%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR101+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 : 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:16:52 PM UTC 2026
% Result : Theorem 5.05s 3.81s
% Output : CNFRefutation 5.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 21 ( 7 unt; 0 def)
% Number of atoms : 48 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 47 ( 20 ~; 17 |; 5 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 25 ( 2 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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(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(local_9,axiom,
s__subclass(s__Class32_3,s__Class32_1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_9) ).
fof(local_8,axiom,
s__subclass(s__Class32_2,s__Class32_3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_8) ).
fof(prove_from_ALL,conjecture,
! [X2341] :
( s__instance(X2341,s__Class32_2)
=> s__instance(X2341,s__Class32_1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_from_ALL) ).
fof(c_0_5,plain,
! [X2345,X2346,X2347] :
( s__instance(X2347,X2346)
| ~ s__instance(X2347,X2345)
| ~ s__subclass(X2345,X2346)
| ~ s__instance(X2345,s__SetOrClass)
| ~ s__instance(X2346,s__SetOrClass) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_26636])])]) ).
fof(c_0_6,plain,
! [X2343,X2344] :
( ( ~ s__subclass(X2343,X2344)
| s__instance(X2344,s__SetOrClass) )
& ( ~ s__subclass(X2343,X2344)
| s__instance(X2343,s__SetOrClass) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_26635])])])]) ).
cnf(c_0_7,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_5]) ).
cnf(c_0_8,plain,
( ~ s__subclass(X2,X1)
| s__instance(X1,s__SetOrClass) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
( ~ s__subclass(X1,X2)
| s__instance(X1,s__SetOrClass) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( ~ s__subclass(X3,X2)
| ~ s__instance(X1,X3)
| s__instance(X1,X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_7,c_0_8]),c_0_9]) ).
cnf(c_0_11,plain,
s__subclass(s__Class32_3,s__Class32_1),
inference(split_conjunct,[status(thm)],[local_9]) ).
cnf(c_0_12,plain,
s__subclass(s__Class32_2,s__Class32_3),
inference(split_conjunct,[status(thm)],[local_8]) ).
fof(c_0_13,negated_conjecture,
~ ! [X2341] :
( s__instance(X2341,s__Class32_2)
=> s__instance(X2341,s__Class32_1) ),
inference(assume_negation,[status(cth)],[prove_from_ALL]) ).
cnf(c_0_14,plain,
( ~ s__instance(X1,s__Class32_3)
| s__instance(X1,s__Class32_1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
( ~ s__instance(X1,s__Class32_2)
| s__instance(X1,s__Class32_3) ),
inference(spm,[status(thm)],[c_0_10,c_0_12]) ).
fof(c_0_16,negated_conjecture,
( ~ s__instance(esk1_0,s__Class32_1)
& s__instance(esk1_0,s__Class32_2) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])]) ).
cnf(c_0_17,plain,
( ~ s__instance(X1,s__Class32_2)
| s__instance(X1,s__Class32_1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
s__instance(esk1_0,s__Class32_2),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_19,negated_conjecture,
~ s__instance(esk1_0,s__Class32_1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : CSR101+6 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.41 % Computer : n016.cluster.edu
% 0.15/0.41 % Model : x86_64 x86_64
% 0.15/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.41 % Memory : 8046.5625MB
% 0.15/0.41 % OS : Linux 6.8.0-71-generic
% 0.15/0.41 % CPULimit : 300
% 0.15/0.41 % WCLimit : 300
% 0.15/0.41 % DateTime : Mon Sep 21 15:03:38 UTC 2026
% 0.15/0.42 % CPUTime :
% 0.15/0.42 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.49 Running first-order theorem proving
% 0.15/0.49 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.05/3.81 % Version: 3.5.1
% 5.05/3.81 % Preprocessing class: FMLLSMSLSSSNFFN.
% 5.05/3.81 % Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 5.05/3.81 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1490s (5) cores
% 5.05/3.81 % Starting new_bool_3 with 298s (1) cores
% 5.05/3.81 % Starting new_bool_1 with 298s (1) cores
% 5.05/3.81 % Starting sh5l with 298s (1) cores
% 5.05/3.81 % new_bool_1 with pid 2696657 completed with status 0
% 5.05/3.81 % Result found by new_bool_1
% 5.05/3.81 % Preprocessing class: FMLLSMSLSSSNFFN.
% 5.05/3.81 % Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 5.05/3.81 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1490s (5) cores
% 5.05/3.81 % Starting new_bool_3 with 298s (1) cores
% 5.05/3.81 % Starting new_bool_1 with 298s (1) cores
% 5.05/3.81 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 5.05/3.81 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 5.05/3.81 % Search class: FHUSF-FFSM00-SFFFFFNN
% 5.05/3.81 % partial match(1): FHUNF-FFSM00-SFFFFFNN
% 5.05/3.81 % Scheduled 5 strats onto 1 cores with 298 seconds (298 total)
% 5.05/3.81 % Starting SubtermCWHack with 30s (1) cores
% 5.05/3.81 % SubtermCWHack with pid 2696659 completed with status 0
% 5.05/3.81 % Result found by SubtermCWHack
% 5.05/3.81 % Preprocessing class: FMLLSMSLSSSNFFN.
% 5.05/3.81 % Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 5.05/3.81 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1490s (5) cores
% 5.05/3.81 % Starting new_bool_3 with 298s (1) cores
% 5.05/3.81 % Starting new_bool_1 with 298s (1) cores
% 5.05/3.81 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 5.05/3.81 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 5.05/3.81 % Search class: FHUSF-FFSM00-SFFFFFNN
% 5.05/3.81 % partial match(1): FHUNF-FFSM00-SFFFFFNN
% 5.05/3.81 % Scheduled 5 strats onto 1 cores with 298 seconds (298 total)
% 5.05/3.81 % Starting SubtermCWHack with 30s (1) cores
% 5.05/3.81 % Preprocessing time : 0.103 s
% 5.05/3.81
% 5.05/3.81 % Proof found!
% 5.05/3.81 % SZS status Theorem
% 5.05/3.81 % SZS output start CNFRefutation
% See solution above
% 5.05/3.81 % Parsed axioms : 55596
% 5.05/3.81 % Removed by relevancy pruning/SinE : 55576
% 5.05/3.81 % Initial clauses : 24
% 5.05/3.81 % Removed in clause preprocessing : 4
% 5.05/3.81 % Initial clauses in saturation : 20
% 5.05/3.81 % Processed clauses : 59
% 5.05/3.81 % ...of these trivial : 3
% 5.05/3.81 % ...subsumed : 1
% 5.05/3.81 % ...remaining for further processing : 55
% 5.05/3.81 % Other redundant clauses eliminated : 0
% 5.05/3.81 % Clauses deleted for lack of memory : 0
% 5.05/3.81 % Backward-subsumed : 0
% 5.05/3.81 % Backward-rewritten : 0
% 5.05/3.81 % Generated clauses : 92
% 5.05/3.81 % ...of the previous two non-redundant : 48
% 5.05/3.81 % ...aggressively subsumed : 0
% 5.05/3.81 % Contextual simplify-reflections : 7
% 5.05/3.81 % Paramodulations : 92
% 5.05/3.81 % Factorizations : 0
% 5.05/3.81 % NegExts : 0
% 5.05/3.81 % Equation resolutions : 0
% 5.05/3.81 % Disequality decompositions : 0
% 5.05/3.81 % Total rewrite steps : 29
% 5.05/3.81 % ...of those cached : 21
% 5.05/3.81 % Propositional unsat checks : 0
% 5.05/3.81 % Propositional check models : 0
% 5.05/3.81 % Propositional check unsatisfiable : 0
% 5.05/3.81 % Propositional clauses : 0
% 5.05/3.81 % Propositional clauses after purity: 0
% 5.05/3.81 % Propositional unsat core size : 0
% 5.05/3.81 % Propositional preprocessing time : 0.000
% 5.05/3.81 % Propositional encoding time : 0.000
% 5.05/3.81 % Propositional solver time : 0.000
% 5.05/3.81 % Success case prop preproc time : 0.000
% 5.05/3.81 % Success case prop encoding time : 0.000
% 5.05/3.81 % Success case prop solver time : 0.000
% 5.05/3.81 % Current number of processed clauses : 55
% 5.05/3.81 % Positive orientable unit clauses : 29
% 5.05/3.81 % Positive unorientable unit clauses: 0
% 5.05/3.81 % Negative unit clauses : 1
% 5.05/3.81 % Non-unit-clauses : 25
% 5.05/3.81 % Current number of unprocessed clauses: 9
% 5.05/3.81 % ...number of literals in the above : 18
% 5.05/3.81 % Current number of archived formulas : 0
% 5.05/3.81 % Current number of archived clauses : 0
% 5.05/3.81 % Clause-clause subsumption calls (NU) : 37
% 5.05/3.81 % Rec. Clause-clause subsumption calls : 24
% 5.05/3.81 % Non-unit clause-clause subsumptions : 8
% 5.05/3.81 % Unit Clause-clause subsumption calls : 0
% 5.05/3.81 % Rewrite failures with RHS unbound : 0
% 5.05/3.81 % BW rewrite match attempts : 0
% 5.05/3.81 % BW rewrite match successes : 0
% 5.05/3.81 % Condensation attempts : 0
% 5.05/3.81 % Condensation successes : 0
% 5.05/3.81 % Termbank termtop insertions : 650039
% 5.05/3.81 % Search garbage collected termcells : 291036
% 5.05/3.81
% 5.05/3.81 % -------------------------------------------------
% 5.05/3.81 % User time : 0.313 s
% 5.05/3.81 % System time : 0.244 s
% 5.05/3.81 % Total time : 0.557 s
% 5.05/3.81 % Maximum resident set size: 136708 pages
% 5.05/3.81
% 5.05/3.81 % -------------------------------------------------
% 5.05/3.81 % User time : 2.867 s
% 5.05/3.81 % System time : 0.392 s
% 5.05/3.81 % Total time : 3.259 s
% 5.05/3.81 % Maximum resident set size: 64000 pages
% 5.05/3.81 % E exiting
%------------------------------------------------------------------------------