%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL113-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 : n013.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:48 PM UTC 2026
% Result : Unsatisfiable 0.15s 0.48s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of clauses : 30 ( 16 unt; 0 nHn; 12 RR)
% Number of literals : 49 ( 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 ( 6 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_33,negated_conjecture,
~ is_a_theorem(implies(implies(not(a),b),implies(not(b),a))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_mv_33) ).
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,negated_conjecture,
~ is_a_theorem(implies(implies(not(a),b),implies(not(b),a))),
inference(fof_simplification,[status(thm)],[prove_mv_33]) ).
cnf(c_0_23,plain,
( ~ is_a_theorem(implies(X2,X3))
| is_a_theorem(implies(implies(X1,X2),implies(X1,X3))) ),
inference(spm,[status(thm)],[c_0_19,c_0_8]) ).
cnf(c_0_24,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_25,plain,
is_a_theorem(implies(not(not(X1)),X1)),
inference(spm,[status(thm)],[c_0_21,c_0_18]) ).
cnf(c_0_26,negated_conjecture,
~ is_a_theorem(implies(implies(not(a),b),implies(not(b),a))),
c_0_22 ).
cnf(c_0_27,plain,
( ~ is_a_theorem(implies(X2,not(X3)))
| is_a_theorem(implies(implies(not(X1),X2),implies(X3,X1))) ),
inference(spm,[status(thm)],[c_0_16,c_0_23]) ).
cnf(c_0_28,plain,
is_a_theorem(implies(X1,not(not(X1)))),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL113-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.36 % Computer : n013.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 21 00:05:20 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.41 Running first-order theorem proving
% 0.15/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.15/0.48 % Version: 3.5.1
% 0.15/0.48 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.48 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.48 % Starting sh5l with 300s (1) cores
% 0.15/0.48 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 3740105 completed with status 0
% 0.15/0.48 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.15/0.48 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.48 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.48 % No SInE strategy applied
% 0.15/0.48 % Search class: FHUNM-FFSF21-MFFFFFNN
% 0.15/0.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.48 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.15/0.48 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.15/0.48 % Starting new_bool_3 with 136s (1) cores
% 0.15/0.48 % Starting new_bool_1 with 136s (1) cores
% 0.15/0.48 % G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with pid 3740113 completed with status 0
% 0.15/0.48 % Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN
% 0.15/0.48 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.48 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.48 % No SInE strategy applied
% 0.15/0.48 % Search class: FHUNM-FFSF21-MFFFFFNN
% 0.15/0.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.48 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.15/0.48 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.15/0.48 % Preprocessing time : 0.003 s
% 0.15/0.48
% 0.15/0.48 % Proof found!
% 0.15/0.48 % SZS status Unsatisfiable
% 0.15/0.48 % SZS output start CNFRefutation
% See solution above
% 0.15/0.48 % Parsed axioms : 6
% 0.15/0.48 % Removed by relevancy pruning/SinE : 0
% 0.15/0.48 % Initial clauses : 6
% 0.15/0.48 % Removed in clause preprocessing : 0
% 0.15/0.48 % Initial clauses in saturation : 6
% 0.15/0.48 % Processed clauses : 395
% 0.15/0.48 % ...of these trivial : 1
% 0.15/0.48 % ...subsumed : 247
% 0.15/0.48 % ...remaining for further processing : 147
% 0.15/0.48 % Other redundant clauses eliminated : 0
% 0.15/0.48 % Clauses deleted for lack of memory : 0
% 0.15/0.48 % Backward-subsumed : 5
% 0.15/0.48 % Backward-rewritten : 0
% 0.15/0.48 % Generated clauses : 2302
% 0.15/0.48 % ...of the previous two non-redundant : 2175
% 0.15/0.48 % ...aggressively subsumed : 0
% 0.15/0.48 % Contextual simplify-reflections : 2
% 0.15/0.48 % Paramodulations : 2302
% 0.15/0.48 % Factorizations : 0
% 0.15/0.48 % NegExts : 0
% 0.15/0.48 % Equation resolutions : 0
% 0.15/0.48 % Disequality decompositions : 0
% 0.15/0.48 % Total rewrite steps : 96
% 0.15/0.48 % ...of those cached : 66
% 0.15/0.48 % Propositional unsat checks : 0
% 0.15/0.48 % Propositional check models : 0
% 0.15/0.48 % Propositional check unsatisfiable : 0
% 0.15/0.48 % Propositional clauses : 0
% 0.15/0.48 % Propositional clauses after purity: 0
% 0.15/0.48 % Propositional unsat core size : 0
% 0.15/0.48 % Propositional preprocessing time : 0.000
% 0.15/0.48 % Propositional encoding time : 0.000
% 0.15/0.48 % Propositional solver time : 0.000
% 0.15/0.48 % Success case prop preproc time : 0.000
% 0.15/0.48 % Success case prop encoding time : 0.000
% 0.15/0.48 % Success case prop solver time : 0.000
% 0.15/0.48 % Current number of processed clauses : 142
% 0.15/0.48 % Positive orientable unit clauses : 19
% 0.15/0.48 % Positive unorientable unit clauses: 0
% 0.15/0.48 % Negative unit clauses : 6
% 0.15/0.48 % Non-unit-clauses : 117
% 0.15/0.48 % Current number of unprocessed clauses: 1702
% 0.15/0.48 % ...number of literals in the above : 5138
% 0.15/0.48 % Current number of archived formulas : 0
% 0.15/0.48 % Current number of archived clauses : 5
% 0.15/0.48 % Clause-clause subsumption calls (NU) : 2599
% 0.15/0.48 % Rec. Clause-clause subsumption calls : 2489
% 0.15/0.48 % Non-unit clause-clause subsumptions : 249
% 0.15/0.48 % Unit Clause-clause subsumption calls : 109
% 0.15/0.48 % Rewrite failures with RHS unbound : 0
% 0.15/0.48 % BW rewrite match attempts : 202
% 0.15/0.48 % BW rewrite match successes : 2
% 0.15/0.48 % Condensation attempts : 0
% 0.15/0.48 % Condensation successes : 0
% 0.15/0.48 % Termbank termtop insertions : 29147
% 0.15/0.48 % Search garbage collected termcells : 8
% 0.15/0.48
% 0.15/0.48 % -------------------------------------------------
% 0.15/0.48 % User time : 0.050 s
% 0.15/0.48 % System time : 0.005 s
% 0.15/0.48 % Total time : 0.055 s
% 0.15/0.48 % Maximum resident set size: 3632 pages
% 0.15/0.48
% 0.15/0.48 % -------------------------------------------------
% 0.15/0.48 % User time : 0.243 s
% 0.15/0.48 % System time : 0.022 s
% 0.15/0.48 % Total time : 0.264 s
% 0.15/0.48 % Maximum resident set size: 4608 pages
% 0.15/0.48 % E exiting
%------------------------------------------------------------------------------