%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR104+5 : 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 : n003.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:54 PM UTC 2026
% Result : Theorem 1.53s 6.30s
% Output : CNFRefutation 1.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of formulae : 41 ( 23 unt; 0 def)
% Number of atoms : 92 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 93 ( 42 ~; 36 |; 8 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 7 con; 0-0 aty)
% Number of variables : 38 ( 2 sgn 20 !; 0 ?)
% 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(kb_SUMO_1016,axiom,
s__subclass(s__TimePoint,s__TimePosition),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+1.ax',kb_SUMO_1016) ).
fof(prove_from_SUMO_MILO,conjecture,
s__temporalPart(s__TimePoint35_1,s__TimeInterval35_2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_from_SUMO_MILO) ).
fof(kb_SUMO_1502,axiom,
! [X4,X5,X105] :
( ( s__instance(X4,s__TimePosition)
& s__instance(X5,s__TimePosition)
& s__instance(X105,s__TimePosition) )
=> ( ( s__temporalPart(X5,X105)
& s__temporalPart(X4,X5) )
=> s__temporalPart(X4,X105) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+1.ax',kb_SUMO_1502) ).
fof(local_1,axiom,
s__instance(s__TimePoint35_1,s__TimePoint),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_1) ).
fof(kb_SUMO_68,axiom,
! [X15,X16] :
( ( s__instance(X15,s__TimeInterval)
& s__instance(X16,s__TimeInterval) )
=> ( s__during(X15,X16)
=> s__temporalPart(X15,X16) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+1.ax',kb_SUMO_68) ).
fof(local_4,axiom,
s__temporalPart(s__TimePoint35_1,s__TimeInterval35_1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_4) ).
fof(local_5,axiom,
s__during(s__TimeInterval35_1,s__TimeInterval35_2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_5) ).
fof(local_2,axiom,
s__instance(s__TimeInterval35_1,s__TimeInterval),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_2) ).
fof(local_3,axiom,
s__instance(s__TimeInterval35_2,s__TimeInterval),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_3) ).
fof(kb_SUMO_1012,axiom,
s__subclass(s__TimeInterval,s__TimePosition),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+1.ax',kb_SUMO_1012) ).
fof(c_0_12,plain,
! [X1423,X1424,X1425] :
( s__instance(X1425,X1424)
| ~ s__instance(X1425,X1423)
| ~ s__subclass(X1423,X1424)
| ~ s__instance(X1423,s__SetOrClass)
| ~ s__instance(X1424,s__SetOrClass) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_27])])]) ).
fof(c_0_13,plain,
! [X1421,X1422] :
( ( ~ s__subclass(X1421,X1422)
| s__instance(X1422,s__SetOrClass) )
& ( ~ s__subclass(X1421,X1422)
| s__instance(X1421,s__SetOrClass) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_26])])])]) ).
cnf(c_0_14,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_12]) ).
cnf(c_0_15,plain,
( ~ s__subclass(X2,X1)
| s__instance(X1,s__SetOrClass) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,plain,
( ~ s__subclass(X1,X2)
| s__instance(X1,s__SetOrClass) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,plain,
( ~ s__instance(X1,X3)
| ~ s__subclass(X3,X2)
| s__instance(X1,X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_18,plain,
s__subclass(s__TimePoint,s__TimePosition),
inference(split_conjunct,[status(thm)],[kb_SUMO_1016]) ).
fof(c_0_19,negated_conjecture,
~ s__temporalPart(s__TimePoint35_1,s__TimeInterval35_2),
inference(assume_negation,[status(cth)],[prove_from_SUMO_MILO]) ).
fof(c_0_20,plain,
! [X1230,X1231,X1232] :
( s__temporalPart(X1230,X1232)
| ~ s__temporalPart(X1231,X1232)
| ~ s__temporalPart(X1230,X1231)
| ~ s__instance(X1230,s__TimePosition)
| ~ s__instance(X1231,s__TimePosition)
| ~ s__instance(X1232,s__TimePosition) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_1502])])]) ).
cnf(c_0_21,plain,
( ~ s__instance(X1,s__TimePoint)
| s__instance(X1,s__TimePosition) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
s__instance(s__TimePoint35_1,s__TimePoint),
inference(split_conjunct,[status(thm)],[local_1]) ).
fof(c_0_23,plain,
! [X1370,X1371] :
( s__temporalPart(X1370,X1371)
| ~ s__during(X1370,X1371)
| ~ s__instance(X1370,s__TimeInterval)
| ~ s__instance(X1371,s__TimeInterval) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_68])])]) ).
fof(c_0_24,negated_conjecture,
~ s__temporalPart(s__TimePoint35_1,s__TimeInterval35_2),
inference(fof_simplification,[status(thm)],[c_0_19]) ).
cnf(c_0_25,plain,
( ~ s__temporalPart(X2,X1)
| ~ s__temporalPart(X3,X2)
| ~ s__instance(X3,s__TimePosition)
| ~ s__instance(X2,s__TimePosition)
| ~ s__instance(X1,s__TimePosition)
| s__temporalPart(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_26,plain,
s__temporalPart(s__TimePoint35_1,s__TimeInterval35_1),
inference(split_conjunct,[status(thm)],[local_4]) ).
cnf(c_0_27,plain,
s__instance(s__TimePoint35_1,s__TimePosition),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,plain,
( ~ s__during(X2,X1)
| ~ s__instance(X2,s__TimeInterval)
| ~ s__instance(X1,s__TimeInterval)
| s__temporalPart(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_29,plain,
s__during(s__TimeInterval35_1,s__TimeInterval35_2),
inference(split_conjunct,[status(thm)],[local_5]) ).
cnf(c_0_30,plain,
s__instance(s__TimeInterval35_1,s__TimeInterval),
inference(split_conjunct,[status(thm)],[local_2]) ).
cnf(c_0_31,plain,
s__instance(s__TimeInterval35_2,s__TimeInterval),
inference(split_conjunct,[status(thm)],[local_3]) ).
fof(c_0_32,negated_conjecture,
~ s__temporalPart(s__TimePoint35_1,s__TimeInterval35_2),
inference(fof_nnf,[status(thm)],[c_0_24]) ).
cnf(c_0_33,plain,
( ~ s__instance(X1,s__TimePosition)
| ~ s__instance(s__TimeInterval35_1,s__TimePosition)
| ~ s__temporalPart(s__TimeInterval35_1,X1)
| s__temporalPart(s__TimePoint35_1,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]) ).
cnf(c_0_34,plain,
s__temporalPart(s__TimeInterval35_1,s__TimeInterval35_2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),c_0_31])]) ).
cnf(c_0_35,negated_conjecture,
~ s__temporalPart(s__TimePoint35_1,s__TimeInterval35_2),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_36,plain,
s__subclass(s__TimeInterval,s__TimePosition),
inference(split_conjunct,[status(thm)],[kb_SUMO_1012]) ).
cnf(c_0_37,plain,
( ~ s__instance(s__TimeInterval35_2,s__TimePosition)
| ~ s__instance(s__TimeInterval35_1,s__TimePosition) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]) ).
cnf(c_0_38,plain,
( ~ s__instance(X1,s__TimeInterval)
| s__instance(X1,s__TimePosition) ),
inference(spm,[status(thm)],[c_0_17,c_0_36]) ).
cnf(c_0_39,plain,
~ s__instance(s__TimeInterval35_1,s__TimePosition),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_31])]) ).
cnf(c_0_40,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_38]),c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : CSR104+5 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/5.58 % Computer : n003.cluster.edu
% 0.11/5.58 % Model : x86_64 x86_64
% 0.11/5.58 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.58 % Memory : 8046.5625MB
% 0.11/5.58 % OS : Linux 6.8.0-71-generic
% 0.11/5.58 % CPULimit : 300
% 0.11/5.58 % WCLimit : 300
% 0.11/5.58 % DateTime : Mon Sep 21 15:01:37 UTC 2026
% 0.11/5.58 % CPUTime :
% 0.11/5.58 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/5.63 Running first-order theorem proving
% 0.14/5.63 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
% 1.53/6.30 % Version: 3.5.1
% 1.53/6.30 % Preprocessing class: FMLLSMSLSSSNFFN.
% 1.53/6.30 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.53/6.30 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 1.53/6.30 % Starting new_bool_3 with 300s (1) cores
% 1.53/6.30 % Starting new_bool_1 with 300s (1) cores
% 1.53/6.30 % Starting sh5l with 300s (1) cores
% 1.53/6.30 % new_bool_1 with pid 388810 completed with status 0
% 1.53/6.30 % Result found by new_bool_1
% 1.53/6.30 % Preprocessing class: FMLLSMSLSSSNFFN.
% 1.53/6.30 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.53/6.30 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 1.53/6.30 % Starting new_bool_3 with 300s (1) cores
% 1.53/6.30 % Starting new_bool_1 with 300s (1) cores
% 1.53/6.30 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.53/6.30 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.53/6.30 % Search class: FGHSF-FSLM31-MFFFFFNN
% 1.53/6.30 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 1.53/6.30 % Starting SubtermCWHack with 28s (1) cores
% 1.53/6.30 % SubtermCWHack with pid 388813 completed with status 0
% 1.53/6.30 % Result found by SubtermCWHack
% 1.53/6.30 % Preprocessing class: FMLLSMSLSSSNFFN.
% 1.53/6.30 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.53/6.30 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 1.53/6.30 % Starting new_bool_3 with 300s (1) cores
% 1.53/6.30 % Starting new_bool_1 with 300s (1) cores
% 1.53/6.30 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.53/6.30 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.53/6.30 % Search class: FGHSF-FSLM31-MFFFFFNN
% 1.53/6.30 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 1.53/6.30 % Starting SubtermCWHack with 28s (1) cores
% 1.53/6.30 % Preprocessing time : 0.015 s
% 1.53/6.30
% 1.53/6.30 % Proof found!
% 1.53/6.30 % SZS status Theorem
% 1.53/6.30 % SZS output start CNFRefutation
% See solution above
% 1.53/6.30 % Parsed axioms : 16754
% 1.53/6.30 % Removed by relevancy pruning/SinE : 16563
% 1.53/6.30 % Initial clauses : 249
% 1.53/6.30 % Removed in clause preprocessing : 4
% 1.53/6.30 % Initial clauses in saturation : 245
% 1.53/6.30 % Processed clauses : 551
% 1.53/6.30 % ...of these trivial : 5
% 1.53/6.30 % ...subsumed : 141
% 1.53/6.30 % ...remaining for further processing : 405
% 1.53/6.30 % Other redundant clauses eliminated : 3
% 1.53/6.30 % Clauses deleted for lack of memory : 0
% 1.53/6.30 % Backward-subsumed : 4
% 1.53/6.30 % Backward-rewritten : 1
% 1.53/6.30 % Generated clauses : 582
% 1.53/6.30 % ...of the previous two non-redundant : 451
% 1.53/6.30 % ...aggressively subsumed : 0
% 1.53/6.30 % Contextual simplify-reflections : 38
% 1.53/6.30 % Paramodulations : 578
% 1.53/6.30 % Factorizations : 0
% 1.53/6.30 % NegExts : 0
% 1.53/6.30 % Equation resolutions : 4
% 1.53/6.30 % Disequality decompositions : 0
% 1.53/6.30 % Total rewrite steps : 136
% 1.53/6.30 % ...of those cached : 101
% 1.53/6.30 % Propositional unsat checks : 0
% 1.53/6.30 % Propositional check models : 0
% 1.53/6.30 % Propositional check unsatisfiable : 0
% 1.53/6.30 % Propositional clauses : 0
% 1.53/6.30 % Propositional clauses after purity: 0
% 1.53/6.30 % Propositional unsat core size : 0
% 1.53/6.30 % Propositional preprocessing time : 0.000
% 1.53/6.30 % Propositional encoding time : 0.000
% 1.53/6.30 % Propositional solver time : 0.000
% 1.53/6.30 % Success case prop preproc time : 0.000
% 1.53/6.30 % Success case prop encoding time : 0.000
% 1.53/6.30 % Success case prop solver time : 0.000
% 1.53/6.30 % Current number of processed clauses : 397
% 1.53/6.30 % Positive orientable unit clauses : 56
% 1.53/6.30 % Positive unorientable unit clauses: 0
% 1.53/6.30 % Negative unit clauses : 2
% 1.53/6.30 % Non-unit-clauses : 339
% 1.53/6.30 % Current number of unprocessed clauses: 145
% 1.53/6.30 % ...number of literals in the above : 862
% 1.53/6.30 % Current number of archived formulas : 0
% 1.53/6.30 % Current number of archived clauses : 5
% 1.53/6.30 % Clause-clause subsumption calls (NU) : 19364
% 1.53/6.30 % Rec. Clause-clause subsumption calls : 9802
% 1.53/6.30 % Non-unit clause-clause subsumptions : 180
% 1.53/6.30 % Unit Clause-clause subsumption calls : 184
% 1.53/6.30 % Rewrite failures with RHS unbound : 0
% 1.53/6.30 % BW rewrite match attempts : 2
% 1.53/6.30 % BW rewrite match successes : 1
% 1.53/6.30 % Condensation attempts : 0
% 1.53/6.30 % Condensation successes : 0
% 1.53/6.30 % Termbank termtop insertions : 198257
% 1.53/6.30 % Search garbage collected termcells : 90427
% 1.53/6.30
% 1.53/6.30 % -------------------------------------------------
% 1.53/6.30 % User time : 0.150 s
% 1.53/6.30 % System time : 0.075 s
% 1.53/6.30 % Total time : 0.225 s
% 1.53/6.30 % Maximum resident set size: 42648 pages
% 1.53/6.30
% 1.53/6.30 % -------------------------------------------------
% 1.53/6.30 % User time : 0.545 s
% 1.53/6.30 % System time : 0.111 s
% 1.53/6.30 % Total time : 0.656 s
% 1.53/6.30 % Maximum resident set size: 22016 pages
% 1.53/6.30 % E exiting
%------------------------------------------------------------------------------