%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : LCL068-1 : TPTP v9.3.1. Bugfixed v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n004.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:18:23 PM UTC 2026
% Result : Unsatisfiable 3.26s 1.14s
% Output : CNFRefutation 3.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 5
% Syntax : Number of clauses : 43 ( 21 unt; 0 nHn; 24 RR)
% Number of literals : 75 ( 0 equ; 37 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 5 ( 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 : 93 ( 22 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_59,axiom,
is_a_theorem(implies(implies(not(X1),X2),implies(implies(X3,X2),implies(implies(X1,X3),X2)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_59) ).
cnf(cn_37,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(not(X1),X3))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_37) ).
cnf(cn_19,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X2,X3))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_19) ).
cnf(prove_cn_2,negated_conjecture,
~ is_a_theorem(implies(implies(not(a),a),a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_2) ).
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(not(X1),X2),implies(implies(X3,X2),implies(implies(X1,X3),X2)))),
cn_59 ).
cnf(c_0_8,plain,
( ~ is_a_theorem(implies(not(X3),X2))
| is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X1),X2))) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(not(X1),X3))),
cn_37 ).
cnf(c_0_10,plain,
( ~ is_a_theorem(implies(X2,X3))
| ~ is_a_theorem(implies(not(X1),X3))
| is_a_theorem(implies(implies(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_6,c_0_8]) ).
cnf(c_0_11,plain,
( ~ is_a_theorem(implies(implies(X1,X3),X2))
| is_a_theorem(implies(not(X1),X2)) ),
inference(spm,[status(thm)],[c_0_6,c_0_9]) ).
cnf(c_0_12,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X2,X3))),
cn_19 ).
cnf(c_0_13,plain,
( ~ is_a_theorem(implies(X3,X1))
| ~ is_a_theorem(implies(X2,X3))
| ~ is_a_theorem(implies(not(X2),X1))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_6,c_0_10]) ).
cnf(c_0_14,plain,
is_a_theorem(implies(not(implies(X1,X2)),implies(X2,X3))),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
( ~ is_a_theorem(implies(X4,implies(X1,X2)))
| ~ is_a_theorem(implies(implies(X3,X1),X4))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,plain,
( ~ is_a_theorem(implies(implies(X3,X1),implies(X1,X2)))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_15,c_0_12]) ).
cnf(c_0_17,plain,
is_a_theorem(implies(X1,X1)),
inference(spm,[status(thm)],[c_0_16,c_0_12]) ).
cnf(c_0_18,plain,
is_a_theorem(implies(not(X1),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_11,c_0_17]) ).
cnf(c_0_19,plain,
( ~ is_a_theorem(implies(X1,X3))
| ~ is_a_theorem(implies(X3,implies(X1,X2)))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_13,c_0_18]) ).
cnf(c_0_20,plain,
( ~ is_a_theorem(implies(implies(X3,X1),X2))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_6,c_0_12]) ).
cnf(c_0_21,plain,
( ~ is_a_theorem(implies(X1,implies(X1,X2)))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_19,c_0_17]) ).
cnf(c_0_22,plain,
is_a_theorem(implies(X1,implies(X2,X1))),
inference(spm,[status(thm)],[c_0_20,c_0_12]) ).
cnf(c_0_23,plain,
( ~ is_a_theorem(implies(not(X1),X1))
| is_a_theorem(implies(implies(X1,X1),X1)) ),
inference(spm,[status(thm)],[c_0_21,c_0_8]) ).
cnf(c_0_24,plain,
is_a_theorem(implies(X1,implies(X2,implies(X3,X1)))),
inference(spm,[status(thm)],[c_0_20,c_0_22]) ).
cnf(c_0_25,plain,
( ~ is_a_theorem(implies(not(X1),X1))
| is_a_theorem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_23]),c_0_17])]) ).
cnf(c_0_26,plain,
( ~ is_a_theorem(implies(X1,X3))
| is_a_theorem(implies(X1,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_19,c_0_24]) ).
cnf(c_0_27,plain,
( ~ is_a_theorem(implies(not(implies(X1,X2)),X2))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_28,plain,
is_a_theorem(implies(not(implies(X1,X2)),implies(not(X1),X3))),
inference(spm,[status(thm)],[c_0_11,c_0_9]) ).
cnf(c_0_29,plain,
( ~ is_a_theorem(implies(X2,X3))
| ~ is_a_theorem(implies(X3,implies(X1,not(X2))))
| is_a_theorem(implies(X1,not(X2))) ),
inference(spm,[status(thm)],[c_0_13,c_0_22]) ).
cnf(c_0_30,plain,
is_a_theorem(implies(X1,implies(not(X1),X2))),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,plain,
( ~ is_a_theorem(implies(X2,implies(X1,not(X2))))
| is_a_theorem(implies(X1,not(X2))) ),
inference(spm,[status(thm)],[c_0_29,c_0_17]) ).
cnf(c_0_32,plain,
is_a_theorem(implies(X1,implies(not(implies(X2,X1)),X3))),
inference(spm,[status(thm)],[c_0_20,c_0_30]) ).
cnf(c_0_33,negated_conjecture,
~ is_a_theorem(implies(implies(not(a),a),a)),
inference(fof_simplification,[status(thm)],[prove_cn_2]) ).
cnf(c_0_34,plain,
( ~ is_a_theorem(implies(X3,X2))
| ~ is_a_theorem(implies(X1,X3))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_19,c_0_26]) ).
cnf(c_0_35,plain,
is_a_theorem(implies(not(implies(X1,X2)),not(X2))),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,negated_conjecture,
~ is_a_theorem(implies(implies(not(a),a),a)),
c_0_33 ).
cnf(c_0_37,plain,
( ~ is_a_theorem(implies(not(X2),X3))
| is_a_theorem(implies(not(implies(X1,X2)),X3)) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_38,negated_conjecture,
( ~ is_a_theorem(implies(a,a))
| ~ is_a_theorem(implies(not(not(a)),a)) ),
inference(spm,[status(thm)],[c_0_36,c_0_10]) ).
cnf(c_0_39,plain,
( ~ is_a_theorem(implies(not(X2),implies(X1,X2)))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_25,c_0_37]) ).
cnf(c_0_40,negated_conjecture,
~ is_a_theorem(implies(not(not(a)),a)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_17])]) ).
cnf(c_0_41,plain,
is_a_theorem(implies(not(not(X1)),X1)),
inference(spm,[status(thm)],[c_0_39,c_0_30]) ).
cnf(c_0_42,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL068-1 : TPTP v9.3.1. Bugfixed v1.2.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.20/0.47 % Computer : n004.cluster.edu
% 0.20/0.47 % Model : x86_64 x86_64
% 0.20/0.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.47 % Memory : 8046.5625MB
% 0.20/0.47 % OS : Linux 6.8.0-71-generic
% 0.20/0.47 % CPULimit : 300
% 0.20/0.47 % WCLimit : 300
% 0.20/0.47 % DateTime : Mon Sep 21 00:03:35 UTC 2026
% 0.20/0.47 % CPUTime :
% 0.20/0.47 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.25/0.55 Running first-order theorem proving
% 0.25/0.55 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
% 3.26/1.14 % Version: 3.5.1
% 3.26/1.14 % Preprocessing class: FSSSSMSSSSSNFFN.
% 3.26/1.14 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.26/1.14 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.26/1.14 % Starting new_bool_3 with 300s (1) cores
% 3.26/1.14 % Starting new_bool_1 with 300s (1) cores
% 3.26/1.14 % Starting sh5l with 300s (1) cores
% 3.26/1.14 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1828802 completed with status 0
% 3.26/1.14 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 3.26/1.14 % Preprocessing class: FSSSSMSSSSSNFFN.
% 3.26/1.14 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.26/1.14 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.26/1.14 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.26/1.14 % No SInE strategy applied
% 3.26/1.14 % Search class: FHUNS-FFSF21-MFFFFFNN
% 3.26/1.14 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 3.26/1.14 % Starting SubtermCWHack with 136s (1) cores
% 3.26/1.14 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 3.26/1.14 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 3.26/1.14 % Starting H----_011_C07_F1_PI_SE_SP_S0V with 136s (1) cores
% 3.26/1.14 % Starting new_bool_3 with 136s (1) cores
% 3.26/1.14 % H----_011_C07_F1_PI_SE_SP_S0V with pid 1828812 completed with status 0
% 3.26/1.14 % Result found by H----_011_C07_F1_PI_SE_SP_S0V
% 3.26/1.14 % Preprocessing class: FSSSSMSSSSSNFFN.
% 3.26/1.14 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.26/1.14 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.26/1.14 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.26/1.14 % No SInE strategy applied
% 3.26/1.14 % Search class: FHUNS-FFSF21-MFFFFFNN
% 3.26/1.14 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 3.26/1.14 % Starting SubtermCWHack with 136s (1) cores
% 3.26/1.14 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 3.26/1.14 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 3.26/1.14 % Starting H----_011_C07_F1_PI_SE_SP_S0V with 136s (1) cores
% 3.26/1.14 % Preprocessing time : 0.002 s
% 3.26/1.14
% 3.26/1.14 % Proof found!
% 3.26/1.14 % SZS status Unsatisfiable
% 3.26/1.14 % SZS output start CNFRefutation
% See solution above
% 3.26/1.14 % Parsed axioms : 5
% 3.26/1.14 % Removed by relevancy pruning/SinE : 0
% 3.26/1.14 % Initial clauses : 5
% 3.26/1.14 % Removed in clause preprocessing : 0
% 3.26/1.14 % Initial clauses in saturation : 5
% 3.26/1.14 % Processed clauses : 5057
% 3.26/1.14 % ...of these trivial : 112
% 3.26/1.14 % ...subsumed : 4059
% 3.26/1.14 % ...remaining for further processing : 886
% 3.26/1.14 % Other redundant clauses eliminated : 0
% 3.26/1.14 % Clauses deleted for lack of memory : 0
% 3.26/1.14 % Backward-subsumed : 57
% 3.26/1.14 % Backward-rewritten : 13
% 3.26/1.14 % Generated clauses : 34202
% 3.26/1.14 % ...of the previous two non-redundant : 31582
% 3.26/1.14 % ...aggressively subsumed : 0
% 3.26/1.14 % Contextual simplify-reflections : 0
% 3.26/1.14 % Paramodulations : 34202
% 3.26/1.14 % Factorizations : 0
% 3.26/1.14 % NegExts : 0
% 3.26/1.14 % Equation resolutions : 0
% 3.26/1.14 % Disequality decompositions : 0
% 3.26/1.14 % Total rewrite steps : 2828
% 3.26/1.14 % ...of those cached : 2173
% 3.26/1.14 % Propositional unsat checks : 0
% 3.26/1.14 % Propositional check models : 0
% 3.26/1.14 % Propositional check unsatisfiable : 0
% 3.26/1.14 % Propositional clauses : 0
% 3.26/1.14 % Propositional clauses after purity: 0
% 3.26/1.14 % Propositional unsat core size : 0
% 3.26/1.14 % Propositional preprocessing time : 0.000
% 3.26/1.14 % Propositional encoding time : 0.000
% 3.26/1.14 % Propositional solver time : 0.000
% 3.26/1.14 % Success case prop preproc time : 0.000
% 3.26/1.14 % Success case prop encoding time : 0.000
% 3.26/1.14 % Success case prop solver time : 0.000
% 3.26/1.14 % Current number of processed clauses : 816
% 3.26/1.14 % Positive orientable unit clauses : 244
% 3.26/1.14 % Positive unorientable unit clauses: 0
% 3.26/1.14 % Negative unit clauses : 9
% 3.26/1.14 % Non-unit-clauses : 563
% 3.26/1.14 % Current number of unprocessed clauses: 25952
% 3.26/1.14 % ...number of literals in the above : 75004
% 3.26/1.14 % Current number of archived formulas : 0
% 3.26/1.14 % Current number of archived clauses : 70
% 3.26/1.14 % Clause-clause subsumption calls (NU) : 83098
% 3.26/1.14 % Rec. Clause-clause subsumption calls : 78473
% 3.26/1.14 % Non-unit clause-clause subsumptions : 4066
% 3.26/1.14 % Unit Clause-clause subsumption calls : 2246
% 3.26/1.14 % Rewrite failures with RHS unbound : 0
% 3.26/1.14 % BW rewrite match attempts : 14255
% 3.26/1.14 % BW rewrite match successes : 16
% 3.26/1.14 % Condensation attempts : 0
% 3.26/1.14 % Condensation successes : 0
% 3.26/1.14 % Termbank termtop insertions : 498313
% 3.26/1.14 % Search garbage collected termcells : 8
% 3.26/1.14
% 3.26/1.14 % -------------------------------------------------
% 3.26/1.14 % User time : 0.466 s
% 3.26/1.14 % System time : 0.025 s
% 3.26/1.14 % Total time : 0.491 s
% 3.26/1.14 % Maximum resident set size: 3636 pages
% 3.26/1.14
% 3.26/1.14 % -------------------------------------------------
% 3.26/1.14 % User time : 2.329 s
% 3.26/1.14 % System time : 0.110 s
% 3.26/1.14 % Total time : 2.439 s
% 3.26/1.14 % Maximum resident set size: 4864 pages
% 3.26/1.14 % E exiting
%------------------------------------------------------------------------------