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