%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR086+6 : TPTP v9.3.1. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n001.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 12:16:41 PM UTC 2026
% Result : Theorem 5.24s 4.63s
% Output : CNFRefutation 5.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 28 ( 12 unt; 0 def)
% Number of atoms : 120 ( 14 equ)
% Maximal formula atoms : 45 ( 4 avg)
% Number of connectives : 146 ( 54 ~; 61 |; 23 &)
% ( 2 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-3 aty)
% Number of variables : 52 ( 9 sgn 29 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(kb_SUMO_26635,axiom,
! [X1,X15] :
( s__subclass(X1,X15)
=> ( s__instance(X15,s__SetOrClass)
& s__instance(X1,s__SetOrClass) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+2.ax',kb_SUMO_26635) ).
fof(kb_SUMO_32603,axiom,
! [X137,X12,X136] :
( X12 = s__UnionFn(X136,X137)
<=> ! [X1138,X34,X1139] :
( ( s__instance(X137,s__SetOrClass)
& s__instance(X12,s__SetOrClass)
& s__instance(X136,s__SetOrClass) )
=> ( ( s__instance(X1139,X12)
& s__instance(X34,X137)
& s__instance(X1138,X136) )
=> ( ( s__instance(X1139,X137)
| s__instance(X1139,X136) )
& s__instance(X34,X12)
& s__instance(X1138,X12) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+2.ax',kb_SUMO_32603) ).
fof(kb_SUMO_32707,axiom,
s__subclass(s__GraphLoop,s__GraphArc),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+2.ax',kb_SUMO_32707) ).
fof(kb_SUMO_26636,axiom,
! [X1,X15,X13] :
( ( s__instance(X1,s__SetOrClass)
& s__instance(X15,s__SetOrClass) )
=> ( ( s__instance(X13,X1)
& s__subclass(X1,X15) )
=> s__instance(X13,X15) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+2.ax',kb_SUMO_26636) ).
fof(prove_from_ALL,conjecture,
? [X2341] : s__links(X2341,X2341,s__Arc13_1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_from_ALL) ).
fof(kb_SUMO_32710,axiom,
! [X1148] :
( s__instance(X1148,s__GraphArc)
=> ( s__instance(X1148,s__GraphLoop)
<=> ? [X1149] :
( s__links(X1149,X1149,X1148)
& s__instance(X1149,s__GraphNode) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+2.ax',kb_SUMO_32710) ).
fof(local_1,axiom,
s__instance(s__Arc13_1,s__GraphLoop),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_1) ).
fof(c_0_7,plain,
! [X2435,X2436] :
( ( ~ s__subclass(X2435,X2436)
| s__instance(X2436,s__SetOrClass) )
& ( ~ s__subclass(X2435,X2436)
| s__instance(X2435,s__SetOrClass) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_26635])])])]) ).
fof(c_0_8,plain,
! [X2452,X2453,X2454,X2455,X2456,X2457,X2458,X2459,X2460] :
( ( X2459 = s__UnionFn(X2460,X2458)
| ~ s__instance(esk14_3(X2458,X2459,X2460),X2459)
| ~ s__instance(esk13_3(X2458,X2459,X2460),X2459)
| ~ s__instance(esk15_3(X2458,X2459,X2460),X2458) )
& ( X2459 = s__UnionFn(X2460,X2458)
| ~ s__instance(esk14_3(X2458,X2459,X2460),X2459)
| ~ s__instance(esk13_3(X2458,X2459,X2460),X2459)
| ~ s__instance(esk15_3(X2458,X2459,X2460),X2460) )
& ( X2459 = s__UnionFn(X2460,X2458)
| s__instance(esk15_3(X2458,X2459,X2460),X2459) )
& ( X2459 = s__UnionFn(X2460,X2458)
| s__instance(esk14_3(X2458,X2459,X2460),X2458) )
& ( X2459 = s__UnionFn(X2460,X2458)
| s__instance(esk13_3(X2458,X2459,X2460),X2460) )
& ( X2459 = s__UnionFn(X2460,X2458)
| s__instance(X2458,s__SetOrClass) )
& ( X2459 = s__UnionFn(X2460,X2458)
| s__instance(X2459,s__SetOrClass) )
& ( X2459 = s__UnionFn(X2460,X2458)
| s__instance(X2460,s__SetOrClass) )
& ( X2453 != s__UnionFn(X2454,X2452)
| ~ s__instance(X2452,s__SetOrClass)
| ~ s__instance(X2453,s__SetOrClass)
| ~ s__instance(X2454,s__SetOrClass)
| ~ s__instance(X2457,X2453)
| ~ s__instance(X2456,X2452)
| ~ s__instance(X2455,X2454)
| s__instance(X2457,X2452)
| s__instance(X2457,X2454) )
& ( X2453 != s__UnionFn(X2454,X2452)
| ~ s__instance(X2452,s__SetOrClass)
| ~ s__instance(X2453,s__SetOrClass)
| ~ s__instance(X2454,s__SetOrClass)
| ~ s__instance(X2457,X2453)
| ~ s__instance(X2456,X2452)
| ~ s__instance(X2455,X2454)
| s__instance(X2456,X2453) )
& ( X2453 != s__UnionFn(X2454,X2452)
| ~ s__instance(X2452,s__SetOrClass)
| ~ s__instance(X2453,s__SetOrClass)
| ~ s__instance(X2454,s__SetOrClass)
| ~ s__instance(X2457,X2453)
| ~ s__instance(X2456,X2452)
| ~ s__instance(X2455,X2454)
| s__instance(X2455,X2453) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_32603])])])])])])]) ).
cnf(c_0_9,plain,
( ~ s__subclass(X1,X2)
| s__instance(X1,s__SetOrClass) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
s__subclass(s__GraphLoop,s__GraphArc),
inference(split_conjunct,[status(thm)],[kb_SUMO_32707]) ).
cnf(c_0_11,plain,
( X2 = s__UnionFn(X3,X1)
| s__instance(X1,s__SetOrClass) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
s__instance(s__GraphLoop,s__SetOrClass),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
( s__instance(X3,s__SetOrClass)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_11,c_0_11]) ).
fof(c_0_14,plain,
! [X2437,X2438,X2439] :
( s__instance(X2439,X2438)
| ~ s__instance(X2439,X2437)
| ~ s__subclass(X2437,X2438)
| ~ s__instance(X2437,s__SetOrClass)
| ~ s__instance(X2438,s__SetOrClass) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_26636])])]) ).
cnf(c_0_15,plain,
( s__instance(X2,s__SetOrClass)
| s__instance(X1,s__SetOrClass) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
fof(c_0_16,negated_conjecture,
~ ? [X2341] : s__links(X2341,X2341,s__Arc13_1),
inference(assume_negation,[status(cth)],[prove_from_ALL]) ).
cnf(c_0_17,plain,
( ~ s__instance(X3,X2)
| ~ s__subclass(X2,X1)
| ~ s__instance(X2,s__SetOrClass)
| ~ s__instance(X1,s__SetOrClass)
| s__instance(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,plain,
s__instance(X1,s__SetOrClass),
inference(ef,[status(thm)],[c_0_15]) ).
fof(c_0_19,negated_conjecture,
! [X2342] : ~ s__links(X2342,X2342,s__Arc13_1),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])]) ).
fof(c_0_20,plain,
! [X2539,X2541] :
( ( ~ s__instance(X2539,s__GraphArc)
| s__instance(X2539,s__GraphLoop)
| ~ s__links(X2541,X2541,X2539)
| ~ s__instance(X2541,s__GraphNode) )
& ( ~ s__instance(X2539,s__GraphArc)
| ~ s__instance(X2539,s__GraphLoop)
| s__links(esk22_1(X2539),esk22_1(X2539),X2539) )
& ( ~ s__instance(X2539,s__GraphArc)
| ~ s__instance(X2539,s__GraphLoop)
| s__instance(esk22_1(X2539),s__GraphNode) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_32710])])])])])]) ).
cnf(c_0_21,plain,
( ~ s__subclass(X3,X2)
| ~ s__instance(X1,X3)
| s__instance(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18]),c_0_18])]) ).
cnf(c_0_22,negated_conjecture,
~ s__links(X1,X1,s__Arc13_1),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_23,plain,
( ~ s__instance(X1,s__GraphArc)
| ~ s__instance(X1,s__GraphLoop)
| s__links(esk22_1(X1),esk22_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_24,plain,
s__instance(s__Arc13_1,s__GraphLoop),
inference(split_conjunct,[status(thm)],[local_1]) ).
cnf(c_0_25,plain,
( ~ s__instance(X1,s__GraphLoop)
| s__instance(X1,s__GraphArc) ),
inference(spm,[status(thm)],[c_0_21,c_0_10]) ).
cnf(c_0_26,negated_conjecture,
~ s__instance(s__Arc13_1,s__GraphArc),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_27,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_24]),c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : CSR086+6 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.44 % Computer : n001.cluster.edu
% 0.16/0.44 % Model : x86_64 x86_64
% 0.16/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.44 % Memory : 8046.5625MB
% 0.16/0.44 % OS : Linux 6.8.0-71-generic
% 0.16/0.44 % CPULimit : 300
% 0.16/0.44 % WCLimit : 300
% 0.16/0.44 % DateTime : Mon Sep 21 14:58:15 UTC 2026
% 0.16/0.44 % CPUTime :
% 0.16/0.44 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.26/0.51 Running first-order theorem proving
% 0.26/0.51 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
% 5.24/4.63 % Version: 3.5.1
% 5.24/4.63 % Preprocessing class: FMLLSMSLSSSNFFN.
% 5.24/4.63 % Scheduled 4 strats onto 8 cores with 297 seconds (2376 total)
% 5.24/4.63 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1485s (5) cores
% 5.24/4.63 % Starting new_bool_3 with 297s (1) cores
% 5.24/4.63 % Starting new_bool_1 with 297s (1) cores
% 5.24/4.63 % Starting sh5l with 297s (1) cores
% 5.24/4.63 % new_bool_3 with pid 3401603 completed with status 0
% 5.24/4.63 % Result found by new_bool_3
% 5.24/4.63 % Preprocessing class: FMLLSMSLSSSNFFN.
% 5.24/4.63 % Scheduled 4 strats onto 8 cores with 297 seconds (2376 total)
% 5.24/4.63 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1485s (5) cores
% 5.24/4.63 % Starting new_bool_3 with 297s (1) cores
% 5.24/4.63 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 5.24/4.63 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 5.24/4.63 % Search class: FGHSS-FSLM32-MFFFFFNN
% 5.24/4.63 % Scheduled 5 strats onto 1 cores with 297 seconds (297 total)
% 5.24/4.63 % Starting SubtermCWHack with 30s (1) cores
% 5.24/4.63 % SubtermCWHack with pid 3401606 completed with status 0
% 5.24/4.63 % Result found by SubtermCWHack
% 5.24/4.63 % Preprocessing class: FMLLSMSLSSSNFFN.
% 5.24/4.63 % Scheduled 4 strats onto 8 cores with 297 seconds (2376 total)
% 5.24/4.63 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1485s (5) cores
% 5.24/4.63 % Starting new_bool_3 with 297s (1) cores
% 5.24/4.63 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 5.24/4.63 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 5.24/4.63 % Search class: FGHSS-FSLM32-MFFFFFNN
% 5.24/4.63 % Scheduled 5 strats onto 1 cores with 297 seconds (297 total)
% 5.24/4.63 % Starting SubtermCWHack with 30s (1) cores
% 5.24/4.63 % Preprocessing time : 0.025 s
% 5.24/4.63
% 5.24/4.63 % Proof found!
% 5.24/4.63 % SZS status Theorem
% 5.24/4.63 % SZS output start CNFRefutation
% See solution above
% 5.24/4.63 % Parsed axioms : 55588
% 5.24/4.63 % Removed by relevancy pruning/SinE : 55466
% 5.24/4.63 % Initial clauses : 201
% 5.24/4.63 % Removed in clause preprocessing : 14
% 5.24/4.63 % Initial clauses in saturation : 187
% 5.24/4.63 % Processed clauses : 199
% 5.24/4.63 % ...of these trivial : 13
% 5.24/4.63 % ...subsumed : 1
% 5.24/4.63 % ...remaining for further processing : 185
% 5.24/4.63 % Other redundant clauses eliminated : 7
% 5.24/4.63 % Clauses deleted for lack of memory : 0
% 5.24/4.63 % Backward-subsumed : 8
% 5.24/4.63 % Backward-rewritten : 33
% 5.24/4.63 % Generated clauses : 467
% 5.24/4.63 % ...of the previous two non-redundant : 451
% 5.24/4.63 % ...aggressively subsumed : 0
% 5.24/4.63 % Contextual simplify-reflections : 0
% 5.24/4.63 % Paramodulations : 456
% 5.24/4.63 % Factorizations : 4
% 5.24/4.63 % NegExts : 0
% 5.24/4.63 % Equation resolutions : 7
% 5.24/4.63 % Disequality decompositions : 0
% 5.24/4.63 % Total rewrite steps : 63
% 5.24/4.63 % ...of those cached : 21
% 5.24/4.63 % Propositional unsat checks : 0
% 5.24/4.63 % Propositional check models : 0
% 5.24/4.63 % Propositional check unsatisfiable : 0
% 5.24/4.63 % Propositional clauses : 0
% 5.24/4.63 % Propositional clauses after purity: 0
% 5.24/4.63 % Propositional unsat core size : 0
% 5.24/4.63 % Propositional preprocessing time : 0.000
% 5.24/4.63 % Propositional encoding time : 0.000
% 5.24/4.63 % Propositional solver time : 0.000
% 5.24/4.63 % Success case prop preproc time : 0.000
% 5.24/4.63 % Success case prop encoding time : 0.000
% 5.24/4.63 % Success case prop solver time : 0.000
% 5.24/4.63 % Current number of processed clauses : 143
% 5.24/4.63 % Positive orientable unit clauses : 46
% 5.24/4.63 % Positive unorientable unit clauses: 0
% 5.24/4.63 % Negative unit clauses : 2
% 5.24/4.63 % Non-unit-clauses : 95
% 5.24/4.63 % Current number of unprocessed clauses: 104
% 5.24/4.63 % ...number of literals in the above : 583
% 5.24/4.63 % Current number of archived formulas : 0
% 5.24/4.63 % Current number of archived clauses : 41
% 5.24/4.63 % Clause-clause subsumption calls (NU) : 1287
% 5.24/4.63 % Rec. Clause-clause subsumption calls : 817
% 5.24/4.63 % Non-unit clause-clause subsumptions : 4
% 5.24/4.63 % Unit Clause-clause subsumption calls : 111
% 5.24/4.63 % Rewrite failures with RHS unbound : 0
% 5.24/4.63 % BW rewrite match attempts : 54
% 5.24/4.63 % BW rewrite match successes : 32
% 5.24/4.63 % Condensation attempts : 0
% 5.24/4.63 % Condensation successes : 0
% 5.24/4.63 % Termbank termtop insertions : 668761
% 5.24/4.63 % Search garbage collected termcells : 293503
% 5.24/4.63
% 5.24/4.63 % -------------------------------------------------
% 5.24/4.63 % User time : 0.272 s
% 5.24/4.63 % System time : 0.147 s
% 5.24/4.63 % Total time : 0.419 s
% 5.24/4.63 % Maximum resident set size: 137016 pages
% 5.24/4.63
% 5.24/4.63 % -------------------------------------------------
% 5.24/4.63 % User time : 3.714 s
% 5.24/4.63 % System time : 0.314 s
% 5.24/4.63 % Total time : 4.027 s
% 5.24/4.63 % Maximum resident set size: 63744 pages
% 5.24/4.63 % E exiting
%------------------------------------------------------------------------------