TSTP Solution File: LCL604^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LCL604^1 : TPTP v8.2.0. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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:46:58 EDT 2024
% Result : Theorem 0.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 21
% Syntax : Number of formulae : 48 ( 21 unt; 13 typ; 0 def)
% Number of atoms : 103 ( 15 equ; 0 cnn)
% Maximal formula atoms : 26 ( 2 avg)
% Number of connectives : 272 ( 39 ~; 40 |; 16 &; 166 @)
% ( 0 <=>; 10 =>; 1 <=; 0 <~>)
% Maximal formula depth : 20 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 64 ( 64 >; 0 *; 0 +; 0 <<)
% Number of symbols : 15 ( 13 usr; 5 con; 0-3 aty)
% Number of variables : 74 ( 30 ^ 44 !; 0 ?; 74 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_28,type,
mnot: ( $i > $o ) > $i > $o ).
thf(decl_29,type,
mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_31,type,
mimpl: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_33,type,
mbox: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_37,type,
mvalid: ( $i > $o ) > $o ).
thf(decl_49,type,
reflexive: ( $i > $i > $o ) > $o ).
thf(decl_52,type,
transitive: ( $i > $i > $o ) > $o ).
thf(decl_62,type,
epred1_0: $i > $i > $o ).
thf(decl_63,type,
epred2_0: $i > $o ).
thf(decl_64,type,
esk1_0: $i ).
thf(decl_65,type,
esk2_0: $i ).
thf(decl_66,type,
esk3_0: $i ).
thf(decl_67,type,
esk4_0: $i ).
thf(mimpl,axiom,
( mimpl
= ( ^ [X7: $i > $o,X8: $i > $o] : ( mor @ ( mnot @ X7 ) @ X8 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL008^0.ax',mimpl) ).
thf(mnot,axiom,
( mnot
= ( ^ [X2: $i > $o,X3: $i] :
~ ( X2 @ X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL008^0.ax',mnot) ).
thf(mor,axiom,
( mor
= ( ^ [X4: $i > $o,X5: $i > $o,X3: $i] :
( ( X4 @ X3 )
| ( X5 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL008^0.ax',mor) ).
thf(mbox,axiom,
( mbox
= ( ^ [X10: $i > $i > $o,X11: $i > $o,X1: $i] :
! [X12: $i] :
( ( X10 @ X1 @ X12 )
=> ( X11 @ X12 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL008^0.ax',mbox) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X11: $i > $o] :
! [X15: $i] : ( X11 @ X15 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL008^0.ax',mvalid) ).
thf(reflexive,axiom,
( reflexive
= ( ^ [X10: $i > $i > $o] :
! [X1: $i] : ( X10 @ X1 @ X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET008^2.ax',reflexive) ).
thf(transitive,axiom,
( transitive
= ( ^ [X10: $i > $i > $o] :
! [X1: $i,X36: $i,X33: $i] :
( ( ( X10 @ X1 @ X36 )
& ( X10 @ X36 @ X33 ) )
=> ( X10 @ X1 @ X33 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET008^2.ax',transitive) ).
thf(thm,conjecture,
! [X10: $i > $i > $o] :
( ! [X28: $i > $o] :
( ( mvalid @ ( mimpl @ ( mbox @ X10 @ X28 ) @ ( mbox @ X10 @ ( mbox @ X10 @ X28 ) ) ) )
& ( mvalid @ ( mimpl @ ( mbox @ X10 @ X28 ) @ X28 ) ) )
<= ( ( reflexive @ X10 )
& ( transitive @ X10 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm) ).
thf(c_0_8,plain,
( mimpl
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimpl]) ).
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,
( mimpl
= ( ^ [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_12,plain,
( mbox
= ( ^ [Z0: $i > $i > $o,Z1: $i > $o,Z2: $i] :
! [X12: $i] :
( ( Z0 @ Z2 @ X12 )
=> ( Z1 @ X12 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox]) ).
thf(c_0_13,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X15: $i] : ( Z0 @ X15 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_14,plain,
( reflexive
= ( ^ [Z0: $i > $i > $o] :
! [X1: $i] : ( Z0 @ X1 @ X1 ) ) ),
inference(fof_simplification,[status(thm)],[reflexive]) ).
thf(c_0_15,plain,
( transitive
= ( ^ [Z0: $i > $i > $o] :
! [X1: $i,X36: $i,X33: $i] :
( ( ( Z0 @ X1 @ X36 )
& ( Z0 @ X36 @ X33 ) )
=> ( Z0 @ X1 @ X33 ) ) ) ),
inference(fof_simplification,[status(thm)],[transitive]) ).
thf(c_0_16,negated_conjecture,
~ ! [X10: $i > $i > $o] :
( ( ! [X63: $i] : ( X10 @ X63 @ X63 )
& ! [X64: $i,X65: $i,X66: $i] :
( ( ( X10 @ X64 @ X65 )
& ( X10 @ X65 @ X66 ) )
=> ( X10 @ X64 @ X66 ) ) )
=> ! [X28: $i > $o] :
( ! [X60: $i] :
( ~ ! [X57: $i] :
( ( X10 @ X60 @ X57 )
=> ( X28 @ X57 ) )
| ! [X59: $i] :
( ( X10 @ X60 @ X59 )
=> ! [X58: $i] :
( ( X10 @ X59 @ X58 )
=> ( X28 @ X58 ) ) ) )
& ! [X62: $i] :
( ~ ! [X61: $i] :
( ( X10 @ X62 @ X61 )
=> ( X28 @ X61 ) )
| ( X28 @ X62 ) ) ) ),
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(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[thm]),c_0_11]),c_0_12]),c_0_13]),c_0_14]),c_0_15])]) ).
thf(c_0_17,negated_conjecture,
! [X68: $i,X69: $i,X70: $i,X71: $i,X74: $i,X78: $i] :
( ( epred1_0 @ X68 @ X68 )
& ( ~ ( epred1_0 @ X69 @ X70 )
| ~ ( epred1_0 @ X70 @ X71 )
| ( epred1_0 @ X69 @ X71 ) )
& ( ~ ( epred1_0 @ esk4_0 @ X78 )
| ( epred2_0 @ X78 )
| ~ ( epred1_0 @ esk1_0 @ X74 )
| ( epred2_0 @ X74 ) )
& ( ~ ( epred2_0 @ esk4_0 )
| ~ ( epred1_0 @ esk1_0 @ X74 )
| ( epred2_0 @ X74 ) )
& ( ~ ( epred1_0 @ esk4_0 @ X78 )
| ( epred2_0 @ X78 )
| ( epred1_0 @ esk1_0 @ esk2_0 ) )
& ( ~ ( epred2_0 @ esk4_0 )
| ( epred1_0 @ esk1_0 @ esk2_0 ) )
& ( ~ ( epred1_0 @ esk4_0 @ X78 )
| ( epred2_0 @ X78 )
| ( epred1_0 @ esk2_0 @ esk3_0 ) )
& ( ~ ( epred2_0 @ esk4_0 )
| ( epred1_0 @ esk2_0 @ esk3_0 ) )
& ( ~ ( epred1_0 @ esk4_0 @ X78 )
| ( epred2_0 @ X78 )
| ~ ( epred2_0 @ esk3_0 ) )
& ( ~ ( epred2_0 @ esk4_0 )
| ~ ( epred2_0 @ esk3_0 ) ) ),
inference(distribute,[status(thm)],[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,
! [X1: $i] :
( ( epred2_0 @ X1 )
| ( epred1_0 @ esk2_0 @ esk3_0 )
| ~ ( epred1_0 @ esk4_0 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_19,negated_conjecture,
! [X1: $i] : ( epred1_0 @ X1 @ X1 ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_20,negated_conjecture,
( ( epred1_0 @ esk2_0 @ esk3_0 )
| ~ ( epred2_0 @ esk4_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_21,negated_conjecture,
! [X1: $i,X3: $i,X12: $i] :
( ( epred1_0 @ X1 @ X12 )
| ~ ( epred1_0 @ X1 @ X3 )
| ~ ( epred1_0 @ X3 @ X12 ) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_22,negated_conjecture,
epred1_0 @ esk2_0 @ esk3_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
thf(c_0_23,negated_conjecture,
! [X1: $i] :
( ( epred2_0 @ X1 )
| ( epred1_0 @ esk1_0 @ esk2_0 )
| ~ ( epred1_0 @ esk4_0 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_24,negated_conjecture,
( ( epred1_0 @ esk1_0 @ esk2_0 )
| ~ ( epred2_0 @ esk4_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_25,negated_conjecture,
! [X1: $i] :
( ( epred2_0 @ X1 )
| ~ ( epred1_0 @ esk4_0 @ X1 )
| ~ ( epred2_0 @ esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_26,negated_conjecture,
( ~ ( epred2_0 @ esk4_0 )
| ~ ( epred2_0 @ esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_27,negated_conjecture,
! [X1: $i,X3: $i] :
( ( epred2_0 @ X1 )
| ( epred2_0 @ X3 )
| ~ ( epred1_0 @ esk4_0 @ X1 )
| ~ ( epred1_0 @ esk1_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_28,negated_conjecture,
! [X1: $i] :
( ( epred1_0 @ X1 @ esk3_0 )
| ~ ( epred1_0 @ X1 @ esk2_0 ) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
thf(c_0_29,negated_conjecture,
epred1_0 @ esk1_0 @ esk2_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_19]),c_0_24]) ).
thf(c_0_30,negated_conjecture,
~ ( epred2_0 @ esk3_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_19]),c_0_26]) ).
thf(c_0_31,negated_conjecture,
! [X1: $i] :
( ( epred2_0 @ X1 )
| ~ ( epred2_0 @ esk4_0 )
| ~ ( epred1_0 @ esk1_0 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_32,negated_conjecture,
! [X1: $i] :
( ( epred2_0 @ X1 )
| ~ ( epred1_0 @ esk4_0 @ X1 ) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]),c_0_30]) ).
thf(c_0_33,negated_conjecture,
~ ( epred2_0 @ esk4_0 ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_28]),c_0_29])]),c_0_30]) ).
thf(c_0_34,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_19]),c_0_33]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL604^1 : TPTP v8.2.0. Released v3.6.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n012.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 02:40:23 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running higher-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.20/0.50 # Version: 3.1.0-ho
% 0.20/0.50 # Preprocessing class: HSMSSMSSMLSNHSN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.20/0.50 # Starting post_as_ho3 with 300s (1) cores
% 0.20/0.50 # Starting post_as_ho11 with 300s (1) cores
% 0.20/0.50 # Starting full_lambda_8 with 300s (1) cores
% 0.20/0.50 # post_as_ho3 with pid 16450 completed with status 0
% 0.20/0.50 # Result found by post_as_ho3
% 0.20/0.50 # Preprocessing class: HSMSSMSSMLSNHSN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.20/0.50 # Starting post_as_ho3 with 300s (1) cores
% 0.20/0.50 # No SInE strategy applied
% 0.20/0.50 # Search class: HGHNF-FFSF00-SHSSMFNN
% 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 16456 completed with status 0
% 0.20/0.50 # Result found by new_ho_10
% 0.20/0.50 # Preprocessing class: HSMSSMSSMLSNHSN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.20/0.50 # Starting post_as_ho3 with 300s (1) cores
% 0.20/0.50 # No SInE strategy applied
% 0.20/0.50 # Search class: HGHNF-FFSF00-SHSSMFNN
% 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.003 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 : 78
% 0.20/0.50 # Removed by relevancy pruning/SinE : 0
% 0.20/0.50 # Initial clauses : 51
% 0.20/0.50 # Removed in clause preprocessing : 41
% 0.20/0.50 # Initial clauses in saturation : 10
% 0.20/0.50 # Processed clauses : 34
% 0.20/0.50 # ...of these trivial : 0
% 0.20/0.50 # ...subsumed : 1
% 0.20/0.50 # ...remaining for further processing : 33
% 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 : 8
% 0.20/0.50 # Backward-rewritten : 4
% 0.20/0.50 # Generated clauses : 27
% 0.20/0.50 # ...of the previous two non-redundant : 24
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 4
% 0.20/0.50 # Paramodulations : 27
% 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 : 9
% 0.20/0.50 # ...of those cached : 4
% 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 : 11
% 0.20/0.50 # Positive orientable unit clauses : 5
% 0.20/0.50 # Positive unorientable unit clauses: 0
% 0.20/0.50 # Negative unit clauses : 2
% 0.20/0.50 # Non-unit-clauses : 4
% 0.20/0.50 # Current number of unprocessed clauses: 3
% 0.20/0.50 # ...number of literals in the above : 9
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 22
% 0.20/0.50 # Clause-clause subsumption calls (NU) : 25
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 19
% 0.20/0.50 # Non-unit clause-clause subsumptions : 6
% 0.20/0.50 # Unit Clause-clause subsumption calls : 12
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 8
% 0.20/0.50 # BW rewrite match successes : 4
% 0.20/0.50 # Condensation attempts : 34
% 0.20/0.50 # Condensation successes : 0
% 0.20/0.50 # Termbank termtop insertions : 3100
% 0.20/0.50 # Search garbage collected termcells : 575
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.007 s
% 0.20/0.50 # System time : 0.004 s
% 0.20/0.50 # Total time : 0.011 s
% 0.20/0.50 # Maximum resident set size: 1896 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.009 s
% 0.20/0.50 # System time : 0.007 s
% 0.20/0.50 # Total time : 0.016 s
% 0.20/0.50 # Maximum resident set size: 1820 pages
% 0.20/0.50 % E---3.1 exiting
% 0.20/0.51 % E exiting
%------------------------------------------------------------------------------