%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL033-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 : 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:35 PM UTC 2026
% Result : Unsatisfiable 0.28s 0.55s
% Output : CNFRefutation 0.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of clauses : 20 ( 13 unt; 0 nHn; 9 RR)
% Number of literals : 30 ( 0 equ; 13 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; 3 con; 0-2 aty)
% Number of variables : 54 ( 28 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(c0_CAMeredith,axiom,
is_a_theorem(implies(implies(implies(implies(implies(X1,X2),implies(X3,falsehood)),X4),X5),implies(implies(X5,X1),implies(X3,X1)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c0_CAMeredith) ).
cnf(prove_c0_2,negated_conjecture,
~ is_a_theorem(implies(a,implies(b,a))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_c0_2) ).
cnf(c_0_3,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_4,plain,
( ~ is_a_theorem(X1)
| ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(X2) ),
c_0_3 ).
cnf(c_0_5,axiom,
is_a_theorem(implies(implies(implies(implies(implies(X1,X2),implies(X3,falsehood)),X4),X5),implies(implies(X5,X1),implies(X3,X1)))),
c0_CAMeredith ).
cnf(c_0_6,plain,
( ~ is_a_theorem(implies(implies(implies(implies(X2,X4),implies(X3,falsehood)),X5),X1))
| is_a_theorem(implies(implies(X1,X2),implies(X3,X2))) ),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_7,plain,
is_a_theorem(implies(implies(implies(implies(X1,X2),implies(X3,X2)),implies(X2,X4)),implies(X5,implies(X2,X4)))),
inference(spm,[status(thm)],[c_0_6,c_0_5]) ).
cnf(c_0_8,plain,
is_a_theorem(implies(implies(implies(X1,implies(falsehood,X2)),X3),implies(X4,X3))),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,plain,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(falsehood,X3))),
inference(spm,[status(thm)],[c_0_6,c_0_8]) ).
cnf(c_0_10,plain,
( ~ is_a_theorem(implies(implies(implies(X4,X2),implies(X5,X2)),implies(X2,X3)))
| is_a_theorem(implies(X1,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_4,c_0_7]) ).
cnf(c_0_11,plain,
is_a_theorem(implies(implies(implies(falsehood,X1),X2),implies(X3,X2))),
inference(spm,[status(thm)],[c_0_6,c_0_9]) ).
cnf(c_0_12,plain,
is_a_theorem(implies(X1,implies(X2,implies(X3,X2)))),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,plain,
( ~ is_a_theorem(implies(implies(X2,X3),X1))
| is_a_theorem(implies(falsehood,X1)) ),
inference(spm,[status(thm)],[c_0_4,c_0_9]) ).
cnf(c_0_14,negated_conjecture,
~ is_a_theorem(implies(a,implies(b,a))),
inference(fof_simplification,[status(thm)],[prove_c0_2]) ).
cnf(c_0_15,plain,
( ~ is_a_theorem(X3)
| is_a_theorem(implies(X1,implies(X2,X1))) ),
inference(spm,[status(thm)],[c_0_4,c_0_12]) ).
cnf(c_0_16,plain,
is_a_theorem(implies(falsehood,implies(X1,X2))),
inference(spm,[status(thm)],[c_0_13,c_0_8]) ).
cnf(c_0_17,negated_conjecture,
~ is_a_theorem(implies(a,implies(b,a))),
c_0_14 ).
cnf(c_0_18,plain,
is_a_theorem(implies(X1,implies(X2,X1))),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL033-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.44 % Computer : n006.cluster.edu
% 0.19/0.44 % Model : x86_64 x86_64
% 0.19/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.44 % Memory : 8046.5625MB
% 0.19/0.44 % OS : Linux 6.8.0-71-generic
% 0.19/0.44 % CPULimit : 300
% 0.19/0.44 % WCLimit : 300
% 0.19/0.44 % DateTime : Mon Sep 21 00:00:42 UTC 2026
% 0.19/0.45 % CPUTime :
% 0.19/0.45 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.28/0.52 Running first-order theorem proving
% 0.28/0.52 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
% 0.28/0.55 % Version: 3.5.1
% 0.28/0.55 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.28/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/0.55 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.28/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.28/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.28/0.55 % Starting sh5l with 300s (1) cores
% 0.28/0.55 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1585633 completed with status 0
% 0.28/0.55 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.28/0.55 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.28/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/0.55 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.28/0.55 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.28/0.55 % No SInE strategy applied
% 0.28/0.55 % Search class: FHUNF-FFSF22-MFFFFFNN
% 0.28/0.55 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.28/0.55 % Starting SubtermCWHack with 136s (1) cores
% 0.28/0.55 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.28/0.55 % Starting G-E--_060_C18_F1_PI_AE_CS_SP_S0Y with 136s (1) cores
% 0.28/0.55 % Starting new_bool_3 with 136s (1) cores
% 0.28/0.55 % Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.28/0.55 % SubtermCWHack with pid 1585637 completed with status 0
% 0.28/0.55 % Result found by SubtermCWHack
% 0.28/0.55 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.28/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/0.55 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.28/0.55 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.28/0.55 % No SInE strategy applied
% 0.28/0.55 % Search class: FHUNF-FFSF22-MFFFFFNN
% 0.28/0.55 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.28/0.55 % Starting SubtermCWHack with 136s (1) cores
% 0.28/0.55 % Preprocessing time : 0.001 s
% 0.28/0.55
% 0.28/0.55 % Proof found!
% 0.28/0.55 % SZS status Unsatisfiable
% 0.28/0.55 % SZS output start CNFRefutation
% See solution above
% 0.28/0.55 % Parsed axioms : 3
% 0.28/0.55 % Removed by relevancy pruning/SinE : 0
% 0.28/0.55 % Initial clauses : 3
% 0.28/0.55 % Removed in clause preprocessing : 0
% 0.28/0.55 % Initial clauses in saturation : 3
% 0.28/0.55 % Processed clauses : 19
% 0.28/0.55 % ...of these trivial : 2
% 0.28/0.55 % ...subsumed : 0
% 0.28/0.55 % ...remaining for further processing : 17
% 0.28/0.55 % Other redundant clauses eliminated : 0
% 0.28/0.55 % Clauses deleted for lack of memory : 0
% 0.28/0.55 % Backward-subsumed : 1
% 0.28/0.55 % Backward-rewritten : 3
% 0.28/0.55 % Generated clauses : 43
% 0.28/0.55 % ...of the previous two non-redundant : 33
% 0.28/0.55 % ...aggressively subsumed : 0
% 0.28/0.55 % Contextual simplify-reflections : 0
% 0.28/0.55 % Paramodulations : 43
% 0.28/0.55 % Factorizations : 0
% 0.28/0.55 % NegExts : 0
% 0.28/0.55 % Equation resolutions : 0
% 0.28/0.55 % Disequality decompositions : 0
% 0.28/0.55 % Total rewrite steps : 11
% 0.28/0.55 % ...of those cached : 0
% 0.28/0.55 % Propositional unsat checks : 0
% 0.28/0.55 % Propositional check models : 0
% 0.28/0.55 % Propositional check unsatisfiable : 0
% 0.28/0.55 % Propositional clauses : 0
% 0.28/0.55 % Propositional clauses after purity: 0
% 0.28/0.55 % Propositional unsat core size : 0
% 0.28/0.55 % Propositional preprocessing time : 0.000
% 0.28/0.55 % Propositional encoding time : 0.000
% 0.28/0.55 % Propositional solver time : 0.000
% 0.28/0.55 % Success case prop preproc time : 0.000
% 0.28/0.55 % Success case prop encoding time : 0.000
% 0.28/0.55 % Success case prop solver time : 0.000
% 0.28/0.55 % Current number of processed clauses : 13
% 0.28/0.55 % Positive orientable unit clauses : 8
% 0.28/0.55 % Positive unorientable unit clauses: 0
% 0.28/0.55 % Negative unit clauses : 1
% 0.28/0.55 % Non-unit-clauses : 4
% 0.28/0.55 % Current number of unprocessed clauses: 14
% 0.28/0.55 % ...number of literals in the above : 17
% 0.28/0.55 % Current number of archived formulas : 0
% 0.28/0.55 % Current number of archived clauses : 4
% 0.28/0.55 % Clause-clause subsumption calls (NU) : 6
% 0.28/0.55 % Rec. Clause-clause subsumption calls : 6
% 0.28/0.55 % Non-unit clause-clause subsumptions : 0
% 0.28/0.55 % Unit Clause-clause subsumption calls : 9
% 0.28/0.55 % Rewrite failures with RHS unbound : 0
% 0.28/0.55 % BW rewrite match attempts : 47
% 0.28/0.55 % BW rewrite match successes : 3
% 0.28/0.55 % Condensation attempts : 0
% 0.28/0.55 % Condensation successes : 0
% 0.28/0.55 % Termbank termtop insertions : 637
% 0.28/0.55 % Search garbage collected termcells : 8
% 0.28/0.55
% 0.28/0.55 % -------------------------------------------------
% 0.28/0.55 % User time : 0.003 s
% 0.28/0.55 % System time : 0.004 s
% 0.28/0.55 % Total time : 0.007 s
% 0.28/0.55 % Maximum resident set size: 3636 pages
% 0.28/0.55
% 0.28/0.55 % -------------------------------------------------
% 0.28/0.55 % User time : 0.010 s
% 0.28/0.55 % System time : 0.019 s
% 0.28/0.55 % Total time : 0.029 s
% 0.28/0.55 % Maximum resident set size: 4608 pages
% 0.28/0.55 % E exiting
%------------------------------------------------------------------------------