TSTP Solution File: LCL387-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LCL387-1 : TPTP v8.1.2. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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:12:35 EDT 2023
% Result : Unsatisfiable 15.49s 2.39s
% Output : CNFRefutation 15.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 5
% Syntax : Number of clauses : 65 ( 36 unt; 0 nHn; 19 RR)
% Number of literals : 104 ( 0 equ; 44 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 : 153 ( 42 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.z3dQbo9rLi/E---3.1_27979.p',condensed_detachment) ).
cnf(cn_1,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
file('/export/starexec/sandbox2/tmp/tmp.z3dQbo9rLi/E---3.1_27979.p',cn_1) ).
cnf(cn_2,axiom,
is_a_theorem(implies(implies(not(X1),X1),X1)),
file('/export/starexec/sandbox2/tmp/tmp.z3dQbo9rLi/E---3.1_27979.p',cn_2) ).
cnf(cn_3,axiom,
is_a_theorem(implies(X1,implies(not(X1),X2))),
file('/export/starexec/sandbox2/tmp/tmp.z3dQbo9rLi/E---3.1_27979.p',cn_3) ).
cnf(prove_cn_50,negated_conjecture,
~ is_a_theorem(implies(implies(implies(not(x),y),z),implies(implies(not(y),x),z))),
file('/export/starexec/sandbox2/tmp/tmp.z3dQbo9rLi/E---3.1_27979.p',prove_cn_50) ).
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(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
cn_1 ).
cnf(c_0_7,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
| ~ is_a_theorem(implies(X3,X1)) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X3,X2))
| ~ is_a_theorem(implies(X1,X3)) ),
inference(spm,[status(thm)],[c_0_5,c_0_7]) ).
cnf(c_0_9,axiom,
is_a_theorem(implies(implies(not(X1),X1),X1)),
cn_2 ).
cnf(c_0_10,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X1,implies(X4,X3)))
| ~ is_a_theorem(implies(X2,X4)) ),
inference(spm,[status(thm)],[c_0_8,c_0_7]) ).
cnf(c_0_11,axiom,
is_a_theorem(implies(X1,implies(not(X1),X2))),
cn_3 ).
cnf(c_0_12,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,implies(not(X2),X2))) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X2,not(X1))) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(not(X2),not(X1))) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,plain,
( is_a_theorem(implies(not(X1),X2))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_5,c_0_11]) ).
cnf(c_0_16,plain,
( is_a_theorem(implies(X1,implies(not(X2),X3)))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_8,c_0_11]) ).
cnf(c_0_17,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
( is_a_theorem(implies(not(X1),X2))
| ~ is_a_theorem(implies(X3,X1))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_5,c_0_16]) ).
cnf(c_0_19,plain,
( is_a_theorem(implies(X1,implies(not(X2),X3)))
| ~ is_a_theorem(implies(X1,X4))
| ~ is_a_theorem(implies(X4,X2)) ),
inference(spm,[status(thm)],[c_0_8,c_0_16]) ).
cnf(c_0_20,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X2,X4))
| ~ is_a_theorem(implies(X4,X3)) ),
inference(spm,[status(thm)],[c_0_10,c_0_17]) ).
cnf(c_0_21,plain,
( is_a_theorem(implies(not(implies(X1,X2)),X3))
| ~ is_a_theorem(implies(X4,X2))
| ~ is_a_theorem(implies(X1,X4)) ),
inference(spm,[status(thm)],[c_0_18,c_0_7]) ).
cnf(c_0_22,plain,
( is_a_theorem(implies(X1,implies(not(X2),X3)))
| ~ is_a_theorem(implies(implies(not(X1),X4),X2)) ),
inference(spm,[status(thm)],[c_0_19,c_0_11]) ).
cnf(c_0_23,plain,
is_a_theorem(implies(implies(not(implies(not(X1),X1)),implies(not(X1),X1)),X1)),
inference(spm,[status(thm)],[c_0_12,c_0_9]) ).
cnf(c_0_24,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X4,X3))
| ~ is_a_theorem(X4) ),
inference(spm,[status(thm)],[c_0_20,c_0_17]) ).
cnf(c_0_25,plain,
( is_a_theorem(implies(not(implies(X1,X2)),X3))
| ~ is_a_theorem(implies(X1,implies(not(X2),X2))) ),
inference(spm,[status(thm)],[c_0_21,c_0_9]) ).
cnf(c_0_26,plain,
is_a_theorem(implies(implies(not(X1),X1),implies(not(X1),X2))),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(not(X1),X1)) ),
inference(spm,[status(thm)],[c_0_5,c_0_9]) ).
cnf(c_0_28,plain,
( is_a_theorem(implies(X1,implies(implies(X2,X3),implies(X4,X3))))
| ~ is_a_theorem(implies(X1,implies(X4,X2))) ),
inference(spm,[status(thm)],[c_0_8,c_0_6]) ).
cnf(c_0_29,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(not(X3),X3)) ),
inference(spm,[status(thm)],[c_0_24,c_0_9]) ).
cnf(c_0_30,plain,
is_a_theorem(implies(not(implies(implies(not(X1),X1),X1)),X2)),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
| ~ is_a_theorem(implies(not(implies(implies(X1,X2),implies(X3,X2))),implies(X3,X1))) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,plain,
is_a_theorem(implies(X1,implies(X2,implies(implies(not(X3),X3),X3)))),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,plain,
is_a_theorem(implies(implies(implies(implies(not(X1),X1),X1),X2),implies(X3,X2))),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_34,plain,
( is_a_theorem(implies(implies(X1,X2),implies(not(X3),X4)))
| ~ is_a_theorem(implies(implies(implies(X2,X5),implies(X1,X5)),X3)) ),
inference(spm,[status(thm)],[c_0_19,c_0_6]) ).
cnf(c_0_35,plain,
is_a_theorem(implies(implies(implies(implies(not(X1),X1),X1),X2),X2)),
inference(spm,[status(thm)],[c_0_12,c_0_33]) ).
cnf(c_0_36,plain,
( is_a_theorem(implies(implies(not(X1),X1),implies(not(X2),X3)))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_19,c_0_9]) ).
cnf(c_0_37,plain,
is_a_theorem(implies(implies(X1,implies(not(X2),X2)),implies(not(implies(X1,X2)),X3))),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_38,plain,
is_a_theorem(implies(X1,X1)),
inference(spm,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_39,plain,
( is_a_theorem(implies(implies(not(X1),X1),X2))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_12,c_0_36]) ).
cnf(c_0_40,plain,
is_a_theorem(implies(implies(X1,implies(not(X2),X2)),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_12,c_0_37]) ).
cnf(c_0_41,plain,
is_a_theorem(implies(not(implies(X1,X1)),X2)),
inference(spm,[status(thm)],[c_0_25,c_0_11]) ).
cnf(c_0_42,plain,
is_a_theorem(implies(X1,implies(not(implies(not(X1),X2)),X3))),
inference(spm,[status(thm)],[c_0_22,c_0_38]) ).
cnf(c_0_43,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,implies(not(X3),X3)))
| ~ is_a_theorem(implies(X3,X2)) ),
inference(spm,[status(thm)],[c_0_8,c_0_39]) ).
cnf(c_0_44,plain,
is_a_theorem(implies(implies(not(X1),X2),implies(not(implies(implies(X2,X1),X1)),X3))),
inference(spm,[status(thm)],[c_0_34,c_0_40]) ).
cnf(c_0_45,plain,
is_a_theorem(implies(X1,implies(X2,implies(X3,X3)))),
inference(spm,[status(thm)],[c_0_29,c_0_41]) ).
cnf(c_0_46,plain,
is_a_theorem(implies(not(implies(X1,implies(not(X1),X2))),X3)),
inference(spm,[status(thm)],[c_0_25,c_0_42]) ).
cnf(c_0_47,plain,
( is_a_theorem(implies(implies(not(X1),X2),X3))
| ~ is_a_theorem(implies(implies(implies(X2,X1),X1),X3)) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_48,plain,
is_a_theorem(implies(implies(implies(X1,X1),X2),implies(X3,X2))),
inference(spm,[status(thm)],[c_0_31,c_0_45]) ).
cnf(c_0_49,plain,
is_a_theorem(implies(X1,implies(X2,implies(not(X2),X3)))),
inference(spm,[status(thm)],[c_0_14,c_0_46]) ).
cnf(c_0_50,plain,
is_a_theorem(implies(implies(not(X1),X1),implies(X2,X1))),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_51,plain,
is_a_theorem(implies(implies(implies(not(X1),X2),X3),implies(X1,X3))),
inference(spm,[status(thm)],[c_0_31,c_0_49]) ).
cnf(c_0_52,negated_conjecture,
~ is_a_theorem(implies(implies(implies(not(x),y),z),implies(implies(not(y),x),z))),
prove_cn_50 ).
cnf(c_0_53,plain,
is_a_theorem(implies(implies(not(X1),X2),implies(implies(X2,X1),X1))),
inference(spm,[status(thm)],[c_0_12,c_0_44]) ).
cnf(c_0_54,plain,
is_a_theorem(implies(X1,implies(not(implies(X2,X1)),X3))),
inference(spm,[status(thm)],[c_0_22,c_0_50]) ).
cnf(c_0_55,plain,
is_a_theorem(implies(implies(implies(not(not(X1)),X2),X1),X1)),
inference(spm,[status(thm)],[c_0_12,c_0_51]) ).
cnf(c_0_56,negated_conjecture,
~ is_a_theorem(implies(implies(not(y),x),implies(not(x),y))),
inference(spm,[status(thm)],[c_0_52,c_0_7]) ).
cnf(c_0_57,plain,
( is_a_theorem(implies(implies(not(X1),X2),implies(X3,X1)))
| ~ is_a_theorem(implies(X3,implies(X2,X1))) ),
inference(spm,[status(thm)],[c_0_10,c_0_53]) ).
cnf(c_0_58,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(implies(X3,X1),X2)) ),
inference(spm,[status(thm)],[c_0_43,c_0_54]) ).
cnf(c_0_59,plain,
is_a_theorem(implies(implies(not(X1),not(not(X1))),X1)),
inference(spm,[status(thm)],[c_0_47,c_0_55]) ).
cnf(c_0_60,negated_conjecture,
~ is_a_theorem(implies(not(x),implies(x,y))),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_61,plain,
is_a_theorem(implies(not(not(X1)),X1)),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_62,negated_conjecture,
~ is_a_theorem(implies(x,not(not(x)))),
inference(spm,[status(thm)],[c_0_60,c_0_13]) ).
cnf(c_0_63,plain,
is_a_theorem(implies(X1,not(not(X1)))),
inference(spm,[status(thm)],[c_0_14,c_0_61]) ).
cnf(c_0_64,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_62,c_0_63])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.10 % Problem : LCL387-1 : TPTP v8.1.2. Released v2.3.0.
% 0.10/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n005.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 2400
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Mon Oct 2 12:48:31 EDT 2023
% 0.11/0.31 % CPUTime :
% 0.15/0.42 Running first-order theorem proving
% 0.15/0.42 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.z3dQbo9rLi/E---3.1_27979.p
% 15.49/2.39 # Version: 3.1pre001
% 15.49/2.39 # Preprocessing class: FSSSSMSSSSSNFFN.
% 15.49/2.39 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 15.49/2.39 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 15.49/2.39 # Starting new_bool_3 with 300s (1) cores
% 15.49/2.39 # Starting new_bool_1 with 300s (1) cores
% 15.49/2.39 # Starting sh5l with 300s (1) cores
% 15.49/2.39 # new_bool_1 with pid 28060 completed with status 0
% 15.49/2.39 # Result found by new_bool_1
% 15.49/2.39 # Preprocessing class: FSSSSMSSSSSNFFN.
% 15.49/2.39 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 15.49/2.39 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 15.49/2.39 # Starting new_bool_3 with 300s (1) cores
% 15.49/2.39 # Starting new_bool_1 with 300s (1) cores
% 15.49/2.39 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 15.49/2.39 # Search class: FHUNS-FFSF21-MFFFFFNN
% 15.49/2.39 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 15.49/2.39 # Starting H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V with 181s (1) cores
% 15.49/2.39 # H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V with pid 28064 completed with status 0
% 15.49/2.39 # Result found by H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V
% 15.49/2.39 # Preprocessing class: FSSSSMSSSSSNFFN.
% 15.49/2.39 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 15.49/2.39 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 15.49/2.39 # Starting new_bool_3 with 300s (1) cores
% 15.49/2.39 # Starting new_bool_1 with 300s (1) cores
% 15.49/2.39 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 15.49/2.39 # Search class: FHUNS-FFSF21-MFFFFFNN
% 15.49/2.39 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 15.49/2.39 # Starting H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V with 181s (1) cores
% 15.49/2.39 # Preprocessing time : 0.001 s
% 15.49/2.39 # Presaturation interreduction done
% 15.49/2.39
% 15.49/2.39 # Proof found!
% 15.49/2.39 # SZS status Unsatisfiable
% 15.49/2.39 # SZS output start CNFRefutation
% See solution above
% 15.49/2.39 # Parsed axioms : 5
% 15.49/2.39 # Removed by relevancy pruning/SinE : 0
% 15.49/2.39 # Initial clauses : 5
% 15.49/2.39 # Removed in clause preprocessing : 0
% 15.49/2.39 # Initial clauses in saturation : 5
% 15.49/2.39 # Processed clauses : 20600
% 15.49/2.39 # ...of these trivial : 552
% 15.49/2.39 # ...subsumed : 18349
% 15.49/2.39 # ...remaining for further processing : 1699
% 15.49/2.39 # Other redundant clauses eliminated : 0
% 15.49/2.39 # Clauses deleted for lack of memory : 0
% 15.49/2.39 # Backward-subsumed : 285
% 15.49/2.39 # Backward-rewritten : 45
% 15.49/2.39 # Generated clauses : 154143
% 15.49/2.39 # ...of the previous two non-redundant : 142750
% 15.49/2.39 # ...aggressively subsumed : 0
% 15.49/2.39 # Contextual simplify-reflections : 0
% 15.49/2.39 # Paramodulations : 154143
% 15.49/2.39 # Factorizations : 0
% 15.49/2.39 # NegExts : 0
% 15.49/2.39 # Equation resolutions : 0
% 15.49/2.39 # Total rewrite steps : 12603
% 15.49/2.39 # Propositional unsat checks : 0
% 15.49/2.39 # Propositional check models : 0
% 15.49/2.39 # Propositional check unsatisfiable : 0
% 15.49/2.39 # Propositional clauses : 0
% 15.49/2.39 # Propositional clauses after purity: 0
% 15.49/2.39 # Propositional unsat core size : 0
% 15.49/2.39 # Propositional preprocessing time : 0.000
% 15.49/2.39 # Propositional encoding time : 0.000
% 15.49/2.39 # Propositional solver time : 0.000
% 15.49/2.39 # Success case prop preproc time : 0.000
% 15.49/2.39 # Success case prop encoding time : 0.000
% 15.49/2.39 # Success case prop solver time : 0.000
% 15.49/2.39 # Current number of processed clauses : 1364
% 15.49/2.39 # Positive orientable unit clauses : 274
% 15.49/2.39 # Positive unorientable unit clauses: 0
% 15.49/2.39 # Negative unit clauses : 106
% 15.49/2.39 # Non-unit-clauses : 984
% 15.49/2.39 # Current number of unprocessed clauses: 122044
% 15.49/2.39 # ...number of literals in the above : 371734
% 15.49/2.39 # Current number of archived formulas : 0
% 15.49/2.39 # Current number of archived clauses : 335
% 15.49/2.39 # Clause-clause subsumption calls (NU) : 418377
% 15.49/2.39 # Rec. Clause-clause subsumption calls : 364682
% 15.49/2.39 # Non-unit clause-clause subsumptions : 15102
% 15.49/2.39 # Unit Clause-clause subsumption calls : 10436
% 15.49/2.39 # Rewrite failures with RHS unbound : 0
% 15.49/2.39 # BW rewrite match attempts : 42788
% 15.49/2.39 # BW rewrite match successes : 26
% 15.49/2.39 # Condensation attempts : 0
% 15.49/2.39 # Condensation successes : 0
% 15.49/2.39 # Termbank termtop insertions : 2392676
% 15.49/2.39
% 15.49/2.39 # -------------------------------------------------
% 15.49/2.39 # User time : 1.854 s
% 15.49/2.39 # System time : 0.065 s
% 15.49/2.39 # Total time : 1.919 s
% 15.49/2.39 # Maximum resident set size: 1648 pages
% 15.49/2.39
% 15.49/2.39 # -------------------------------------------------
% 15.49/2.39 # User time : 1.854 s
% 15.49/2.39 # System time : 0.068 s
% 15.49/2.39 # Total time : 1.921 s
% 15.49/2.39 # Maximum resident set size: 1676 pages
% 15.49/2.39 % E---3.1 exiting
% 15.68/2.40 % E---3.1 exiting
%------------------------------------------------------------------------------