TSTP Solution File: LCL390-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LCL390-1 : TPTP v8.1.2. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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:24:45 EDT 2023
% Result : Unsatisfiable 12.99s 2.22s
% Output : CNFRefutation 12.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 5
% Syntax : Number of clauses : 66 ( 33 unt; 0 nHn; 23 RR)
% Number of literals : 110 ( 0 equ; 49 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 : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 155 ( 39 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.ML0pZvem3B/E---3.1_3005.p',condensed_detachment) ).
cnf(cn_1,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
file('/export/starexec/sandbox/tmp/tmp.ML0pZvem3B/E---3.1_3005.p',cn_1) ).
cnf(cn_3,axiom,
is_a_theorem(implies(X1,implies(not(X1),X2))),
file('/export/starexec/sandbox/tmp/tmp.ML0pZvem3B/E---3.1_3005.p',cn_3) ).
cnf(cn_2,axiom,
is_a_theorem(implies(implies(not(X1),X1),X1)),
file('/export/starexec/sandbox/tmp/tmp.ML0pZvem3B/E---3.1_3005.p',cn_2) ).
cnf(prove_cn_53,negated_conjecture,
~ is_a_theorem(implies(implies(not(x),y),implies(implies(x,y),y))),
file('/export/starexec/sandbox/tmp/tmp.ML0pZvem3B/E---3.1_3005.p',prove_cn_53) ).
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(X1,implies(not(X1),X2))),
cn_3 ).
cnf(c_0_10,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_9]) ).
cnf(c_0_11,axiom,
is_a_theorem(implies(implies(not(X1),X1),X1)),
cn_2 ).
cnf(c_0_12,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_13,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_10]) ).
cnf(c_0_14,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_10]) ).
cnf(c_0_15,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_11]) ).
cnf(c_0_16,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X2,not(X1))) ),
inference(spm,[status(thm)],[c_0_12,c_0_9]) ).
cnf(c_0_17,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_13,c_0_7]) ).
cnf(c_0_18,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_14,c_0_9]) ).
cnf(c_0_19,plain,
is_a_theorem(implies(implies(not(implies(not(X1),X1)),implies(not(X1),X1)),X1)),
inference(spm,[status(thm)],[c_0_15,c_0_11]) ).
cnf(c_0_20,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(not(X2),not(X1))) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
( is_a_theorem(implies(not(X1),X2))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_5,c_0_9]) ).
cnf(c_0_22,plain,
( is_a_theorem(implies(implies(X1,X2),X2))
| ~ is_a_theorem(implies(not(X2),X1)) ),
inference(spm,[status(thm)],[c_0_15,c_0_7]) ).
cnf(c_0_23,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_17,c_0_11]) ).
cnf(c_0_24,plain,
is_a_theorem(implies(implies(not(X1),X1),implies(not(X1),X2))),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,implies(X3,X2)))
| ~ is_a_theorem(implies(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_8,c_0_22]) ).
cnf(c_0_27,plain,
is_a_theorem(implies(not(implies(implies(not(X1),X1),X1)),X2)),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,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_12,c_0_25]) ).
cnf(c_0_29,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_14,c_0_11]) ).
cnf(c_0_30,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X1,X3)))
| ~ is_a_theorem(implies(not(implies(X1,X3)),implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_26,c_0_6]) ).
cnf(c_0_31,plain,
is_a_theorem(implies(X1,implies(implies(not(X2),X2),X2))),
inference(spm,[status(thm)],[c_0_20,c_0_27]) ).
cnf(c_0_32,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_28,c_0_25]) ).
cnf(c_0_33,plain,
is_a_theorem(implies(X1,X1)),
inference(spm,[status(thm)],[c_0_15,c_0_9]) ).
cnf(c_0_34,plain,
( is_a_theorem(implies(implies(not(X1),X1),X2))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_15,c_0_29]) ).
cnf(c_0_35,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_14,c_0_6]) ).
cnf(c_0_36,plain,
is_a_theorem(implies(implies(X1,implies(not(X2),X2)),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_37,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(not(X1),X1)) ),
inference(spm,[status(thm)],[c_0_5,c_0_11]) ).
cnf(c_0_38,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_39,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(not(X3),X3)) ),
inference(spm,[status(thm)],[c_0_32,c_0_11]) ).
cnf(c_0_40,plain,
is_a_theorem(implies(not(implies(X1,X1)),X2)),
inference(spm,[status(thm)],[c_0_23,c_0_9]) ).
cnf(c_0_41,plain,
is_a_theorem(implies(X1,implies(not(implies(not(X1),X2)),X3))),
inference(spm,[status(thm)],[c_0_18,c_0_33]) ).
cnf(c_0_42,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_34]) ).
cnf(c_0_43,plain,
is_a_theorem(implies(implies(not(X1),X2),implies(not(implies(implies(X2,X1),X1)),X3))),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_44,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_37,c_0_38]) ).
cnf(c_0_45,plain,
is_a_theorem(implies(X1,implies(X2,implies(X3,X3)))),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_46,plain,
is_a_theorem(implies(not(implies(X1,implies(not(X1),X2))),X3)),
inference(spm,[status(thm)],[c_0_23,c_0_41]) ).
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_42,c_0_43]) ).
cnf(c_0_48,plain,
is_a_theorem(implies(implies(implies(X1,X1),X2),implies(X3,X2))),
inference(spm,[status(thm)],[c_0_44,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_20,c_0_46]) ).
cnf(c_0_50,plain,
is_a_theorem(implies(implies(not(X1),X2),implies(implies(X2,X1),X1))),
inference(spm,[status(thm)],[c_0_15,c_0_43]) ).
cnf(c_0_51,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_52,plain,
is_a_theorem(implies(implies(implies(not(X1),X2),X3),implies(X1,X3))),
inference(spm,[status(thm)],[c_0_44,c_0_49]) ).
cnf(c_0_53,negated_conjecture,
~ is_a_theorem(implies(implies(not(x),y),implies(implies(x,y),y))),
prove_cn_53 ).
cnf(c_0_54,plain,
( is_a_theorem(implies(X1,implies(implies(X2,X3),X3)))
| ~ is_a_theorem(implies(X1,implies(not(X3),X2))) ),
inference(spm,[status(thm)],[c_0_8,c_0_50]) ).
cnf(c_0_55,plain,
is_a_theorem(implies(X1,implies(not(implies(X2,X1)),X3))),
inference(spm,[status(thm)],[c_0_18,c_0_51]) ).
cnf(c_0_56,plain,
is_a_theorem(implies(implies(implies(not(not(X1)),X2),X1),X1)),
inference(spm,[status(thm)],[c_0_15,c_0_52]) ).
cnf(c_0_57,negated_conjecture,
~ is_a_theorem(implies(implies(not(x),y),implies(not(y),x))),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_58,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_12,c_0_50]) ).
cnf(c_0_59,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(implies(X3,X1),X2)) ),
inference(spm,[status(thm)],[c_0_42,c_0_55]) ).
cnf(c_0_60,plain,
is_a_theorem(implies(implies(not(X1),not(not(X1))),X1)),
inference(spm,[status(thm)],[c_0_47,c_0_56]) ).
cnf(c_0_61,negated_conjecture,
~ is_a_theorem(implies(not(y),implies(y,x))),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_62,plain,
is_a_theorem(implies(not(not(X1)),X1)),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_63,negated_conjecture,
~ is_a_theorem(implies(y,not(not(y)))),
inference(spm,[status(thm)],[c_0_61,c_0_16]) ).
cnf(c_0_64,plain,
is_a_theorem(implies(X1,not(not(X1)))),
inference(spm,[status(thm)],[c_0_20,c_0_62]) ).
cnf(c_0_65,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_63,c_0_64])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : LCL390-1 : TPTP v8.1.2. Released v2.3.0.
% 0.10/0.11 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n004.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Oct 2 12:36:30 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running first-order model finding
% 0.17/0.44 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.ML0pZvem3B/E---3.1_3005.p
% 12.99/2.22 # Version: 3.1pre001
% 12.99/2.22 # Preprocessing class: FSSSSMSSSSSNFFN.
% 12.99/2.22 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 12.99/2.22 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 12.99/2.22 # Starting new_bool_3 with 300s (1) cores
% 12.99/2.22 # Starting new_bool_1 with 300s (1) cores
% 12.99/2.22 # Starting sh5l with 300s (1) cores
% 12.99/2.22 # new_bool_3 with pid 3084 completed with status 0
% 12.99/2.22 # Result found by new_bool_3
% 12.99/2.22 # Preprocessing class: FSSSSMSSSSSNFFN.
% 12.99/2.22 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 12.99/2.22 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 12.99/2.22 # Starting new_bool_3 with 300s (1) cores
% 12.99/2.22 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 12.99/2.22 # Search class: FHUNS-FFSF21-MFFFFFNN
% 12.99/2.22 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 12.99/2.22 # Starting H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V with 181s (1) cores
% 12.99/2.22 # H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V with pid 3088 completed with status 0
% 12.99/2.22 # Result found by H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V
% 12.99/2.22 # Preprocessing class: FSSSSMSSSSSNFFN.
% 12.99/2.22 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 12.99/2.22 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 12.99/2.22 # Starting new_bool_3 with 300s (1) cores
% 12.99/2.22 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 12.99/2.22 # Search class: FHUNS-FFSF21-MFFFFFNN
% 12.99/2.22 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 12.99/2.22 # Starting H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V with 181s (1) cores
% 12.99/2.22 # Preprocessing time : 0.001 s
% 12.99/2.22 # Presaturation interreduction done
% 12.99/2.22
% 12.99/2.22 # Proof found!
% 12.99/2.22 # SZS status Unsatisfiable
% 12.99/2.22 # SZS output start CNFRefutation
% See solution above
% 12.99/2.22 # Parsed axioms : 5
% 12.99/2.22 # Removed by relevancy pruning/SinE : 0
% 12.99/2.22 # Initial clauses : 5
% 12.99/2.22 # Removed in clause preprocessing : 0
% 12.99/2.22 # Initial clauses in saturation : 5
% 12.99/2.22 # Processed clauses : 16793
% 12.99/2.22 # ...of these trivial : 514
% 12.99/2.22 # ...subsumed : 14860
% 12.99/2.22 # ...remaining for further processing : 1419
% 12.99/2.22 # Other redundant clauses eliminated : 0
% 12.99/2.22 # Clauses deleted for lack of memory : 0
% 12.99/2.22 # Backward-subsumed : 125
% 12.99/2.22 # Backward-rewritten : 33
% 12.99/2.22 # Generated clauses : 137638
% 12.99/2.22 # ...of the previous two non-redundant : 127144
% 12.99/2.22 # ...aggressively subsumed : 0
% 12.99/2.22 # Contextual simplify-reflections : 6
% 12.99/2.22 # Paramodulations : 137638
% 12.99/2.22 # Factorizations : 0
% 12.99/2.22 # NegExts : 0
% 12.99/2.22 # Equation resolutions : 0
% 12.99/2.22 # Total rewrite steps : 11968
% 12.99/2.22 # Propositional unsat checks : 0
% 12.99/2.22 # Propositional check models : 0
% 12.99/2.22 # Propositional check unsatisfiable : 0
% 12.99/2.22 # Propositional clauses : 0
% 12.99/2.22 # Propositional clauses after purity: 0
% 12.99/2.22 # Propositional unsat core size : 0
% 12.99/2.22 # Propositional preprocessing time : 0.000
% 12.99/2.22 # Propositional encoding time : 0.000
% 12.99/2.22 # Propositional solver time : 0.000
% 12.99/2.22 # Success case prop preproc time : 0.000
% 12.99/2.22 # Success case prop encoding time : 0.000
% 12.99/2.22 # Success case prop solver time : 0.000
% 12.99/2.22 # Current number of processed clauses : 1256
% 12.99/2.22 # Positive orientable unit clauses : 248
% 12.99/2.22 # Positive unorientable unit clauses: 0
% 12.99/2.22 # Negative unit clauses : 71
% 12.99/2.22 # Non-unit-clauses : 937
% 12.99/2.22 # Current number of unprocessed clauses: 110332
% 12.99/2.22 # ...number of literals in the above : 332231
% 12.99/2.22 # Current number of archived formulas : 0
% 12.99/2.22 # Current number of archived clauses : 163
% 12.99/2.22 # Clause-clause subsumption calls (NU) : 313175
% 12.99/2.22 # Rec. Clause-clause subsumption calls : 289469
% 12.99/2.22 # Non-unit clause-clause subsumptions : 13236
% 12.99/2.22 # Unit Clause-clause subsumption calls : 8490
% 12.99/2.22 # Rewrite failures with RHS unbound : 0
% 12.99/2.22 # BW rewrite match attempts : 36904
% 12.99/2.22 # BW rewrite match successes : 23
% 12.99/2.22 # Condensation attempts : 0
% 12.99/2.22 # Condensation successes : 0
% 12.99/2.22 # Termbank termtop insertions : 2106128
% 12.99/2.22
% 12.99/2.22 # -------------------------------------------------
% 12.99/2.22 # User time : 1.676 s
% 12.99/2.22 # System time : 0.057 s
% 12.99/2.22 # Total time : 1.733 s
% 12.99/2.22 # Maximum resident set size: 1644 pages
% 12.99/2.22
% 12.99/2.22 # -------------------------------------------------
% 12.99/2.22 # User time : 1.677 s
% 12.99/2.22 # System time : 0.058 s
% 12.99/2.22 # Total time : 1.735 s
% 12.99/2.22 # Maximum resident set size: 1672 pages
% 12.99/2.22 % E---3.1 exiting
%------------------------------------------------------------------------------