%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL080-2 : 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 : n006.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:43 PM UTC 2026
% Result : Unsatisfiable 0.25s 5.81s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of clauses : 29 ( 13 unt; 0 nHn; 16 RR)
% Number of literals : 49 ( 0 equ; 25 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 61 ( 12 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(ic_3,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X1),X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ic_3) ).
cnf(ic_4,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ic_4) ).
cnf(prove_ic_JLukasiewicz,negated_conjecture,
~ is_a_theorem(implies(implies(implies(a,b),c),implies(implies(c,a),implies(e,a)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ic_JLukasiewicz) ).
cnf(ic_2,axiom,
is_a_theorem(implies(X1,implies(X2,X1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ic_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(implies(X1,X2),X1),X1)),
ic_3 ).
cnf(c_0_8,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
ic_4 ).
cnf(c_0_9,plain,
( ~ is_a_theorem(implies(implies(X1,X2),X1))
| is_a_theorem(X1) ),
inference(pm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,plain,
( ~ is_a_theorem(implies(X3,X1))
| is_a_theorem(implies(implies(X1,X2),implies(X3,X2))) ),
inference(pm,[status(thm)],[c_0_6,c_0_8]) ).
cnf(c_0_11,negated_conjecture,
~ is_a_theorem(implies(implies(implies(a,b),c),implies(implies(c,a),implies(e,a)))),
inference(fof_simplification,[status(thm)],[prove_ic_JLukasiewicz]) ).
cnf(c_0_12,plain,
( ~ is_a_theorem(implies(X1,implies(X1,X2)))
| is_a_theorem(implies(X1,X2)) ),
inference(pm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,axiom,
is_a_theorem(implies(X1,implies(X2,X1))),
ic_2 ).
cnf(c_0_14,plain,
( ~ is_a_theorem(implies(X1,X3))
| ~ is_a_theorem(implies(X3,X2))
| is_a_theorem(implies(X1,X2)) ),
inference(pm,[status(thm)],[c_0_6,c_0_10]) ).
cnf(c_0_15,negated_conjecture,
~ is_a_theorem(implies(implies(implies(a,b),c),implies(implies(c,a),implies(e,a)))),
c_0_11 ).
cnf(c_0_16,plain,
( ~ is_a_theorem(implies(implies(X1,X2),X1))
| is_a_theorem(implies(implies(X1,X2),X2)) ),
inference(pm,[status(thm)],[c_0_12,c_0_10]) ).
cnf(c_0_17,plain,
( ~ is_a_theorem(X2)
| is_a_theorem(implies(X1,X2)) ),
inference(pm,[status(thm)],[c_0_6,c_0_13]) ).
cnf(c_0_18,plain,
( ~ is_a_theorem(implies(X1,X3))
| is_a_theorem(implies(implies(implies(X1,X2),X1),X3)) ),
inference(pm,[status(thm)],[c_0_14,c_0_7]) ).
cnf(c_0_19,plain,
( ~ is_a_theorem(implies(implies(X3,X1),X2))
| is_a_theorem(implies(X1,X2)) ),
inference(pm,[status(thm)],[c_0_14,c_0_13]) ).
cnf(c_0_20,negated_conjecture,
( ~ is_a_theorem(implies(implies(implies(a,b),c),X1))
| ~ is_a_theorem(implies(X1,implies(implies(c,a),implies(e,a)))) ),
inference(pm,[status(thm)],[c_0_15,c_0_14]) ).
cnf(c_0_21,plain,
( ~ is_a_theorem(X1)
| is_a_theorem(implies(implies(X1,X2),X2)) ),
inference(pm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
( ~ is_a_theorem(implies(implies(implies(X2,X4),implies(X1,X4)),X3))
| is_a_theorem(implies(implies(X1,X2),X3)) ),
inference(pm,[status(thm)],[c_0_14,c_0_8]) ).
cnf(c_0_23,plain,
( ~ is_a_theorem(implies(X1,implies(implies(implies(X1,X2),X1),X3)))
| is_a_theorem(implies(implies(implies(X1,X2),X1),X3)) ),
inference(pm,[status(thm)],[c_0_12,c_0_18]) ).
cnf(c_0_24,plain,
is_a_theorem(implies(X1,implies(X2,implies(X3,X1)))),
inference(pm,[status(thm)],[c_0_19,c_0_13]) ).
cnf(c_0_25,negated_conjecture,
( ~ is_a_theorem(X1)
| ~ is_a_theorem(implies(implies(implies(a,b),c),implies(X1,implies(implies(c,a),implies(e,a))))) ),
inference(pm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(implies(X1,X3),X4),implies(implies(X2,X3),X4)))),
inference(pm,[status(thm)],[c_0_22,c_0_8]) ).
cnf(c_0_27,plain,
is_a_theorem(implies(implies(implies(X1,X2),X1),implies(X3,X1))),
inference(pm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL080-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.20/5.47 % Computer : n006.cluster.edu
% 0.20/5.47 % Model : x86_64 x86_64
% 0.20/5.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/5.47 % Memory : 8046.5625MB
% 0.20/5.47 % OS : Linux 6.8.0-71-generic
% 0.20/5.47 % CPULimit : 300
% 0.20/5.47 % WCLimit : 300
% 0.20/5.47 % DateTime : Mon Sep 21 00:04:04 UTC 2026
% 0.20/5.48 % CPUTime :
% 0.20/5.48 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.25/5.54 Running first-order theorem proving
% 0.25/5.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
% 0.25/5.81 % Version: 3.5.1
% 0.25/5.81 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.25/5.81 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/5.81 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.25/5.81 % Starting new_bool_3 with 300s (1) cores
% 0.25/5.81 % Starting new_bool_1 with 300s (1) cores
% 0.25/5.81 % Starting sh5l with 300s (1) cores
% 0.25/5.81 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1590068 completed with status 0
% 0.25/5.81 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.25/5.81 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.25/5.81 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/5.81 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.25/5.81 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.25/5.81 % No SInE strategy applied
% 0.25/5.81 % Search class: FHUNM-FFSF22-MFFFFFNN
% 0.25/5.81 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.25/5.81 % Starting SubtermCWHack with 136s (1) cores
% 0.25/5.81 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.25/5.81 % Starting U----_206e_00_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.25/5.81 % Starting G-E--_300_C01_S00 with 136s (1) cores
% 0.25/5.81 % Starting new_bool_3 with 136s (1) cores
% 0.25/5.81 % G-E--_300_C01_S00 with pid 1590078 completed with status 0
% 0.25/5.81 % Result found by G-E--_300_C01_S00
% 0.25/5.81 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.25/5.81 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/5.81 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.25/5.81 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.25/5.81 % No SInE strategy applied
% 0.25/5.81 % Search class: FHUNM-FFSF22-MFFFFFNN
% 0.25/5.81 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.25/5.81 % Starting SubtermCWHack with 136s (1) cores
% 0.25/5.81 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.25/5.81 % Starting U----_206e_00_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.25/5.81 % Starting G-E--_300_C01_S00 with 136s (1) cores
% 0.25/5.81 % Preprocessing time : 0.002 s
% 0.25/5.81
% 0.25/5.81 % Proof found!
% 0.25/5.81 % SZS status Unsatisfiable
% 0.25/5.81 % SZS output start CNFRefutation
% See solution above
% 0.25/5.81 % Parsed axioms : 6
% 0.25/5.81 % Removed by relevancy pruning/SinE : 0
% 0.25/5.81 % Initial clauses : 6
% 0.25/5.81 % Removed in clause preprocessing : 0
% 0.25/5.81 % Initial clauses in saturation : 6
% 0.25/5.81 % Processed clauses : 977
% 0.25/5.81 % ...of these trivial : 11
% 0.25/5.81 % ...subsumed : 722
% 0.25/5.81 % ...remaining for further processing : 244
% 0.25/5.81 % Other redundant clauses eliminated : 0
% 0.25/5.81 % Clauses deleted for lack of memory : 0
% 0.25/5.81 % Backward-subsumed : 3
% 0.25/5.81 % Backward-rewritten : 3
% 0.25/5.81 % Generated clauses : 7420
% 0.25/5.81 % ...of the previous two non-redundant : 6991
% 0.25/5.81 % ...aggressively subsumed : 0
% 0.25/5.81 % Contextual simplify-reflections : 0
% 0.25/5.81 % Paramodulations : 7420
% 0.25/5.81 % Factorizations : 0
% 0.25/5.81 % NegExts : 0
% 0.25/5.81 % Equation resolutions : 0
% 0.25/5.81 % Disequality decompositions : 0
% 0.25/5.81 % Total rewrite steps : 423
% 0.25/5.81 % ...of those cached : 320
% 0.25/5.81 % Propositional unsat checks : 0
% 0.25/5.81 % Propositional check models : 0
% 0.25/5.81 % Propositional check unsatisfiable : 0
% 0.25/5.81 % Propositional clauses : 0
% 0.25/5.81 % Propositional clauses after purity: 0
% 0.25/5.81 % Propositional unsat core size : 0
% 0.25/5.81 % Propositional preprocessing time : 0.000
% 0.25/5.81 % Propositional encoding time : 0.000
% 0.25/5.81 % Propositional solver time : 0.000
% 0.25/5.81 % Success case prop preproc time : 0.000
% 0.25/5.81 % Success case prop encoding time : 0.000
% 0.25/5.81 % Success case prop solver time : 0.000
% 0.25/5.81 % Current number of processed clauses : 238
% 0.25/5.81 % Positive orientable unit clauses : 56
% 0.25/5.81 % Positive unorientable unit clauses: 0
% 0.25/5.81 % Negative unit clauses : 70
% 0.25/5.81 % Non-unit-clauses : 112
% 0.25/5.81 % Current number of unprocessed clauses: 5979
% 0.25/5.81 % ...number of literals in the above : 15089
% 0.25/5.81 % Current number of archived formulas : 0
% 0.25/5.81 % Current number of archived clauses : 6
% 0.25/5.81 % Clause-clause subsumption calls (NU) : 2250
% 0.25/5.81 % Rec. Clause-clause subsumption calls : 2196
% 0.25/5.81 % Non-unit clause-clause subsumptions : 272
% 0.25/5.81 % Unit Clause-clause subsumption calls : 454
% 0.25/5.81 % Rewrite failures with RHS unbound : 0
% 0.25/5.81 % BW rewrite match attempts : 2761
% 0.25/5.81 % BW rewrite match successes : 3
% 0.25/5.81 % Condensation attempts : 0
% 0.25/5.81 % Condensation successes : 0
% 0.25/5.81 % Termbank termtop insertions : 64975
% 0.25/5.81 % Search garbage collected termcells : 8
% 0.25/5.81
% 0.25/5.81 % -------------------------------------------------
% 0.25/5.81 % User time : 0.196 s
% 0.25/5.81 % System time : 0.014 s
% 0.25/5.81 % Total time : 0.211 s
% 0.25/5.81 % Maximum resident set size: 3376 pages
% 0.25/5.81
% 0.25/5.81 % -------------------------------------------------
% 0.25/5.81 % User time : 0.831 s
% 0.25/5.81 % System time : 0.056 s
% 0.25/5.81 % Total time : 0.887 s
% 0.25/5.81 % Maximum resident set size: 4864 pages
% 0.25/5.81 % E exiting
%------------------------------------------------------------------------------