TSTP Solution File: LCL116-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LCL116-1 : TPTP v8.1.2. 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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:23:48 EDT 2023
% Result : Unsatisfiable 422.64s 54.43s
% Output : CNFRefutation 422.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 6
% Syntax : Number of clauses : 52 ( 32 unt; 0 nHn; 15 RR)
% Number of literals : 76 ( 0 equ; 26 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 : 120 ( 13 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.ykZBJJSb8i/E---3.1_445.p',condensed_detachment) ).
cnf(mv_2,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
file('/export/starexec/sandbox2/tmp/tmp.ykZBJJSb8i/E---3.1_445.p',mv_2) ).
cnf(mv_1,axiom,
is_a_theorem(implies(X1,implies(X2,X1))),
file('/export/starexec/sandbox2/tmp/tmp.ykZBJJSb8i/E---3.1_445.p',mv_1) ).
cnf(mv_3,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X2),implies(implies(X2,X1),X1))),
file('/export/starexec/sandbox2/tmp/tmp.ykZBJJSb8i/E---3.1_445.p',mv_3) ).
cnf(mv_5,axiom,
is_a_theorem(implies(implies(not(X1),not(X2)),implies(X2,X1))),
file('/export/starexec/sandbox2/tmp/tmp.ykZBJJSb8i/E---3.1_445.p',mv_5) ).
cnf(prove_mv_50,negated_conjecture,
~ is_a_theorem(implies(not(a),implies(b,not(implies(b,a))))),
file('/export/starexec/sandbox2/tmp/tmp.ykZBJJSb8i/E---3.1_445.p',prove_mv_50) ).
cnf(c_0_6,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1) ),
condensed_detachment ).
cnf(c_0_7,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
mv_2 ).
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,axiom,
is_a_theorem(implies(X1,implies(X2,X1))),
mv_1 ).
cnf(c_0_10,plain,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X2,X3))),
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_6,c_0_10]) ).
cnf(c_0_12,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X2),implies(implies(X2,X1),X1))),
mv_3 ).
cnf(c_0_13,plain,
is_a_theorem(implies(X1,implies(implies(X1,X2),X2))),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,plain,
is_a_theorem(implies(implies(implies(implies(X1,X2),X2),X3),implies(X1,X3))),
inference(spm,[status(thm)],[c_0_8,c_0_13]) ).
cnf(c_0_15,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(implies(implies(X1,X3),X3),X2)) ),
inference(spm,[status(thm)],[c_0_6,c_0_14]) ).
cnf(c_0_16,axiom,
is_a_theorem(implies(implies(not(X1),not(X2)),implies(X2,X1))),
mv_5 ).
cnf(c_0_17,plain,
( is_a_theorem(implies(implies(X1,X2),X2))
| ~ is_a_theorem(implies(implies(X2,X1),X1)) ),
inference(spm,[status(thm)],[c_0_6,c_0_12]) ).
cnf(c_0_18,plain,
is_a_theorem(implies(X1,implies(X2,X2))),
inference(spm,[status(thm)],[c_0_15,c_0_10]) ).
cnf(c_0_19,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_6,c_0_9]) ).
cnf(c_0_20,plain,
is_a_theorem(implies(not(X1),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_11,c_0_16]) ).
cnf(c_0_21,plain,
is_a_theorem(implies(implies(implies(X1,X1),X2),X2)),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(implies(not(X2),not(X1)),X3))),
inference(spm,[status(thm)],[c_0_8,c_0_16]) ).
cnf(c_0_23,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_19]) ).
cnf(c_0_24,plain,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(not(X1),X3))),
inference(spm,[status(thm)],[c_0_8,c_0_20]) ).
cnf(c_0_25,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(implies(X2,X2),X1)) ),
inference(spm,[status(thm)],[c_0_6,c_0_21]) ).
cnf(c_0_26,plain,
is_a_theorem(implies(X1,implies(implies(not(X2),not(X1)),X2))),
inference(spm,[status(thm)],[c_0_15,c_0_22]) ).
cnf(c_0_27,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X3,X2))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_6,c_0_23]) ).
cnf(c_0_28,plain,
( is_a_theorem(implies(not(X1),X2))
| ~ is_a_theorem(implies(implies(X1,X3),X2)) ),
inference(spm,[status(thm)],[c_0_6,c_0_24]) ).
cnf(c_0_29,plain,
is_a_theorem(implies(implies(not(X1),not(implies(X2,X2))),X1)),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,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_16]) ).
cnf(c_0_31,plain,
is_a_theorem(implies(not(not(X1)),X1)),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,plain,
( is_a_theorem(implies(implies(X1,X2),X2))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_19]) ).
cnf(c_0_33,plain,
is_a_theorem(implies(implies(implies(implies(X1,X2),implies(X3,X2)),X4),implies(implies(X3,X1),X4))),
inference(spm,[status(thm)],[c_0_8,c_0_7]) ).
cnf(c_0_34,plain,
is_a_theorem(implies(X1,implies(X2,not(not(X2))))),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,plain,
( is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X1),X2)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_8,c_0_32]) ).
cnf(c_0_36,plain,
( is_a_theorem(implies(implies(X1,X2),X3))
| ~ is_a_theorem(implies(implies(implies(X2,X4),implies(X1,X4)),X3)) ),
inference(spm,[status(thm)],[c_0_6,c_0_33]) ).
cnf(c_0_37,plain,
is_a_theorem(implies(implies(X1,X2),implies(not(not(X1)),X2))),
inference(spm,[status(thm)],[c_0_8,c_0_31]) ).
cnf(c_0_38,plain,
is_a_theorem(implies(implies(implies(X1,not(not(X1))),X2),X2)),
inference(spm,[status(thm)],[c_0_17,c_0_34]) ).
cnf(c_0_39,plain,
( is_a_theorem(implies(implies(X1,X2),X3))
| ~ is_a_theorem(implies(X2,X3))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_6,c_0_35]) ).
cnf(c_0_40,plain,
is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(X2,implies(X1,X3)))),
inference(spm,[status(thm)],[c_0_36,c_0_14]) ).
cnf(c_0_41,plain,
( is_a_theorem(implies(not(not(X1)),X2))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_6,c_0_37]) ).
cnf(c_0_42,plain,
is_a_theorem(implies(implies(X1,X2),implies(X1,not(not(X2))))),
inference(spm,[status(thm)],[c_0_36,c_0_38]) ).
cnf(c_0_43,plain,
( is_a_theorem(implies(implies(X1,implies(not(X2),not(X3))),implies(X3,X2)))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_39,c_0_16]) ).
cnf(c_0_44,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X2,implies(X1,X3))) ),
inference(spm,[status(thm)],[c_0_6,c_0_40]) ).
cnf(c_0_45,plain,
is_a_theorem(implies(not(not(implies(X1,X2))),implies(X1,not(not(X2))))),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_46,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X1,implies(not(X3),not(X2)))) ),
inference(spm,[status(thm)],[c_0_15,c_0_43]) ).
cnf(c_0_47,plain,
is_a_theorem(implies(X1,implies(not(not(implies(X1,X2))),not(not(X2))))),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_48,plain,
is_a_theorem(implies(X1,implies(not(X2),not(implies(X1,X2))))),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_49,negated_conjecture,
~ is_a_theorem(implies(not(a),implies(b,not(implies(b,a))))),
prove_mv_50 ).
cnf(c_0_50,plain,
is_a_theorem(implies(not(X1),implies(X2,not(implies(X2,X1))))),
inference(spm,[status(thm)],[c_0_44,c_0_48]) ).
cnf(c_0_51,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_50])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : LCL116-1 : TPTP v8.1.2. Released v1.0.0.
% 0.06/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 11:56:30 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.43 Running first-order model finding
% 0.17/0.43 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.ykZBJJSb8i/E---3.1_445.p
% 422.64/54.43 # Version: 3.1pre001
% 422.64/54.43 # Preprocessing class: FSSSSMSSSSSNFFN.
% 422.64/54.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 422.64/54.43 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 422.64/54.43 # Starting new_bool_3 with 300s (1) cores
% 422.64/54.43 # Starting new_bool_1 with 300s (1) cores
% 422.64/54.43 # Starting sh5l with 300s (1) cores
% 422.64/54.43 # new_bool_1 with pid 541 completed with status 0
% 422.64/54.43 # Result found by new_bool_1
% 422.64/54.43 # Preprocessing class: FSSSSMSSSSSNFFN.
% 422.64/54.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 422.64/54.43 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 422.64/54.43 # Starting new_bool_3 with 300s (1) cores
% 422.64/54.43 # Starting new_bool_1 with 300s (1) cores
% 422.64/54.43 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 422.64/54.43 # Search class: FHUNM-FFSF21-MFFFFFNN
% 422.64/54.43 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 422.64/54.43 # Starting G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with 181s (1) cores
% 422.64/54.43 # G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with pid 546 completed with status 0
% 422.64/54.43 # Result found by G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S
% 422.64/54.43 # Preprocessing class: FSSSSMSSSSSNFFN.
% 422.64/54.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 422.64/54.43 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 422.64/54.43 # Starting new_bool_3 with 300s (1) cores
% 422.64/54.43 # Starting new_bool_1 with 300s (1) cores
% 422.64/54.43 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 422.64/54.43 # Search class: FHUNM-FFSF21-MFFFFFNN
% 422.64/54.43 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 422.64/54.43 # Starting G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with 181s (1) cores
% 422.64/54.43 # Preprocessing time : 0.001 s
% 422.64/54.43 # Presaturation interreduction done
% 422.64/54.43
% 422.64/54.43 # Proof found!
% 422.64/54.43 # SZS status Unsatisfiable
% 422.64/54.43 # SZS output start CNFRefutation
% See solution above
% 422.64/54.44 # Parsed axioms : 6
% 422.64/54.44 # Removed by relevancy pruning/SinE : 0
% 422.64/54.44 # Initial clauses : 6
% 422.64/54.44 # Removed in clause preprocessing : 0
% 422.64/54.44 # Initial clauses in saturation : 6
% 422.64/54.44 # Processed clauses : 160795
% 422.64/54.44 # ...of these trivial : 10575
% 422.64/54.44 # ...subsumed : 141604
% 422.64/54.44 # ...remaining for further processing : 8616
% 422.64/54.44 # Other redundant clauses eliminated : 0
% 422.64/54.44 # Clauses deleted for lack of memory : 40102
% 422.64/54.44 # Backward-subsumed : 74
% 422.64/54.44 # Backward-rewritten : 87
% 422.64/54.44 # Generated clauses : 2973115
% 422.64/54.44 # ...of the previous two non-redundant : 2522769
% 422.64/54.44 # ...aggressively subsumed : 0
% 422.64/54.44 # Contextual simplify-reflections : 0
% 422.64/54.44 # Paramodulations : 2973115
% 422.64/54.44 # Factorizations : 0
% 422.64/54.44 # NegExts : 0
% 422.64/54.44 # Equation resolutions : 0
% 422.64/54.44 # Total rewrite steps : 457550
% 422.64/54.44 # Propositional unsat checks : 0
% 422.64/54.44 # Propositional check models : 0
% 422.64/54.44 # Propositional check unsatisfiable : 0
% 422.64/54.44 # Propositional clauses : 0
% 422.64/54.44 # Propositional clauses after purity: 0
% 422.64/54.44 # Propositional unsat core size : 0
% 422.64/54.44 # Propositional preprocessing time : 0.000
% 422.64/54.44 # Propositional encoding time : 0.000
% 422.64/54.44 # Propositional solver time : 0.000
% 422.64/54.44 # Success case prop preproc time : 0.000
% 422.64/54.44 # Success case prop encoding time : 0.000
% 422.64/54.44 # Success case prop solver time : 0.000
% 422.64/54.44 # Current number of processed clauses : 8449
% 422.64/54.44 # Positive orientable unit clauses : 4602
% 422.64/54.44 # Positive unorientable unit clauses: 0
% 422.64/54.44 # Negative unit clauses : 4
% 422.64/54.44 # Non-unit-clauses : 3843
% 422.64/54.44 # Current number of unprocessed clauses: 1177942
% 422.64/54.44 # ...number of literals in the above : 1981948
% 422.64/54.44 # Current number of archived formulas : 0
% 422.64/54.44 # Current number of archived clauses : 167
% 422.64/54.44 # Clause-clause subsumption calls (NU) : 5812474
% 422.64/54.44 # Rec. Clause-clause subsumption calls : 5783298
% 422.64/54.44 # Non-unit clause-clause subsumptions : 141674
% 422.64/54.44 # Unit Clause-clause subsumption calls : 174705
% 422.64/54.44 # Rewrite failures with RHS unbound : 0
% 422.64/54.44 # BW rewrite match attempts : 4452038
% 422.64/54.44 # BW rewrite match successes : 90
% 422.64/54.44 # Condensation attempts : 0
% 422.64/54.44 # Condensation successes : 0
% 422.64/54.44 # Termbank termtop insertions : 44508841
% 422.64/54.44
% 422.64/54.44 # -------------------------------------------------
% 422.64/54.44 # User time : 51.469 s
% 422.64/54.44 # System time : 1.398 s
% 422.64/54.44 # Total time : 52.867 s
% 422.64/54.44 # Maximum resident set size: 1648 pages
% 422.64/54.44
% 422.64/54.44 # -------------------------------------------------
% 422.64/54.44 # User time : 51.469 s
% 422.64/54.44 # System time : 1.403 s
% 422.64/54.44 # Total time : 52.872 s
% 422.64/54.44 # Maximum resident set size: 1676 pages
% 422.64/54.44 % E---3.1 exiting
%------------------------------------------------------------------------------