%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : CSR075+2 : 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 : n008.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:36 PM UTC 2026
% Result : Theorem 2.06s 1.50s
% Output : CNFRefutation 2.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 22 ( 10 unt; 0 def)
% Number of atoms : 50 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 50 ( 22 ~; 18 |; 6 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 29 ( 3 sgn 13 !; 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/sandbox2/benchmark/Axioms/CSR003+1.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/sandbox2/benchmark/Axioms/CSR003+1.ax',kb_SUMO_26) ).
fof(prove_from_SUMO_MILO,conjecture,
? [X1223] : s__member(X1223,s__Org1_1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_from_SUMO_MILO) ).
fof(kb_SUMO_734,axiom,
! [X85] :
( s__instance(X85,s__Collection)
=> ? [X51] :
( s__member(X51,X85)
& s__instance(X51,s__SelfConnectedObject) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+1.ax',kb_SUMO_734) ).
fof(kb_SUMO_16630,axiom,
s__subclass(s__Organization,s__Collection),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+4.ax',kb_SUMO_16630) ).
fof(local_1,axiom,
s__instance(s__Org1_1,s__Organization),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_1) ).
fof(c_0_6,plain,
! [X1325,X1326,X1327] :
( s__instance(X1327,X1326)
| ~ s__instance(X1327,X1325)
| ~ s__subclass(X1325,X1326)
| ~ s__instance(X1325,s__SetOrClass)
| ~ s__instance(X1326,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,
! [X1323,X1324] :
( ( ~ s__subclass(X1323,X1324)
| s__instance(X1324,s__SetOrClass) )
& ( ~ s__subclass(X1323,X1324)
| s__instance(X1323,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,
~ ? [X1223] : s__member(X1223,s__Org1_1),
inference(assume_negation,[status(cth)],[prove_from_SUMO_MILO]) ).
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,
! [X1224] : ~ s__member(X1224,s__Org1_1),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
fof(c_0_13,plain,
! [X1227] :
( ( ~ s__instance(X1227,s__Collection)
| s__member(esk1_1(X1227),X1227) )
& ( ~ s__instance(X1227,s__Collection)
| s__instance(esk1_1(X1227),s__SelfConnectedObject) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_734])])])])]) ).
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__Organization,s__Collection),
inference(split_conjunct,[status(thm)],[kb_SUMO_16630]) ).
cnf(c_0_16,negated_conjecture,
~ s__member(X1,s__Org1_1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
( ~ s__instance(X1,s__Collection)
| s__member(esk1_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
( ~ s__instance(X1,s__Organization)
| s__instance(X1,s__Collection) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
s__instance(s__Org1_1,s__Organization),
inference(split_conjunct,[status(thm)],[local_1]) ).
cnf(c_0_20,negated_conjecture,
~ s__instance(s__Org1_1,s__Collection),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR075+2 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n008.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:47:23 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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
% 2.06/1.50 % Version: 3.5.1
% 2.06/1.50 % Preprocessing class: FMLLSMSLSSSNFFN.
% 2.06/1.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.06/1.50 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 2.06/1.50 % Starting new_bool_3 with 300s (1) cores
% 2.06/1.50 % Starting new_bool_1 with 300s (1) cores
% 2.06/1.50 % Starting sh5l with 300s (1) cores
% 2.06/1.50 % new_bool_3 with pid 1238613 completed with status 0
% 2.06/1.50 % Result found by new_bool_3
% 2.06/1.50 % Preprocessing class: FMLLSMSLSSSNFFN.
% 2.06/1.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.06/1.50 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 2.06/1.50 % Starting new_bool_3 with 300s (1) cores
% 2.06/1.50 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 2.06/1.50 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.06/1.50 % Search class: FGHSS-FSLM21-MFFFFFNN
% 2.06/1.50 % partial match(1): FGHSF-FSLM21-MFFFFFNN
% 2.06/1.50 % Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 2.06/1.50 % Starting SubtermCWHack with 28s (1) cores
% 2.06/1.50 % SubtermCWHack with pid 1238616 completed with status 0
% 2.06/1.50 % Result found by SubtermCWHack
% 2.06/1.50 % Preprocessing class: FMLLSMSLSSSNFFN.
% 2.06/1.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.06/1.50 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 2.06/1.50 % Starting new_bool_3 with 300s (1) cores
% 2.06/1.50 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 2.06/1.50 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.06/1.50 % Search class: FGHSS-FSLM21-MFFFFFNN
% 2.06/1.50 % partial match(1): FGHSF-FSLM21-MFFFFFNN
% 2.06/1.50 % Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 2.06/1.50 % Starting SubtermCWHack with 28s (1) cores
% 2.06/1.50 % Preprocessing time : 0.011 s
% 2.06/1.50
% 2.06/1.50 % Proof found!
% 2.06/1.50 % SZS status Theorem
% 2.06/1.50 % SZS output start CNFRefutation
% See solution above
% 2.06/1.50 % Parsed axioms : 37983
% 2.06/1.50 % Removed by relevancy pruning/SinE : 37825
% 2.06/1.50 % Initial clauses : 174
% 2.06/1.50 % Removed in clause preprocessing : 4
% 2.06/1.50 % Initial clauses in saturation : 170
% 2.06/1.50 % Processed clauses : 373
% 2.06/1.50 % ...of these trivial : 101
% 2.06/1.50 % ...subsumed : 6
% 2.06/1.50 % ...remaining for further processing : 266
% 2.06/1.50 % Other redundant clauses eliminated : 1
% 2.06/1.50 % Clauses deleted for lack of memory : 0
% 2.06/1.50 % Backward-subsumed : 0
% 2.06/1.50 % Backward-rewritten : 2
% 2.06/1.50 % Generated clauses : 321
% 2.06/1.50 % ...of the previous two non-redundant : 282
% 2.06/1.50 % ...aggressively subsumed : 0
% 2.06/1.50 % Contextual simplify-reflections : 12
% 2.06/1.50 % Paramodulations : 320
% 2.06/1.50 % Factorizations : 0
% 2.06/1.50 % NegExts : 0
% 2.06/1.50 % Equation resolutions : 1
% 2.06/1.50 % Disequality decompositions : 0
% 2.06/1.50 % Total rewrite steps : 131
% 2.06/1.50 % ...of those cached : 104
% 2.06/1.50 % Propositional unsat checks : 0
% 2.06/1.50 % Propositional check models : 0
% 2.06/1.50 % Propositional check unsatisfiable : 0
% 2.06/1.50 % Propositional clauses : 0
% 2.06/1.50 % Propositional clauses after purity: 0
% 2.06/1.50 % Propositional unsat core size : 0
% 2.06/1.50 % Propositional preprocessing time : 0.000
% 2.06/1.50 % Propositional encoding time : 0.000
% 2.06/1.50 % Propositional solver time : 0.000
% 2.06/1.50 % Success case prop preproc time : 0.000
% 2.06/1.50 % Success case prop encoding time : 0.000
% 2.06/1.50 % Success case prop solver time : 0.000
% 2.06/1.50 % Current number of processed clauses : 263
% 2.06/1.50 % Positive orientable unit clauses : 107
% 2.06/1.50 % Positive unorientable unit clauses: 0
% 2.06/1.50 % Negative unit clauses : 2
% 2.06/1.50 % Non-unit-clauses : 154
% 2.06/1.50 % Current number of unprocessed clauses: 79
% 2.06/1.50 % ...number of literals in the above : 302
% 2.06/1.50 % Current number of archived formulas : 0
% 2.06/1.50 % Current number of archived clauses : 2
% 2.06/1.50 % Clause-clause subsumption calls (NU) : 2558
% 2.06/1.50 % Rec. Clause-clause subsumption calls : 1838
% 2.06/1.50 % Non-unit clause-clause subsumptions : 18
% 2.06/1.50 % Unit Clause-clause subsumption calls : 37
% 2.06/1.50 % Rewrite failures with RHS unbound : 0
% 2.06/1.50 % BW rewrite match attempts : 2
% 2.06/1.50 % BW rewrite match successes : 2
% 2.06/1.50 % Condensation attempts : 0
% 2.06/1.50 % Condensation successes : 0
% 2.06/1.50 % Termbank termtop insertions : 262717
% 2.06/1.50 % Search garbage collected termcells : 126701
% 2.06/1.50
% 2.06/1.50 % -------------------------------------------------
% 2.06/1.50 % User time : 0.138 s
% 2.06/1.50 % System time : 0.076 s
% 2.06/1.50 % Total time : 0.215 s
% 2.06/1.50 % Maximum resident set size: 52068 pages
% 2.06/1.50
% 2.06/1.50 % -------------------------------------------------
% 2.06/1.50 % User time : 0.912 s
% 2.06/1.50 % System time : 0.130 s
% 2.06/1.50 % Total time : 1.041 s
% 2.06/1.50 % Maximum resident set size: 31488 pages
% 2.06/1.50 % E exiting
%------------------------------------------------------------------------------