TSTP Solution File: LCL623^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LCL623^1 : TPTP v8.2.0. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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:47:01 EDT 2024
% Result : Theorem 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 18
% Syntax : Number of formulae : 43 ( 17 unt; 11 typ; 0 def)
% Number of atoms : 89 ( 11 equ; 0 cnn)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 263 ( 30 ~; 41 |; 5 &; 179 @)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 60 ( 60 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 11 usr; 3 con; 0-3 aty)
% Number of variables : 65 ( 26 ^ 39 !; 0 ?; 65 :)
% 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_41,type,
r: $i > $i > $o ).
thf(decl_42,type,
esk1_2: ( $i > $o ) > $i > $i ).
thf(decl_43,type,
epred1_0: $i > $o ).
thf(decl_44,type,
esk2_0: $i ).
thf(decl_45,type,
esk3_1: $i > $i ).
thf(decl_46,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(gl,axiom,
! [X19: $i > $o] : ( mvalid @ ( mimpl @ ( mbox @ r @ ( mimpl @ ( mbox @ r @ X19 ) @ X19 ) ) @ ( mbox @ r @ X19 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',gl) ).
thf(loeb,conjecture,
! [X11: $i > $o] : ( mvalid @ ( mimpl @ ( mbox @ r @ ( mimpl @ ( mbox @ r @ X11 ) @ X11 ) ) @ ( mbox @ r @ X11 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',loeb) ).
thf(c_0_7,plain,
( mimpl
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimpl]) ).
thf(c_0_8,plain,
( mnot
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot]) ).
thf(c_0_9,plain,
( mor
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mor]) ).
thf(c_0_10,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_7,c_0_8]),c_0_9]) ).
thf(c_0_11,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_12,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X15: $i] : ( Z0 @ X15 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_13,plain,
! [X19: $i > $o,X25: $i] :
( ~ ! [X23: $i] :
( ( r @ X25 @ X23 )
=> ( ~ ! [X22: $i] :
( ( r @ X23 @ X22 )
=> ( X19 @ X22 ) )
| ( X19 @ X23 ) ) )
| ! [X24: $i] :
( ( r @ X25 @ X24 )
=> ( X19 @ X24 ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[gl,c_0_10]),c_0_11]),c_0_12]) ).
thf(c_0_14,negated_conjecture,
~ ! [X11: $i > $o,X29: $i] :
( ~ ! [X27: $i] :
( ( r @ X29 @ X27 )
=> ( ~ ! [X26: $i] :
( ( r @ X27 @ X26 )
=> ( X11 @ X26 ) )
| ( X11 @ X27 ) ) )
| ! [X28: $i] :
( ( r @ X29 @ X28 )
=> ( X11 @ X28 ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[loeb]),c_0_10]),c_0_11]),c_0_12]) ).
thf(c_0_15,plain,
! [X30: $i > $o,X31: $i,X33: $i,X34: $i] :
( ( ( r @ X31 @ ( esk1_2 @ X30 @ X31 ) )
| ~ ( r @ X31 @ X34 )
| ( X30 @ X34 ) )
& ( ~ ( r @ ( esk1_2 @ X30 @ X31 ) @ X33 )
| ( X30 @ X33 )
| ~ ( r @ X31 @ X34 )
| ( X30 @ X34 ) )
& ( ~ ( X30 @ ( esk1_2 @ X30 @ X31 ) )
| ~ ( r @ X31 @ X34 )
| ( X30 @ X34 ) ) ),
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_13])])])])])]) ).
thf(c_0_16,negated_conjecture,
! [X37: $i] :
( ( ( r @ X37 @ ( esk3_1 @ X37 ) )
| ( epred1_0 @ X37 )
| ~ ( r @ esk2_0 @ X37 ) )
& ( ~ ( epred1_0 @ ( esk3_1 @ X37 ) )
| ( epred1_0 @ X37 )
| ~ ( r @ esk2_0 @ X37 ) )
& ( r @ esk2_0 @ esk4_0 )
& ~ ( epred1_0 @ esk4_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_14])])])])])]) ).
thf(c_0_17,plain,
! [X1: $i,X2: $i > $o,X3: $i] :
( ( r @ X1 @ ( esk1_2 @ X2 @ X1 ) )
| ( X2 @ X3 )
| ~ ( r @ X1 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
thf(c_0_18,negated_conjecture,
r @ esk2_0 @ esk4_0,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
thf(c_0_19,negated_conjecture,
! [X1: $i] :
( ( r @ X1 @ ( esk3_1 @ X1 ) )
| ( epred1_0 @ X1 )
| ~ ( r @ esk2_0 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
thf(c_0_20,negated_conjecture,
! [X2: $i > $o] :
( ( r @ esk2_0 @ ( esk1_2 @ X2 @ esk2_0 ) )
| ( X2 @ esk4_0 ) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
thf(c_0_21,plain,
! [X1: $i,X3: $i,X2: $i > $o,X12: $i] :
( ( X2 @ X3 )
| ( X2 @ X12 )
| ~ ( r @ ( esk1_2 @ X2 @ X1 ) @ X3 )
| ~ ( r @ X1 @ X12 ) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
thf(c_0_22,negated_conjecture,
! [X2: $i > $o] :
( ( r @ ( esk1_2 @ X2 @ esk2_0 ) @ ( esk3_1 @ ( esk1_2 @ X2 @ esk2_0 ) ) )
| ( epred1_0 @ ( esk1_2 @ X2 @ esk2_0 ) )
| ( X2 @ esk4_0 ) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
thf(c_0_23,negated_conjecture,
! [X2: $i > $o,X1: $i] :
( ( X2 @ ( esk3_1 @ ( esk1_2 @ X2 @ esk2_0 ) ) )
| ( epred1_0 @ ( esk1_2 @ X2 @ esk2_0 ) )
| ( X2 @ esk4_0 )
| ( X2 @ X1 )
| ~ ( r @ esk2_0 @ X1 ) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
thf(c_0_24,negated_conjecture,
! [X1: $i] :
( ( epred1_0 @ X1 )
| ~ ( epred1_0 @ ( esk3_1 @ X1 ) )
| ~ ( r @ esk2_0 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
thf(c_0_25,negated_conjecture,
! [X2: $i > $o] :
( ( X2 @ ( esk3_1 @ ( esk1_2 @ X2 @ esk2_0 ) ) )
| ( epred1_0 @ ( esk1_2 @ X2 @ esk2_0 ) )
| ( X2 @ esk4_0 ) ),
inference(spm,[status(thm)],[c_0_23,c_0_18]) ).
thf(c_0_26,negated_conjecture,
~ ( epred1_0 @ esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
thf(c_0_27,negated_conjecture,
( ( epred1_0 @ ( esk1_2 @ epred1_0 @ esk2_0 ) )
| ~ ( r @ esk2_0 @ ( esk1_2 @ epred1_0 @ esk2_0 ) ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
thf(c_0_28,plain,
! [X1: $i,X2: $i > $o,X3: $i] :
( ( X2 @ X3 )
| ~ ( X2 @ ( esk1_2 @ X2 @ X1 ) )
| ~ ( r @ X1 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
thf(c_0_29,negated_conjecture,
epred1_0 @ ( esk1_2 @ epred1_0 @ esk2_0 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_20]),c_0_26]) ).
thf(c_0_30,negated_conjecture,
! [X1: $i] :
( ( epred1_0 @ X1 )
| ~ ( r @ esk2_0 @ X1 ) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
thf(c_0_31,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_18]),c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : LCL623^1 : TPTP v8.2.0. Bugfixed v7.3.0.
% 0.08/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n011.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 20 02:52:38 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running higher-order theorem proving
% 0.20/0.47 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.49 # Version: 3.1.0-ho
% 0.20/0.49 # Preprocessing class: HSSSSMSSMLSNHSN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting new_ho_9 with 1500s (5) cores
% 0.20/0.49 # Starting post_as_ho1 with 300s (1) cores
% 0.20/0.49 # Starting sh1l with 300s (1) cores
% 0.20/0.49 # Starting post_as_ho10 with 300s (1) cores
% 0.20/0.49 # new_ho_9 with pid 14654 completed with status 0
% 0.20/0.49 # Result found by new_ho_9
% 0.20/0.49 # Preprocessing class: HSSSSMSSMLSNHSN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting new_ho_9 with 1500s (5) cores
% 0.20/0.49 # No SInE strategy applied
% 0.20/0.49 # Search class: HGUNF-FFSF21-SHSSMSBN
% 0.20/0.49 # partial match(2): HGHNF-FFMF21-SHSSMSBN
% 0.20/0.49 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.49 # Starting new_ho_9 with 901s (1) cores
% 0.20/0.49 # Starting post_as_ho11 with 151s (1) cores
% 0.20/0.49 # Starting pre_casc_8 with 151s (1) cores
% 0.20/0.49 # Starting post_as_ho2 with 151s (1) cores
% 0.20/0.49 # Starting post_as_ho1 with 146s (1) cores
% 0.20/0.49 # new_ho_9 with pid 14658 completed with status 0
% 0.20/0.49 # Result found by new_ho_9
% 0.20/0.49 # Preprocessing class: HSSSSMSSMLSNHSN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting new_ho_9 with 1500s (5) cores
% 0.20/0.49 # No SInE strategy applied
% 0.20/0.49 # Search class: HGUNF-FFSF21-SHSSMSBN
% 0.20/0.49 # partial match(2): HGHNF-FFMF21-SHSSMSBN
% 0.20/0.49 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.49 # Starting new_ho_9 with 901s (1) cores
% 0.20/0.49 # Preprocessing time : 0.001 s
% 0.20/0.49 # Presaturation interreduction done
% 0.20/0.49
% 0.20/0.49 # Proof found!
% 0.20/0.49 # SZS status Theorem
% 0.20/0.49 # SZS output start CNFRefutation
% See solution above
% 0.20/0.49 # Parsed axioms : 38
% 0.20/0.49 # Removed by relevancy pruning/SinE : 0
% 0.20/0.49 # Initial clauses : 28
% 0.20/0.49 # Removed in clause preprocessing : 21
% 0.20/0.49 # Initial clauses in saturation : 7
% 0.20/0.49 # Processed clauses : 29
% 0.20/0.49 # ...of these trivial : 0
% 0.20/0.49 # ...subsumed : 3
% 0.20/0.49 # ...remaining for further processing : 26
% 0.20/0.49 # Other redundant clauses eliminated : 0
% 0.20/0.49 # Clauses deleted for lack of memory : 0
% 0.20/0.49 # Backward-subsumed : 3
% 0.20/0.49 # Backward-rewritten : 1
% 0.20/0.49 # Generated clauses : 58
% 0.20/0.49 # ...of the previous two non-redundant : 45
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 0
% 0.20/0.49 # Paramodulations : 54
% 0.20/0.49 # Factorizations : 4
% 0.20/0.49 # NegExts : 0
% 0.20/0.49 # Equation resolutions : 0
% 0.20/0.49 # Disequality decompositions : 0
% 0.20/0.49 # Total rewrite steps : 9
% 0.20/0.49 # ...of those cached : 6
% 0.20/0.49 # Propositional unsat checks : 0
% 0.20/0.49 # Propositional check models : 0
% 0.20/0.49 # Propositional check unsatisfiable : 0
% 0.20/0.49 # Propositional clauses : 0
% 0.20/0.49 # Propositional clauses after purity: 0
% 0.20/0.49 # Propositional unsat core size : 0
% 0.20/0.49 # Propositional preprocessing time : 0.000
% 0.20/0.49 # Propositional encoding time : 0.000
% 0.20/0.49 # Propositional solver time : 0.000
% 0.20/0.49 # Success case prop preproc time : 0.000
% 0.20/0.49 # Success case prop encoding time : 0.000
% 0.20/0.49 # Success case prop solver time : 0.000
% 0.20/0.49 # Current number of processed clauses : 15
% 0.20/0.49 # Positive orientable unit clauses : 3
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 1
% 0.20/0.49 # Non-unit-clauses : 11
% 0.20/0.49 # Current number of unprocessed clauses: 28
% 0.20/0.49 # ...number of literals in the above : 137
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 11
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 56
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 28
% 0.20/0.49 # Non-unit clause-clause subsumptions : 6
% 0.20/0.49 # Unit Clause-clause subsumption calls : 0
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 1
% 0.20/0.49 # BW rewrite match successes : 1
% 0.20/0.49 # Condensation attempts : 29
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 3102
% 0.20/0.49 # Search garbage collected termcells : 483
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.006 s
% 0.20/0.49 # System time : 0.004 s
% 0.20/0.49 # Total time : 0.010 s
% 0.20/0.49 # Maximum resident set size: 1916 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.019 s
% 0.20/0.49 # System time : 0.008 s
% 0.20/0.49 # Total time : 0.027 s
% 0.20/0.49 # Maximum resident set size: 1764 pages
% 0.20/0.49 % E---3.1 exiting
% 0.20/0.49 % E exiting
%------------------------------------------------------------------------------