TSTP Solution File: LCL603^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LCL603^1 : TPTP v8.2.0. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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.19s 0.48s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 22
% Syntax : Number of formulae : 47 ( 22 unt; 14 typ; 0 def)
% Number of atoms : 76 ( 15 equ; 0 cnn)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 263 ( 32 ~; 33 |; 13 &; 174 @)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 76 ( 76 >; 0 *; 0 +; 0 <<)
% Number of symbols : 16 ( 14 usr; 5 con; 0-3 aty)
% Number of variables : 79 ( 30 ^ 49 !; 0 ?; 79 :)
% 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,
esk1_2: ( $i > $o ) > $i > $i ).
thf(decl_64,type,
esk2_2: ( $i > $o ) > $i > $i ).
thf(decl_65,type,
esk3_0: $i ).
thf(decl_66,type,
esk4_0: $i ).
thf(decl_67,type,
esk5_0: $i ).
thf(decl_68,type,
esk6_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] :
( ! [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 ) ) )
=> ( ! [X63: $i] : ( X10 @ X63 @ X63 )
& ! [X64: $i,X65: $i,X66: $i] :
( ( ( X10 @ X64 @ X65 )
& ( X10 @ X65 @ X66 ) )
=> ( X10 @ X64 @ X66 ) ) ) ),
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 > $o,X69: $i,X71: $i,X72: $i,X73: $i] :
( ( ( epred1_0 @ X69 @ ( esk1_2 @ X68 @ X69 ) )
| ~ ( epred1_0 @ X69 @ X71 )
| ~ ( epred1_0 @ X71 @ X72 )
| ( X68 @ X72 ) )
& ( ~ ( X68 @ ( esk1_2 @ X68 @ X69 ) )
| ~ ( epred1_0 @ X69 @ X71 )
| ~ ( epred1_0 @ X71 @ X72 )
| ( X68 @ X72 ) )
& ( ( epred1_0 @ X73 @ ( esk2_2 @ X68 @ X73 ) )
| ( X68 @ X73 ) )
& ( ~ ( X68 @ ( esk2_2 @ X68 @ X73 ) )
| ( X68 @ X73 ) )
& ( ( epred1_0 @ esk4_0 @ esk5_0 )
| ~ ( epred1_0 @ esk3_0 @ esk3_0 ) )
& ( ( epred1_0 @ esk5_0 @ esk6_0 )
| ~ ( epred1_0 @ esk3_0 @ esk3_0 ) )
& ( ~ ( epred1_0 @ esk4_0 @ esk6_0 )
| ~ ( epred1_0 @ esk3_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,
! [X2: $i > $o,X1: $i] :
( ( X2 @ X1 )
| ~ ( X2 @ ( esk2_2 @ X2 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_19,negated_conjecture,
! [X2: $i > $o,X1: $i] :
( ( epred1_0 @ X1 @ ( esk2_2 @ X2 @ X1 ) )
| ( X2 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_20,negated_conjecture,
( ( epred1_0 @ esk5_0 @ esk6_0 )
| ~ ( epred1_0 @ esk3_0 @ esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_21,negated_conjecture,
! [X1: $i] : ( epred1_0 @ X1 @ X1 ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
thf(c_0_22,negated_conjecture,
! [X1: $i,X2: $i > $o,X3: $i,X12: $i] :
( ( X2 @ X12 )
| ~ ( X2 @ ( esk1_2 @ X2 @ X1 ) )
| ~ ( epred1_0 @ X1 @ X3 )
| ~ ( epred1_0 @ X3 @ X12 ) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_23,negated_conjecture,
epred1_0 @ esk5_0 @ esk6_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]) ).
thf(c_0_24,negated_conjecture,
! [X1: $i,X2: $i > $o,X3: $i,X12: $i] :
( ( epred1_0 @ X1 @ ( esk1_2 @ X2 @ X1 ) )
| ( X2 @ X12 )
| ~ ( epred1_0 @ X1 @ X3 )
| ~ ( epred1_0 @ X3 @ X12 ) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_25,negated_conjecture,
( ~ ( epred1_0 @ esk4_0 @ esk6_0 )
| ~ ( epred1_0 @ esk3_0 @ esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_26,negated_conjecture,
! [X2: $i > $o,X1: $i] :
( ( X2 @ esk6_0 )
| ~ ( X2 @ ( esk1_2 @ X2 @ X1 ) )
| ~ ( epred1_0 @ X1 @ esk5_0 ) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
thf(c_0_27,negated_conjecture,
! [X2: $i > $o,X1: $i] :
( ( epred1_0 @ X1 @ ( esk1_2 @ X2 @ X1 ) )
| ( X2 @ esk6_0 )
| ~ ( epred1_0 @ X1 @ esk5_0 ) ),
inference(spm,[status(thm)],[c_0_24,c_0_23]) ).
thf(c_0_28,negated_conjecture,
( ( epred1_0 @ esk4_0 @ esk5_0 )
| ~ ( epred1_0 @ esk3_0 @ esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_29,negated_conjecture,
~ ( epred1_0 @ esk4_0 @ esk6_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_21])]) ).
thf(c_0_30,negated_conjecture,
! [X1: $i] :
( ( epred1_0 @ X1 @ esk6_0 )
| ~ ( epred1_0 @ X1 @ esk5_0 ) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
thf(c_0_31,negated_conjecture,
epred1_0 @ esk4_0 @ esk5_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_21])]) ).
thf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL603^1 : TPTP v8.2.0. Released v3.6.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n022.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 : Mon May 20 02:29:23 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.19/0.46 Running higher-order theorem proving
% 0.19/0.46 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.19/0.48 # Version: 3.1.0-ho
% 0.19/0.48 # Preprocessing class: HSMSSMSSMLSNHSN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.19/0.48 # Starting post_as_ho3 with 300s (1) cores
% 0.19/0.48 # Starting post_as_ho11 with 300s (1) cores
% 0.19/0.48 # Starting full_lambda_8 with 300s (1) cores
% 0.19/0.48 # post_as_ho3 with pid 19536 completed with status 0
% 0.19/0.48 # Result found by post_as_ho3
% 0.19/0.48 # Preprocessing class: HSMSSMSSMLSNHSN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.19/0.48 # Starting post_as_ho3 with 300s (1) cores
% 0.19/0.48 # No SInE strategy applied
% 0.19/0.48 # Search class: HGHNF-FFSF22-SHSSMMBN
% 0.19/0.48 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.48 # Starting new_ho_10 with 163s (1) cores
% 0.19/0.48 # new_ho_10 with pid 19540 completed with status 0
% 0.19/0.48 # Result found by new_ho_10
% 0.19/0.48 # Preprocessing class: HSMSSMSSMLSNHSN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.19/0.48 # Starting post_as_ho3 with 300s (1) cores
% 0.19/0.48 # No SInE strategy applied
% 0.19/0.48 # Search class: HGHNF-FFSF22-SHSSMMBN
% 0.19/0.48 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.48 # Starting new_ho_10 with 163s (1) cores
% 0.19/0.48 # Preprocessing time : 0.001 s
% 0.19/0.48 # Presaturation interreduction done
% 0.19/0.48
% 0.19/0.48 # Proof found!
% 0.19/0.48 # SZS status Theorem
% 0.19/0.48 # SZS output start CNFRefutation
% See solution above
% 0.19/0.48 # Parsed axioms : 78
% 0.19/0.48 # Removed by relevancy pruning/SinE : 0
% 0.19/0.48 # Initial clauses : 48
% 0.19/0.48 # Removed in clause preprocessing : 41
% 0.19/0.48 # Initial clauses in saturation : 7
% 0.19/0.48 # Processed clauses : 30
% 0.19/0.48 # ...of these trivial : 0
% 0.19/0.48 # ...subsumed : 0
% 0.19/0.48 # ...remaining for further processing : 30
% 0.19/0.48 # Other redundant clauses eliminated : 0
% 0.19/0.48 # Clauses deleted for lack of memory : 0
% 0.19/0.48 # Backward-subsumed : 0
% 0.19/0.48 # Backward-rewritten : 3
% 0.19/0.48 # Generated clauses : 49
% 0.19/0.48 # ...of the previous two non-redundant : 36
% 0.19/0.48 # ...aggressively subsumed : 0
% 0.19/0.48 # Contextual simplify-reflections : 0
% 0.19/0.48 # Paramodulations : 49
% 0.19/0.48 # Factorizations : 0
% 0.19/0.48 # NegExts : 0
% 0.19/0.48 # Equation resolutions : 0
% 0.19/0.48 # Disequality decompositions : 0
% 0.19/0.48 # Total rewrite steps : 17
% 0.19/0.48 # ...of those cached : 11
% 0.19/0.48 # Propositional unsat checks : 0
% 0.19/0.48 # Propositional check models : 0
% 0.19/0.48 # Propositional check unsatisfiable : 0
% 0.19/0.48 # Propositional clauses : 0
% 0.19/0.48 # Propositional clauses after purity: 0
% 0.19/0.48 # Propositional unsat core size : 0
% 0.19/0.48 # Propositional preprocessing time : 0.000
% 0.19/0.48 # Propositional encoding time : 0.000
% 0.19/0.48 # Propositional solver time : 0.000
% 0.19/0.48 # Success case prop preproc time : 0.000
% 0.19/0.48 # Success case prop encoding time : 0.000
% 0.19/0.48 # Success case prop solver time : 0.000
% 0.19/0.48 # Current number of processed clauses : 20
% 0.19/0.48 # Positive orientable unit clauses : 3
% 0.19/0.48 # Positive unorientable unit clauses: 0
% 0.19/0.48 # Negative unit clauses : 1
% 0.19/0.48 # Non-unit-clauses : 16
% 0.19/0.48 # Current number of unprocessed clauses: 20
% 0.19/0.48 # ...number of literals in the above : 79
% 0.19/0.48 # Current number of archived formulas : 0
% 0.19/0.48 # Current number of archived clauses : 10
% 0.19/0.48 # Clause-clause subsumption calls (NU) : 51
% 0.19/0.48 # Rec. Clause-clause subsumption calls : 34
% 0.19/0.48 # Non-unit clause-clause subsumptions : 0
% 0.19/0.48 # Unit Clause-clause subsumption calls : 1
% 0.19/0.48 # Rewrite failures with RHS unbound : 0
% 0.19/0.48 # BW rewrite match attempts : 5
% 0.19/0.48 # BW rewrite match successes : 1
% 0.19/0.48 # Condensation attempts : 30
% 0.19/0.48 # Condensation successes : 0
% 0.19/0.48 # Termbank termtop insertions : 3609
% 0.19/0.48 # Search garbage collected termcells : 561
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.007 s
% 0.19/0.48 # System time : 0.002 s
% 0.19/0.48 # Total time : 0.009 s
% 0.19/0.48 # Maximum resident set size: 1896 pages
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.010 s
% 0.19/0.48 # System time : 0.004 s
% 0.19/0.48 # Total time : 0.014 s
% 0.19/0.48 # Maximum resident set size: 1820 pages
% 0.19/0.48 % E---3.1 exiting
% 0.19/0.48 % E exiting
%------------------------------------------------------------------------------