TSTP Solution File: LCL580^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LCL580^1 : TPTP v8.2.0. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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:54 EDT 2024
% Result : Theorem 0.20s 0.47s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 10
% Syntax : Number of formulae : 17 ( 8 unt; 6 typ; 0 def)
% Number of atoms : 24 ( 6 equ; 0 cnn)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 22 ( 3 ~; 0 |; 1 &; 15 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 19 ( 19 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 4 con; 0-3 aty)
% Number of variables : 16 ( 10 ^ 6 !; 0 ?; 16 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_27,type,
mtrue: $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_0: $i ).
thf(decl_43,type,
esk2_0: $i ).
thf(mtrue,axiom,
( mtrue
= ( ^ [X1: $i] : $true ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL008^0.ax',mtrue) ).
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,
mvalid @ ( mbox @ r @ mtrue ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm) ).
thf(c_0_4,plain,
( mtrue
= ( ^ [Z0: $i] : $true ) ),
inference(fof_simplification,[status(thm)],[mtrue]) ).
thf(c_0_5,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_6,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X15: $i] : ( Z0 @ X15 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_7,negated_conjecture,
~ ! [X20: $i,X19: $i] :
( ( r @ X20 @ X19 )
=> $true ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[thm]),c_0_4]),c_0_5]),c_0_6]) ).
thf(c_0_8,negated_conjecture,
( ( r @ esk1_0 @ esk2_0 )
& ~ $true ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
thf(c_0_9,negated_conjecture,
~ $true,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_10,negated_conjecture,
$false,
inference(cn,[status(thm)],[c_0_9]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL580^1 : TPTP v8.2.0. Released v3.6.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.14/0.33 % Computer : n023.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Mon May 20 02:56:23 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.20/0.46 Running higher-order theorem proving
% 0.20/0.46 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.20/0.47 # Version: 3.1.0-ho
% 0.20/0.47 # Preprocessing class: HSSSSMSSMLSNHSN.
% 0.20/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.47 # Starting new_ho_9 with 1500s (5) cores
% 0.20/0.47 # Starting post_as_ho1 with 300s (1) cores
% 0.20/0.47 # Starting sh1l with 300s (1) cores
% 0.20/0.47 # Starting post_as_ho10 with 300s (1) cores
% 0.20/0.47 # sh1l with pid 526 completed with status 0
% 0.20/0.47 # Result found by sh1l
% 0.20/0.47 # Preprocessing class: HSSSSMSSMLSNHSN.
% 0.20/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.47 # Starting new_ho_9 with 1500s (5) cores
% 0.20/0.47 # Starting post_as_ho1 with 300s (1) cores
% 0.20/0.47 # Starting sh1l with 300s (1) cores
% 0.20/0.47 # No SInE strategy applied
% 0.20/0.47 # Search class: HUHNF-FFSF00-SHSSMFNN
% 0.20/0.47 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.47 # Starting new_ho_10 with 163s (1) cores
% 0.20/0.47 # new_ho_10 with pid 533 completed with status 0
% 0.20/0.47 # Result found by new_ho_10
% 0.20/0.47 # Preprocessing class: HSSSSMSSMLSNHSN.
% 0.20/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.47 # Starting new_ho_9 with 1500s (5) cores
% 0.20/0.47 # Starting post_as_ho1 with 300s (1) cores
% 0.20/0.47 # Starting sh1l with 300s (1) cores
% 0.20/0.47 # No SInE strategy applied
% 0.20/0.47 # Search class: HUHNF-FFSF00-SHSSMFNN
% 0.20/0.47 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.47 # Starting new_ho_10 with 163s (1) cores
% 0.20/0.47 # Preprocessing time : 0.001 s
% 0.20/0.47 # Presaturation interreduction done
% 0.20/0.47
% 0.20/0.47 # Proof found!
% 0.20/0.47 # SZS status Theorem
% 0.20/0.47 # SZS output start CNFRefutation
% See solution above
% 0.20/0.47 # Parsed axioms : 37
% 0.20/0.47 # Removed by relevancy pruning/SinE : 0
% 0.20/0.47 # Initial clauses : 23
% 0.20/0.47 # Removed in clause preprocessing : 21
% 0.20/0.47 # Initial clauses in saturation : 2
% 0.20/0.47 # Processed clauses : 1
% 0.20/0.47 # ...of these trivial : 0
% 0.20/0.47 # ...subsumed : 0
% 0.20/0.47 # ...remaining for further processing : 0
% 0.20/0.47 # Other redundant clauses eliminated : 0
% 0.20/0.47 # Clauses deleted for lack of memory : 0
% 0.20/0.47 # Backward-subsumed : 0
% 0.20/0.47 # Backward-rewritten : 0
% 0.20/0.47 # Generated clauses : 0
% 0.20/0.47 # ...of the previous two non-redundant : 0
% 0.20/0.47 # ...aggressively subsumed : 0
% 0.20/0.47 # Contextual simplify-reflections : 0
% 0.20/0.47 # Paramodulations : 0
% 0.20/0.47 # Factorizations : 0
% 0.20/0.47 # NegExts : 0
% 0.20/0.47 # Equation resolutions : 0
% 0.20/0.47 # Disequality decompositions : 0
% 0.20/0.47 # Total rewrite steps : 0
% 0.20/0.47 # ...of those cached : 0
% 0.20/0.47 # Propositional unsat checks : 0
% 0.20/0.47 # Propositional check models : 0
% 0.20/0.47 # Propositional check unsatisfiable : 0
% 0.20/0.47 # Propositional clauses : 0
% 0.20/0.47 # Propositional clauses after purity: 0
% 0.20/0.47 # Propositional unsat core size : 0
% 0.20/0.47 # Propositional preprocessing time : 0.000
% 0.20/0.47 # Propositional encoding time : 0.000
% 0.20/0.47 # Propositional solver time : 0.000
% 0.20/0.47 # Success case prop preproc time : 0.000
% 0.20/0.47 # Success case prop encoding time : 0.000
% 0.20/0.47 # Success case prop solver time : 0.000
% 0.20/0.47 # Current number of processed clauses : 0
% 0.20/0.47 # Positive orientable unit clauses : 0
% 0.20/0.47 # Positive unorientable unit clauses: 0
% 0.20/0.47 # Negative unit clauses : 0
% 0.20/0.47 # Non-unit-clauses : 0
% 0.20/0.47 # Current number of unprocessed clauses: 1
% 0.20/0.47 # ...number of literals in the above : 1
% 0.20/0.47 # Current number of archived formulas : 0
% 0.20/0.47 # Current number of archived clauses : 0
% 0.20/0.47 # Clause-clause subsumption calls (NU) : 0
% 0.20/0.47 # Rec. Clause-clause subsumption calls : 0
% 0.20/0.47 # Non-unit clause-clause subsumptions : 0
% 0.20/0.47 # Unit Clause-clause subsumption calls : 0
% 0.20/0.47 # Rewrite failures with RHS unbound : 0
% 0.20/0.47 # BW rewrite match attempts : 0
% 0.20/0.47 # BW rewrite match successes : 0
% 0.20/0.47 # Condensation attempts : 1
% 0.20/0.47 # Condensation successes : 0
% 0.20/0.47 # Termbank termtop insertions : 798
% 0.20/0.47 # Search garbage collected termcells : 101
% 0.20/0.47
% 0.20/0.47 # -------------------------------------------------
% 0.20/0.47 # User time : 0.003 s
% 0.20/0.47 # System time : 0.001 s
% 0.20/0.47 # Total time : 0.004 s
% 0.20/0.47 # Maximum resident set size: 1728 pages
% 0.20/0.47
% 0.20/0.47 # -------------------------------------------------
% 0.20/0.47 # User time : 0.004 s
% 0.20/0.47 # System time : 0.004 s
% 0.20/0.47 # Total time : 0.008 s
% 0.20/0.47 # Maximum resident set size: 1764 pages
% 0.20/0.47 % E---3.1 exiting
% 0.20/0.47 % E exiting
%------------------------------------------------------------------------------