%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL115-1 : 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 : n008.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:49 PM UTC 2026
% Result : Unsatisfiable 0.11s 0.44s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 6
% Syntax : Number of clauses : 31 ( 17 unt; 0 nHn; 14 RR)
% Number of literals : 50 ( 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 : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 58 ( 7 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(mv_2,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mv_2) ).
cnf(mv_3,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X2),implies(implies(X2,X1),X1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mv_3) ).
cnf(mv_1,axiom,
is_a_theorem(implies(X1,implies(X2,X1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mv_1) ).
cnf(mv_5,axiom,
is_a_theorem(implies(implies(not(X1),not(X2)),implies(X2,X1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mv_5) ).
cnf(prove_mv_39,negated_conjecture,
~ is_a_theorem(implies(not(implies(a,b)),not(b))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_mv_39) ).
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,X2),implies(implies(X2,X3),implies(X1,X3)))),
mv_2 ).
cnf(c_0_9,plain,
( ~ is_a_theorem(implies(X3,X1))
| is_a_theorem(implies(implies(X1,X2),implies(X3,X2))) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X2),implies(implies(X2,X1),X1))),
mv_3 ).
cnf(c_0_11,axiom,
is_a_theorem(implies(X1,implies(X2,X1))),
mv_1 ).
cnf(c_0_12,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_7,c_0_9]) ).
cnf(c_0_13,axiom,
is_a_theorem(implies(implies(not(X1),not(X2)),implies(X2,X1))),
mv_5 ).
cnf(c_0_14,plain,
( ~ is_a_theorem(implies(implies(X2,X1),X1))
| is_a_theorem(implies(implies(X1,X2),X2)) ),
inference(spm,[status(thm)],[c_0_7,c_0_10]) ).
cnf(c_0_15,plain,
( ~ is_a_theorem(X2)
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_7,c_0_11]) ).
cnf(c_0_16,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_12,c_0_13]) ).
cnf(c_0_17,plain,
( ~ is_a_theorem(X1)
| is_a_theorem(implies(implies(X1,X2),X2)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
is_a_theorem(implies(not(X1),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_16,c_0_11]) ).
cnf(c_0_19,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_12,c_0_17]) ).
cnf(c_0_20,plain,
is_a_theorem(implies(not(not(X1)),implies(X2,X1))),
inference(spm,[status(thm)],[c_0_16,c_0_18]) ).
cnf(c_0_21,plain,
( ~ is_a_theorem(X2)
| is_a_theorem(implies(not(not(X1)),X1)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,plain,
( ~ is_a_theorem(implies(not(X2),not(X1)))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_7,c_0_13]) ).
cnf(c_0_23,plain,
is_a_theorem(implies(not(not(X1)),X1)),
inference(spm,[status(thm)],[c_0_21,c_0_18]) ).
cnf(c_0_24,plain,
is_a_theorem(implies(X1,not(not(X1)))),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_25,plain,
( ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(implies(X1,not(not(X2)))) ),
inference(spm,[status(thm)],[c_0_12,c_0_24]) ).
cnf(c_0_26,negated_conjecture,
~ is_a_theorem(implies(not(implies(a,b)),not(b))),
inference(fof_simplification,[status(thm)],[prove_mv_39]) ).
cnf(c_0_27,plain,
( ~ is_a_theorem(implies(not(X2),X1))
| is_a_theorem(implies(not(X1),X2)) ),
inference(spm,[status(thm)],[c_0_22,c_0_25]) ).
cnf(c_0_28,negated_conjecture,
~ is_a_theorem(implies(not(implies(a,b)),not(b))),
c_0_26 ).
cnf(c_0_29,plain,
is_a_theorem(implies(not(implies(X1,X2)),not(X2))),
inference(spm,[status(thm)],[c_0_27,c_0_20]) ).
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 : LCL115-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n008.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 00:06:24 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 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.11/0.44 % Version: 3.5.1
% 0.11/0.44 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.11/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.11/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.44 % Starting sh5l with 300s (1) cores
% 0.11/0.44 % new_bool_3 with pid 3928513 completed with status 0
% 0.11/0.44 % Result found by new_bool_3
% 0.11/0.44 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.11/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.11/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.44 % Search class: FHUNM-FFSF21-MFFFFFNN
% 0.11/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.44 % SubtermCWHack with pid 3928518 completed with status 0
% 0.11/0.44 % Result found by SubtermCWHack
% 0.11/0.44 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.11/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.11/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.44 % Search class: FHUNM-FFSF21-MFFFFFNN
% 0.11/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.44 % Preprocessing time : 0.001 s
% 0.11/0.44
% 0.11/0.44 % Proof found!
% 0.11/0.44 % SZS status Unsatisfiable
% 0.11/0.44 % SZS output start CNFRefutation
% See solution above
% 0.11/0.44 % Parsed axioms : 6
% 0.11/0.44 % Removed by relevancy pruning/SinE : 0
% 0.11/0.44 % Initial clauses : 6
% 0.11/0.44 % Removed in clause preprocessing : 0
% 0.11/0.44 % Initial clauses in saturation : 6
% 0.11/0.44 % Processed clauses : 348
% 0.11/0.44 % ...of these trivial : 11
% 0.11/0.44 % ...subsumed : 203
% 0.11/0.44 % ...remaining for further processing : 134
% 0.11/0.44 % Other redundant clauses eliminated : 0
% 0.11/0.44 % Clauses deleted for lack of memory : 0
% 0.11/0.44 % Backward-subsumed : 0
% 0.11/0.44 % Backward-rewritten : 4
% 0.11/0.44 % Generated clauses : 1747
% 0.11/0.44 % ...of the previous two non-redundant : 1506
% 0.11/0.44 % ...aggressively subsumed : 0
% 0.11/0.44 % Contextual simplify-reflections : 0
% 0.11/0.44 % Paramodulations : 1747
% 0.11/0.44 % Factorizations : 0
% 0.11/0.44 % NegExts : 0
% 0.11/0.44 % Equation resolutions : 0
% 0.11/0.44 % Disequality decompositions : 0
% 0.11/0.44 % Total rewrite steps : 217
% 0.11/0.44 % ...of those cached : 157
% 0.11/0.44 % Propositional unsat checks : 0
% 0.11/0.44 % Propositional check models : 0
% 0.11/0.44 % Propositional check unsatisfiable : 0
% 0.11/0.44 % Propositional clauses : 0
% 0.11/0.44 % Propositional clauses after purity: 0
% 0.11/0.44 % Propositional unsat core size : 0
% 0.11/0.44 % Propositional preprocessing time : 0.000
% 0.11/0.44 % Propositional encoding time : 0.000
% 0.11/0.44 % Propositional solver time : 0.000
% 0.11/0.44 % Success case prop preproc time : 0.000
% 0.11/0.44 % Success case prop encoding time : 0.000
% 0.11/0.44 % Success case prop solver time : 0.000
% 0.11/0.44 % Current number of processed clauses : 130
% 0.11/0.44 % Positive orientable unit clauses : 44
% 0.11/0.44 % Positive unorientable unit clauses: 0
% 0.11/0.44 % Negative unit clauses : 3
% 0.11/0.44 % Non-unit-clauses : 83
% 0.11/0.44 % Current number of unprocessed clauses: 1089
% 0.11/0.44 % ...number of literals in the above : 2455
% 0.11/0.44 % Current number of archived formulas : 0
% 0.11/0.44 % Current number of archived clauses : 4
% 0.11/0.44 % Clause-clause subsumption calls (NU) : 1516
% 0.11/0.44 % Rec. Clause-clause subsumption calls : 1516
% 0.11/0.44 % Non-unit clause-clause subsumptions : 202
% 0.11/0.44 % Unit Clause-clause subsumption calls : 122
% 0.11/0.44 % Rewrite failures with RHS unbound : 0
% 0.11/0.44 % BW rewrite match attempts : 730
% 0.11/0.44 % BW rewrite match successes : 4
% 0.11/0.44 % Condensation attempts : 0
% 0.11/0.44 % Condensation successes : 0
% 0.11/0.44 % Termbank termtop insertions : 20127
% 0.11/0.44 % Search garbage collected termcells : 8
% 0.11/0.44
% 0.11/0.44 % -------------------------------------------------
% 0.11/0.44 % User time : 0.016 s
% 0.11/0.44 % System time : 0.000 s
% 0.11/0.44 % Total time : 0.017 s
% 0.11/0.44 % Maximum resident set size: 3632 pages
% 0.11/0.44
% 0.11/0.44 % -------------------------------------------------
% 0.11/0.44 % User time : 0.018 s
% 0.11/0.44 % System time : 0.004 s
% 0.11/0.44 % Total time : 0.022 s
% 0.11/0.44 % Maximum resident set size: 4608 pages
% 0.11/0.44 % E exiting
%------------------------------------------------------------------------------