%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : CSR099+2 : 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 : n016.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:18:52 PM UTC 2026
% Result : Theorem 1.07s 1.59s
% Output : CNFRefutation 1.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 17 ( 10 unt; 0 def)
% Number of atoms : 37 ( 9 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 37 ( 17 ~; 13 |; 4 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 14 ( 1 sgn 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_from_SUMO_MILO,conjecture,
s__Class30_1 = s__Reptile,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_from_SUMO_MILO) ).
fof(kb_SUMO_1443,axiom,
! [X4,X5] :
( ( s__instance(X4,s__SetOrClass)
& s__instance(X5,s__SetOrClass) )
=> ( ( s__subclass(X5,X4)
& s__subclass(X4,X5) )
=> X4 = X5 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+1.ax',kb_SUMO_1443) ).
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+1.ax',kb_SUMO_26) ).
fof(local_2,axiom,
s__subclass(s__Class30_1,s__Reptile),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_2) ).
fof(local_3,axiom,
s__subclass(s__Reptile,s__Class30_1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_3) ).
fof(c_0_5,negated_conjecture,
s__Class30_1 != s__Reptile,
inference(assume_negation,[status(cth)],[prove_from_SUMO_MILO]) ).
fof(c_0_6,plain,
! [X1270,X1271] :
( X1270 = X1271
| ~ s__subclass(X1271,X1270)
| ~ s__subclass(X1270,X1271)
| ~ s__instance(X1270,s__SetOrClass)
| ~ s__instance(X1271,s__SetOrClass) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_1443])])]) ).
fof(c_0_7,plain,
! [X1258,X1259] :
( ( ~ s__subclass(X1258,X1259)
| s__instance(X1259,s__SetOrClass) )
& ( ~ s__subclass(X1258,X1259)
| s__instance(X1258,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,
s__Class30_1 != s__Reptile,
inference(fof_simplification,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( ~ s__subclass(X1,X2)
| ~ s__subclass(X2,X1)
| ~ s__instance(X2,s__SetOrClass)
| ~ s__instance(X1,s__SetOrClass)
| X2 = X1 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( ~ s__subclass(X1,X2)
| s__instance(X1,s__SetOrClass) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_11,negated_conjecture,
s__Class30_1 != s__Reptile,
inference(fof_nnf,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( ~ s__subclass(X1,X2)
| ~ s__subclass(X2,X1)
| X1 = X2 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_9,c_0_10]),c_0_10]) ).
cnf(c_0_13,plain,
s__subclass(s__Class30_1,s__Reptile),
inference(split_conjunct,[status(thm)],[local_2]) ).
cnf(c_0_14,plain,
s__subclass(s__Reptile,s__Class30_1),
inference(split_conjunct,[status(thm)],[local_3]) ).
cnf(c_0_15,negated_conjecture,
s__Class30_1 != s__Reptile,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]),c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR099+2 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.38 % Computer : n016.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Mon Sep 21 15:03:09 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.43 Running first-order theorem proving
% 0.10/0.43 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
% 1.07/1.59 % Version: 3.5.1
% 1.07/1.59 % Preprocessing class: FMLLSMSLSSSNFFN.
% 1.07/1.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.07/1.59 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 1.07/1.59 % Starting new_bool_3 with 300s (1) cores
% 1.07/1.59 % Starting new_bool_1 with 300s (1) cores
% 1.07/1.59 % Starting sh5l with 300s (1) cores
% 1.07/1.59 % new_bool_1 with pid 2695710 completed with status 0
% 1.07/1.59 % Result found by new_bool_1
% 1.07/1.59 % Preprocessing class: FMLLSMSLSSSNFFN.
% 1.07/1.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.07/1.59 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 1.07/1.59 % Starting new_bool_3 with 300s (1) cores
% 1.07/1.59 % Starting new_bool_1 with 300s (1) cores
% 1.07/1.59 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.07/1.59 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.07/1.59 % Search class: FGHSF-FFMM21-SFFFFFNN
% 1.07/1.59 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 1.07/1.59 % Starting SubtermCWHack with 28s (1) cores
% 1.07/1.59 % SubtermCWHack with pid 2695712 completed with status 0
% 1.07/1.59 % Result found by SubtermCWHack
% 1.07/1.59 % Preprocessing class: FMLLSMSLSSSNFFN.
% 1.07/1.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.07/1.59 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 1.07/1.59 % Starting new_bool_3 with 300s (1) cores
% 1.07/1.59 % Starting new_bool_1 with 300s (1) cores
% 1.07/1.59 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.07/1.59 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.07/1.59 % Search class: FGHSF-FFMM21-SFFFFFNN
% 1.07/1.59 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 1.07/1.59 % Starting SubtermCWHack with 28s (1) cores
% 1.07/1.59 % Preprocessing time : 0.010 s
% 1.07/1.59
% 1.07/1.59 % Proof found!
% 1.07/1.59 % SZS status Theorem
% 1.07/1.59 % SZS output start CNFRefutation
% See solution above
% 1.07/1.59 % Parsed axioms : 37985
% 1.07/1.59 % Removed by relevancy pruning/SinE : 37692
% 1.07/1.59 % Initial clauses : 307
% 1.07/1.59 % Removed in clause preprocessing : 4
% 1.07/1.59 % Initial clauses in saturation : 303
% 1.07/1.59 % Processed clauses : 451
% 1.07/1.59 % ...of these trivial : 137
% 1.07/1.59 % ...subsumed : 0
% 1.07/1.59 % ...remaining for further processing : 314
% 1.07/1.59 % Other redundant clauses eliminated : 0
% 1.07/1.59 % Clauses deleted for lack of memory : 0
% 1.07/1.59 % Backward-subsumed : 0
% 1.07/1.59 % Backward-rewritten : 2
% 1.07/1.59 % Generated clauses : 817
% 1.07/1.59 % ...of the previous two non-redundant : 480
% 1.07/1.59 % ...aggressively subsumed : 0
% 1.07/1.59 % Contextual simplify-reflections : 5
% 1.07/1.59 % Paramodulations : 817
% 1.07/1.59 % Factorizations : 0
% 1.07/1.59 % NegExts : 0
% 1.07/1.59 % Equation resolutions : 0
% 1.07/1.59 % Disequality decompositions : 0
% 1.07/1.59 % Total rewrite steps : 215
% 1.07/1.59 % ...of those cached : 196
% 1.07/1.59 % Propositional unsat checks : 0
% 1.07/1.59 % Propositional check models : 0
% 1.07/1.59 % Propositional check unsatisfiable : 0
% 1.07/1.59 % Propositional clauses : 0
% 1.07/1.59 % Propositional clauses after purity: 0
% 1.07/1.59 % Propositional unsat core size : 0
% 1.07/1.59 % Propositional preprocessing time : 0.000
% 1.07/1.59 % Propositional encoding time : 0.000
% 1.07/1.59 % Propositional solver time : 0.000
% 1.07/1.59 % Success case prop preproc time : 0.000
% 1.07/1.59 % Success case prop encoding time : 0.000
% 1.07/1.59 % Success case prop solver time : 0.000
% 1.07/1.59 % Current number of processed clauses : 312
% 1.07/1.59 % Positive orientable unit clauses : 291
% 1.07/1.59 % Positive unorientable unit clauses: 0
% 1.07/1.59 % Negative unit clauses : 1
% 1.07/1.59 % Non-unit-clauses : 20
% 1.07/1.59 % Current number of unprocessed clauses: 332
% 1.07/1.59 % ...number of literals in the above : 387
% 1.07/1.59 % Current number of archived formulas : 0
% 1.07/1.59 % Current number of archived clauses : 2
% 1.07/1.59 % Clause-clause subsumption calls (NU) : 41
% 1.07/1.59 % Rec. Clause-clause subsumption calls : 40
% 1.07/1.59 % Non-unit clause-clause subsumptions : 5
% 1.07/1.59 % Unit Clause-clause subsumption calls : 15
% 1.07/1.59 % Rewrite failures with RHS unbound : 0
% 1.07/1.59 % BW rewrite match attempts : 2
% 1.07/1.59 % BW rewrite match successes : 2
% 1.07/1.59 % Condensation attempts : 0
% 1.07/1.59 % Condensation successes : 0
% 1.07/1.59 % Termbank termtop insertions : 260441
% 1.07/1.59 % Search garbage collected termcells : 125414
% 1.07/1.59
% 1.07/1.59 % -------------------------------------------------
% 1.07/1.59 % User time : 0.116 s
% 1.07/1.59 % System time : 0.081 s
% 1.07/1.59 % Total time : 0.197 s
% 1.07/1.59 % Maximum resident set size: 52068 pages
% 1.07/1.59
% 1.07/1.59 % -------------------------------------------------
% 1.07/1.59 % User time : 0.980 s
% 1.07/1.59 % System time : 0.137 s
% 1.07/1.59 % Total time : 1.117 s
% 1.07/1.59 % Maximum resident set size: 31744 pages
% 1.07/1.59 % E exiting
%------------------------------------------------------------------------------