TSTP Solution File: LCL067-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LCL067-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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 : Unsatisfiable 8.21s 1.59s
% Output : CNFRefutation 8.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 5
% Syntax : Number of clauses : 47 ( 23 unt; 0 nHn; 24 RR)
% Number of literals : 79 ( 0 equ; 35 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 119 ( 27 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.gUoZFqkAkh/E---3.1_29575.p',condensed_detachment) ).
cnf(cn_59,axiom,
is_a_theorem(implies(implies(not(X1),X2),implies(implies(X3,X2),implies(implies(X1,X3),X2)))),
file('/export/starexec/sandbox/tmp/tmp.gUoZFqkAkh/E---3.1_29575.p',cn_59) ).
cnf(cn_37,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(not(X1),X3))),
file('/export/starexec/sandbox/tmp/tmp.gUoZFqkAkh/E---3.1_29575.p',cn_37) ).
cnf(cn_19,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X2,X3))),
file('/export/starexec/sandbox/tmp/tmp.gUoZFqkAkh/E---3.1_29575.p',cn_19) ).
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.gUoZFqkAkh/E---3.1_29575.p',prove_cn_1) ).
cnf(c_0_5,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1) ),
condensed_detachment ).
cnf(c_0_6,axiom,
is_a_theorem(implies(implies(not(X1),X2),implies(implies(X3,X2),implies(implies(X1,X3),X2)))),
cn_59 ).
cnf(c_0_7,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(not(X1),X3))),
cn_37 ).
cnf(c_0_8,plain,
( is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X1),X2)))
| ~ is_a_theorem(implies(not(X3),X2)) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,plain,
( is_a_theorem(implies(not(X1),X2))
| ~ is_a_theorem(implies(implies(X1,X3),X2)) ),
inference(spm,[status(thm)],[c_0_5,c_0_7]) ).
cnf(c_0_10,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X2,X3))),
cn_19 ).
cnf(c_0_11,plain,
( is_a_theorem(implies(implies(X1,X2),X3))
| ~ is_a_theorem(implies(not(X1),X3))
| ~ is_a_theorem(implies(X2,X3)) ),
inference(spm,[status(thm)],[c_0_5,c_0_8]) ).
cnf(c_0_12,plain,
is_a_theorem(implies(not(implies(X1,X2)),implies(X2,X3))),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
( is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X2,X4)))
| ~ is_a_theorem(implies(X3,implies(X2,X4))) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(implies(X3,X1),X2)) ),
inference(spm,[status(thm)],[c_0_5,c_0_10]) ).
cnf(c_0_15,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(implies(X3,X1),X4))
| ~ is_a_theorem(implies(X4,implies(X1,X2))) ),
inference(spm,[status(thm)],[c_0_5,c_0_13]) ).
cnf(c_0_16,plain,
is_a_theorem(implies(X1,implies(X2,X1))),
inference(spm,[status(thm)],[c_0_14,c_0_10]) ).
cnf(c_0_17,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(implies(X3,X1),implies(X1,X2))) ),
inference(spm,[status(thm)],[c_0_15,c_0_10]) ).
cnf(c_0_18,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,not(X1))))
| ~ is_a_theorem(implies(X2,implies(X3,not(X1)))) ),
inference(spm,[status(thm)],[c_0_11,c_0_16]) ).
cnf(c_0_19,plain,
is_a_theorem(implies(X1,X1)),
inference(spm,[status(thm)],[c_0_17,c_0_10]) ).
cnf(c_0_20,plain,
( is_a_theorem(implies(X1,not(X2)))
| ~ is_a_theorem(implies(X3,implies(X1,not(X2))))
| ~ is_a_theorem(implies(X2,X3)) ),
inference(spm,[status(thm)],[c_0_5,c_0_18]) ).
cnf(c_0_21,plain,
is_a_theorem(implies(not(X1),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_9,c_0_19]) ).
cnf(c_0_22,plain,
( is_a_theorem(implies(implies(X1,X2),not(X1)))
| ~ is_a_theorem(implies(X2,not(X1))) ),
inference(spm,[status(thm)],[c_0_11,c_0_19]) ).
cnf(c_0_23,plain,
( is_a_theorem(implies(X1,not(X2)))
| ~ is_a_theorem(implies(X2,not(X1))) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,plain,
is_a_theorem(implies(not(not(X1)),implies(implies(X2,X3),implies(implies(X1,X2),X3)))),
inference(spm,[status(thm)],[c_0_9,c_0_6]) ).
cnf(c_0_25,plain,
( is_a_theorem(not(X1))
| ~ is_a_theorem(implies(X2,not(X1)))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_5,c_0_22]) ).
cnf(c_0_26,plain,
is_a_theorem(implies(X1,not(not(X1)))),
inference(spm,[status(thm)],[c_0_23,c_0_19]) ).
cnf(c_0_27,plain,
( is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X1),X2)))
| ~ is_a_theorem(not(not(X3))) ),
inference(spm,[status(thm)],[c_0_5,c_0_24]) ).
cnf(c_0_28,plain,
( is_a_theorem(not(not(X1)))
| ~ is_a_theorem(implies(not(X1),X1)) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,plain,
( is_a_theorem(implies(implies(X1,X2),X3))
| ~ is_a_theorem(not(not(X1)))
| ~ is_a_theorem(implies(X2,X3)) ),
inference(spm,[status(thm)],[c_0_5,c_0_27]) ).
cnf(c_0_30,plain,
is_a_theorem(not(not(implies(X1,X1)))),
inference(spm,[status(thm)],[c_0_28,c_0_12]) ).
cnf(c_0_31,plain,
( is_a_theorem(implies(implies(implies(X1,X1),X2),X3))
| ~ is_a_theorem(implies(X2,X3)) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_32,plain,
is_a_theorem(implies(not(X1),implies(X2,implies(X1,X3)))),
inference(spm,[status(thm)],[c_0_9,c_0_16]) ).
cnf(c_0_33,plain,
is_a_theorem(implies(X1,implies(X2,implies(X3,X1)))),
inference(spm,[status(thm)],[c_0_14,c_0_16]) ).
cnf(c_0_34,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(implies(X2,X2),X3))
| ~ is_a_theorem(implies(X3,X1)) ),
inference(spm,[status(thm)],[c_0_5,c_0_31]) ).
cnf(c_0_35,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,implies(X1,X2))) ),
inference(spm,[status(thm)],[c_0_17,c_0_13]) ).
cnf(c_0_36,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,implies(X1,X4))))
| ~ is_a_theorem(implies(X2,implies(X3,implies(X1,X4)))) ),
inference(spm,[status(thm)],[c_0_11,c_0_32]) ).
cnf(c_0_37,plain,
is_a_theorem(implies(X1,implies(X2,implies(X3,implies(X4,X1))))),
inference(spm,[status(thm)],[c_0_14,c_0_33]) ).
cnf(c_0_38,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(implies(X2,X2),X1)) ),
inference(spm,[status(thm)],[c_0_34,c_0_19]) ).
cnf(c_0_39,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X1,X3)))
| ~ is_a_theorem(implies(X2,implies(implies(X1,X2),implies(X1,X3)))) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,plain,
is_a_theorem(implies(X1,implies(X2,implies(X3,implies(X4,implies(X5,X1)))))),
inference(spm,[status(thm)],[c_0_14,c_0_37]) ).
cnf(c_0_41,negated_conjecture,
~ is_a_theorem(implies(implies(a,b),implies(implies(b,c),implies(a,c)))),
prove_cn_1 ).
cnf(c_0_42,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X2,implies(X1,implies(X2,X3)))) ),
inference(spm,[status(thm)],[c_0_38,c_0_36]) ).
cnf(c_0_43,plain,
is_a_theorem(implies(implies(X1,X2),implies(X1,implies(X3,implies(X4,X2))))),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_44,negated_conjecture,
~ is_a_theorem(implies(b,implies(implies(b,c),implies(a,c)))),
inference(spm,[status(thm)],[c_0_41,c_0_36]) ).
cnf(c_0_45,plain,
is_a_theorem(implies(X1,implies(implies(X1,X2),implies(X3,X2)))),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_46,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_45])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : LCL067-1 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n018.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Oct 2 12:11:53 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 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.gUoZFqkAkh/E---3.1_29575.p
% 8.21/1.59 # Version: 3.1pre001
% 8.21/1.59 # Preprocessing class: FSSSSMSSSSSNFFN.
% 8.21/1.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.21/1.59 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 8.21/1.59 # Starting new_bool_3 with 300s (1) cores
% 8.21/1.59 # Starting new_bool_1 with 300s (1) cores
% 8.21/1.59 # Starting sh5l with 300s (1) cores
% 8.21/1.59 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 29653 completed with status 0
% 8.21/1.59 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 8.21/1.59 # Preprocessing class: FSSSSMSSSSSNFFN.
% 8.21/1.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.21/1.59 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 8.21/1.59 # No SInE strategy applied
% 8.21/1.59 # Search class: FHUNS-FFSF21-MFFFFFNN
% 8.21/1.59 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 8.21/1.59 # Starting H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V with 811s (1) cores
% 8.21/1.59 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 8.21/1.59 # Starting H----_011_C07_F1_PI_SE_SP_S0V with 136s (1) cores
% 8.21/1.59 # Starting new_bool_3 with 136s (1) cores
% 8.21/1.59 # Starting new_bool_1 with 136s (1) cores
% 8.21/1.59 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 29659 completed with status 0
% 8.21/1.59 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 8.21/1.59 # Preprocessing class: FSSSSMSSSSSNFFN.
% 8.21/1.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.21/1.59 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 8.21/1.59 # No SInE strategy applied
% 8.21/1.59 # Search class: FHUNS-FFSF21-MFFFFFNN
% 8.21/1.59 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 8.21/1.59 # Starting H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V with 811s (1) cores
% 8.21/1.59 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 8.21/1.59 # Preprocessing time : 0.008 s
% 8.21/1.59
% 8.21/1.59 # Proof found!
% 8.21/1.59 # SZS status Unsatisfiable
% 8.21/1.59 # SZS output start CNFRefutation
% See solution above
% 8.21/1.59 # Parsed axioms : 5
% 8.21/1.59 # Removed by relevancy pruning/SinE : 0
% 8.21/1.59 # Initial clauses : 5
% 8.21/1.59 # Removed in clause preprocessing : 0
% 8.21/1.59 # Initial clauses in saturation : 5
% 8.21/1.59 # Processed clauses : 5014
% 8.21/1.59 # ...of these trivial : 37
% 8.21/1.59 # ...subsumed : 3929
% 8.21/1.59 # ...remaining for further processing : 1048
% 8.21/1.59 # Other redundant clauses eliminated : 0
% 8.21/1.59 # Clauses deleted for lack of memory : 0
% 8.21/1.59 # Backward-subsumed : 17
% 8.21/1.59 # Backward-rewritten : 2
% 8.21/1.59 # Generated clauses : 72472
% 8.21/1.59 # ...of the previous two non-redundant : 65699
% 8.21/1.59 # ...aggressively subsumed : 0
% 8.21/1.59 # Contextual simplify-reflections : 0
% 8.21/1.59 # Paramodulations : 72472
% 8.21/1.59 # Factorizations : 0
% 8.21/1.59 # NegExts : 0
% 8.21/1.59 # Equation resolutions : 0
% 8.21/1.59 # Total rewrite steps : 6415
% 8.21/1.59 # Propositional unsat checks : 0
% 8.21/1.59 # Propositional check models : 0
% 8.21/1.59 # Propositional check unsatisfiable : 0
% 8.21/1.59 # Propositional clauses : 0
% 8.21/1.59 # Propositional clauses after purity: 0
% 8.21/1.59 # Propositional unsat core size : 0
% 8.21/1.59 # Propositional preprocessing time : 0.000
% 8.21/1.59 # Propositional encoding time : 0.000
% 8.21/1.59 # Propositional solver time : 0.000
% 8.21/1.59 # Success case prop preproc time : 0.000
% 8.21/1.59 # Success case prop encoding time : 0.000
% 8.21/1.59 # Success case prop solver time : 0.000
% 8.21/1.59 # Current number of processed clauses : 1029
% 8.21/1.59 # Positive orientable unit clauses : 133
% 8.21/1.59 # Positive unorientable unit clauses: 0
% 8.21/1.59 # Negative unit clauses : 18
% 8.21/1.59 # Non-unit-clauses : 878
% 8.21/1.59 # Current number of unprocessed clauses: 60663
% 8.21/1.59 # ...number of literals in the above : 172448
% 8.21/1.59 # Current number of archived formulas : 0
% 8.21/1.59 # Current number of archived clauses : 19
% 8.21/1.59 # Clause-clause subsumption calls (NU) : 270509
% 8.21/1.59 # Rec. Clause-clause subsumption calls : 224225
% 8.21/1.59 # Non-unit clause-clause subsumptions : 3877
% 8.21/1.59 # Unit Clause-clause subsumption calls : 2722
% 8.21/1.59 # Rewrite failures with RHS unbound : 0
% 8.21/1.59 # BW rewrite match attempts : 12231
% 8.21/1.59 # BW rewrite match successes : 2
% 8.21/1.59 # Condensation attempts : 0
% 8.21/1.59 # Condensation successes : 0
% 8.21/1.59 # Termbank termtop insertions : 1117831
% 8.21/1.59
% 8.21/1.59 # -------------------------------------------------
% 8.21/1.59 # User time : 0.998 s
% 8.21/1.59 # System time : 0.033 s
% 8.21/1.59 # Total time : 1.031 s
% 8.21/1.59 # Maximum resident set size: 1592 pages
% 8.21/1.59
% 8.21/1.59 # -------------------------------------------------
% 8.21/1.59 # User time : 5.124 s
% 8.21/1.59 # System time : 0.132 s
% 8.21/1.59 # Total time : 5.256 s
% 8.21/1.59 # Maximum resident set size: 1672 pages
% 8.21/1.59 % E---3.1 exiting
% 8.21/1.59 % E---3.1 exiting
%------------------------------------------------------------------------------