%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL049-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n005.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:37 PM UTC 2026
% Result : Unsatisfiable 19.92s 3.36s
% Output : CNFRefutation 19.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 5
% Syntax : Number of clauses : 63 ( 26 unt; 0 nHn; 21 RR)
% Number of literals : 113 ( 0 equ; 54 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 : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 157 ( 42 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
( ~ is_a_theorem(X1)
| ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(X2) ),
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_20,negated_conjecture,
~ is_a_theorem(implies(a,implies(implies(a,b),b))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_20) ).
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,plain,
( ~ is_a_theorem(implies(X1,X3))
| ~ is_a_theorem(implies(X3,X2))
| is_a_theorem(implies(X1,X2)) ),
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,X2))
| is_a_theorem(implies(X1,implies(not(X2),X3))) ),
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(X2,X4))
| ~ is_a_theorem(implies(X1,implies(X4,X3)))
| is_a_theorem(implies(X1,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_14,plain,
( ~ is_a_theorem(X3)
| ~ is_a_theorem(implies(X3,X1))
| is_a_theorem(implies(not(X1),X2)) ),
inference(spm,[status(thm)],[c_0_6,c_0_11]) ).
cnf(c_0_15,plain,
( ~ is_a_theorem(implies(X4,X2))
| ~ is_a_theorem(implies(X1,X4))
| is_a_theorem(implies(X1,implies(not(X2),X3))) ),
inference(spm,[status(thm)],[c_0_9,c_0_11]) ).
cnf(c_0_16,plain,
( ~ is_a_theorem(implies(X1,implies(not(X2),X2)))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_9,c_0_12]) ).
cnf(c_0_17,plain,
( ~ is_a_theorem(implies(X2,not(X1)))
| is_a_theorem(implies(X1,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_13,c_0_10]) ).
cnf(c_0_18,plain,
( ~ is_a_theorem(implies(X1,X4))
| ~ is_a_theorem(implies(X4,X2))
| is_a_theorem(implies(not(implies(X1,X2)),X3)) ),
inference(spm,[status(thm)],[c_0_14,c_0_8]) ).
cnf(c_0_19,plain,
( ~ is_a_theorem(implies(implies(not(X1),X4),X2))
| is_a_theorem(implies(X1,implies(not(X2),X3))) ),
inference(spm,[status(thm)],[c_0_15,c_0_10]) ).
cnf(c_0_20,plain,
is_a_theorem(implies(implies(not(implies(not(X1),X1)),implies(not(X1),X1)),X1)),
inference(spm,[status(thm)],[c_0_16,c_0_12]) ).
cnf(c_0_21,plain,
( ~ is_a_theorem(implies(not(X2),not(X1)))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
( ~ is_a_theorem(X1)
| is_a_theorem(implies(not(X1),X2)) ),
inference(spm,[status(thm)],[c_0_6,c_0_10]) ).
cnf(c_0_23,plain,
( ~ is_a_theorem(implies(not(X2),X1))
| is_a_theorem(implies(implies(X1,X2),X2)) ),
inference(spm,[status(thm)],[c_0_16,c_0_8]) ).
cnf(c_0_24,plain,
( ~ is_a_theorem(implies(X1,implies(not(X2),X2)))
| is_a_theorem(implies(not(implies(X1,X2)),X3)) ),
inference(spm,[status(thm)],[c_0_18,c_0_12]) ).
cnf(c_0_25,plain,
is_a_theorem(implies(implies(not(X1),X1),implies(not(X1),X2))),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,plain,
( ~ is_a_theorem(X2)
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,plain,
( ~ is_a_theorem(implies(not(X2),X3))
| ~ is_a_theorem(implies(X1,implies(X3,X2)))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_9,c_0_23]) ).
cnf(c_0_28,plain,
is_a_theorem(implies(not(implies(implies(not(X1),X1),X1)),X2)),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,plain,
( ~ is_a_theorem(implies(X4,X3))
| ~ is_a_theorem(implies(X2,X4))
| is_a_theorem(implies(X1,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_13,c_0_26]) ).
cnf(c_0_30,plain,
( ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(implies(implies(not(X1),X1),implies(not(X2),X3))) ),
inference(spm,[status(thm)],[c_0_15,c_0_12]) ).
cnf(c_0_31,plain,
( ~ is_a_theorem(implies(not(implies(X1,X3)),implies(X2,X3)))
| is_a_theorem(implies(implies(X1,X2),implies(X1,X3))) ),
inference(spm,[status(thm)],[c_0_27,c_0_7]) ).
cnf(c_0_32,plain,
is_a_theorem(implies(X1,implies(implies(not(X2),X2),X2))),
inference(spm,[status(thm)],[c_0_21,c_0_28]) ).
cnf(c_0_33,plain,
( ~ is_a_theorem(implies(not(X1),X1))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_6,c_0_12]) ).
cnf(c_0_34,plain,
( ~ is_a_theorem(implies(X1,implies(X4,X2)))
| is_a_theorem(implies(X1,implies(implies(X2,X3),implies(X4,X3)))) ),
inference(spm,[status(thm)],[c_0_9,c_0_7]) ).
cnf(c_0_35,plain,
( ~ is_a_theorem(X4)
| ~ is_a_theorem(implies(X4,X3))
| is_a_theorem(implies(X1,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_29,c_0_26]) ).
cnf(c_0_36,plain,
is_a_theorem(implies(X1,X1)),
inference(spm,[status(thm)],[c_0_16,c_0_10]) ).
cnf(c_0_37,plain,
( ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(implies(implies(not(X1),X1),X2)) ),
inference(spm,[status(thm)],[c_0_16,c_0_30]) ).
cnf(c_0_38,plain,
( ~ is_a_theorem(implies(implies(implies(X3,X5),implies(X2,X5)),X4))
| is_a_theorem(implies(X1,implies(implies(X2,X3),X4))) ),
inference(spm,[status(thm)],[c_0_29,c_0_7]) ).
cnf(c_0_39,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_40,plain,
( ~ is_a_theorem(implies(not(implies(implies(X1,X2),implies(X3,X2))),implies(X3,X1)))
| is_a_theorem(implies(implies(X1,X2),implies(X3,X2))) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_41,plain,
( ~ is_a_theorem(X3)
| is_a_theorem(implies(X1,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_42,plain,
( ~ is_a_theorem(implies(X3,X2))
| ~ is_a_theorem(implies(X1,implies(not(X3),X3)))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_9,c_0_37]) ).
cnf(c_0_43,plain,
is_a_theorem(implies(X1,implies(not(implies(not(X1),X2)),X3))),
inference(spm,[status(thm)],[c_0_19,c_0_36]) ).
cnf(c_0_44,plain,
is_a_theorem(implies(X1,implies(implies(not(X2),X3),implies(implies(X3,X2),X2)))),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_45,plain,
( ~ is_a_theorem(implies(not(X3),X3))
| is_a_theorem(implies(X1,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_35,c_0_12]) ).
cnf(c_0_46,plain,
is_a_theorem(implies(not(implies(X1,X1)),X2)),
inference(spm,[status(thm)],[c_0_24,c_0_10]) ).
cnf(c_0_47,plain,
( ~ is_a_theorem(X1)
| is_a_theorem(implies(implies(X1,X2),implies(X3,X2))) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_48,plain,
( ~ is_a_theorem(implies(implies(not(X1),X3),X2))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_49,plain,
is_a_theorem(implies(implies(not(X1),X2),implies(implies(X2,X1),X1))),
inference(spm,[status(thm)],[c_0_33,c_0_44]) ).
cnf(c_0_50,plain,
( ~ is_a_theorem(implies(not(X1),X1))
| is_a_theorem(implies(implies(X1,X2),implies(X3,X2))) ),
inference(spm,[status(thm)],[c_0_40,c_0_45]) ).
cnf(c_0_51,plain,
is_a_theorem(implies(X1,implies(X2,implies(X3,X3)))),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_52,negated_conjecture,
~ is_a_theorem(implies(a,implies(implies(a,b),b))),
inference(fof_simplification,[status(thm)],[prove_cn_20]) ).
cnf(c_0_53,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_9,c_0_47]) ).
cnf(c_0_54,plain,
is_a_theorem(implies(X1,implies(implies(X2,X1),X1))),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_55,plain,
is_a_theorem(implies(implies(implies(X1,implies(X2,X2)),X3),implies(X4,X3))),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_56,negated_conjecture,
~ is_a_theorem(implies(a,implies(implies(a,b),b))),
c_0_52 ).
cnf(c_0_57,plain,
( ~ is_a_theorem(implies(X1,implies(not(X3),X2)))
| is_a_theorem(implies(X1,implies(implies(X2,X3),X3))) ),
inference(spm,[status(thm)],[c_0_9,c_0_49]) ).
cnf(c_0_58,plain,
( ~ is_a_theorem(implies(X3,X1))
| is_a_theorem(implies(X1,implies(X2,X1))) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_59,plain,
is_a_theorem(implies(not(implies(implies(implies(X1,implies(X2,X2)),X3),X3)),X4)),
inference(spm,[status(thm)],[c_0_24,c_0_55]) ).
cnf(c_0_60,negated_conjecture,
~ is_a_theorem(implies(a,implies(not(b),a))),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_61,plain,
is_a_theorem(implies(X1,implies(X2,X1))),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_62,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_60,c_0_61])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL049-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n005.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 21 00:01:20 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.42 Running first-order theorem proving
% 0.15/0.42 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 19.92/3.36 % Version: 3.5.1
% 19.92/3.36 % Preprocessing class: FSSSSMSSSSSNFFN.
% 19.92/3.36 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 19.92/3.36 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 19.92/3.36 % Starting new_bool_3 with 300s (1) cores
% 19.92/3.36 % Starting new_bool_1 with 300s (1) cores
% 19.92/3.36 % Starting sh5l with 300s (1) cores
% 19.92/3.36 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 2106004 completed with status 0
% 19.92/3.36 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 19.92/3.36 % Preprocessing class: FSSSSMSSSSSNFFN.
% 19.92/3.36 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 19.92/3.36 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 19.92/3.36 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 19.92/3.36 % No SInE strategy applied
% 19.92/3.36 % Search class: FHUNS-FFSF21-MFFFFFNN
% 19.92/3.36 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 19.92/3.36 % Starting SubtermCWHack with 136s (1) cores
% 19.92/3.36 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 19.92/3.36 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 19.92/3.36 % Starting H----_011_C07_F1_PI_SE_SP_S0V with 136s (1) cores
% 19.92/3.36 % Starting new_bool_3 with 136s (1) cores
% 19.92/3.36 % H----_011_C07_F1_PI_SE_SP_S0V with pid 2106013 completed with status 0
% 19.92/3.36 % Result found by H----_011_C07_F1_PI_SE_SP_S0V
% 19.92/3.36 % Preprocessing class: FSSSSMSSSSSNFFN.
% 19.92/3.36 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 19.92/3.36 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 19.92/3.36 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 19.92/3.36 % No SInE strategy applied
% 19.92/3.36 % Search class: FHUNS-FFSF21-MFFFFFNN
% 19.92/3.36 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 19.92/3.36 % Starting SubtermCWHack with 136s (1) cores
% 19.92/3.36 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 19.92/3.36 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 19.92/3.36 % Starting H----_011_C07_F1_PI_SE_SP_S0V with 136s (1) cores
% 19.92/3.36 % Preprocessing time : 0.001 s
% 19.92/3.36
% 19.92/3.36 % Proof found!
% 19.92/3.36 % SZS status Unsatisfiable
% 19.92/3.36 % SZS output start CNFRefutation
% See solution above
% 19.92/3.36 % Parsed axioms : 5
% 19.92/3.36 % Removed by relevancy pruning/SinE : 0
% 19.92/3.36 % Initial clauses : 5
% 19.92/3.36 % Removed in clause preprocessing : 0
% 19.92/3.36 % Initial clauses in saturation : 5
% 19.92/3.36 % Processed clauses : 18564
% 19.92/3.36 % ...of these trivial : 439
% 19.92/3.36 % ...subsumed : 16790
% 19.92/3.36 % ...remaining for further processing : 1335
% 19.92/3.36 % Other redundant clauses eliminated : 0
% 19.92/3.36 % Clauses deleted for lack of memory : 0
% 19.92/3.36 % Backward-subsumed : 16
% 19.92/3.36 % Backward-rewritten : 8
% 19.92/3.36 % Generated clauses : 165628
% 19.92/3.36 % ...of the previous two non-redundant : 157756
% 19.92/3.36 % ...aggressively subsumed : 0
% 19.92/3.36 % Contextual simplify-reflections : 0
% 19.92/3.36 % Paramodulations : 165628
% 19.92/3.36 % Factorizations : 0
% 19.92/3.36 % NegExts : 0
% 19.92/3.36 % Equation resolutions : 0
% 19.92/3.36 % Disequality decompositions : 0
% 19.92/3.36 % Total rewrite steps : 8567
% 19.92/3.36 % ...of those cached : 7345
% 19.92/3.36 % Propositional unsat checks : 0
% 19.92/3.36 % Propositional check models : 0
% 19.92/3.36 % Propositional check unsatisfiable : 0
% 19.92/3.36 % Propositional clauses : 0
% 19.92/3.37 % Propositional clauses after purity: 0
% 19.92/3.37 % Propositional unsat core size : 0
% 19.92/3.37 % Propositional preprocessing time : 0.000
% 19.92/3.37 % Propositional encoding time : 0.000
% 19.92/3.37 % Propositional solver time : 0.000
% 19.92/3.37 % Success case prop preproc time : 0.000
% 19.92/3.37 % Success case prop encoding time : 0.000
% 19.92/3.37 % Success case prop solver time : 0.000
% 19.92/3.37 % Current number of processed clauses : 1311
% 19.92/3.37 % Positive orientable unit clauses : 161
% 19.92/3.37 % Positive unorientable unit clauses: 0
% 19.92/3.37 % Negative unit clauses : 22
% 19.92/3.37 % Non-unit-clauses : 1128
% 19.92/3.37 % Current number of unprocessed clauses: 139157
% 19.92/3.37 % ...number of literals in the above : 438731
% 19.92/3.37 % Current number of archived formulas : 0
% 19.92/3.37 % Current number of archived clauses : 24
% 19.92/3.37 % Clause-clause subsumption calls (NU) : 1087492
% 19.92/3.37 % Rec. Clause-clause subsumption calls : 608693
% 19.92/3.37 % Non-unit clause-clause subsumptions : 16699
% 19.92/3.37 % Unit Clause-clause subsumption calls : 8507
% 19.92/3.37 % Rewrite failures with RHS unbound : 0
% 19.92/3.37 % BW rewrite match attempts : 24442
% 19.92/3.37 % BW rewrite match successes : 9
% 19.92/3.37 % Condensation attempts : 0
% 19.92/3.37 % Condensation successes : 0
% 19.92/3.37 % Termbank termtop insertions : 2708931
% 19.92/3.37 % Search garbage collected termcells : 8
% 19.92/3.37
% 19.92/3.37 % -------------------------------------------------
% 19.92/3.37 % User time : 2.521 s
% 19.92/3.37 % System time : 0.082 s
% 19.92/3.37 % Total time : 2.603 s
% 19.92/3.37 % Maximum resident set size: 3632 pages
% 19.92/3.37
% 19.92/3.37 % -------------------------------------------------
% 19.92/3.37 % User time : 13.584 s
% 19.92/3.37 % System time : 0.552 s
% 19.92/3.37 % Total time : 14.137 s
% 19.92/3.37 % Maximum resident set size: 4608 pages
% 19.92/3.37 % E exiting
%------------------------------------------------------------------------------