%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR086+4 : 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 : 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 12:16:41 PM UTC 2026
% Result : Theorem 0.34s 0.66s
% Output : CNFRefutation 0.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 22 ( 10 unt; 0 def)
% Number of atoms : 58 ( 0 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 64 ( 28 ~; 24 |; 7 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 30 ( 2 sgn 14 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(kb_SUMO_27,axiom,
! [X6,X7,X8] :
( ( s__instance(X6,s__SetOrClass)
& s__instance(X7,s__SetOrClass) )
=> ( ( s__instance(X8,X6)
& s__subclass(X6,X7) )
=> s__instance(X8,X7) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+0.ax',kb_SUMO_27) ).
fof(kb_SUMO_26,axiom,
! [X6,X7] :
( s__subclass(X6,X7)
=> ( s__instance(X7,s__SetOrClass)
& s__instance(X6,s__SetOrClass) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+0.ax',kb_SUMO_26) ).
fof(prove_from_SUMO,conjecture,
? [X591] : s__links(X591,X591,s__Arc13_1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_from_SUMO) ).
fof(kb_SUMO_3603,axiom,
! [X185] :
( s__instance(X185,s__GraphArc)
=> ( s__instance(X185,s__GraphLoop)
<=> ? [X186] :
( s__links(X186,X186,X185)
& s__instance(X186,s__GraphNode) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+0.ax',kb_SUMO_3603) ).
fof(kb_SUMO_3600,axiom,
s__subclass(s__GraphLoop,s__GraphArc),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+0.ax',kb_SUMO_3600) ).
fof(local_1,axiom,
s__instance(s__Arc13_1,s__GraphLoop),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_1) ).
fof(c_0_6,plain,
! [X689,X690,X691] :
( s__instance(X691,X690)
| ~ s__instance(X691,X689)
| ~ s__subclass(X689,X690)
| ~ s__instance(X689,s__SetOrClass)
| ~ s__instance(X690,s__SetOrClass) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_27])])]) ).
fof(c_0_7,plain,
! [X687,X688] :
( ( ~ s__subclass(X687,X688)
| s__instance(X688,s__SetOrClass) )
& ( ~ s__subclass(X687,X688)
| s__instance(X687,s__SetOrClass) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_26])])])]) ).
fof(c_0_8,negated_conjecture,
~ ? [X591] : s__links(X591,X591,s__Arc13_1),
inference(assume_negation,[status(cth)],[prove_from_SUMO]) ).
cnf(c_0_9,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_6]) ).
cnf(c_0_10,plain,
( ~ s__subclass(X2,X1)
| s__instance(X1,s__SetOrClass) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( ~ s__subclass(X1,X2)
| s__instance(X1,s__SetOrClass) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_12,negated_conjecture,
! [X592] : ~ s__links(X592,X592,s__Arc13_1),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
fof(c_0_13,plain,
! [X681,X683] :
( ( ~ s__instance(X681,s__GraphArc)
| s__instance(X681,s__GraphLoop)
| ~ s__links(X683,X683,X681)
| ~ s__instance(X683,s__GraphNode) )
& ( ~ s__instance(X681,s__GraphArc)
| ~ s__instance(X681,s__GraphLoop)
| s__links(esk11_1(X681),esk11_1(X681),X681) )
& ( ~ s__instance(X681,s__GraphArc)
| ~ s__instance(X681,s__GraphLoop)
| s__instance(esk11_1(X681),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_3603])])])])])]) ).
cnf(c_0_14,plain,
( ~ s__instance(X1,X3)
| ~ s__subclass(X3,X2)
| s__instance(X1,X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
cnf(c_0_15,plain,
s__subclass(s__GraphLoop,s__GraphArc),
inference(split_conjunct,[status(thm)],[kb_SUMO_3600]) ).
cnf(c_0_16,negated_conjecture,
~ s__links(X1,X1,s__Arc13_1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
( ~ s__instance(X1,s__GraphArc)
| ~ s__instance(X1,s__GraphLoop)
| s__links(esk11_1(X1),esk11_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
s__instance(s__Arc13_1,s__GraphLoop),
inference(split_conjunct,[status(thm)],[local_1]) ).
cnf(c_0_19,plain,
( ~ s__instance(X1,s__GraphLoop)
| s__instance(X1,s__GraphArc) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,negated_conjecture,
~ s__instance(s__Arc13_1,s__GraphArc),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
cnf(c_0_21,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_18]),c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR086+4 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n002.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 21 14:55:03 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/0.42 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.34/0.66 % Version: 3.5.1
% 0.34/0.66 % Preprocessing class: FMLLSMSLSSSNFFN.
% 0.34/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.34/0.66 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 0.34/0.66 % Starting new_bool_3 with 300s (1) cores
% 0.34/0.66 % Starting new_bool_1 with 300s (1) cores
% 0.34/0.66 % Starting sh5l with 300s (1) cores
% 0.34/0.66 % new_bool_1 with pid 3546114 completed with status 0
% 0.34/0.66 % Result found by new_bool_1
% 0.34/0.66 % Preprocessing class: FMLLSMSLSSSNFFN.
% 0.34/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.34/0.66 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 0.34/0.66 % Starting new_bool_3 with 300s (1) cores
% 0.34/0.66 % Starting new_bool_1 with 300s (1) cores
% 0.34/0.66 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.34/0.66 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.34/0.66 % Search class: FGHSS-FFMM31-MFFFFFNN
% 0.34/0.66 % partial match(1): FGHSM-FFMM31-MFFFFFNN
% 0.34/0.66 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.34/0.66 % Starting SubtermCWHack with 28s (1) cores
% 0.34/0.66 % SubtermCWHack with pid 3546118 completed with status 0
% 0.34/0.66 % Result found by SubtermCWHack
% 0.34/0.66 % Preprocessing class: FMLLSMSLSSSNFFN.
% 0.34/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.34/0.66 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 0.34/0.66 % Starting new_bool_3 with 300s (1) cores
% 0.34/0.66 % Starting new_bool_1 with 300s (1) cores
% 0.34/0.66 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.34/0.66 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.34/0.66 % Search class: FGHSS-FFMM31-MFFFFFNN
% 0.34/0.66 % partial match(1): FGHSM-FFMM31-MFFFFFNN
% 0.34/0.66 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.34/0.66 % Starting SubtermCWHack with 28s (1) cores
% 0.34/0.66 % Preprocessing time : 0.006 s
% 0.34/0.66
% 0.34/0.66 % Proof found!
% 0.34/0.66 % SZS status Theorem
% 0.34/0.66 % SZS output start CNFRefutation
% See solution above
% 0.34/0.66 % Parsed axioms : 7219
% 0.34/0.66 % Removed by relevancy pruning/SinE : 7154
% 0.34/0.66 % Initial clauses : 90
% 0.34/0.66 % Removed in clause preprocessing : 8
% 0.34/0.66 % Initial clauses in saturation : 82
% 0.34/0.66 % Processed clauses : 86
% 0.34/0.66 % ...of these trivial : 3
% 0.34/0.66 % ...subsumed : 0
% 0.34/0.66 % ...remaining for further processing : 83
% 0.34/0.66 % Other redundant clauses eliminated : 1
% 0.34/0.66 % Clauses deleted for lack of memory : 0
% 0.34/0.66 % Backward-subsumed : 0
% 0.34/0.66 % Backward-rewritten : 0
% 0.34/0.66 % Generated clauses : 47
% 0.34/0.66 % ...of the previous two non-redundant : 37
% 0.34/0.66 % ...aggressively subsumed : 0
% 0.34/0.66 % Contextual simplify-reflections : 6
% 0.34/0.66 % Paramodulations : 46
% 0.34/0.66 % Factorizations : 0
% 0.34/0.66 % NegExts : 0
% 0.34/0.66 % Equation resolutions : 1
% 0.34/0.66 % Disequality decompositions : 0
% 0.34/0.66 % Total rewrite steps : 6
% 0.34/0.66 % ...of those cached : 2
% 0.34/0.66 % Propositional unsat checks : 0
% 0.34/0.66 % Propositional check models : 0
% 0.34/0.66 % Propositional check unsatisfiable : 0
% 0.34/0.66 % Propositional clauses : 0
% 0.34/0.66 % Propositional clauses after purity: 0
% 0.34/0.66 % Propositional unsat core size : 0
% 0.34/0.66 % Propositional preprocessing time : 0.000
% 0.34/0.66 % Propositional encoding time : 0.000
% 0.34/0.66 % Propositional solver time : 0.000
% 0.34/0.66 % Success case prop preproc time : 0.000
% 0.34/0.66 % Success case prop encoding time : 0.000
% 0.34/0.66 % Success case prop solver time : 0.000
% 0.34/0.66 % Current number of processed clauses : 82
% 0.34/0.66 % Positive orientable unit clauses : 29
% 0.34/0.66 % Positive unorientable unit clauses: 0
% 0.34/0.66 % Negative unit clauses : 2
% 0.34/0.66 % Non-unit-clauses : 51
% 0.34/0.66 % Current number of unprocessed clauses: 33
% 0.34/0.66 % ...number of literals in the above : 149
% 0.34/0.66 % Current number of archived formulas : 0
% 0.34/0.66 % Current number of archived clauses : 0
% 0.34/0.66 % Clause-clause subsumption calls (NU) : 283
% 0.34/0.66 % Rec. Clause-clause subsumption calls : 227
% 0.34/0.66 % Non-unit clause-clause subsumptions : 6
% 0.34/0.66 % Unit Clause-clause subsumption calls : 10
% 0.34/0.66 % Rewrite failures with RHS unbound : 0
% 0.34/0.66 % BW rewrite match attempts : 0
% 0.34/0.66 % BW rewrite match successes : 0
% 0.34/0.66 % Condensation attempts : 0
% 0.34/0.66 % Condensation successes : 0
% 0.34/0.66 % Termbank termtop insertions : 84759
% 0.34/0.66 % Search garbage collected termcells : 40034
% 0.34/0.66
% 0.34/0.66 % -------------------------------------------------
% 0.34/0.66 % User time : 0.032 s
% 0.34/0.66 % System time : 0.017 s
% 0.34/0.66 % Total time : 0.049 s
% 0.34/0.66 % Maximum resident set size: 18940 pages
% 0.34/0.66
% 0.34/0.66 % -------------------------------------------------
% 0.34/0.66 % User time : 0.184 s
% 0.34/0.66 % System time : 0.037 s
% 0.34/0.66 % Total time : 0.221 s
% 0.34/0.66 % Maximum resident set size: 12544 pages
% 0.34/0.66 % E exiting
%------------------------------------------------------------------------------