%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : LCL076-3 : 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:18:24 PM UTC 2026
% Result : Unsatisfiable 0.16s 0.45s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of clauses : 31 ( 15 unt; 0 nHn; 17 RR)
% Number of literals : 55 ( 0 equ; 27 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 : 60 ( 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(transitivity,axiom,
( ~ is_a_theorem(implies(X2,X3))
| ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(implies(X1,X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity) ).
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_40,negated_conjecture,
~ is_a_theorem(implies(a,not(not(a)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_40) ).
cnf(c_0_6,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_7,plain,
( ~ is_a_theorem(X1)
| ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(X2) ),
c_0_6 ).
cnf(c_0_8,axiom,
is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(implies(X1,X2),implies(X1,X3)))),
cn_35 ).
cnf(c_0_9,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_7,c_0_8]) ).
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_7,c_0_9]) ).
cnf(c_0_11,axiom,
is_a_theorem(implies(X1,implies(X2,X1))),
cn_18 ).
cnf(c_0_12,plain,
( ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(implies(X1,X1)) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,plain,
( ~ is_a_theorem(implies(X2,X3))
| ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(implies(X1,X3)) ),
inference(fof_simplification,[status(thm)],[transitivity]) ).
cnf(c_0_14,plain,
is_a_theorem(implies(X1,X1)),
inference(spm,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_15,plain,
( ~ is_a_theorem(implies(X2,X3))
| ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(implies(X1,X3)) ),
c_0_13 ).
cnf(c_0_16,axiom,
is_a_theorem(implies(implies(not(X1),not(X2)),implies(X2,X1))),
cn_49 ).
cnf(c_0_17,plain,
( ~ is_a_theorem(implies(implies(X1,X2),X1))
| is_a_theorem(implies(implies(X1,X2),X2)) ),
inference(spm,[status(thm)],[c_0_10,c_0_14]) ).
cnf(c_0_18,plain,
( ~ is_a_theorem(X2)
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_7,c_0_11]) ).
cnf(c_0_19,plain,
( ~ is_a_theorem(implies(X1,implies(not(X3),not(X2))))
| is_a_theorem(implies(X1,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
( ~ is_a_theorem(X1)
| is_a_theorem(implies(implies(X1,X2),X2)) ),
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_19,c_0_11]) ).
cnf(c_0_22,plain,
( ~ is_a_theorem(X3)
| ~ is_a_theorem(implies(X1,implies(X3,X2)))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_15,c_0_20]) ).
cnf(c_0_23,plain,
is_a_theorem(implies(not(not(X1)),implies(X2,X1))),
inference(spm,[status(thm)],[c_0_19,c_0_21]) ).
cnf(c_0_24,plain,
( ~ is_a_theorem(X2)
| is_a_theorem(implies(not(not(X1)),X1)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_25,negated_conjecture,
~ is_a_theorem(implies(a,not(not(a)))),
inference(fof_simplification,[status(thm)],[prove_cn_40]) ).
cnf(c_0_26,plain,
( ~ is_a_theorem(implies(not(X2),not(X1)))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_7,c_0_16]) ).
cnf(c_0_27,plain,
is_a_theorem(implies(not(not(X1)),X1)),
inference(spm,[status(thm)],[c_0_24,c_0_21]) ).
cnf(c_0_28,negated_conjecture,
~ is_a_theorem(implies(a,not(not(a)))),
c_0_25 ).
cnf(c_0_29,plain,
is_a_theorem(implies(X1,not(not(X1)))),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL076-3 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.38 % Computer : n002.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Mon Sep 21 00:06:17 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 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.16/0.45 % Version: 3.5.1
% 0.16/0.45 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.45 % Starting sh5l with 300s (1) cores
% 0.16/0.45 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 2028512 completed with status 0
% 0.16/0.45 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.16/0.45 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/0.45 % No SInE strategy applied
% 0.16/0.45 % Search class: FHUNS-FFSF21-MFFFFFNN
% 0.16/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.16/0.45 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.16/0.45 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.16/0.45 % Starting H----_011_C07_F1_PI_SE_SP_S0V with 136s (1) cores
% 0.16/0.45 % Starting new_bool_3 with 136s (1) cores
% 0.16/0.45 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 2028518 completed with status 0
% 0.16/0.45 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.16/0.45 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/0.45 % No SInE strategy applied
% 0.16/0.45 % Search class: FHUNS-FFSF21-MFFFFFNN
% 0.16/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.16/0.45 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.16/0.45 % Preprocessing time : 0.001 s
% 0.16/0.45
% 0.16/0.45 % Proof found!
% 0.16/0.45 % SZS status Unsatisfiable
% 0.16/0.45 % SZS output start CNFRefutation
% See solution above
% 0.16/0.45 % Parsed axioms : 6
% 0.16/0.45 % Removed by relevancy pruning/SinE : 0
% 0.16/0.45 % Initial clauses : 6
% 0.16/0.45 % Removed in clause preprocessing : 0
% 0.16/0.45 % Initial clauses in saturation : 6
% 0.16/0.45 % Processed clauses : 129
% 0.16/0.45 % ...of these trivial : 2
% 0.16/0.45 % ...subsumed : 54
% 0.16/0.45 % ...remaining for further processing : 73
% 0.16/0.45 % Other redundant clauses eliminated : 0
% 0.16/0.45 % Clauses deleted for lack of memory : 0
% 0.16/0.45 % Backward-subsumed : 3
% 0.16/0.45 % Backward-rewritten : 1
% 0.16/0.45 % Generated clauses : 613
% 0.16/0.45 % ...of the previous two non-redundant : 547
% 0.16/0.45 % ...aggressively subsumed : 0
% 0.16/0.45 % Contextual simplify-reflections : 0
% 0.16/0.45 % Paramodulations : 613
% 0.16/0.45 % Factorizations : 0
% 0.16/0.45 % NegExts : 0
% 0.16/0.45 % Equation resolutions : 0
% 0.16/0.45 % Disequality decompositions : 0
% 0.16/0.45 % Total rewrite steps : 54
% 0.16/0.45 % ...of those cached : 35
% 0.16/0.45 % Propositional unsat checks : 0
% 0.16/0.45 % Propositional check models : 0
% 0.16/0.45 % Propositional check unsatisfiable : 0
% 0.16/0.45 % Propositional clauses : 0
% 0.16/0.45 % Propositional clauses after purity: 0
% 0.16/0.45 % Propositional unsat core size : 0
% 0.16/0.45 % Propositional preprocessing time : 0.000
% 0.16/0.45 % Propositional encoding time : 0.000
% 0.16/0.45 % Propositional solver time : 0.000
% 0.16/0.45 % Success case prop preproc time : 0.000
% 0.16/0.45 % Success case prop encoding time : 0.000
% 0.16/0.45 % Success case prop solver time : 0.000
% 0.16/0.45 % Current number of processed clauses : 69
% 0.16/0.45 % Positive orientable unit clauses : 13
% 0.16/0.45 % Positive unorientable unit clauses: 0
% 0.16/0.45 % Negative unit clauses : 2
% 0.16/0.45 % Non-unit-clauses : 54
% 0.16/0.45 % Current number of unprocessed clauses: 386
% 0.16/0.45 % ...number of literals in the above : 880
% 0.16/0.45 % Current number of archived formulas : 0
% 0.16/0.45 % Current number of archived clauses : 4
% 0.16/0.45 % Clause-clause subsumption calls (NU) : 662
% 0.16/0.45 % Rec. Clause-clause subsumption calls : 662
% 0.16/0.45 % Non-unit clause-clause subsumptions : 54
% 0.16/0.45 % Unit Clause-clause subsumption calls : 33
% 0.16/0.45 % Rewrite failures with RHS unbound : 0
% 0.16/0.45 % BW rewrite match attempts : 73
% 0.16/0.45 % BW rewrite match successes : 3
% 0.16/0.45 % Condensation attempts : 0
% 0.16/0.45 % Condensation successes : 0
% 0.16/0.45 % Termbank termtop insertions : 7848
% 0.16/0.45 % Search garbage collected termcells : 12
% 0.16/0.45
% 0.16/0.45 % -------------------------------------------------
% 0.16/0.45 % User time : 0.008 s
% 0.16/0.45 % System time : 0.004 s
% 0.16/0.45 % Total time : 0.011 s
% 0.16/0.45 % Maximum resident set size: 3632 pages
% 0.16/0.45
% 0.16/0.45 % -------------------------------------------------
% 0.16/0.45 % User time : 0.034 s
% 0.16/0.45 % System time : 0.011 s
% 0.16/0.45 % Total time : 0.044 s
% 0.16/0.45 % Maximum resident set size: 4864 pages
% 0.16/0.45 % E exiting
%------------------------------------------------------------------------------