TSTP Solution File: LCL608^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LCL608^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:59 EDT 2024
% Result : Theorem 0.19s 0.51s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of formulae : 24 ( 13 unt; 7 typ; 0 def)
% Number of atoms : 34 ( 9 equ; 0 cnn)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 56 ( 10 ~; 7 |; 4 &; 33 @)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 35 ( 35 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 7 usr; 2 con; 0-3 aty)
% Number of variables : 34 ( 20 ^ 14 !; 0 ?; 34 :)
% 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_37,type,
mvalid: ( $i > $o ) > $o ).
thf(decl_41,type,
epred1_0: $i > $o ).
thf(decl_42,type,
epred2_0: $i > $o ).
thf(decl_43,type,
esk1_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(mvalid,axiom,
( mvalid
= ( ^ [X11: $i > $o] :
! [X15: $i] : ( X11 @ X15 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL008^0.ax',mvalid) ).
thf(thm,conjecture,
! [X19: $i > $o,X20: $i > $o] :
( ( ( mvalid @ X19 )
& ( mvalid @ ( mimpl @ X19 @ X20 ) ) )
=> ( mvalid @ X20 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm) ).
thf(c_0_5,plain,
( mimpl
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimpl]) ).
thf(c_0_6,plain,
( mnot
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot]) ).
thf(c_0_7,plain,
( mor
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mor]) ).
thf(c_0_8,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_5,c_0_6]),c_0_7]) ).
thf(c_0_9,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X15: $i] : ( Z0 @ X15 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_10,negated_conjecture,
~ ! [X19: $i > $o,X20: $i > $o] :
( ( ! [X23: $i] : ( X19 @ X23 )
& ! [X24: $i] :
( ~ ( X19 @ X24 )
| ( X20 @ X24 ) ) )
=> ! [X25: $i] : ( X20 @ X25 ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[thm]),c_0_8]),c_0_9]) ).
thf(c_0_11,negated_conjecture,
! [X28: $i,X29: $i] :
( ( epred1_0 @ X28 )
& ( ~ ( epred1_0 @ X29 )
| ( epred2_0 @ X29 ) )
& ~ ( epred2_0 @ esk1_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_10])])])])]) ).
thf(c_0_12,negated_conjecture,
! [X1: $i] :
( ( epred2_0 @ X1 )
| ~ ( epred1_0 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_13,negated_conjecture,
! [X1: $i] : ( epred1_0 @ X1 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_14,negated_conjecture,
~ ( epred2_0 @ esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_15,negated_conjecture,
! [X1: $i] : ( epred2_0 @ X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]) ).
thf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL608^1 : TPTP v8.2.0. Released v3.6.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n022.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 00:31:37 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.49 Running higher-order theorem proving
% 0.19/0.49 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.51 # Version: 3.1.0-ho
% 0.19/0.51 # Preprocessing class: HSSSSMSSMLSNHSN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting new_ho_9 with 1500s (5) cores
% 0.19/0.51 # Starting post_as_ho1 with 300s (1) cores
% 0.19/0.51 # Starting sh1l with 300s (1) cores
% 0.19/0.51 # Starting post_as_ho10 with 300s (1) cores
% 0.19/0.51 # post_as_ho1 with pid 10950 completed with status 0
% 0.19/0.51 # Result found by post_as_ho1
% 0.19/0.51 # Preprocessing class: HSSSSMSSMLSNHSN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting new_ho_9 with 1500s (5) cores
% 0.19/0.51 # Starting post_as_ho1 with 300s (1) cores
% 0.19/0.51 # No SInE strategy applied
% 0.19/0.51 # Search class: HHUNF-FFSF00-SHSSMFNN
% 0.19/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.51 # Starting new_ho_10 with 163s (1) cores
% 0.19/0.51 # new_ho_10 with pid 10954 completed with status 0
% 0.19/0.51 # Result found by new_ho_10
% 0.19/0.51 # Preprocessing class: HSSSSMSSMLSNHSN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting new_ho_9 with 1500s (5) cores
% 0.19/0.51 # Starting post_as_ho1 with 300s (1) cores
% 0.19/0.51 # No SInE strategy applied
% 0.19/0.51 # Search class: HHUNF-FFSF00-SHSSMFNN
% 0.19/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.51 # Starting new_ho_10 with 163s (1) cores
% 0.19/0.51 # Preprocessing time : 0.001 s
% 0.19/0.51 # Presaturation interreduction done
% 0.19/0.51
% 0.19/0.51 # Proof found!
% 0.19/0.51 # SZS status Theorem
% 0.19/0.51 # SZS output start CNFRefutation
% See solution above
% 0.19/0.51 # Parsed axioms : 36
% 0.19/0.51 # Removed by relevancy pruning/SinE : 0
% 0.19/0.51 # Initial clauses : 23
% 0.19/0.51 # Removed in clause preprocessing : 20
% 0.19/0.51 # Initial clauses in saturation : 3
% 0.19/0.51 # Processed clauses : 3
% 0.19/0.51 # ...of these trivial : 0
% 0.19/0.51 # ...subsumed : 0
% 0.19/0.51 # ...remaining for further processing : 3
% 0.19/0.51 # Other redundant clauses eliminated : 0
% 0.19/0.51 # Clauses deleted for lack of memory : 0
% 0.19/0.51 # Backward-subsumed : 0
% 0.19/0.51 # Backward-rewritten : 1
% 0.19/0.51 # Generated clauses : 0
% 0.19/0.51 # ...of the previous two non-redundant : 0
% 0.19/0.51 # ...aggressively subsumed : 0
% 0.19/0.51 # Contextual simplify-reflections : 0
% 0.19/0.51 # Paramodulations : 0
% 0.19/0.51 # Factorizations : 0
% 0.19/0.51 # NegExts : 0
% 0.19/0.51 # Equation resolutions : 0
% 0.19/0.51 # Disequality decompositions : 0
% 0.19/0.51 # Total rewrite steps : 2
% 0.19/0.51 # ...of those cached : 0
% 0.19/0.51 # Propositional unsat checks : 0
% 0.19/0.51 # Propositional check models : 0
% 0.19/0.51 # Propositional check unsatisfiable : 0
% 0.19/0.51 # Propositional clauses : 0
% 0.19/0.51 # Propositional clauses after purity: 0
% 0.19/0.51 # Propositional unsat core size : 0
% 0.19/0.51 # Propositional preprocessing time : 0.000
% 0.19/0.51 # Propositional encoding time : 0.000
% 0.19/0.51 # Propositional solver time : 0.000
% 0.19/0.51 # Success case prop preproc time : 0.000
% 0.19/0.51 # Success case prop encoding time : 0.000
% 0.19/0.51 # Success case prop solver time : 0.000
% 0.19/0.51 # Current number of processed clauses : 2
% 0.19/0.51 # Positive orientable unit clauses : 2
% 0.19/0.51 # Positive unorientable unit clauses: 0
% 0.19/0.51 # Negative unit clauses : 0
% 0.19/0.51 # Non-unit-clauses : 0
% 0.19/0.51 # Current number of unprocessed clauses: 0
% 0.19/0.51 # ...number of literals in the above : 0
% 0.19/0.51 # Current number of archived formulas : 0
% 0.19/0.51 # Current number of archived clauses : 1
% 0.19/0.51 # Clause-clause subsumption calls (NU) : 0
% 0.19/0.51 # Rec. Clause-clause subsumption calls : 0
% 0.19/0.51 # Non-unit clause-clause subsumptions : 0
% 0.19/0.51 # Unit Clause-clause subsumption calls : 0
% 0.19/0.51 # Rewrite failures with RHS unbound : 0
% 0.19/0.51 # BW rewrite match attempts : 1
% 0.19/0.51 # BW rewrite match successes : 1
% 0.19/0.51 # Condensation attempts : 3
% 0.19/0.51 # Condensation successes : 0
% 0.19/0.51 # Termbank termtop insertions : 939
% 0.19/0.51 # Search garbage collected termcells : 192
% 0.19/0.51
% 0.19/0.51 # -------------------------------------------------
% 0.19/0.51 # User time : 0.004 s
% 0.19/0.51 # System time : 0.001 s
% 0.19/0.51 # Total time : 0.005 s
% 0.19/0.51 # Maximum resident set size: 1708 pages
% 0.19/0.51
% 0.19/0.51 # -------------------------------------------------
% 0.19/0.51 # User time : 0.005 s
% 0.19/0.51 # System time : 0.003 s
% 0.19/0.51 # Total time : 0.009 s
% 0.19/0.51 # Maximum resident set size: 1764 pages
% 0.19/0.51 % E---3.1 exiting
% 0.19/0.51 % E exiting
%------------------------------------------------------------------------------