TSTP Solution File: LCL702^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LCL702^1 : TPTP v8.2.0. Bugfixed v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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 : Mon May 20 23:53:10 EDT 2024
% Result : Theorem 0.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 20
% Syntax : Number of formulae : 37 ( 19 unt; 12 typ; 0 def)
% Number of atoms : 58 ( 15 equ; 0 cnn)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 143 ( 20 ~; 17 |; 7 &; 94 @)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 70 ( 70 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 12 usr; 4 con; 0-3 aty)
% Number of variables : 64 ( 33 ^ 31 !; 0 ?; 64 :)
% 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_42,type,
mtransitive: ( $i > $i > $o ) > $o ).
thf(decl_49,type,
mvalid: ( $i > $o ) > $o ).
thf(decl_53,type,
epred1_0: $i > $i > $o ).
thf(decl_54,type,
esk1_0: $i ).
thf(decl_55,type,
epred2_0: $i > $o ).
thf(decl_56,type,
esk2_0: $i ).
thf(decl_57,type,
esk3_0: $i ).
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(mvalid,axiom,
( mvalid
= ( ^ [X6: $i > $o] :
! [X3: $i] : ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mvalid) ).
thf(mtransitive,axiom,
( mtransitive
= ( ^ [X13: $i > $i > $o] :
! [X15: $i,X16: $i,X17: $i] :
( ( ( X13 @ X15 @ X16 )
& ( X13 @ X16 @ X17 ) )
=> ( X13 @ X15 @ X17 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mtransitive) ).
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(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(conj,conjecture,
! [X13: $i > $i > $o] :
( ( mtransitive @ X13 )
=> ( mvalid
@ ( mforall_prop
@ ^ [X18: $i > $o] : ( mimplies @ ( mbox @ X13 @ X18 ) @ ( mbox @ X13 @ ( mbox @ X13 @ X18 ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
thf(c_0_8,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies]) ).
thf(c_0_9,plain,
( mnot
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot]) ).
thf(c_0_10,plain,
( mor
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mor]) ).
thf(c_0_11,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X3: $i] : ( Z0 @ X3 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_12,plain,
( mtransitive
= ( ^ [Z0: $i > $i > $o] :
! [X15: $i,X16: $i,X17: $i] :
( ( ( Z0 @ X15 @ X16 )
& ( Z0 @ X16 @ X17 ) )
=> ( Z0 @ X15 @ X17 ) ) ) ),
inference(fof_simplification,[status(thm)],[mtransitive]) ).
thf(c_0_13,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_14,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_8,c_0_9]),c_0_10]) ).
thf(c_0_15,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_16,negated_conjecture,
~ ! [X13: $i > $i > $o] :
( ! [X22: $i,X23: $i,X24: $i] :
( ( ( X13 @ X22 @ X23 )
& ( X13 @ X23 @ X24 ) )
=> ( X13 @ X22 @ X24 ) )
=> ! [X29: $i,X28: $i > $o] :
( ~ ! [X25: $i] :
( ~ ( X13 @ X29 @ X25 )
| ( X28 @ X25 ) )
| ! [X27: $i] :
( ~ ( X13 @ X29 @ X27 )
| ! [X26: $i] :
( ~ ( X13 @ X27 @ X26 )
| ( X28 @ X26 ) ) ) ) ),
inference(apply_def,[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_11]),c_0_12]),c_0_13]),c_0_14]),c_0_15]) ).
thf(c_0_17,negated_conjecture,
! [X31: $i,X32: $i,X33: $i,X36: $i] :
( ( ~ ( epred1_0 @ X31 @ X32 )
| ~ ( epred1_0 @ X32 @ X33 )
| ( epred1_0 @ X31 @ X33 ) )
& ( ~ ( epred1_0 @ esk1_0 @ X36 )
| ( epred2_0 @ X36 ) )
& ( epred1_0 @ esk1_0 @ esk2_0 )
& ( epred1_0 @ esk2_0 @ esk3_0 )
& ~ ( epred2_0 @ esk3_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_16])])])])]) ).
thf(c_0_18,negated_conjecture,
! [X14: $i,X3: $i,X15: $i] :
( ( epred1_0 @ X3 @ X15 )
| ~ ( epred1_0 @ X3 @ X14 )
| ~ ( epred1_0 @ X14 @ X15 ) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_19,negated_conjecture,
epred1_0 @ esk2_0 @ esk3_0,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_20,negated_conjecture,
! [X3: $i] :
( ( epred2_0 @ X3 )
| ~ ( epred1_0 @ esk1_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_21,negated_conjecture,
! [X3: $i] :
( ( epred1_0 @ X3 @ esk3_0 )
| ~ ( epred1_0 @ X3 @ esk2_0 ) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
thf(c_0_22,negated_conjecture,
epred1_0 @ esk1_0 @ esk2_0,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_23,negated_conjecture,
~ ( epred2_0 @ esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_24,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : LCL702^1 : TPTP v8.2.0. Bugfixed v5.0.0.
% 0.08/0.13 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n024.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon May 20 01:52:22 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running higher-order theorem proving
% 0.20/0.48 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.20/0.50 # Version: 3.1.0-ho
% 0.20/0.50 # Preprocessing class: HSMSSMSSMLMNHHN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting ehoh_best2_full_lfho with 1500s (5) cores
% 0.20/0.50 # Starting lpo9_lambda_fix with 300s (1) cores
% 0.20/0.50 # Starting sh5l with 300s (1) cores
% 0.20/0.50 # Starting ho_unfolding_6 with 300s (1) cores
% 0.20/0.50 # lpo9_lambda_fix with pid 8594 completed with status 0
% 0.20/0.50 # Result found by lpo9_lambda_fix
% 0.20/0.50 # Preprocessing class: HSMSSMSSMLMNHHN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting ehoh_best2_full_lfho with 1500s (5) cores
% 0.20/0.50 # Starting lpo9_lambda_fix with 300s (1) cores
% 0.20/0.50 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.50 # Search class: HHUNF-FFSF00-SHHSMFNN
% 0.20/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting new_ho_10 with 163s (1) cores
% 0.20/0.50 # new_ho_10 with pid 8597 completed with status 0
% 0.20/0.50 # Result found by new_ho_10
% 0.20/0.50 # Preprocessing class: HSMSSMSSMLMNHHN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting ehoh_best2_full_lfho with 1500s (5) cores
% 0.20/0.50 # Starting lpo9_lambda_fix with 300s (1) cores
% 0.20/0.50 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.50 # Search class: HHUNF-FFSF00-SHHSMFNN
% 0.20/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting new_ho_10 with 163s (1) cores
% 0.20/0.50 # Preprocessing time : 0.001 s
% 0.20/0.50 # Presaturation interreduction done
% 0.20/0.50
% 0.20/0.50 # Proof found!
% 0.20/0.50 # SZS status Theorem
% 0.20/0.50 # SZS output start CNFRefutation
% See solution above
% 0.20/0.50 # Parsed axioms : 64
% 0.20/0.50 # Removed by relevancy pruning/SinE : 50
% 0.20/0.50 # Initial clauses : 5
% 0.20/0.50 # Removed in clause preprocessing : 0
% 0.20/0.50 # Initial clauses in saturation : 5
% 0.20/0.50 # Processed clauses : 13
% 0.20/0.50 # ...of these trivial : 0
% 0.20/0.50 # ...subsumed : 0
% 0.20/0.50 # ...remaining for further processing : 13
% 0.20/0.50 # Other redundant clauses eliminated : 0
% 0.20/0.50 # Clauses deleted for lack of memory : 0
% 0.20/0.50 # Backward-subsumed : 0
% 0.20/0.50 # Backward-rewritten : 0
% 0.20/0.50 # Generated clauses : 5
% 0.20/0.50 # ...of the previous two non-redundant : 3
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 0
% 0.20/0.50 # Paramodulations : 5
% 0.20/0.50 # Factorizations : 0
% 0.20/0.50 # NegExts : 0
% 0.20/0.50 # Equation resolutions : 0
% 0.20/0.50 # Disequality decompositions : 0
% 0.20/0.50 # Total rewrite steps : 1
% 0.20/0.50 # ...of those cached : 0
% 0.20/0.50 # Propositional unsat checks : 0
% 0.20/0.50 # Propositional check models : 0
% 0.20/0.50 # Propositional check unsatisfiable : 0
% 0.20/0.50 # Propositional clauses : 0
% 0.20/0.50 # Propositional clauses after purity: 0
% 0.20/0.50 # Propositional unsat core size : 0
% 0.20/0.50 # Propositional preprocessing time : 0.000
% 0.20/0.50 # Propositional encoding time : 0.000
% 0.20/0.50 # Propositional solver time : 0.000
% 0.20/0.50 # Success case prop preproc time : 0.000
% 0.20/0.50 # Success case prop encoding time : 0.000
% 0.20/0.50 # Success case prop solver time : 0.000
% 0.20/0.50 # Current number of processed clauses : 8
% 0.20/0.50 # Positive orientable unit clauses : 3
% 0.20/0.50 # Positive unorientable unit clauses: 0
% 0.20/0.50 # Negative unit clauses : 1
% 0.20/0.50 # Non-unit-clauses : 4
% 0.20/0.50 # Current number of unprocessed clauses: 0
% 0.20/0.50 # ...number of literals in the above : 0
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 5
% 0.20/0.50 # Clause-clause subsumption calls (NU) : 2
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 2
% 0.20/0.50 # Non-unit clause-clause subsumptions : 0
% 0.20/0.50 # Unit Clause-clause subsumption calls : 0
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 0
% 0.20/0.50 # BW rewrite match successes : 0
% 0.20/0.50 # Condensation attempts : 13
% 0.20/0.50 # Condensation successes : 0
% 0.20/0.50 # Termbank termtop insertions : 1620
% 0.20/0.50 # Search garbage collected termcells : 663
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.003 s
% 0.20/0.50 # System time : 0.003 s
% 0.20/0.50 # Total time : 0.006 s
% 0.20/0.50 # Maximum resident set size: 1916 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.005 s
% 0.20/0.50 # System time : 0.005 s
% 0.20/0.50 # Total time : 0.011 s
% 0.20/0.50 # Maximum resident set size: 1800 pages
% 0.20/0.50 % E---3.1 exiting
% 0.20/0.50 % E exiting
%------------------------------------------------------------------------------