%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR099+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 : n007.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:50 PM UTC 2026
% Result : Theorem 0.33s 0.65s
% Output : CNFRefutation 0.33s
% 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,conjecture,
s__Class30_1 = s__Reptile,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_from_SUMO) ).
fof(kb_SUMO_1220,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+0.ax',kb_SUMO_1220) ).
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(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]) ).
fof(c_0_6,plain,
! [X597,X598] :
( X597 = X598
| ~ s__subclass(X598,X597)
| ~ s__subclass(X597,X598)
| ~ s__instance(X597,s__SetOrClass)
| ~ s__instance(X598,s__SetOrClass) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_1220])])]) ).
fof(c_0_7,plain,
! [X591,X592] :
( ( ~ s__subclass(X591,X592)
| s__instance(X592,s__SetOrClass) )
& ( ~ s__subclass(X591,X592)
| s__instance(X591,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+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.11/0.37 % Computer : n007.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 14:56:20 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.42 Running first-order theorem proving
% 0.11/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.33/0.65 % Version: 3.5.1
% 0.33/0.65 % Preprocessing class: FMLLSMSLSSSNFFN.
% 0.33/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.33/0.65 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 0.33/0.65 % Starting new_bool_3 with 300s (1) cores
% 0.33/0.65 % Starting new_bool_1 with 300s (1) cores
% 0.33/0.65 % Starting sh5l with 300s (1) cores
% 0.33/0.65 % new_bool_3 with pid 1358334 completed with status 0
% 0.33/0.65 % Result found by new_bool_3
% 0.33/0.65 % Preprocessing class: FMLLSMSLSSSNFFN.
% 0.33/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.33/0.65 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 0.33/0.65 % Starting new_bool_3 with 300s (1) cores
% 0.33/0.65 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.33/0.65 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.33/0.65 % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.33/0.65 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.33/0.65 % Starting SubtermCWHack with 28s (1) cores
% 0.33/0.65 % SubtermCWHack with pid 1358337 completed with status 0
% 0.33/0.65 % Result found by SubtermCWHack
% 0.33/0.65 % Preprocessing class: FMLLSMSLSSSNFFN.
% 0.33/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.33/0.65 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 0.33/0.65 % Starting new_bool_3 with 300s (1) cores
% 0.33/0.65 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.33/0.65 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.33/0.65 % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.33/0.65 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.33/0.65 % Starting SubtermCWHack with 28s (1) cores
% 0.33/0.65 % Preprocessing time : 0.005 s
% 0.33/0.65
% 0.33/0.65 % Proof found!
% 0.33/0.65 % SZS status Theorem
% 0.33/0.65 % SZS output start CNFRefutation
% See solution above
% 0.33/0.65 % Parsed axioms : 7221
% 0.33/0.65 % Removed by relevancy pruning/SinE : 7184
% 0.33/0.65 % Initial clauses : 47
% 0.33/0.65 % Removed in clause preprocessing : 4
% 0.33/0.65 % Initial clauses in saturation : 43
% 0.33/0.65 % Processed clauses : 55
% 0.33/0.65 % ...of these trivial : 9
% 0.33/0.65 % ...subsumed : 1
% 0.33/0.65 % ...remaining for further processing : 45
% 0.33/0.65 % Other redundant clauses eliminated : 0
% 0.33/0.65 % Clauses deleted for lack of memory : 0
% 0.33/0.65 % Backward-subsumed : 0
% 0.33/0.65 % Backward-rewritten : 1
% 0.33/0.65 % Generated clauses : 41
% 0.33/0.65 % ...of the previous two non-redundant : 22
% 0.33/0.65 % ...aggressively subsumed : 0
% 0.33/0.65 % Contextual simplify-reflections : 5
% 0.33/0.65 % Paramodulations : 41
% 0.33/0.65 % Factorizations : 0
% 0.33/0.65 % NegExts : 0
% 0.33/0.65 % Equation resolutions : 0
% 0.33/0.65 % Disequality decompositions : 0
% 0.33/0.65 % Total rewrite steps : 17
% 0.33/0.65 % ...of those cached : 5
% 0.33/0.65 % Propositional unsat checks : 0
% 0.33/0.65 % Propositional check models : 0
% 0.33/0.65 % Propositional check unsatisfiable : 0
% 0.33/0.65 % Propositional clauses : 0
% 0.33/0.65 % Propositional clauses after purity: 0
% 0.33/0.65 % Propositional unsat core size : 0
% 0.33/0.65 % Propositional preprocessing time : 0.000
% 0.33/0.65 % Propositional encoding time : 0.000
% 0.33/0.65 % Propositional solver time : 0.000
% 0.33/0.65 % Success case prop preproc time : 0.000
% 0.33/0.65 % Success case prop encoding time : 0.000
% 0.33/0.65 % Success case prop solver time : 0.000
% 0.33/0.65 % Current number of processed clauses : 44
% 0.33/0.65 % Positive orientable unit clauses : 29
% 0.33/0.65 % Positive unorientable unit clauses: 0
% 0.33/0.65 % Negative unit clauses : 1
% 0.33/0.65 % Non-unit-clauses : 14
% 0.33/0.65 % Current number of unprocessed clauses: 10
% 0.33/0.65 % ...number of literals in the above : 39
% 0.33/0.65 % Current number of archived formulas : 0
% 0.33/0.65 % Current number of archived clauses : 1
% 0.33/0.65 % Clause-clause subsumption calls (NU) : 16
% 0.33/0.65 % Rec. Clause-clause subsumption calls : 16
% 0.33/0.65 % Non-unit clause-clause subsumptions : 6
% 0.33/0.65 % Unit Clause-clause subsumption calls : 18
% 0.33/0.65 % Rewrite failures with RHS unbound : 0
% 0.33/0.65 % BW rewrite match attempts : 1
% 0.33/0.65 % BW rewrite match successes : 1
% 0.33/0.65 % Condensation attempts : 0
% 0.33/0.65 % Condensation successes : 0
% 0.33/0.65 % Termbank termtop insertions : 79699
% 0.33/0.65 % Search garbage collected termcells : 39403
% 0.33/0.65
% 0.33/0.65 % -------------------------------------------------
% 0.33/0.65 % User time : 0.023 s
% 0.33/0.65 % System time : 0.021 s
% 0.33/0.65 % Total time : 0.044 s
% 0.33/0.65 % Maximum resident set size: 18736 pages
% 0.33/0.65
% 0.33/0.65 % -------------------------------------------------
% 0.33/0.65 % User time : 0.189 s
% 0.33/0.65 % System time : 0.033 s
% 0.33/0.65 % Total time : 0.222 s
% 0.33/0.65 % Maximum resident set size: 12544 pages
% 0.33/0.65 % E exiting
%------------------------------------------------------------------------------