TSTP Solution File: LCL056-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : LCL056-1 : TPTP v8.2.0. Released v1.0.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 : 300s
% WCLimit : 300s
% DateTime : Mon May 20 23:55:16 EDT 2024
% Result : Unsatisfiable 11.03s 1.86s
% Output : CNFRefutation 11.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 5
% Syntax : Number of clauses : 65 ( 31 unt; 0 nHn; 21 RR)
% Number of literals : 109 ( 0 equ; 47 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 159 ( 37 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.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/benchmark/theBenchmark.p',cn_1) ).
cnf(cn_3,axiom,
is_a_theorem(implies(X1,implies(not(X1),X2))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_3) ).
cnf(cn_2,axiom,
is_a_theorem(implies(implies(not(X1),X1),X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_2) ).
cnf(prove_cn_39,negated_conjecture,
~ is_a_theorem(implies(not(not(a)),a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_39) ).
cnf(c_0_5,plain,
( is_a_theorem(X2)
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1) ),
inference(fof_simplification,[status(thm)],[condensed_detachment]) ).
cnf(c_0_6,plain,
( is_a_theorem(X2)
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1) ),
c_0_5 ).
cnf(c_0_7,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
cn_1 ).
cnf(c_0_8,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
| ~ is_a_theorem(implies(X3,X1)) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,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_6,c_0_8]) ).
cnf(c_0_10,axiom,
is_a_theorem(implies(X1,implies(not(X1),X2))),
cn_3 ).
cnf(c_0_11,plain,
( is_a_theorem(implies(X1,implies(not(X2),X3)))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,axiom,
is_a_theorem(implies(implies(not(X1),X1),X1)),
cn_2 ).
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_6,c_0_11]) ).
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_9,c_0_11]) ).
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_9,c_0_12]) ).
cnf(c_0_16,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_9,c_0_8]) ).
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_8]) ).
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_10]) ).
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_12]) ).
cnf(c_0_20,plain,
is_a_theorem(implies(X1,X1)),
inference(spm,[status(thm)],[c_0_15,c_0_10]) ).
cnf(c_0_21,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_8]) ).
cnf(c_0_22,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X2,not(X1))) ),
inference(spm,[status(thm)],[c_0_16,c_0_10]) ).
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_12]) ).
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,implies(not(implies(not(X1),X2)),X3))),
inference(spm,[status(thm)],[c_0_18,c_0_20]) ).
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_9,c_0_21]) ).
cnf(c_0_27,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(not(X2),not(X1))) ),
inference(spm,[status(thm)],[c_0_15,c_0_22]) ).
cnf(c_0_28,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_29,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(not(X1),X1)) ),
inference(spm,[status(thm)],[c_0_6,c_0_12]) ).
cnf(c_0_30,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_9,c_0_7]) ).
cnf(c_0_31,plain,
is_a_theorem(implies(not(implies(X1,implies(not(X1),X2))),X3)),
inference(spm,[status(thm)],[c_0_23,c_0_25]) ).
cnf(c_0_32,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_7]) ).
cnf(c_0_33,plain,
is_a_theorem(implies(X1,implies(implies(not(X2),X2),X2))),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_34,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_29,c_0_30]) ).
cnf(c_0_35,plain,
is_a_theorem(implies(X1,implies(X2,implies(not(X2),X3)))),
inference(spm,[status(thm)],[c_0_27,c_0_31]) ).
cnf(c_0_36,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_7]) ).
cnf(c_0_37,plain,
is_a_theorem(implies(implies(X1,implies(not(X2),X2)),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,plain,
is_a_theorem(implies(implies(implies(not(X1),X2),X3),implies(X1,X3))),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,plain,
is_a_theorem(implies(implies(not(X1),X2),implies(not(implies(implies(X2,X1),X1)),X3))),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_40,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(implies(not(X1),X3),X2)) ),
inference(spm,[status(thm)],[c_0_6,c_0_38]) ).
cnf(c_0_41,plain,
is_a_theorem(implies(implies(not(X1),X2),implies(implies(X2,X1),X1))),
inference(spm,[status(thm)],[c_0_15,c_0_39]) ).
cnf(c_0_42,plain,
( is_a_theorem(implies(not(implies(implies(X1,X2),implies(X3,X2))),X4))
| ~ is_a_theorem(implies(X3,X1)) ),
inference(spm,[status(thm)],[c_0_13,c_0_7]) ).
cnf(c_0_43,plain,
is_a_theorem(implies(X1,implies(implies(X2,X1),X1))),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_44,plain,
( is_a_theorem(implies(X1,implies(implies(X2,X3),implies(X4,X3))))
| ~ is_a_theorem(implies(X4,X2)) ),
inference(spm,[status(thm)],[c_0_27,c_0_42]) ).
cnf(c_0_45,plain,
( is_a_theorem(implies(X1,implies(X2,X1)))
| ~ is_a_theorem(implies(X2,implies(X3,X1))) ),
inference(spm,[status(thm)],[c_0_16,c_0_43]) ).
cnf(c_0_46,plain,
( is_a_theorem(implies(X1,implies(X2,implies(X3,X4))))
| ~ is_a_theorem(implies(X2,implies(X5,X4)))
| ~ is_a_theorem(implies(X3,X5)) ),
inference(spm,[status(thm)],[c_0_16,c_0_44]) ).
cnf(c_0_47,plain,
is_a_theorem(implies(X1,implies(X2,X1))),
inference(spm,[status(thm)],[c_0_45,c_0_10]) ).
cnf(c_0_48,plain,
( is_a_theorem(implies(not(implies(X1,X2)),X3))
| ~ is_a_theorem(implies(not(X2),not(X1))) ),
inference(spm,[status(thm)],[c_0_23,c_0_22]) ).
cnf(c_0_49,plain,
( is_a_theorem(implies(X1,implies(X2,implies(X3,X2))))
| ~ is_a_theorem(implies(X3,X4)) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_50,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(not(X3),not(X2))) ),
inference(spm,[status(thm)],[c_0_27,c_0_48]) ).
cnf(c_0_51,plain,
is_a_theorem(implies(X1,implies(X2,implies(X3,X2)))),
inference(spm,[status(thm)],[c_0_49,c_0_10]) ).
cnf(c_0_52,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
| ~ is_a_theorem(implies(not(X1),not(X3))) ),
inference(spm,[status(thm)],[c_0_34,c_0_50]) ).
cnf(c_0_53,plain,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X2,X3))),
inference(spm,[status(thm)],[c_0_34,c_0_51]) ).
cnf(c_0_54,plain,
is_a_theorem(implies(implies(X1,not(not(implies(X1,X2)))),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_32,c_0_10]) ).
cnf(c_0_55,plain,
( is_a_theorem(implies(implies(X1,X2),X2))
| ~ is_a_theorem(implies(not(X1),not(not(X2)))) ),
inference(spm,[status(thm)],[c_0_15,c_0_52]) ).
cnf(c_0_56,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(implies(X3,X1),X2)) ),
inference(spm,[status(thm)],[c_0_6,c_0_53]) ).
cnf(c_0_57,plain,
is_a_theorem(implies(implies(not(X1),not(not(implies(not(X1),X1)))),X1)),
inference(spm,[status(thm)],[c_0_15,c_0_54]) ).
cnf(c_0_58,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(not(not(X1)),not(not(X2)))) ),
inference(spm,[status(thm)],[c_0_40,c_0_55]) ).
cnf(c_0_59,plain,
is_a_theorem(implies(not(not(implies(not(X1),X1))),X1)),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_60,negated_conjecture,
~ is_a_theorem(implies(not(not(a)),a)),
inference(fof_simplification,[status(thm)],[prove_cn_39]) ).
cnf(c_0_61,plain,
is_a_theorem(implies(implies(not(not(not(X1))),not(not(X1))),X1)),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_62,negated_conjecture,
~ is_a_theorem(implies(not(not(a)),a)),
c_0_60 ).
cnf(c_0_63,plain,
is_a_theorem(implies(not(not(X1)),X1)),
inference(spm,[status(thm)],[c_0_40,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.06/0.12 % Problem : LCL056-1 : TPTP v8.2.0. Released v1.0.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n004.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 20 00:36:23 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order model finding
% 0.19/0.47 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/benchmark/theBenchmark.p
% 11.03/1.86 # Version: 3.1.0
% 11.03/1.86 # Preprocessing class: FSSSSMSSSSSNFFN.
% 11.03/1.86 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.03/1.86 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 11.03/1.86 # Starting new_bool_3 with 300s (1) cores
% 11.03/1.86 # Starting new_bool_1 with 300s (1) cores
% 11.03/1.86 # Starting sh5l with 300s (1) cores
% 11.03/1.86 # new_bool_3 with pid 18760 completed with status 0
% 11.03/1.86 # Result found by new_bool_3
% 11.03/1.86 # Preprocessing class: FSSSSMSSSSSNFFN.
% 11.03/1.86 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.03/1.86 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 11.03/1.86 # Starting new_bool_3 with 300s (1) cores
% 11.03/1.86 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 11.03/1.86 # Search class: FHUNS-FFSF21-MFFFFFNN
% 11.03/1.86 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 11.03/1.86 # Starting H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V with 181s (1) cores
% 11.03/1.86 # H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V with pid 18765 completed with status 0
% 11.03/1.86 # Result found by H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V
% 11.03/1.86 # Preprocessing class: FSSSSMSSSSSNFFN.
% 11.03/1.86 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.03/1.86 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 11.03/1.86 # Starting new_bool_3 with 300s (1) cores
% 11.03/1.86 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 11.03/1.86 # Search class: FHUNS-FFSF21-MFFFFFNN
% 11.03/1.86 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 11.03/1.86 # Starting H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V with 181s (1) cores
% 11.03/1.86 # Preprocessing time : 0.001 s
% 11.03/1.86 # Presaturation interreduction done
% 11.03/1.86
% 11.03/1.86 # Proof found!
% 11.03/1.86 # SZS status Unsatisfiable
% 11.03/1.86 # SZS output start CNFRefutation
% See solution above
% 11.03/1.86 # Parsed axioms : 5
% 11.03/1.86 # Removed by relevancy pruning/SinE : 0
% 11.03/1.86 # Initial clauses : 5
% 11.03/1.86 # Removed in clause preprocessing : 0
% 11.03/1.86 # Initial clauses in saturation : 5
% 11.03/1.86 # Processed clauses : 15628
% 11.03/1.86 # ...of these trivial : 639
% 11.03/1.86 # ...subsumed : 13639
% 11.03/1.86 # ...remaining for further processing : 1350
% 11.03/1.86 # Other redundant clauses eliminated : 0
% 11.03/1.86 # Clauses deleted for lack of memory : 0
% 11.03/1.86 # Backward-subsumed : 25
% 11.03/1.86 # Backward-rewritten : 31
% 11.03/1.86 # Generated clauses : 166322
% 11.03/1.86 # ...of the previous two non-redundant : 152756
% 11.03/1.86 # ...aggressively subsumed : 0
% 11.03/1.86 # Contextual simplify-reflections : 0
% 11.03/1.86 # Paramodulations : 166322
% 11.03/1.86 # Factorizations : 0
% 11.03/1.86 # NegExts : 0
% 11.03/1.86 # Equation resolutions : 0
% 11.03/1.86 # Disequality decompositions : 0
% 11.03/1.86 # Total rewrite steps : 15230
% 11.03/1.86 # ...of those cached : 12693
% 11.03/1.86 # Propositional unsat checks : 0
% 11.03/1.86 # Propositional check models : 0
% 11.03/1.86 # Propositional check unsatisfiable : 0
% 11.03/1.86 # Propositional clauses : 0
% 11.03/1.86 # Propositional clauses after purity: 0
% 11.03/1.86 # Propositional unsat core size : 0
% 11.03/1.86 # Propositional preprocessing time : 0.000
% 11.03/1.86 # Propositional encoding time : 0.000
% 11.03/1.86 # Propositional solver time : 0.000
% 11.03/1.86 # Success case prop preproc time : 0.000
% 11.03/1.86 # Success case prop encoding time : 0.000
% 11.03/1.86 # Success case prop solver time : 0.000
% 11.03/1.86 # Current number of processed clauses : 1289
% 11.03/1.86 # Positive orientable unit clauses : 288
% 11.03/1.86 # Positive unorientable unit clauses: 0
% 11.03/1.86 # Negative unit clauses : 5
% 11.03/1.86 # Non-unit-clauses : 996
% 11.03/1.86 # Current number of unprocessed clauses: 136804
% 11.03/1.86 # ...number of literals in the above : 396512
% 11.03/1.86 # Current number of archived formulas : 0
% 11.03/1.86 # Current number of archived clauses : 61
% 11.03/1.86 # Clause-clause subsumption calls (NU) : 336985
% 11.03/1.86 # Rec. Clause-clause subsumption calls : 314465
% 11.03/1.86 # Non-unit clause-clause subsumptions : 13658
% 11.03/1.86 # Unit Clause-clause subsumption calls : 9474
% 11.03/1.86 # Rewrite failures with RHS unbound : 0
% 11.03/1.86 # BW rewrite match attempts : 47012
% 11.03/1.86 # BW rewrite match successes : 33
% 11.03/1.86 # Condensation attempts : 0
% 11.03/1.86 # Condensation successes : 0
% 11.03/1.86 # Termbank termtop insertions : 2620227
% 11.03/1.86 # Search garbage collected termcells : 8
% 11.03/1.86
% 11.03/1.86 # -------------------------------------------------
% 11.03/1.86 # User time : 1.280 s
% 11.03/1.86 # System time : 0.065 s
% 11.03/1.86 # Total time : 1.345 s
% 11.03/1.86 # Maximum resident set size: 1628 pages
% 11.03/1.86
% 11.03/1.86 # -------------------------------------------------
% 11.03/1.86 # User time : 1.280 s
% 11.03/1.86 # System time : 0.068 s
% 11.03/1.86 # Total time : 1.348 s
% 11.03/1.86 # Maximum resident set size: 1692 pages
% 11.03/1.86 % E---3.1 exiting
%------------------------------------------------------------------------------