TSTP Solution File: LCL597^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LCL597^1 : TPTP v8.2.0. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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:57 EDT 2024
% Result : Theorem 0.16s 0.44s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 15
% Syntax : Number of formulae : 25 ( 12 unt; 9 typ; 0 def)
% Number of atoms : 32 ( 11 equ; 0 cnn)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 80 ( 8 ~; 6 |; 3 &; 58 @)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 64 ( 64 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 9 usr; 1 con; 0-3 aty)
% Number of variables : 41 ( 26 ^ 13 !; 2 ?; 41 :)
% 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,
epred1_1: ( $i > $i > $o ) > $i > $o ).
thf(decl_42,type,
esk1_1: ( $i > $i > $o ) > $i ).
thf(decl_43,type,
esk2_1: ( $i > $i > $o ) > $i ).
thf(decl_44,type,
esk3_1: ( $i > $i > $o ) > $i ).
thf(mimpl,axiom,
( mimpl
= ( ^ [X7: $i > $o,X8: $i > $o] : ( mor @ ( mnot @ X7 ) @ X8 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL008^0.ax',mimpl) ).
thf(mnot,axiom,
( mnot
= ( ^ [X2: $i > $o,X3: $i] :
~ ( X2 @ X3 ) ) ),
file('/export/starexec/sandbox/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/sandbox/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/sandbox/benchmark/Axioms/LCL008^0.ax',mbox) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X11: $i > $o] :
! [X15: $i] : ( X11 @ X15 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL008^0.ax',mvalid) ).
thf(thm,conjecture,
? [X10: $i > $i > $o] :
! [X19: $i > $o] : ( mvalid @ ( mimpl @ ( mbox @ X10 @ X19 ) @ ( mbox @ X10 @ ( mbox @ X10 @ X19 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm) ).
thf(c_0_6,plain,
( mimpl
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimpl]) ).
thf(c_0_7,plain,
( mnot
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot]) ).
thf(c_0_8,plain,
( mor
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mor]) ).
thf(c_0_9,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_6,c_0_7]),c_0_8]) ).
thf(c_0_10,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_11,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X15: $i] : ( Z0 @ X15 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_12,negated_conjecture,
~ ? [X10: $i > $i > $o] :
! [X19: $i > $o,X25: $i] :
( ~ ! [X22: $i] :
( ( X10 @ X25 @ X22 )
=> ( X19 @ X22 ) )
| ! [X24: $i] :
( ( X10 @ X25 @ X24 )
=> ! [X23: $i] :
( ( X10 @ X24 @ X23 )
=> ( X19 @ X23 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[thm]),c_0_9]),c_0_10]),c_0_11]) ).
thf(c_0_13,negated_conjecture,
! [X26: $i > $i > $o,X29: $i] :
( ( ~ ( X26 @ ( esk1_1 @ X26 ) @ X29 )
| ( epred1_1 @ X26 @ X29 ) )
& ( X26 @ ( esk1_1 @ X26 ) @ ( esk2_1 @ X26 ) )
& ( X26 @ ( esk2_1 @ X26 ) @ ( esk3_1 @ X26 ) )
& ~ ( epred1_1 @ X26 @ ( esk3_1 @ X26 ) ) ),
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_12])])])])]) ).
thf(c_0_14,negated_conjecture,
! [X10: $i > $i > $o] : ( X10 @ ( esk1_1 @ X10 ) @ ( esk2_1 @ X10 ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_15,negated_conjecture,
$false,
inference(flex_resolve,[status(thm)],[c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : LCL597^1 : TPTP v8.2.0. Released v3.6.0.
% 0.02/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n029.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Mon May 20 00:53:22 EDT 2024
% 0.11/0.31 % CPUTime :
% 0.16/0.43 Running higher-order theorem proving
% 0.16/0.43 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.16/0.44 # Version: 3.1.0-ho
% 0.16/0.44 # Preprocessing class: HSSSSMSSMLSNHSN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting new_ho_9 with 1500s (5) cores
% 0.16/0.44 # Starting post_as_ho1 with 300s (1) cores
% 0.16/0.44 # Starting sh1l with 300s (1) cores
% 0.16/0.44 # Starting post_as_ho10 with 300s (1) cores
% 0.16/0.44 # post_as_ho1 with pid 9919 completed with status 0
% 0.16/0.44 # Result found by post_as_ho1
% 0.16/0.44 # Preprocessing class: HSSSSMSSMLSNHSN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting new_ho_9 with 1500s (5) cores
% 0.16/0.44 # Starting post_as_ho1 with 300s (1) cores
% 0.16/0.44 # No SInE strategy applied
% 0.16/0.44 # Search class: HHUNS-FFSF11-SHSSMMBN
% 0.16/0.44 # partial match(2): HGUNF-FFSF11-SHSSMMBN
% 0.16/0.44 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.44 # Starting ehoh_best2_full_lfho with 163s (1) cores
% 0.16/0.44 # ehoh_best2_full_lfho with pid 9922 completed with status 0
% 0.16/0.44 # Result found by ehoh_best2_full_lfho
% 0.16/0.44 # Preprocessing class: HSSSSMSSMLSNHSN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting new_ho_9 with 1500s (5) cores
% 0.16/0.44 # Starting post_as_ho1 with 300s (1) cores
% 0.16/0.44 # No SInE strategy applied
% 0.16/0.44 # Search class: HHUNS-FFSF11-SHSSMMBN
% 0.16/0.44 # partial match(2): HGUNF-FFSF11-SHSSMMBN
% 0.16/0.44 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.44 # Starting ehoh_best2_full_lfho with 163s (1) cores
% 0.16/0.44 # Preprocessing time : 0.001 s
% 0.16/0.44
% 0.16/0.44 # Proof found!
% 0.16/0.44 # SZS status Theorem
% 0.16/0.44 # SZS output start CNFRefutation
% See solution above
% 0.16/0.44 # Parsed axioms : 36
% 0.16/0.44 # Removed by relevancy pruning/SinE : 0
% 0.16/0.44 # Initial clauses : 24
% 0.16/0.44 # Removed in clause preprocessing : 20
% 0.16/0.44 # Initial clauses in saturation : 4
% 0.16/0.44 # Processed clauses : 2
% 0.16/0.44 # ...of these trivial : 0
% 0.16/0.44 # ...subsumed : 0
% 0.16/0.44 # ...remaining for further processing : 1
% 0.16/0.44 # Other redundant clauses eliminated : 0
% 0.16/0.44 # Clauses deleted for lack of memory : 0
% 0.16/0.44 # Backward-subsumed : 0
% 0.16/0.44 # Backward-rewritten : 0
% 0.16/0.44 # Generated clauses : 0
% 0.16/0.44 # ...of the previous two non-redundant : 0
% 0.16/0.44 # ...aggressively subsumed : 0
% 0.16/0.44 # Contextual simplify-reflections : 0
% 0.16/0.44 # Paramodulations : 0
% 0.16/0.44 # Factorizations : 0
% 0.16/0.44 # NegExts : 0
% 0.16/0.44 # Equation resolutions : 0
% 0.16/0.44 # Disequality decompositions : 0
% 0.16/0.44 # Total rewrite steps : 0
% 0.16/0.44 # ...of those cached : 0
% 0.16/0.44 # Propositional unsat checks : 0
% 0.16/0.44 # Propositional check models : 0
% 0.16/0.44 # Propositional check unsatisfiable : 0
% 0.16/0.44 # Propositional clauses : 0
% 0.16/0.44 # Propositional clauses after purity: 0
% 0.16/0.44 # Propositional unsat core size : 0
% 0.16/0.44 # Propositional preprocessing time : 0.000
% 0.16/0.44 # Propositional encoding time : 0.000
% 0.16/0.44 # Propositional solver time : 0.000
% 0.16/0.44 # Success case prop preproc time : 0.000
% 0.16/0.44 # Success case prop encoding time : 0.000
% 0.16/0.44 # Success case prop solver time : 0.000
% 0.16/0.44 # Current number of processed clauses : 1
% 0.16/0.44 # Positive orientable unit clauses : 0
% 0.16/0.44 # Positive unorientable unit clauses: 0
% 0.16/0.44 # Negative unit clauses : 1
% 0.16/0.44 # Non-unit-clauses : 0
% 0.16/0.44 # Current number of unprocessed clauses: 2
% 0.16/0.44 # ...number of literals in the above : 3
% 0.16/0.44 # Current number of archived formulas : 0
% 0.16/0.44 # Current number of archived clauses : 0
% 0.16/0.44 # Clause-clause subsumption calls (NU) : 0
% 0.16/0.44 # Rec. Clause-clause subsumption calls : 0
% 0.16/0.44 # Non-unit clause-clause subsumptions : 0
% 0.16/0.44 # Unit Clause-clause subsumption calls : 0
% 0.16/0.44 # Rewrite failures with RHS unbound : 0
% 0.16/0.44 # BW rewrite match attempts : 0
% 0.16/0.44 # BW rewrite match successes : 0
% 0.16/0.44 # Condensation attempts : 0
% 0.16/0.44 # Condensation successes : 0
% 0.16/0.44 # Termbank termtop insertions : 1012
% 0.16/0.44 # Search garbage collected termcells : 240
% 0.16/0.44
% 0.16/0.44 # -------------------------------------------------
% 0.16/0.44 # User time : 0.003 s
% 0.16/0.44 # System time : 0.001 s
% 0.16/0.44 # Total time : 0.004 s
% 0.16/0.44 # Maximum resident set size: 1740 pages
% 0.16/0.44
% 0.16/0.44 # -------------------------------------------------
% 0.16/0.44 # User time : 0.005 s
% 0.16/0.44 # System time : 0.002 s
% 0.16/0.44 # Total time : 0.007 s
% 0.16/0.44 # Maximum resident set size: 1768 pages
% 0.16/0.44 % E---3.1 exiting
% 0.16/0.44 % E exiting
%------------------------------------------------------------------------------