%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR099+6 : TPTP v9.3.1. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n004.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 4.06s 3.27s
% Output : CNFRefutation 4.06s
% 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_ALL,conjecture,
s__Class30_1 = s__Reptile,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_from_ALL) ).
fof(kb_SUMO_28267,axiom,
! [X1034,X1035] :
( ( s__instance(X1034,s__SetOrClass)
& s__instance(X1035,s__SetOrClass) )
=> ( ( s__subclass(X1035,X1034)
& s__subclass(X1034,X1035) )
=> X1034 = X1035 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+2.ax',kb_SUMO_28267) ).
fof(kb_SUMO_26635,axiom,
! [X1,X15] :
( s__subclass(X1,X15)
=> ( s__instance(X15,s__SetOrClass)
& s__instance(X1,s__SetOrClass) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+2.ax',kb_SUMO_26635) ).
fof(local_2,axiom,
s__subclass(s__Class30_1,s__Reptile),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_2) ).
fof(local_3,axiom,
s__subclass(s__Reptile,s__Class30_1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_3) ).
fof(c_0_5,negated_conjecture,
s__Class30_1 != s__Reptile,
inference(assume_negation,[status(cth)],[prove_from_ALL]) ).
fof(c_0_6,plain,
! [X2347,X2348] :
( X2347 = X2348
| ~ s__subclass(X2348,X2347)
| ~ s__subclass(X2347,X2348)
| ~ s__instance(X2347,s__SetOrClass)
| ~ s__instance(X2348,s__SetOrClass) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_28267])])]) ).
fof(c_0_7,plain,
! [X2341,X2342] :
( ( ~ s__subclass(X2341,X2342)
| s__instance(X2342,s__SetOrClass) )
& ( ~ s__subclass(X2341,X2342)
| s__instance(X2341,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,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.02 % Problem : CSR099+6 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n004.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 14:58:20 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.45 Running first-order theorem proving
% 0.15/0.45 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 4.06/3.27 % Version: 3.5.1
% 4.06/3.27 % Preprocessing class: FMLLSMSLSSSNFFN.
% 4.06/3.27 % Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 4.06/3.27 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1490s (5) cores
% 4.06/3.27 % Starting new_bool_3 with 298s (1) cores
% 4.06/3.27 % Starting new_bool_1 with 298s (1) cores
% 4.06/3.27 % Starting sh5l with 298s (1) cores
% 4.06/3.27 % new_bool_3 with pid 3413129 completed with status 0
% 4.06/3.27 % Result found by new_bool_3
% 4.06/3.27 % Preprocessing class: FMLLSMSLSSSNFFN.
% 4.06/3.27 % Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 4.06/3.27 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1490s (5) cores
% 4.06/3.27 % Starting new_bool_3 with 298s (1) cores
% 4.06/3.27 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 4.06/3.27 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 4.06/3.27 % Search class: FGHSF-FFMM32-SFFFFFNN
% 4.06/3.27 % Scheduled 7 strats onto 1 cores with 298 seconds (298 total)
% 4.06/3.27 % Starting SubtermCWHack with 27s (1) cores
% 4.06/3.27 % SubtermCWHack with pid 3413132 completed with status 0
% 4.06/3.27 % Result found by SubtermCWHack
% 4.06/3.27 % Preprocessing class: FMLLSMSLSSSNFFN.
% 4.06/3.27 % Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 4.06/3.27 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1490s (5) cores
% 4.06/3.27 % Starting new_bool_3 with 298s (1) cores
% 4.06/3.27 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 4.06/3.27 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 4.06/3.27 % Search class: FGHSF-FFMM32-SFFFFFNN
% 4.06/3.27 % Scheduled 7 strats onto 1 cores with 298 seconds (298 total)
% 4.06/3.27 % Starting SubtermCWHack with 27s (1) cores
% 4.06/3.27 % Preprocessing time : 0.100 s
% 4.06/3.27
% 4.06/3.27 % Proof found!
% 4.06/3.27 % SZS status Theorem
% 4.06/3.27 % SZS output start CNFRefutation
% See solution above
% 4.06/3.27 % Parsed axioms : 55590
% 4.06/3.27 % Removed by relevancy pruning/SinE : 55545
% 4.06/3.27 % Initial clauses : 75
% 4.06/3.27 % Removed in clause preprocessing : 6
% 4.06/3.27 % Initial clauses in saturation : 69
% 4.06/3.27 % Processed clauses : 66
% 4.06/3.27 % ...of these trivial : 5
% 4.06/3.27 % ...subsumed : 2
% 4.06/3.27 % ...remaining for further processing : 59
% 4.06/3.27 % Other redundant clauses eliminated : 0
% 4.06/3.27 % Clauses deleted for lack of memory : 0
% 4.06/3.27 % Backward-subsumed : 0
% 4.06/3.27 % Backward-rewritten : 0
% 4.06/3.27 % Generated clauses : 47
% 4.06/3.27 % ...of the previous two non-redundant : 24
% 4.06/3.27 % ...aggressively subsumed : 0
% 4.06/3.27 % Contextual simplify-reflections : 5
% 4.06/3.27 % Paramodulations : 47
% 4.06/3.27 % Factorizations : 0
% 4.06/3.27 % NegExts : 0
% 4.06/3.27 % Equation resolutions : 0
% 4.06/3.27 % Disequality decompositions : 0
% 4.06/3.27 % Total rewrite steps : 16
% 4.06/3.27 % ...of those cached : 5
% 4.06/3.27 % Propositional unsat checks : 0
% 4.06/3.27 % Propositional check models : 0
% 4.06/3.27 % Propositional check unsatisfiable : 0
% 4.06/3.27 % Propositional clauses : 0
% 4.06/3.27 % Propositional clauses after purity: 0
% 4.06/3.27 % Propositional unsat core size : 0
% 4.06/3.27 % Propositional preprocessing time : 0.000
% 4.06/3.27 % Propositional encoding time : 0.000
% 4.06/3.27 % Propositional solver time : 0.000
% 4.06/3.27 % Success case prop preproc time : 0.000
% 4.06/3.27 % Success case prop encoding time : 0.000
% 4.06/3.27 % Success case prop solver time : 0.000
% 4.06/3.27 % Current number of processed clauses : 59
% 4.06/3.27 % Positive orientable unit clauses : 36
% 4.06/3.27 % Positive unorientable unit clauses: 0
% 4.06/3.27 % Negative unit clauses : 1
% 4.06/3.27 % Non-unit-clauses : 22
% 4.06/3.27 % Current number of unprocessed clauses: 27
% 4.06/3.27 % ...number of literals in the above : 155
% 4.06/3.27 % Current number of archived formulas : 0
% 4.06/3.27 % Current number of archived clauses : 0
% 4.06/3.27 % Clause-clause subsumption calls (NU) : 66
% 4.06/3.27 % Rec. Clause-clause subsumption calls : 49
% 4.06/3.27 % Non-unit clause-clause subsumptions : 7
% 4.06/3.27 % Unit Clause-clause subsumption calls : 26
% 4.06/3.27 % Rewrite failures with RHS unbound : 0
% 4.06/3.27 % BW rewrite match attempts : 0
% 4.06/3.27 % BW rewrite match successes : 0
% 4.06/3.27 % Condensation attempts : 0
% 4.06/3.27 % Condensation successes : 0
% 4.06/3.27 % Termbank termtop insertions : 654089
% 4.06/3.27 % Search garbage collected termcells : 291764
% 4.06/3.27
% 4.06/3.27 % -------------------------------------------------
% 4.06/3.27 % User time : 0.202 s
% 4.06/3.27 % System time : 0.164 s
% 4.06/3.27 % Total time : 0.366 s
% 4.06/3.27 % Maximum resident set size: 136760 pages
% 4.06/3.27
% 4.06/3.27 % -------------------------------------------------
% 4.06/3.27 % User time : 2.361 s
% 4.06/3.27 % System time : 0.276 s
% 4.06/3.27 % Total time : 2.637 s
% 4.06/3.27 % Maximum resident set size: 63744 pages
% 4.06/3.27 % E exiting
%------------------------------------------------------------------------------