TSTP Solution File: LCL059-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LCL059-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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:23 EDT 2023
% Result : Unsatisfiable 8.01s 1.51s
% Output : CNFRefutation 8.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 5
% Syntax : Number of clauses : 35 ( 16 unt; 0 nHn; 13 RR)
% Number of literals : 62 ( 0 equ; 29 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 : 84 ( 15 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.czUOKzDdT1/E---3.1_26893.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.czUOKzDdT1/E---3.1_26893.p',cn_1) ).
cnf(cn_3,axiom,
is_a_theorem(implies(X1,implies(not(X1),X2))),
file('/export/starexec/sandbox2/tmp/tmp.czUOKzDdT1/E---3.1_26893.p',cn_3) ).
cnf(cn_2,axiom,
is_a_theorem(implies(implies(not(X1),X1),X1)),
file('/export/starexec/sandbox2/tmp/tmp.czUOKzDdT1/E---3.1_26893.p',cn_2) ).
cnf(prove_cn_49,negated_conjecture,
~ is_a_theorem(implies(implies(not(a),not(b)),implies(b,a))),
file('/export/starexec/sandbox2/tmp/tmp.czUOKzDdT1/E---3.1_26893.p',prove_cn_49) ).
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(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_13,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_14,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_15,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_16,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_12,c_0_7]) ).
cnf(c_0_17,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_13,c_0_9]) ).
cnf(c_0_18,plain,
is_a_theorem(implies(implies(not(implies(not(X1),X1)),implies(not(X1),X1)),X1)),
inference(spm,[status(thm)],[c_0_14,c_0_11]) ).
cnf(c_0_19,plain,
( is_a_theorem(implies(implies(X1,X2),X2))
| ~ is_a_theorem(implies(not(X2),X1)) ),
inference(spm,[status(thm)],[c_0_14,c_0_7]) ).
cnf(c_0_20,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X2,not(X1))) ),
inference(spm,[status(thm)],[c_0_15,c_0_9]) ).
cnf(c_0_21,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_16,c_0_11]) ).
cnf(c_0_22,plain,
is_a_theorem(implies(implies(not(X1),X1),implies(not(X1),X2))),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,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_19]) ).
cnf(c_0_24,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(not(X2),not(X1))) ),
inference(spm,[status(thm)],[c_0_14,c_0_20]) ).
cnf(c_0_25,plain,
is_a_theorem(implies(not(implies(implies(not(X1),X1),X1)),X2)),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,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_23,c_0_6]) ).
cnf(c_0_27,plain,
is_a_theorem(implies(X1,implies(implies(not(X2),X2),X2))),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,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_13,c_0_6]) ).
cnf(c_0_29,plain,
is_a_theorem(implies(implies(X1,implies(not(X2),X2)),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,plain,
is_a_theorem(implies(implies(not(X1),X2),implies(not(implies(implies(X2,X1),X1)),X3))),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_31,plain,
is_a_theorem(implies(implies(not(X1),X2),implies(implies(X2,X1),X1))),
inference(spm,[status(thm)],[c_0_14,c_0_30]) ).
cnf(c_0_32,negated_conjecture,
~ is_a_theorem(implies(implies(not(a),not(b)),implies(b,a))),
prove_cn_49 ).
cnf(c_0_33,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_15,c_0_31]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_9])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : LCL059-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.15 % Command : run_E %s %d THM
% 0.16/0.37 % Computer : n025.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 2400
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Mon Oct 2 12:25:51 EDT 2023
% 0.16/0.37 % CPUTime :
% 0.23/0.50 Running first-order theorem proving
% 0.23/0.50 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.czUOKzDdT1/E---3.1_26893.p
% 8.01/1.51 # Version: 3.1pre001
% 8.01/1.51 # Preprocessing class: FSSSSMSSSSSNFFN.
% 8.01/1.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.01/1.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 8.01/1.51 # Starting new_bool_3 with 300s (1) cores
% 8.01/1.51 # Starting new_bool_1 with 300s (1) cores
% 8.01/1.51 # Starting sh5l with 300s (1) cores
% 8.01/1.51 # sh5l with pid 27109 completed with status 0
% 8.01/1.51 # Result found by sh5l
% 8.01/1.51 # Preprocessing class: FSSSSMSSSSSNFFN.
% 8.01/1.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.01/1.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 8.01/1.51 # Starting new_bool_3 with 300s (1) cores
% 8.01/1.51 # Starting new_bool_1 with 300s (1) cores
% 8.01/1.51 # Starting sh5l with 300s (1) cores
% 8.01/1.51 # SinE strategy is gf500_gu_R04_F100_L20000
% 8.01/1.51 # Search class: FHUNS-FFSF21-MFFFFFNN
% 8.01/1.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 8.01/1.51 # Starting H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V with 163s (1) cores
% 8.01/1.51 # H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V with pid 27116 completed with status 0
% 8.01/1.51 # Result found by H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V
% 8.01/1.51 # Preprocessing class: FSSSSMSSSSSNFFN.
% 8.01/1.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.01/1.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 8.01/1.51 # Starting new_bool_3 with 300s (1) cores
% 8.01/1.51 # Starting new_bool_1 with 300s (1) cores
% 8.01/1.51 # Starting sh5l with 300s (1) cores
% 8.01/1.51 # SinE strategy is gf500_gu_R04_F100_L20000
% 8.01/1.51 # Search class: FHUNS-FFSF21-MFFFFFNN
% 8.01/1.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 8.01/1.51 # Starting H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V with 163s (1) cores
% 8.01/1.51 # Preprocessing time : 0.001 s
% 8.01/1.51 # Presaturation interreduction done
% 8.01/1.51
% 8.01/1.51 # Proof found!
% 8.01/1.51 # SZS status Unsatisfiable
% 8.01/1.51 # SZS output start CNFRefutation
% See solution above
% 8.01/1.51 # Parsed axioms : 5
% 8.01/1.51 # Removed by relevancy pruning/SinE : 0
% 8.01/1.51 # Initial clauses : 5
% 8.01/1.51 # Removed in clause preprocessing : 0
% 8.01/1.51 # Initial clauses in saturation : 5
% 8.01/1.51 # Processed clauses : 13604
% 8.01/1.51 # ...of these trivial : 461
% 8.01/1.51 # ...subsumed : 11949
% 8.01/1.51 # ...remaining for further processing : 1194
% 8.01/1.51 # Other redundant clauses eliminated : 0
% 8.01/1.51 # Clauses deleted for lack of memory : 0
% 8.01/1.51 # Backward-subsumed : 17
% 8.01/1.51 # Backward-rewritten : 1
% 8.01/1.51 # Generated clauses : 115718
% 8.01/1.51 # ...of the previous two non-redundant : 107204
% 8.01/1.51 # ...aggressively subsumed : 0
% 8.01/1.51 # Contextual simplify-reflections : 0
% 8.01/1.51 # Paramodulations : 115718
% 8.01/1.51 # Factorizations : 0
% 8.01/1.51 # NegExts : 0
% 8.01/1.51 # Equation resolutions : 0
% 8.01/1.51 # Total rewrite steps : 9579
% 8.01/1.51 # Propositional unsat checks : 0
% 8.01/1.51 # Propositional check models : 0
% 8.01/1.51 # Propositional check unsatisfiable : 0
% 8.01/1.51 # Propositional clauses : 0
% 8.01/1.51 # Propositional clauses after purity: 0
% 8.01/1.51 # Propositional unsat core size : 0
% 8.01/1.51 # Propositional preprocessing time : 0.000
% 8.01/1.51 # Propositional encoding time : 0.000
% 8.01/1.51 # Propositional solver time : 0.000
% 8.01/1.51 # Success case prop preproc time : 0.000
% 8.01/1.51 # Success case prop encoding time : 0.000
% 8.01/1.51 # Success case prop solver time : 0.000
% 8.01/1.51 # Current number of processed clauses : 1171
% 8.01/1.51 # Positive orientable unit clauses : 242
% 8.01/1.51 # Positive unorientable unit clauses: 0
% 8.01/1.51 # Negative unit clauses : 19
% 8.01/1.51 # Non-unit-clauses : 910
% 8.01/1.51 # Current number of unprocessed clauses: 93403
% 8.01/1.51 # ...number of literals in the above : 279836
% 8.01/1.51 # Current number of archived formulas : 0
% 8.01/1.51 # Current number of archived clauses : 23
% 8.01/1.51 # Clause-clause subsumption calls (NU) : 268114
% 8.01/1.51 # Rec. Clause-clause subsumption calls : 246396
% 8.01/1.51 # Non-unit clause-clause subsumptions : 11765
% 8.01/1.51 # Unit Clause-clause subsumption calls : 4460
% 8.01/1.51 # Rewrite failures with RHS unbound : 0
% 8.01/1.51 # BW rewrite match attempts : 29145
% 8.01/1.51 # BW rewrite match successes : 1
% 8.01/1.51 # Condensation attempts : 0
% 8.01/1.51 # Condensation successes : 0
% 8.01/1.51 # Termbank termtop insertions : 1786377
% 8.01/1.51
% 8.01/1.51 # -------------------------------------------------
% 8.01/1.51 # User time : 0.933 s
% 8.01/1.51 # System time : 0.042 s
% 8.01/1.51 # Total time : 0.975 s
% 8.01/1.51 # Maximum resident set size: 1644 pages
% 8.01/1.51
% 8.01/1.51 # -------------------------------------------------
% 8.01/1.51 # User time : 0.934 s
% 8.01/1.51 # System time : 0.044 s
% 8.01/1.51 # Total time : 0.978 s
% 8.01/1.51 # Maximum resident set size: 1676 pages
% 8.01/1.51 % E---3.1 exiting
% 8.01/1.51 % E---3.1 exiting
%------------------------------------------------------------------------------