TSTP Solution File: LCL064-2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LCL064-2 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:11:25 EDT 2023
% Result : Timeout 272.27s 300.19s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of clauses : 17 ( 9 unt; 0 nHn; 10 RR)
% Number of literals : 29 ( 0 equ; 14 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 37 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1) ),
file('/export/starexec/sandbox/tmp/tmp.yMP8Ypt3U6/E---3.1_1601.p',condensed_detachment) ).
cnf(cn_35,axiom,
is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(implies(X1,X2),implies(X1,X3)))),
file('/export/starexec/sandbox/tmp/tmp.yMP8Ypt3U6/E---3.1_1601.p',cn_35) ).
cnf(cn_18,axiom,
is_a_theorem(implies(X1,implies(X2,X1))),
file('/export/starexec/sandbox/tmp/tmp.yMP8Ypt3U6/E---3.1_1601.p',cn_18) ).
cnf(prove_cn_1,negated_conjecture,
~ is_a_theorem(implies(implies(a,b),implies(implies(b,c),implies(a,c)))),
file('/export/starexec/sandbox/tmp/tmp.yMP8Ypt3U6/E---3.1_1601.p',prove_cn_1) ).
cnf(c_0_4,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1) ),
condensed_detachment ).
cnf(c_0_5,axiom,
is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(implies(X1,X2),implies(X1,X3)))),
cn_35 ).
cnf(c_0_6,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X1,X3)))
| ~ is_a_theorem(implies(X1,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_7,axiom,
is_a_theorem(implies(X1,implies(X2,X1))),
cn_18 ).
cnf(c_0_8,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,implies(X3,X2)))
| ~ is_a_theorem(implies(X1,X3)) ),
inference(spm,[status(thm)],[c_0_4,c_0_6]) ).
cnf(c_0_9,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_4,c_0_7]) ).
cnf(c_0_10,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,X3))
| ~ is_a_theorem(implies(X3,X2)) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(implies(X3,X1),X2)) ),
inference(spm,[status(thm)],[c_0_10,c_0_7]) ).
cnf(c_0_12,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X2,implies(X1,X3))) ),
inference(spm,[status(thm)],[c_0_11,c_0_6]) ).
cnf(c_0_13,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X1),implies(X3,X2)))),
inference(spm,[status(thm)],[c_0_11,c_0_5]) ).
cnf(c_0_14,negated_conjecture,
~ is_a_theorem(implies(implies(a,b),implies(implies(b,c),implies(a,c)))),
prove_cn_1 ).
cnf(c_0_15,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(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.05/0.10 % Problem : LCL064-2 : TPTP v8.1.2. Released v1.0.0.
% 0.10/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n006.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon Oct 2 12:26:55 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.16/0.41 Running first-order theorem proving
% 0.16/0.41 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.yMP8Ypt3U6/E---3.1_1601.p
% 272.27/300.19 # Version: 3.1pre001
% 272.27/300.19 # Preprocessing class: FSSSSMSSSSSNFFN.
% 272.27/300.19 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 272.27/300.19 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 272.27/300.19 # Starting new_bool_3 with 300s (1) cores
% 272.27/300.19 # Starting new_bool_1 with 300s (1) cores
% 272.27/300.19 # Starting sh5l with 300s (1) cores
% 272.27/300.19 # new_bool_1 with pid 1683 completed with status 0
% 272.27/300.19 # Result found by new_bool_1
% 272.27/300.19 # Preprocessing class: FSSSSMSSSSSNFFN.
% 272.27/300.19 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 272.27/300.19 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 272.27/300.19 # Starting new_bool_3 with 300s (1) cores
% 272.27/300.19 # Starting new_bool_1 with 300s (1) cores
% 272.27/300.19 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 272.27/300.19 # Search class: FHUNS-FFSF22-MFFFFFNN
% 272.27/300.19 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 272.27/300.19 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 181s (1) cores
% 272.27/300.19 # G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with pid 1687 completed with status 0
% 272.27/300.19 # Result found by G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y
% 272.27/300.19 # Preprocessing class: FSSSSMSSSSSNFFN.
% 272.27/300.19 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 272.27/300.19 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 272.27/300.19 # Starting new_bool_3 with 300s (1) cores
% 272.27/300.19 # Starting new_bool_1 with 300s (1) cores
% 272.27/300.19 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 272.27/300.19 # Search class: FHUNS-FFSF22-MFFFFFNN
% 272.27/300.19 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 272.27/300.19 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 181s (1) cores
% 272.27/300.19 # Preprocessing time : 0.001 s
% 272.27/300.19
% 272.27/300.19 # Proof found!
% 272.27/300.19 # SZS status Unsatisfiable
% 272.27/300.19 # SZS output start CNFRefutation
% See solution above
% 272.27/300.19 # Parsed axioms : 4
% 272.27/300.19 # Removed by relevancy pruning/SinE : 0
% 272.27/300.19 # Initial clauses : 4
% 272.27/300.19 # Removed in clause preprocessing : 0
% 272.27/300.19 # Initial clauses in saturation : 4
% 272.27/300.19 # Processed clauses : 103
% 272.27/300.19 # ...of these trivial : 1
% 272.27/300.19 # ...subsumed : 51
% 272.27/300.19 # ...remaining for further processing : 51
% 272.27/300.19 # Other redundant clauses eliminated : 0
% 272.27/300.19 # Clauses deleted for lack of memory : 0
% 272.27/300.19 # Backward-subsumed : 0
% 272.27/300.19 # Backward-rewritten : 2
% 272.27/300.19 # Generated clauses : 352
% 272.27/300.19 # ...of the previous two non-redundant : 197
% 272.27/300.19 # ...aggressively subsumed : 0
% 272.27/300.19 # Contextual simplify-reflections : 0
% 272.27/300.19 # Paramodulations : 352
% 272.27/300.19 # Factorizations : 0
% 272.27/300.19 # NegExts : 0
% 272.27/300.19 # Equation resolutions : 0
% 272.27/300.19 # Total rewrite steps : 137
% 272.27/300.19 # Propositional unsat checks : 0
% 272.27/300.19 # Propositional check models : 0
% 272.27/300.19 # Propositional check unsatisfiable : 0
% 272.27/300.19 # Propositional clauses : 0
% 272.27/300.19 # Propositional clauses after purity: 0
% 272.27/300.19 # Propositional unsat core size : 0
% 272.27/300.19 # Propositional preprocessing time : 0.000
% 272.27/300.19 # Propositional encoding time : 0.000
% 272.27/300.19 # Propositional solver time : 0.000
% 272.27/300.19 # Success case prop preproc time : 0.000
% 272.27/300.19 # Success case prop encoding time : 0.000
% 272.27/300.19 # Success case prop solver time : 0.000
% 272.27/300.19 # Current number of processed clauses : 49
% 272.27/300.19 # Positive orientable unit clauses : 24
% 272.27/300.19 # Positive unorientable unit clauses: 0
% 272.27/300.19 # Negative unit clauses : 5
% 272.27/300.19 # Non-unit-clauses : 20
% 272.27/300.19 # Current number of unprocessed clauses: 95
% 272.27/300.19 # ...number of literals in the above : 181
% 272.27/300.19 # Current number of archived formulas : 0
% 272.27/300.19 # Current number of archived clauses : 2
% 272.27/300.19 # Clause-clause subsumption calls (NU) : 221
% 272.27/300.19 # Rec. Clause-clause subsumption calls : 221
% 272.27/300.19 # Non-unit clause-clause subsumptions : 49
% 272.27/300.19 # Unit Clause-clause subsumption calls : 34
% 272.27/300.19 # Rewrite failures with RHS unbound : 0
% 272.27/300.19 # BW rewrite match attempts : 284
% 272.27/300.19 # BW rewrite match successes : 2
% 272.27/300.19 # Condensation attempts : 103
% 272.27/300.19 # Condensation successes : 3
% 272.27/300.19 # Termbank termtop insertions : 3428
% 272.27/300.19
% 272.27/300.19 # -------------------------------------------------
% 272.27/300.19 # User time : 0.006 s
% 272.27/300.19 # System time : 0.000 s
% 272.27/300.19 # Total time : 0.007 s
% 272.27/300.19 # Maximum resident set size: 1644 pages
% 272.27/300.19
% 272.27/300.19 # -------------------------------------------------
% 272.27/300.19 # User time : 0.007 s
% 272.27/300.19 # System time : 0.001 s
% 272.27/300.19 # Total time : 0.008 s
% 272.27/300.19 # Maximum resident set size: 1676 pages
% 272.27/300.19 % E---3.1 exiting
% 272.27/300.19 % E---3.1 exiting
%------------------------------------------------------------------------------