%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL056-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n003.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 01:11:38 PM UTC 2026
% Result : Unsatisfiable 8.67s 2.26s
% Output : CNFRefutation 8.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 5
% Syntax : Number of clauses : 56 ( 28 unt; 0 nHn; 16 RR)
% Number of literals : 91 ( 0 equ; 38 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 : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 147 ( 36 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
( ~ is_a_theorem(X1)
| ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(X2) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',cn_1) ).
cnf(cn_3,axiom,
is_a_theorem(implies(X1,implies(not(X1),X2))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_3) ).
cnf(cn_2,axiom,
is_a_theorem(implies(implies(not(X1),X1),X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_2) ).
cnf(prove_cn_39,negated_conjecture,
~ is_a_theorem(implies(not(not(a)),a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_39) ).
cnf(c_0_5,plain,
( ~ is_a_theorem(X1)
| ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(X2) ),
inference(fof_simplification,[status(thm)],[condensed_detachment]) ).
cnf(c_0_6,plain,
( ~ is_a_theorem(X1)
| ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(X2) ),
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(X3,X1))
| is_a_theorem(implies(implies(X1,X2),implies(X3,X2))) ),
inference(spm,[status(thm)],[c_0_6,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(implies(implies(not(X1),X2),X3),implies(X1,X3))),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,plain,
( ~ is_a_theorem(X1)
| is_a_theorem(implies(not(X1),X2)) ),
inference(spm,[status(thm)],[c_0_6,c_0_9]) ).
cnf(c_0_12,plain,
( ~ is_a_theorem(implies(implies(not(X1),X3),X2))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_6,c_0_10]) ).
cnf(c_0_13,plain,
( ~ is_a_theorem(X3)
| is_a_theorem(implies(implies(X1,X2),implies(not(X3),X2))) ),
inference(spm,[status(thm)],[c_0_8,c_0_11]) ).
cnf(c_0_14,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_15,plain,
( ~ is_a_theorem(X2)
| is_a_theorem(implies(X1,implies(not(X2),X3))) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
( ~ is_a_theorem(implies(implies(implies(X2,X4),implies(X1,X4)),X3))
| is_a_theorem(implies(implies(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_6,c_0_14]) ).
cnf(c_0_17,plain,
( ~ is_a_theorem(X1)
| is_a_theorem(implies(implies(implies(not(X1),X2),X3),implies(X4,X3))) ),
inference(spm,[status(thm)],[c_0_8,c_0_15]) ).
cnf(c_0_18,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(implies(X1,X3),X4),implies(implies(X2,X3),X4)))),
inference(spm,[status(thm)],[c_0_16,c_0_7]) ).
cnf(c_0_19,plain,
( ~ is_a_theorem(X3)
| ~ is_a_theorem(implies(implies(not(X3),X4),X2))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_6,c_0_17]) ).
cnf(c_0_20,axiom,
is_a_theorem(implies(implies(not(X1),X1),X1)),
cn_2 ).
cnf(c_0_21,plain,
( ~ is_a_theorem(implies(X1,X4))
| is_a_theorem(implies(implies(implies(X1,X2),X3),implies(implies(X4,X2),X3))) ),
inference(spm,[status(thm)],[c_0_6,c_0_18]) ).
cnf(c_0_22,plain,
( ~ is_a_theorem(X2)
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(not(X1),X1),X2))),
inference(spm,[status(thm)],[c_0_8,c_0_20]) ).
cnf(c_0_24,plain,
( ~ is_a_theorem(X4)
| is_a_theorem(implies(implies(implies(X1,X2),X3),implies(implies(X4,X2),X3))) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,plain,
( ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(implies(implies(not(X1),X1),X2)) ),
inference(spm,[status(thm)],[c_0_6,c_0_23]) ).
cnf(c_0_26,plain,
is_a_theorem(implies(implies(X1,not(X2)),implies(X2,implies(X1,X3)))),
inference(spm,[status(thm)],[c_0_16,c_0_10]) ).
cnf(c_0_27,plain,
( ~ is_a_theorem(X1)
| ~ is_a_theorem(implies(implies(X4,X2),X3))
| is_a_theorem(implies(implies(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_6,c_0_24]) ).
cnf(c_0_28,plain,
is_a_theorem(implies(implies(not(implies(not(X1),X1)),implies(not(X1),X1)),X1)),
inference(spm,[status(thm)],[c_0_25,c_0_20]) ).
cnf(c_0_29,plain,
( ~ is_a_theorem(X1)
| is_a_theorem(implies(implies(X1,X2),implies(X3,X2))) ),
inference(spm,[status(thm)],[c_0_8,c_0_22]) ).
cnf(c_0_30,plain,
is_a_theorem(implies(X1,implies(X2,implies(not(X1),X3)))),
inference(spm,[status(thm)],[c_0_12,c_0_26]) ).
cnf(c_0_31,plain,
( ~ is_a_theorem(X1)
| is_a_theorem(implies(implies(X1,implies(not(X2),X2)),X2)) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,plain,
( ~ is_a_theorem(implies(X2,X4))
| is_a_theorem(implies(implies(X1,X2),implies(X3,implies(X1,X4)))) ),
inference(spm,[status(thm)],[c_0_16,c_0_29]) ).
cnf(c_0_33,plain,
is_a_theorem(implies(implies(implies(X1,implies(not(X2),X3)),X4),implies(X2,X4))),
inference(spm,[status(thm)],[c_0_8,c_0_30]) ).
cnf(c_0_34,plain,
is_a_theorem(implies(implies(implies(implies(not(X1),X1),X2),X3),implies(implies(X1,X2),X3))),
inference(spm,[status(thm)],[c_0_8,c_0_23]) ).
cnf(c_0_35,plain,
( ~ is_a_theorem(X2)
| ~ is_a_theorem(implies(X2,implies(not(X1),X1)))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_6,c_0_31]) ).
cnf(c_0_36,plain,
( ~ is_a_theorem(X2)
| is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(X4,implies(X1,implies(X5,X3))))) ),
inference(spm,[status(thm)],[c_0_32,c_0_29]) ).
cnf(c_0_37,plain,
( ~ is_a_theorem(implies(implies(X3,implies(not(X1),X4)),X2))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_6,c_0_33]) ).
cnf(c_0_38,plain,
is_a_theorem(implies(implies(X1,implies(not(X2),X2)),implies(implies(X2,X3),implies(X1,X3)))),
inference(spm,[status(thm)],[c_0_16,c_0_34]) ).
cnf(c_0_39,plain,
( ~ is_a_theorem(X4)
| ~ is_a_theorem(implies(X1,implies(X4,X3)))
| is_a_theorem(implies(X1,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,plain,
is_a_theorem(implies(X1,implies(implies(X1,X2),implies(X3,X2)))),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_41,plain,
( ~ is_a_theorem(implies(X1,X4))
| is_a_theorem(implies(X1,implies(X2,implies(X3,X4)))) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_42,plain,
is_a_theorem(implies(X1,X1)),
inference(spm,[status(thm)],[c_0_12,c_0_20]) ).
cnf(c_0_43,plain,
( ~ is_a_theorem(implies(X3,implies(not(X1),X1)))
| is_a_theorem(implies(implies(X1,X2),implies(X3,X2))) ),
inference(spm,[status(thm)],[c_0_6,c_0_38]) ).
cnf(c_0_44,plain,
is_a_theorem(implies(X1,implies(X2,implies(X3,X1)))),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_45,plain,
is_a_theorem(implies(implies(implies(X1,implies(X2,X3)),X4),implies(implies(X2,not(X1)),X4))),
inference(spm,[status(thm)],[c_0_8,c_0_26]) ).
cnf(c_0_46,plain,
( ~ is_a_theorem(implies(X2,X1))
| is_a_theorem(implies(implies(not(X1),X2),X1)) ),
inference(spm,[status(thm)],[c_0_16,c_0_31]) ).
cnf(c_0_47,plain,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X2,X3))),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_48,plain,
( ~ is_a_theorem(implies(implies(X2,implies(X1,X4)),X3))
| is_a_theorem(implies(implies(X1,not(X2)),X3)) ),
inference(spm,[status(thm)],[c_0_6,c_0_45]) ).
cnf(c_0_49,plain,
is_a_theorem(implies(implies(not(X1),implies(not(X1),X1)),X1)),
inference(spm,[status(thm)],[c_0_46,c_0_20]) ).
cnf(c_0_50,negated_conjecture,
~ is_a_theorem(implies(not(not(a)),a)),
inference(fof_simplification,[status(thm)],[prove_cn_39]) ).
cnf(c_0_51,plain,
( ~ is_a_theorem(implies(implies(X3,X1),X2))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_6,c_0_47]) ).
cnf(c_0_52,plain,
is_a_theorem(implies(implies(not(X1),not(not(X1))),X1)),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_53,negated_conjecture,
~ is_a_theorem(implies(not(not(a)),a)),
c_0_50 ).
cnf(c_0_54,plain,
is_a_theorem(implies(not(not(X1)),X1)),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_55,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_54])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : LCL056-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.36 % Computer : n003.cluster.edu
% 0.12/0.36 % Model : x86_64 x86_64
% 0.12/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.36 % Memory : 8046.5625MB
% 0.12/0.36 % OS : Linux 6.8.0-71-generic
% 0.12/0.36 % CPULimit : 300
% 0.12/0.36 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 21 00:04:17 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/0.45 Running first-order theorem proving
% 0.17/0.45 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/benchmark/theBenchmark.p
% 8.67/2.26 % Version: 3.5.1
% 8.67/2.26 % Preprocessing class: FSSSSMSSSSSNFFN.
% 8.67/2.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.67/2.26 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 8.67/2.26 % Starting new_bool_3 with 300s (1) cores
% 8.67/2.26 % Starting new_bool_1 with 300s (1) cores
% 8.67/2.26 % Starting sh5l with 300s (1) cores
% 8.67/2.26 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 2968603 completed with status 0
% 8.67/2.26 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 8.67/2.26 % Preprocessing class: FSSSSMSSSSSNFFN.
% 8.67/2.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.67/2.26 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 8.67/2.26 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 8.67/2.26 % No SInE strategy applied
% 8.67/2.26 % Search class: FHUNS-FFSF21-MFFFFFNN
% 8.67/2.26 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 8.67/2.26 % Starting SubtermCWHack with 136s (1) cores
% 8.67/2.26 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 8.67/2.26 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 8.67/2.26 % Starting H----_011_C07_F1_PI_SE_SP_S0V with 136s (1) cores
% 8.67/2.26 % Starting new_bool_3 with 136s (1) cores
% 8.67/2.26 % new_bool_3 with pid 2968613 completed with status 0
% 8.67/2.26 % Result found by new_bool_3
% 8.67/2.26 % Preprocessing class: FSSSSMSSSSSNFFN.
% 8.67/2.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.67/2.26 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 8.67/2.26 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 8.67/2.26 % No SInE strategy applied
% 8.67/2.26 % Search class: FHUNS-FFSF21-MFFFFFNN
% 8.67/2.26 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 8.67/2.26 % Starting SubtermCWHack with 136s (1) cores
% 8.67/2.26 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 8.67/2.26 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 8.67/2.26 % Starting H----_011_C07_F1_PI_SE_SP_S0V with 136s (1) cores
% 8.67/2.26 % Starting new_bool_3 with 136s (1) cores
% 8.67/2.26 % Preprocessing time : 0.002 s
% 8.67/2.26 % Presaturation interreduction done
% 8.67/2.26
% 8.67/2.26 % Proof found!
% 8.67/2.26 % SZS status Unsatisfiable
% 8.67/2.26 % SZS output start CNFRefutation
% See solution above
% 8.67/2.26 % Parsed axioms : 5
% 8.67/2.26 % Removed by relevancy pruning/SinE : 0
% 8.67/2.26 % Initial clauses : 5
% 8.67/2.26 % Removed in clause preprocessing : 0
% 8.67/2.26 % Initial clauses in saturation : 5
% 8.67/2.26 % Processed clauses : 5556
% 8.67/2.26 % ...of these trivial : 118
% 8.67/2.26 % ...subsumed : 4500
% 8.67/2.26 % ...remaining for further processing : 938
% 8.67/2.26 % Other redundant clauses eliminated : 0
% 8.67/2.26 % Clauses deleted for lack of memory : 0
% 8.67/2.26 % Backward-subsumed : 27
% 8.67/2.26 % Backward-rewritten : 3
% 8.67/2.26 % Generated clauses : 54634
% 8.67/2.26 % ...of the previous two non-redundant : 47480
% 8.67/2.26 % ...aggressively subsumed : 0
% 8.67/2.26 % Contextual simplify-reflections : 0
% 8.67/2.26 % Paramodulations : 54634
% 8.67/2.26 % Factorizations : 0
% 8.67/2.26 % NegExts : 0
% 8.67/2.26 % Equation resolutions : 0
% 8.67/2.26 % Disequality decompositions : 0
% 8.67/2.26 % Total rewrite steps : 7026
% 8.67/2.26 % ...of those cached : 5836
% 8.67/2.26 % Propositional unsat checks : 0
% 8.67/2.26 % Propositional check models : 0
% 8.67/2.26 % Propositional check unsatisfiable : 0
% 8.67/2.26 % Propositional clauses : 0
% 8.67/2.26 % Propositional clauses after purity: 0
% 8.67/2.26 % Propositional unsat core size : 0
% 8.67/2.26 % Propositional preprocessing time : 0.000
% 8.67/2.26 % Propositional encoding time : 0.000
% 8.67/2.26 % Propositional solver time : 0.000
% 8.67/2.26 % Success case prop preproc time : 0.000
% 8.67/2.26 % Success case prop encoding time : 0.000
% 8.67/2.26 % Success case prop solver time : 0.000
% 8.67/2.26 % Current number of processed clauses : 903
% 8.67/2.26 % Positive orientable unit clauses : 275
% 8.67/2.26 % Positive unorientable unit clauses: 0
% 8.67/2.26 % Negative unit clauses : 2
% 8.67/2.26 % Non-unit-clauses : 626
% 8.67/2.26 % Current number of unprocessed clauses: 41918
% 8.67/2.26 % ...number of literals in the above : 68513
% 8.67/2.26 % Current number of archived formulas : 0
% 8.67/2.26 % Current number of archived clauses : 35
% 8.67/2.26 % Clause-clause subsumption calls (NU) : 80643
% 8.67/2.26 % Rec. Clause-clause subsumption calls : 78233
% 8.67/2.26 % Non-unit clause-clause subsumptions : 4525
% 8.67/2.26 % Unit Clause-clause subsumption calls : 2728
% 8.67/2.26 % Rewrite failures with RHS unbound : 0
% 8.67/2.26 % BW rewrite match attempts : 32253
% 8.67/2.26 % BW rewrite match successes : 5
% 8.67/2.26 % Condensation attempts : 0
% 8.67/2.26 % Condensation successes : 0
% 8.67/2.26 % Termbank termtop insertions : 848207
% 8.67/2.26 % Search garbage collected termcells : 8
% 8.67/2.26
% 8.67/2.26 % -------------------------------------------------
% 8.67/2.26 % User time : 1.408 s
% 8.67/2.26 % System time : 0.058 s
% 8.67/2.26 % Total time : 1.465 s
% 8.67/2.26 % Maximum resident set size: 3632 pages
% 8.67/2.26
% 8.67/2.26 % -------------------------------------------------
% 8.67/2.26 % User time : 7.237 s
% 8.67/2.26 % System time : 0.274 s
% 8.67/2.26 % Total time : 7.512 s
% 8.67/2.26 % Maximum resident set size: 4864 pages
% 8.67/2.26 % E exiting
%------------------------------------------------------------------------------