%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL053-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 : n002.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 26.07s 5.03s
% Output : CNFRefutation 26.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of clauses : 30 ( 16 unt; 0 nHn; 12 RR)
% Number of literals : 50 ( 0 equ; 23 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; 2 con; 0-2 aty)
% Number of variables : 72 ( 13 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_30,negated_conjecture,
~ is_a_theorem(implies(implies(a,implies(a,b)),implies(a,b))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_30) ).
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,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_11,axiom,
is_a_theorem(implies(X1,implies(not(X1),X2))),
cn_3 ).
cnf(c_0_12,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_13,plain,
( ~ is_a_theorem(implies(X2,not(X1)))
| is_a_theorem(implies(X1,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,axiom,
is_a_theorem(implies(implies(not(X1),X1),X1)),
cn_2 ).
cnf(c_0_15,plain,
( ~ is_a_theorem(implies(X1,implies(X3,X5)))
| ~ is_a_theorem(implies(X2,implies(X5,X4)))
| is_a_theorem(implies(X1,implies(X2,implies(X3,X4)))) ),
inference(spm,[status(thm)],[c_0_10,c_0_12]) ).
cnf(c_0_16,plain,
is_a_theorem(implies(X1,implies(implies(not(not(X1)),not(X1)),X2))),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
( ~ is_a_theorem(implies(X1,implies(X3,not(X2))))
| is_a_theorem(implies(X1,implies(X2,implies(X3,X4)))) ),
inference(spm,[status(thm)],[c_0_15,c_0_11]) ).
cnf(c_0_18,plain,
( ~ is_a_theorem(implies(X1,implies(X3,implies(not(not(X2)),not(X2)))))
| is_a_theorem(implies(X1,implies(X2,implies(X3,X4)))) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
is_a_theorem(implies(X1,implies(X2,implies(not(X1),X3)))),
inference(spm,[status(thm)],[c_0_17,c_0_11]) ).
cnf(c_0_20,plain,
is_a_theorem(implies(not(X1),implies(X1,implies(X2,X3)))),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_21,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_14]) ).
cnf(c_0_22,plain,
( ~ is_a_theorem(implies(X3,implies(X2,X4)))
| is_a_theorem(implies(implies(X1,X2),implies(X3,implies(X1,X4)))) ),
inference(spm,[status(thm)],[c_0_10,c_0_7]) ).
cnf(c_0_23,plain,
is_a_theorem(implies(not(X1),implies(X2,implies(X1,X3)))),
inference(spm,[status(thm)],[c_0_18,c_0_20]) ).
cnf(c_0_24,negated_conjecture,
~ is_a_theorem(implies(implies(a,implies(a,b)),implies(a,b))),
inference(fof_simplification,[status(thm)],[prove_cn_30]) ).
cnf(c_0_25,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_21,c_0_22]) ).
cnf(c_0_26,plain,
is_a_theorem(implies(not(X1),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_21,c_0_23]) ).
cnf(c_0_27,negated_conjecture,
~ is_a_theorem(implies(implies(a,implies(a,b)),implies(a,b))),
c_0_24 ).
cnf(c_0_28,plain,
is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL053-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.49 % Computer : n002.cluster.edu
% 0.18/0.49 % Model : x86_64 x86_64
% 0.18/0.49 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.49 % Memory : 8046.5625MB
% 0.18/0.49 % OS : Linux 6.8.0-71-generic
% 0.18/0.49 % CPULimit : 300
% 0.18/0.49 % WCLimit : 300
% 0.18/0.49 % DateTime : Mon Sep 21 00:04:33 UTC 2026
% 0.18/0.49 % CPUTime :
% 0.18/0.49 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.22/0.58 Running first-order theorem proving
% 0.22/0.58 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
% 26.07/5.03 % Version: 3.5.1
% 26.07/5.03 % Preprocessing class: FSSSSMSSSSSNFFN.
% 26.07/5.03 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 26.07/5.03 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 26.07/5.03 % Starting new_bool_3 with 300s (1) cores
% 26.07/5.03 % Starting new_bool_1 with 300s (1) cores
% 26.07/5.03 % Starting sh5l with 300s (1) cores
% 26.07/5.03 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 2025264 completed with status 0
% 26.07/5.03 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 26.07/5.03 % Preprocessing class: FSSSSMSSSSSNFFN.
% 26.07/5.03 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 26.07/5.03 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 26.07/5.03 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 26.07/5.03 % No SInE strategy applied
% 26.07/5.03 % Search class: FHUNS-FFSF21-MFFFFFNN
% 26.07/5.03 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 26.07/5.03 % Starting SubtermCWHack with 136s (1) cores
% 26.07/5.03 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 26.07/5.03 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 26.07/5.03 % Starting H----_011_C07_F1_PI_SE_SP_S0V with 136s (1) cores
% 26.07/5.03 % Starting new_bool_3 with 136s (1) cores
% 26.07/5.03 % SubtermCWHack with pid 2025265 completed with status 0
% 26.07/5.03 % Result found by SubtermCWHack
% 26.07/5.03 % Preprocessing class: FSSSSMSSSSSNFFN.
% 26.07/5.03 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 26.07/5.03 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 26.07/5.03 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 26.07/5.03 % No SInE strategy applied
% 26.07/5.03 % Search class: FHUNS-FFSF21-MFFFFFNN
% 26.07/5.03 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 26.07/5.03 % Starting SubtermCWHack with 136s (1) cores
% 26.07/5.03 % Preprocessing time : 0.002 s
% 26.07/5.03
% 26.07/5.03 % Proof found!
% 26.07/5.03 % SZS status Unsatisfiable
% 26.07/5.03 % SZS output start CNFRefutation
% See solution above
% 26.07/5.03 % Parsed axioms : 5
% 26.07/5.03 % Removed by relevancy pruning/SinE : 0
% 26.07/5.03 % Initial clauses : 5
% 26.07/5.03 % Removed in clause preprocessing : 0
% 26.07/5.03 % Initial clauses in saturation : 5
% 26.07/5.03 % Processed clauses : 12326
% 26.07/5.03 % ...of these trivial : 268
% 26.07/5.03 % ...subsumed : 10828
% 26.07/5.03 % ...remaining for further processing : 1230
% 26.07/5.03 % Other redundant clauses eliminated : 0
% 26.07/5.03 % Clauses deleted for lack of memory : 0
% 26.07/5.03 % Backward-subsumed : 16
% 26.07/5.03 % Backward-rewritten : 3
% 26.07/5.03 % Generated clauses : 171851
% 26.07/5.03 % ...of the previous two non-redundant : 164361
% 26.07/5.03 % ...aggressively subsumed : 0
% 26.07/5.03 % Contextual simplify-reflections : 0
% 26.07/5.03 % Paramodulations : 171851
% 26.07/5.03 % Factorizations : 0
% 26.07/5.03 % NegExts : 0
% 26.07/5.03 % Equation resolutions : 0
% 26.07/5.03 % Disequality decompositions : 0
% 26.07/5.03 % Total rewrite steps : 7394
% 26.07/5.03 % ...of those cached : 6360
% 26.07/5.03 % Propositional unsat checks : 0
% 26.07/5.03 % Propositional check models : 0
% 26.07/5.03 % Propositional check unsatisfiable : 0
% 26.07/5.03 % Propositional clauses : 0
% 26.07/5.03 % Propositional clauses after purity: 0
% 26.07/5.03 % Propositional unsat core size : 0
% 26.07/5.03 % Propositional preprocessing time : 0.000
% 26.07/5.03 % Propositional encoding time : 0.000
% 26.07/5.03 % Propositional solver time : 0.000
% 26.07/5.03 % Success case prop preproc time : 0.000
% 26.07/5.03 % Success case prop encoding time : 0.000
% 26.07/5.03 % Success case prop solver time : 0.000
% 26.07/5.03 % Current number of processed clauses : 1211
% 26.07/5.03 % Positive orientable unit clauses : 129
% 26.07/5.03 % Positive unorientable unit clauses: 0
% 26.07/5.03 % Negative unit clauses : 4
% 26.07/5.03 % Non-unit-clauses : 1078
% 26.07/5.03 % Current number of unprocessed clauses: 152027
% 26.07/5.03 % ...number of literals in the above : 486902
% 26.07/5.03 % Current number of archived formulas : 0
% 26.07/5.03 % Current number of archived clauses : 19
% 26.07/5.03 % Clause-clause subsumption calls (NU) : 512766
% 26.07/5.03 % Rec. Clause-clause subsumption calls : 427291
% 26.07/5.03 % Non-unit clause-clause subsumptions : 10834
% 26.07/5.03 % Unit Clause-clause subsumption calls : 12216
% 26.07/5.03 % Rewrite failures with RHS unbound : 0
% 26.07/5.03 % BW rewrite match attempts : 18402
% 26.07/5.03 % BW rewrite match successes : 3
% 26.07/5.03 % Condensation attempts : 0
% 26.07/5.03 % Condensation successes : 0
% 26.07/5.03 % Termbank termtop insertions : 2994403
% 26.07/5.03 % Search garbage collected termcells : 8
% 26.07/5.03
% 26.07/5.03 % -------------------------------------------------
% 26.07/5.03 % User time : 4.103 s
% 26.07/5.03 % System time : 0.162 s
% 26.07/5.03 % Total time : 4.265 s
% 26.07/5.03 % Maximum resident set size: 3632 pages
% 26.07/5.03
% 26.07/5.03 % -------------------------------------------------
% 26.07/5.03 % User time : 20.635 s
% 26.07/5.03 % System time : 0.804 s
% 26.07/5.03 % Total time : 21.439 s
% 26.07/5.03 % Maximum resident set size: 4608 pages
% 26.07/5.03 % E exiting
%------------------------------------------------------------------------------