TSTP Solution File: PUZ084^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : PUZ084^1 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 02:25:08 EDT 2024
% Result : Theorem 0.19s 0.47s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 20
% Syntax : Number of formulae : 36 ( 17 unt; 11 typ; 0 def)
% Number of atoms : 58 ( 15 equ; 0 cnn)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 86 ( 13 ~; 10 |; 1 &; 62 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 71 ( 71 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 11 usr; 2 con; 0-3 aty)
% Number of variables : 49 ( 33 ^ 16 !; 0 ?; 49 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_24,type,
mnot: ( $i > $o ) > $i > $o ).
thf(decl_25,type,
mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_27,type,
mimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_32,type,
mforall_prop: ( ( $i > $o ) > $i > $o ) > $i > $o ).
thf(decl_37,type,
mbox: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_39,type,
mreflexive: ( $i > $i > $o ) > $o ).
thf(decl_49,type,
mvalid: ( $i > $o ) > $o ).
thf(decl_53,type,
peter: $i > $i > $o ).
thf(decl_55,type,
wife: ( $i > $i > $o ) > $i > $i > $o ).
thf(decl_56,type,
esk1_0: $i ).
thf(decl_57,type,
epred1_0: $i > $o ).
thf(mimplies,axiom,
( mimplies
= ( ^ [X6: $i > $o,X7: $i > $o] : ( mor @ ( mnot @ X6 ) @ X7 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mimplies) ).
thf(mnot,axiom,
( mnot
= ( ^ [X6: $i > $o,X3: $i] :
~ ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mnot) ).
thf(mor,axiom,
( mor
= ( ^ [X6: $i > $o,X7: $i > $o,X3: $i] :
( ( X6 @ X3 )
| ( X7 @ X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mor) ).
thf(mforall_prop,axiom,
( mforall_prop
= ( ^ [X9: ( $i > $o ) > $i > $o,X3: $i] :
! [X10: $i > $o] : ( X9 @ X10 @ X3 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mforall_prop) ).
thf(mbox,axiom,
( mbox
= ( ^ [X13: $i > $i > $o,X6: $i > $o,X3: $i] :
! [X14: $i] :
( ~ ( X13 @ X3 @ X14 )
| ( X6 @ X14 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mbox) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X6: $i > $o] :
! [X3: $i] : ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mvalid) ).
thf(mreflexive,axiom,
( mreflexive
= ( ^ [X13: $i > $i > $o] :
! [X15: $i] : ( X13 @ X15 @ X15 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mreflexive) ).
thf(conj,conjecture,
( mvalid
@ ( mforall_prop
@ ^ [X18: $i > $o] : ( mimplies @ ( mbox @ ( wife @ peter ) @ X18 ) @ X18 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
thf(refl_wife_peter,axiom,
mreflexive @ ( wife @ peter ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',refl_wife_peter) ).
thf(c_0_9,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies]) ).
thf(c_0_10,plain,
( mnot
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot]) ).
thf(c_0_11,plain,
( mor
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mor]) ).
thf(c_0_12,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
thf(c_0_13,plain,
( mforall_prop
= ( ^ [Z0: ( $i > $o ) > $i > $o,Z1: $i] :
! [X10: $i > $o] : ( Z0 @ X10 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mforall_prop]) ).
thf(c_0_14,plain,
( mbox
= ( ^ [Z0: $i > $i > $o,Z1: $i > $o,Z2: $i] :
! [X14: $i] :
( ~ ( Z0 @ Z2 @ X14 )
| ( Z1 @ X14 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox]) ).
thf(c_0_15,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X3: $i] : ( Z0 @ X3 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_16,plain,
( mreflexive
= ( ^ [Z0: $i > $i > $o] :
! [X15: $i] : ( Z0 @ X15 @ X15 ) ) ),
inference(fof_simplification,[status(thm)],[mreflexive]) ).
thf(c_0_17,negated_conjecture,
~ ! [X36: $i,X35: $i > $o] :
( ~ ! [X34: $i] :
( ~ ( wife @ peter @ X36 @ X34 )
| ( X35 @ X34 ) )
| ( X35 @ X36 ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj])]),c_0_12]),c_0_13]),c_0_14]),c_0_15])]) ).
thf(c_0_18,plain,
! [X24: $i] : ( wife @ peter @ X24 @ X24 ),
inference(apply_def,[status(thm)],[refl_wife_peter,c_0_16]) ).
thf(c_0_19,negated_conjecture,
! [X51: $i] :
( ( ~ ( wife @ peter @ esk1_0 @ X51 )
| ( epred1_0 @ X51 ) )
& ~ ( epred1_0 @ esk1_0 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])])])]) ).
thf(c_0_20,plain,
! [X39: $i] : ( wife @ peter @ X39 @ X39 ),
inference(variable_rename,[status(thm)],[c_0_18]) ).
thf(c_0_21,negated_conjecture,
! [X3: $i] :
( ( epred1_0 @ X3 )
| ~ ( wife @ peter @ esk1_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
thf(c_0_22,plain,
! [X3: $i] : ( wife @ peter @ X3 @ X3 ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
thf(c_0_23,negated_conjecture,
~ ( epred1_0 @ esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
thf(c_0_24,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : PUZ084^1 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n026.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sat May 18 10:46:37 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.19/0.46 Running higher-order theorem proving
% 0.19/0.46 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.47 # Version: 3.1.0-ho
% 0.19/0.47 # Preprocessing class: HSMSSMSSMLMNHHN.
% 0.19/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47 # Starting ehoh_best2_full_lfho with 1500s (5) cores
% 0.19/0.47 # Starting lpo9_lambda_fix with 300s (1) cores
% 0.19/0.47 # Starting sh5l with 300s (1) cores
% 0.19/0.47 # Starting ho_unfolding_6 with 300s (1) cores
% 0.19/0.47 # ehoh_best2_full_lfho with pid 2230 completed with status 0
% 0.19/0.47 # Result found by ehoh_best2_full_lfho
% 0.19/0.47 # Preprocessing class: HSMSSMSSMLMNHHN.
% 0.19/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47 # Starting ehoh_best2_full_lfho with 1500s (5) cores
% 0.19/0.47 # No SInE strategy applied
% 0.19/0.47 # Search class: HHUNS-FFSF00-SHHSMFNN
% 0.19/0.47 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.47 # Starting new_ho_10 with 811s (1) cores
% 0.19/0.47 # Starting ehoh_best2_full_lfho with 151s (1) cores
% 0.19/0.47 # Starting new_bool_1 with 136s (1) cores
% 0.19/0.47 # Starting new_bool_2 with 136s (1) cores
% 0.19/0.47 # Starting new_bool_9 with 136s (1) cores
% 0.19/0.47 # new_bool_9 with pid 2238 completed with status 0
% 0.19/0.47 # Result found by new_bool_9
% 0.19/0.47 # Preprocessing class: HSMSSMSSMLMNHHN.
% 0.19/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47 # Starting ehoh_best2_full_lfho with 1500s (5) cores
% 0.19/0.47 # No SInE strategy applied
% 0.19/0.47 # Search class: HHUNS-FFSF00-SHHSMFNN
% 0.19/0.47 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.47 # Starting new_ho_10 with 811s (1) cores
% 0.19/0.47 # Starting ehoh_best2_full_lfho with 151s (1) cores
% 0.19/0.47 # Starting new_bool_1 with 136s (1) cores
% 0.19/0.47 # Starting new_bool_2 with 136s (1) cores
% 0.19/0.47 # Starting new_bool_9 with 136s (1) cores
% 0.19/0.47 # Preprocessing time : 0.001 s
% 0.19/0.47 # Presaturation interreduction done
% 0.19/0.47
% 0.19/0.47 # Proof found!
% 0.19/0.47 # SZS status Theorem
% 0.19/0.47 # SZS output start CNFRefutation
% See solution above
% 0.19/0.47 # Parsed axioms : 73
% 0.19/0.47 # Removed by relevancy pruning/SinE : 0
% 0.19/0.47 # Initial clauses : 43
% 0.19/0.47 # Removed in clause preprocessing : 35
% 0.19/0.47 # Initial clauses in saturation : 8
% 0.19/0.47 # Processed clauses : 13
% 0.19/0.47 # ...of these trivial : 0
% 0.19/0.47 # ...subsumed : 0
% 0.19/0.47 # ...remaining for further processing : 13
% 0.19/0.47 # Other redundant clauses eliminated : 0
% 0.19/0.47 # Clauses deleted for lack of memory : 0
% 0.19/0.47 # Backward-subsumed : 0
% 0.19/0.47 # Backward-rewritten : 0
% 0.19/0.47 # Generated clauses : 1
% 0.19/0.47 # ...of the previous two non-redundant : 0
% 0.19/0.47 # ...aggressively subsumed : 0
% 0.19/0.47 # Contextual simplify-reflections : 0
% 0.19/0.47 # Paramodulations : 1
% 0.19/0.47 # Factorizations : 0
% 0.19/0.47 # NegExts : 0
% 0.19/0.47 # Equation resolutions : 0
% 0.19/0.47 # Disequality decompositions : 0
% 0.19/0.47 # Total rewrite steps : 0
% 0.19/0.47 # ...of those cached : 0
% 0.19/0.47 # Propositional unsat checks : 0
% 0.19/0.47 # Propositional check models : 0
% 0.19/0.47 # Propositional check unsatisfiable : 0
% 0.19/0.47 # Propositional clauses : 0
% 0.19/0.47 # Propositional clauses after purity: 0
% 0.19/0.47 # Propositional unsat core size : 0
% 0.19/0.47 # Propositional preprocessing time : 0.000
% 0.19/0.47 # Propositional encoding time : 0.000
% 0.19/0.47 # Propositional solver time : 0.000
% 0.19/0.47 # Success case prop preproc time : 0.000
% 0.19/0.47 # Success case prop encoding time : 0.000
% 0.19/0.47 # Success case prop solver time : 0.000
% 0.19/0.47 # Current number of processed clauses : 5
% 0.19/0.47 # Positive orientable unit clauses : 3
% 0.19/0.47 # Positive unorientable unit clauses: 0
% 0.19/0.47 # Negative unit clauses : 1
% 0.19/0.47 # Non-unit-clauses : 1
% 0.19/0.47 # Current number of unprocessed clauses: 3
% 0.19/0.47 # ...number of literals in the above : 9
% 0.19/0.47 # Current number of archived formulas : 0
% 0.19/0.47 # Current number of archived clauses : 8
% 0.19/0.47 # Clause-clause subsumption calls (NU) : 1
% 0.19/0.47 # Rec. Clause-clause subsumption calls : 1
% 0.19/0.47 # Non-unit clause-clause subsumptions : 0
% 0.19/0.47 # Unit Clause-clause subsumption calls : 0
% 0.19/0.47 # Rewrite failures with RHS unbound : 0
% 0.19/0.47 # BW rewrite match attempts : 2
% 0.19/0.47 # BW rewrite match successes : 0
% 0.19/0.47 # Condensation attempts : 0
% 0.19/0.47 # Condensation successes : 0
% 0.19/0.47 # Termbank termtop insertions : 2512
% 0.19/0.47 # Search garbage collected termcells : 476
% 0.19/0.47
% 0.19/0.47 # -------------------------------------------------
% 0.19/0.47 # User time : 0.003 s
% 0.19/0.47 # System time : 0.002 s
% 0.19/0.47 # Total time : 0.005 s
% 0.19/0.47 # Maximum resident set size: 1956 pages
% 0.19/0.47
% 0.19/0.47 # -------------------------------------------------
% 0.19/0.47 # User time : 0.008 s
% 0.19/0.47 # System time : 0.009 s
% 0.19/0.47 # Total time : 0.017 s
% 0.19/0.47 # Maximum resident set size: 1796 pages
% 0.19/0.47 % E---3.1 exiting
% 0.19/0.47 % E exiting
%------------------------------------------------------------------------------