TSTP Solution File: LCL367-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LCL367-1 : TPTP v8.1.2. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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:31 EDT 2023
% Result : Unsatisfiable 7.77s 1.48s
% Output : CNFRefutation 7.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 5
% Syntax : Number of clauses : 44 ( 22 unt; 0 nHn; 15 RR)
% Number of literals : 74 ( 0 equ; 32 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 : 107 ( 24 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.7ztuzOcmLY/E---3.1_6114.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.7ztuzOcmLY/E---3.1_6114.p',cn_1) ).
cnf(cn_3,axiom,
is_a_theorem(implies(X1,implies(not(X1),X2))),
file('/export/starexec/sandbox2/tmp/tmp.7ztuzOcmLY/E---3.1_6114.p',cn_3) ).
cnf(cn_2,axiom,
is_a_theorem(implies(implies(not(X1),X1),X1)),
file('/export/starexec/sandbox2/tmp/tmp.7ztuzOcmLY/E---3.1_6114.p',cn_2) ).
cnf(prove_cn_17,negated_conjecture,
~ is_a_theorem(implies(x,implies(implies(y,x),x))),
file('/export/starexec/sandbox2/tmp/tmp.7ztuzOcmLY/E---3.1_6114.p',prove_cn_17) ).
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(X1,X1)),
inference(spm,[status(thm)],[c_0_14,c_0_9]) ).
cnf(c_0_20,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_21,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_22,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_23,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_24,plain,
is_a_theorem(implies(X1,implies(not(implies(not(X1),X2)),X3))),
inference(spm,[status(thm)],[c_0_17,c_0_19]) ).
cnf(c_0_25,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_20]) ).
cnf(c_0_26,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(not(X2),not(X1))) ),
inference(spm,[status(thm)],[c_0_14,c_0_21]) ).
cnf(c_0_27,plain,
is_a_theorem(implies(not(implies(implies(not(X1),X1),X1)),X2)),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,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_29,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_30,plain,
is_a_theorem(implies(not(implies(X1,implies(not(X1),X2))),X3)),
inference(spm,[status(thm)],[c_0_22,c_0_24]) ).
cnf(c_0_31,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_25,c_0_6]) ).
cnf(c_0_32,plain,
is_a_theorem(implies(X1,implies(implies(not(X2),X2),X2))),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_33,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_28,c_0_29]) ).
cnf(c_0_34,plain,
is_a_theorem(implies(X1,implies(X2,implies(not(X2),X3)))),
inference(spm,[status(thm)],[c_0_26,c_0_30]) ).
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_13,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_31,c_0_32]) ).
cnf(c_0_37,plain,
is_a_theorem(implies(implies(implies(not(X1),X2),X3),implies(X1,X3))),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,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_39,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(implies(not(X1),X3),X2)) ),
inference(spm,[status(thm)],[c_0_5,c_0_37]) ).
cnf(c_0_40,plain,
is_a_theorem(implies(implies(not(X1),X2),implies(implies(X2,X1),X1))),
inference(spm,[status(thm)],[c_0_14,c_0_38]) ).
cnf(c_0_41,negated_conjecture,
~ is_a_theorem(implies(x,implies(implies(y,x),x))),
prove_cn_17 ).
cnf(c_0_42,plain,
is_a_theorem(implies(X1,implies(implies(X2,X1),X1))),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_43,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_42])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL367-1 : TPTP v8.1.2. Released v2.3.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n024.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Oct 2 13:03:42 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 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.7ztuzOcmLY/E---3.1_6114.p
% 7.77/1.48 # Version: 3.1pre001
% 7.77/1.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 7.77/1.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.77/1.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 7.77/1.48 # Starting new_bool_3 with 300s (1) cores
% 7.77/1.48 # Starting new_bool_1 with 300s (1) cores
% 7.77/1.48 # Starting sh5l with 300s (1) cores
% 7.77/1.48 # sh5l with pid 6195 completed with status 0
% 7.77/1.48 # Result found by sh5l
% 7.77/1.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 7.77/1.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.77/1.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 7.77/1.48 # Starting new_bool_3 with 300s (1) cores
% 7.77/1.48 # Starting new_bool_1 with 300s (1) cores
% 7.77/1.48 # Starting sh5l with 300s (1) cores
% 7.77/1.48 # SinE strategy is gf500_gu_R04_F100_L20000
% 7.77/1.48 # Search class: FHUNS-FFSF21-MFFFFFNN
% 7.77/1.48 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 7.77/1.48 # Starting H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V with 163s (1) cores
% 7.77/1.48 # H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V with pid 6202 completed with status 0
% 7.77/1.48 # Result found by H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V
% 7.77/1.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 7.77/1.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.77/1.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 7.77/1.48 # Starting new_bool_3 with 300s (1) cores
% 7.77/1.48 # Starting new_bool_1 with 300s (1) cores
% 7.77/1.48 # Starting sh5l with 300s (1) cores
% 7.77/1.48 # SinE strategy is gf500_gu_R04_F100_L20000
% 7.77/1.48 # Search class: FHUNS-FFSF21-MFFFFFNN
% 7.77/1.48 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 7.77/1.48 # Starting H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V with 163s (1) cores
% 7.77/1.48 # Preprocessing time : 0.001 s
% 7.77/1.48 # Presaturation interreduction done
% 7.77/1.48
% 7.77/1.48 # Proof found!
% 7.77/1.48 # SZS status Unsatisfiable
% 7.77/1.48 # SZS output start CNFRefutation
% See solution above
% 7.77/1.48 # Parsed axioms : 5
% 7.77/1.48 # Removed by relevancy pruning/SinE : 0
% 7.77/1.48 # Initial clauses : 5
% 7.77/1.48 # Removed in clause preprocessing : 0
% 7.77/1.48 # Initial clauses in saturation : 5
% 7.77/1.48 # Processed clauses : 13109
% 7.77/1.48 # ...of these trivial : 451
% 7.77/1.48 # ...subsumed : 11539
% 7.77/1.48 # ...remaining for further processing : 1119
% 7.77/1.48 # Other redundant clauses eliminated : 0
% 7.77/1.48 # Clauses deleted for lack of memory : 0
% 7.77/1.48 # Backward-subsumed : 16
% 7.77/1.48 # Backward-rewritten : 3
% 7.77/1.48 # Generated clauses : 111958
% 7.77/1.48 # ...of the previous two non-redundant : 103732
% 7.77/1.48 # ...aggressively subsumed : 0
% 7.77/1.48 # Contextual simplify-reflections : 0
% 7.77/1.48 # Paramodulations : 111958
% 7.77/1.48 # Factorizations : 0
% 7.77/1.48 # NegExts : 0
% 7.77/1.48 # Equation resolutions : 0
% 7.77/1.48 # Total rewrite steps : 9117
% 7.77/1.48 # Propositional unsat checks : 0
% 7.77/1.48 # Propositional check models : 0
% 7.77/1.48 # Propositional check unsatisfiable : 0
% 7.77/1.48 # Propositional clauses : 0
% 7.77/1.48 # Propositional clauses after purity: 0
% 7.77/1.48 # Propositional unsat core size : 0
% 7.77/1.48 # Propositional preprocessing time : 0.000
% 7.77/1.48 # Propositional encoding time : 0.000
% 7.77/1.48 # Propositional solver time : 0.000
% 7.77/1.48 # Success case prop preproc time : 0.000
% 7.77/1.48 # Success case prop encoding time : 0.000
% 7.77/1.48 # Success case prop solver time : 0.000
% 7.77/1.48 # Current number of processed clauses : 1095
% 7.77/1.48 # Positive orientable unit clauses : 228
% 7.77/1.48 # Positive unorientable unit clauses: 0
% 7.77/1.48 # Negative unit clauses : 16
% 7.77/1.48 # Non-unit-clauses : 851
% 7.77/1.48 # Current number of unprocessed clauses: 90533
% 7.77/1.48 # ...number of literals in the above : 272606
% 7.77/1.48 # Current number of archived formulas : 0
% 7.77/1.48 # Current number of archived clauses : 24
% 7.77/1.48 # Clause-clause subsumption calls (NU) : 732938
% 7.77/1.48 # Rec. Clause-clause subsumption calls : 478783
% 7.77/1.48 # Non-unit clause-clause subsumptions : 11488
% 7.77/1.48 # Unit Clause-clause subsumption calls : 3994
% 7.77/1.48 # Rewrite failures with RHS unbound : 0
% 7.77/1.48 # BW rewrite match attempts : 26192
% 7.77/1.48 # BW rewrite match successes : 3
% 7.77/1.48 # Condensation attempts : 0
% 7.77/1.48 # Condensation successes : 0
% 7.77/1.48 # Termbank termtop insertions : 1732181
% 7.77/1.48
% 7.77/1.48 # -------------------------------------------------
% 7.77/1.48 # User time : 0.933 s
% 7.77/1.48 # System time : 0.041 s
% 7.77/1.48 # Total time : 0.974 s
% 7.77/1.48 # Maximum resident set size: 1640 pages
% 7.77/1.48
% 7.77/1.48 # -------------------------------------------------
% 7.77/1.48 # User time : 0.935 s
% 7.77/1.48 # System time : 0.042 s
% 7.77/1.48 # Total time : 0.978 s
% 7.77/1.48 # Maximum resident set size: 1676 pages
% 7.77/1.48 % E---3.1 exiting
% 7.77/1.48 % E---3.1 exiting
%------------------------------------------------------------------------------