%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL065-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 : n014.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:40 PM UTC 2026
% Result : Unsatisfiable 0.21s 5.55s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of clauses : 28 ( 15 unt; 0 nHn; 16 RR)
% Number of literals : 47 ( 0 equ; 22 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 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 : 56 ( 7 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_35,axiom,
is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(implies(X1,X2),implies(X1,X3)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_35) ).
cnf(cn_18,axiom,
is_a_theorem(implies(X1,implies(X2,X1))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_18) ).
cnf(cn_49,axiom,
is_a_theorem(implies(implies(not(X1),not(X2)),implies(X2,X1))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_49) ).
cnf(prove_cn_2,negated_conjecture,
~ is_a_theorem(implies(implies(not(a),a),a)),
file('/export/starexec/sandbox2/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(X1,implies(X2,X3)),implies(implies(X1,X2),implies(X1,X3)))),
cn_35 ).
cnf(c_0_8,plain,
( ~ is_a_theorem(implies(X1,implies(X2,X3)))
| is_a_theorem(implies(implies(X1,X2),implies(X1,X3))) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,axiom,
is_a_theorem(implies(X1,implies(X2,X1))),
cn_18 ).
cnf(c_0_10,plain,
( ~ is_a_theorem(implies(X1,X3))
| ~ is_a_theorem(implies(X1,implies(X3,X2)))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_6,c_0_8]) ).
cnf(c_0_11,plain,
( ~ is_a_theorem(X2)
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_6,c_0_9]) ).
cnf(c_0_12,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_10,c_0_11]) ).
cnf(c_0_13,plain,
( ~ is_a_theorem(implies(implies(X3,X1),X2))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_12,c_0_9]) ).
cnf(c_0_14,plain,
( ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(implies(X1,X1)) ),
inference(spm,[status(thm)],[c_0_10,c_0_9]) ).
cnf(c_0_15,plain,
( ~ is_a_theorem(implies(X2,implies(X1,X3)))
| is_a_theorem(implies(X1,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_13,c_0_8]) ).
cnf(c_0_16,plain,
is_a_theorem(implies(X1,X1)),
inference(spm,[status(thm)],[c_0_14,c_0_9]) ).
cnf(c_0_17,plain,
( ~ is_a_theorem(implies(X1,implies(X2,X4)))
| ~ is_a_theorem(implies(implies(X1,X4),X3))
| is_a_theorem(implies(implies(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_12,c_0_8]) ).
cnf(c_0_18,axiom,
is_a_theorem(implies(implies(not(X1),not(X2)),implies(X2,X1))),
cn_49 ).
cnf(c_0_19,plain,
is_a_theorem(implies(X1,implies(implies(X1,X2),X2))),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
( ~ is_a_theorem(implies(not(X1),implies(X2,not(X3))))
| is_a_theorem(implies(implies(not(X1),X2),implies(X3,X1))) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,plain,
is_a_theorem(implies(not(X1),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_13,c_0_18]) ).
cnf(c_0_22,negated_conjecture,
~ is_a_theorem(implies(implies(not(a),a),a)),
inference(fof_simplification,[status(thm)],[prove_cn_2]) ).
cnf(c_0_23,plain,
( ~ is_a_theorem(implies(X1,implies(X1,X2)))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_10,c_0_19]) ).
cnf(c_0_24,plain,
is_a_theorem(implies(implies(not(X1),X1),implies(X2,X1))),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,negated_conjecture,
~ is_a_theorem(implies(implies(not(a),a),a)),
c_0_22 ).
cnf(c_0_26,plain,
is_a_theorem(implies(implies(not(X1),X1),X1)),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL065-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.15/5.44 % Computer : n014.cluster.edu
% 0.15/5.44 % Model : x86_64 x86_64
% 0.15/5.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/5.44 % Memory : 8046.5625MB
% 0.15/5.44 % OS : Linux 6.8.0-71-generic
% 0.15/5.44 % CPULimit : 300
% 0.15/5.44 % WCLimit : 300
% 0.15/5.44 % DateTime : Mon Sep 21 00:03:10 UTC 2026
% 0.15/5.45 % CPUTime :
% 0.15/5.45 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/5.49 Running first-order theorem proving
% 0.15/5.49 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.21/5.55 % Version: 3.5.1
% 0.21/5.55 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/5.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/5.55 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/5.55 % Starting new_bool_3 with 300s (1) cores
% 0.21/5.55 % Starting new_bool_1 with 300s (1) cores
% 0.21/5.55 % Starting sh5l with 300s (1) cores
% 0.21/5.55 % new_bool_1 with pid 2722857 completed with status 0
% 0.21/5.55 % Result found by new_bool_1
% 0.21/5.55 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/5.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/5.55 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/5.55 % Starting new_bool_3 with 300s (1) cores
% 0.21/5.55 % Starting new_bool_1 with 300s (1) cores
% 0.21/5.55 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.21/5.55 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/5.55 % Search class: FHUNS-FFSF21-MFFFFFNN
% 0.21/5.55 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/5.55 % Starting SubtermCWHack with 31s (1) cores
% 0.21/5.55 % SubtermCWHack with pid 2722862 completed with status 0
% 0.21/5.55 % Result found by SubtermCWHack
% 0.21/5.55 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/5.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/5.55 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/5.55 % Starting new_bool_3 with 300s (1) cores
% 0.21/5.55 % Starting new_bool_1 with 300s (1) cores
% 0.21/5.55 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.21/5.55 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/5.55 % Search class: FHUNS-FFSF21-MFFFFFNN
% 0.21/5.55 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/5.55 % Starting SubtermCWHack with 31s (1) cores
% 0.21/5.55 % Preprocessing time : 0.001 s
% 0.21/5.55
% 0.21/5.55 % Proof found!
% 0.21/5.55 % SZS status Unsatisfiable
% 0.21/5.55 % SZS output start CNFRefutation
% See solution above
% 0.21/5.55 % Parsed axioms : 5
% 0.21/5.55 % Removed by relevancy pruning/SinE : 0
% 0.21/5.55 % Initial clauses : 5
% 0.21/5.55 % Removed in clause preprocessing : 0
% 0.21/5.55 % Initial clauses in saturation : 5
% 0.21/5.55 % Processed clauses : 1137
% 0.21/5.55 % ...of these trivial : 33
% 0.21/5.55 % ...subsumed : 796
% 0.21/5.55 % ...remaining for further processing : 308
% 0.21/5.55 % Other redundant clauses eliminated : 0
% 0.21/5.55 % Clauses deleted for lack of memory : 0
% 0.21/5.55 % Backward-subsumed : 0
% 0.21/5.55 % Backward-rewritten : 3
% 0.21/5.55 % Generated clauses : 6493
% 0.21/5.55 % ...of the previous two non-redundant : 4930
% 0.21/5.55 % ...aggressively subsumed : 0
% 0.21/5.55 % Contextual simplify-reflections : 0
% 0.21/5.55 % Paramodulations : 6493
% 0.21/5.55 % Factorizations : 0
% 0.21/5.55 % NegExts : 0
% 0.21/5.55 % Equation resolutions : 0
% 0.21/5.55 % Disequality decompositions : 0
% 0.21/5.55 % Total rewrite steps : 1543
% 0.21/5.55 % ...of those cached : 1196
% 0.21/5.55 % Propositional unsat checks : 0
% 0.21/5.55 % Propositional check models : 0
% 0.21/5.55 % Propositional check unsatisfiable : 0
% 0.21/5.55 % Propositional clauses : 0
% 0.21/5.55 % Propositional clauses after purity: 0
% 0.21/5.55 % Propositional unsat core size : 0
% 0.21/5.55 % Propositional preprocessing time : 0.000
% 0.21/5.55 % Propositional encoding time : 0.000
% 0.21/5.55 % Propositional solver time : 0.000
% 0.21/5.55 % Success case prop preproc time : 0.000
% 0.21/5.55 % Success case prop encoding time : 0.000
% 0.21/5.55 % Success case prop solver time : 0.000
% 0.21/5.55 % Current number of processed clauses : 305
% 0.21/5.55 % Positive orientable unit clauses : 130
% 0.21/5.55 % Positive unorientable unit clauses: 0
% 0.21/5.55 % Negative unit clauses : 2
% 0.21/5.55 % Non-unit-clauses : 173
% 0.21/5.55 % Current number of unprocessed clauses: 3775
% 0.21/5.55 % ...number of literals in the above : 7905
% 0.21/5.55 % Current number of archived formulas : 0
% 0.21/5.55 % Current number of archived clauses : 3
% 0.21/5.55 % Clause-clause subsumption calls (NU) : 7103
% 0.21/5.55 % Rec. Clause-clause subsumption calls : 7103
% 0.21/5.55 % Non-unit clause-clause subsumptions : 794
% 0.21/5.55 % Unit Clause-clause subsumption calls : 378
% 0.21/5.55 % Rewrite failures with RHS unbound : 0
% 0.21/5.55 % BW rewrite match attempts : 3406
% 0.21/5.55 % BW rewrite match successes : 3
% 0.21/5.55 % Condensation attempts : 0
% 0.21/5.55 % Condensation successes : 0
% 0.21/5.55 % Termbank termtop insertions : 75776
% 0.21/5.55 % Search garbage collected termcells : 8
% 0.21/5.55
% 0.21/5.55 % -------------------------------------------------
% 0.21/5.55 % User time : 0.044 s
% 0.21/5.55 % System time : 0.004 s
% 0.21/5.55 % Total time : 0.048 s
% 0.21/5.55 % Maximum resident set size: 3632 pages
% 0.21/5.55
% 0.21/5.55 % -------------------------------------------------
% 0.21/5.55 % User time : 0.045 s
% 0.21/5.55 % System time : 0.006 s
% 0.21/5.55 % Total time : 0.051 s
% 0.21/5.55 % Maximum resident set size: 4864 pages
% 0.21/5.55 % E exiting
%------------------------------------------------------------------------------