%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR090+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 : n017.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:44 PM UTC 2026
% Result : Theorem 6.80s 7.34s
% Output : CNFRefutation 6.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of formulae : 34 ( 19 unt; 0 def)
% Number of atoms : 78 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 83 ( 39 ~; 32 |; 7 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 31 ( 2 sgn 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_from_SUMO_MILO,conjecture,
s__temporalPart(s__Time17_1,s__Time17_3),
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(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(local_4,axiom,
s__temporalPart(s__Time17_1,s__Time17_2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_4) ).
fof(local_5,axiom,
s__temporalPart(s__Time17_2,s__Time17_3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_5) ).
fof(kb_SUMO_1012,axiom,
s__subclass(s__TimeInterval,s__TimePosition),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+1.ax',kb_SUMO_1012) ).
fof(local_3,axiom,
s__instance(s__Time17_3,s__TimeInterval),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_3) ).
fof(local_2,axiom,
s__instance(s__Time17_2,s__TimeInterval),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_2) ).
fof(local_1,axiom,
s__instance(s__Time17_1,s__TimeInterval),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_1) ).
fof(c_0_10,negated_conjecture,
~ s__temporalPart(s__Time17_1,s__Time17_3),
inference(assume_negation,[status(cth)],[prove_from_SUMO_MILO]) ).
fof(c_0_11,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])])]) ).
fof(c_0_12,negated_conjecture,
~ s__temporalPart(s__Time17_1,s__Time17_3),
inference(fof_simplification,[status(thm)],[c_0_10]) ).
fof(c_0_13,plain,
! [X1351,X1352,X1353] :
( s__instance(X1353,X1352)
| ~ s__instance(X1353,X1351)
| ~ s__subclass(X1351,X1352)
| ~ s__instance(X1351,s__SetOrClass)
| ~ s__instance(X1352,s__SetOrClass) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_27])])]) ).
fof(c_0_14,plain,
! [X1349,X1350] :
( ( ~ s__subclass(X1349,X1350)
| s__instance(X1350,s__SetOrClass) )
& ( ~ s__subclass(X1349,X1350)
| s__instance(X1349,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_15,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_11]) ).
cnf(c_0_16,plain,
s__temporalPart(s__Time17_1,s__Time17_2),
inference(split_conjunct,[status(thm)],[local_4]) ).
fof(c_0_17,negated_conjecture,
~ s__temporalPart(s__Time17_1,s__Time17_3),
inference(fof_nnf,[status(thm)],[c_0_12]) ).
cnf(c_0_18,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_13]) ).
cnf(c_0_19,plain,
( ~ s__subclass(X2,X1)
| s__instance(X1,s__SetOrClass) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
( ~ s__subclass(X1,X2)
| s__instance(X1,s__SetOrClass) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,plain,
( ~ s__instance(X1,s__TimePosition)
| ~ s__instance(s__Time17_2,s__TimePosition)
| ~ s__instance(s__Time17_1,s__TimePosition)
| ~ s__temporalPart(s__Time17_2,X1)
| s__temporalPart(s__Time17_1,X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,plain,
s__temporalPart(s__Time17_2,s__Time17_3),
inference(split_conjunct,[status(thm)],[local_5]) ).
cnf(c_0_23,negated_conjecture,
~ s__temporalPart(s__Time17_1,s__Time17_3),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
( ~ s__instance(X1,X3)
| ~ s__subclass(X3,X2)
| s__instance(X1,X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_25,plain,
s__subclass(s__TimeInterval,s__TimePosition),
inference(split_conjunct,[status(thm)],[kb_SUMO_1012]) ).
cnf(c_0_26,plain,
( ~ s__instance(s__Time17_3,s__TimePosition)
| ~ s__instance(s__Time17_2,s__TimePosition)
| ~ s__instance(s__Time17_1,s__TimePosition) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_27,plain,
( ~ s__instance(X1,s__TimeInterval)
| s__instance(X1,s__TimePosition) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,plain,
s__instance(s__Time17_3,s__TimeInterval),
inference(split_conjunct,[status(thm)],[local_3]) ).
cnf(c_0_29,plain,
( ~ s__instance(s__Time17_2,s__TimePosition)
| ~ s__instance(s__Time17_1,s__TimePosition) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]) ).
cnf(c_0_30,plain,
s__instance(s__Time17_2,s__TimeInterval),
inference(split_conjunct,[status(thm)],[local_2]) ).
cnf(c_0_31,plain,
~ s__instance(s__Time17_1,s__TimePosition),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_27]),c_0_30])]) ).
cnf(c_0_32,plain,
s__instance(s__Time17_1,s__TimeInterval),
inference(split_conjunct,[status(thm)],[local_1]) ).
cnf(c_0_33,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_27]),c_0_32])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR090+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.12/5.38 % Computer : n017.cluster.edu
% 0.12/5.38 % Model : x86_64 x86_64
% 0.12/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.38 % Memory : 8046.5625MB
% 0.12/5.38 % OS : Linux 6.8.0-71-generic
% 0.12/5.38 % CPULimit : 300
% 0.12/5.38 % WCLimit : 300
% 0.12/5.38 % DateTime : Mon Sep 21 14:49:34 UTC 2026
% 0.12/5.39 % CPUTime :
% 0.12/5.39 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/5.43 Running first-order theorem proving
% 0.16/5.43 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
% 6.80/7.34 % Version: 3.5.1
% 6.80/7.34 % Preprocessing class: FMLLSMSLSSSNFFN.
% 6.80/7.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.80/7.34 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 6.80/7.34 % Starting new_bool_3 with 300s (1) cores
% 6.80/7.34 % Starting new_bool_1 with 300s (1) cores
% 6.80/7.34 % Starting sh5l with 300s (1) cores
% 6.80/7.34 % G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with pid 2579342 completed with status 0
% 6.80/7.34 % Result found by G-E--_208_B07_F1_AE_CS_SP_PS_S0Y
% 6.80/7.34 % Preprocessing class: FMLLSMSLSSSNFFN.
% 6.80/7.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.80/7.34 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 6.80/7.34 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 6.80/7.34 % SinE strategy is gf200_h_gu_R03_F100_L20000
% 6.80/7.34 % Search class: FGHSS-FSLM31-MFFFFFNN
% 6.80/7.34 % partial match(1): FGHSM-FSLM31-MFFFFFNN
% 6.80/7.34 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 6.80/7.34 % Starting SubtermCWHack with 136s (1) cores
% 6.80/7.34 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 151s (1) cores
% 6.80/7.34 % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 136s (1) cores
% 6.80/7.34 % Starting G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y with 136s (1) cores
% 6.80/7.34 % Starting U----_116Y_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 6.80/7.34 % G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with pid 2579355 completed with status 0
% 6.80/7.34 % Result found by G-E--_208_B07_F1_AE_CS_SP_PS_S0Y
% 6.80/7.34 % Preprocessing class: FMLLSMSLSSSNFFN.
% 6.80/7.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.80/7.34 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 6.80/7.34 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 6.80/7.34 % SinE strategy is gf200_h_gu_R03_F100_L20000
% 6.80/7.34 % Search class: FGHSS-FSLM31-MFFFFFNN
% 6.80/7.34 % partial match(1): FGHSM-FSLM31-MFFFFFNN
% 6.80/7.34 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 6.80/7.34 % Starting SubtermCWHack with 136s (1) cores
% 6.80/7.34 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 151s (1) cores
% 6.80/7.34 % Preprocessing time : 0.035 s
% 6.80/7.34 % Presaturation interreduction done
% 6.80/7.34
% 6.80/7.34 % Proof found!
% 6.80/7.34 % SZS status Theorem
% 6.80/7.34 % SZS output start CNFRefutation
% See solution above
% 6.80/7.34 % Parsed axioms : 37987
% 6.80/7.34 % Removed by relevancy pruning/SinE : 37368
% 6.80/7.34 % Initial clauses : 751
% 6.80/7.34 % Removed in clause preprocessing : 4
% 6.80/7.34 % Initial clauses in saturation : 747
% 6.80/7.34 % Processed clauses : 3376
% 6.80/7.34 % ...of these trivial : 293
% 6.80/7.34 % ...subsumed : 540
% 6.80/7.34 % ...remaining for further processing : 2543
% 6.80/7.34 % Other redundant clauses eliminated : 1
% 6.80/7.34 % Clauses deleted for lack of memory : 0
% 6.80/7.34 % Backward-subsumed : 17
% 6.80/7.34 % Backward-rewritten : 1
% 6.80/7.34 % Generated clauses : 8335
% 6.80/7.34 % ...of the previous two non-redundant : 6519
% 6.80/7.34 % ...aggressively subsumed : 0
% 6.80/7.34 % Contextual simplify-reflections : 206
% 6.80/7.34 % Paramodulations : 8333
% 6.80/7.34 % Factorizations : 0
% 6.80/7.34 % NegExts : 0
% 6.80/7.34 % Equation resolutions : 2
% 6.80/7.34 % Disequality decompositions : 0
% 6.80/7.34 % Total rewrite steps : 2449
% 6.80/7.34 % ...of those cached : 2144
% 6.80/7.34 % Propositional unsat checks : 0
% 6.80/7.34 % Propositional check models : 0
% 6.80/7.34 % Propositional check unsatisfiable : 0
% 6.80/7.34 % Propositional clauses : 0
% 6.80/7.34 % Propositional clauses after purity: 0
% 6.80/7.34 % Propositional unsat core size : 0
% 6.80/7.34 % Propositional preprocessing time : 0.000
% 6.80/7.34 % Propositional encoding time : 0.000
% 6.80/7.34 % Propositional solver time : 0.000
% 6.80/7.34 % Success case prop preproc time : 0.000
% 6.80/7.34 % Success case prop encoding time : 0.000
% 6.80/7.34 % Success case prop solver time : 0.000
% 6.80/7.34 % Current number of processed clauses : 1808
% 6.80/7.34 % Positive orientable unit clauses : 519
% 6.80/7.34 % Positive unorientable unit clauses: 0
% 6.80/7.34 % Negative unit clauses : 2
% 6.80/7.34 % Non-unit-clauses : 1287
% 6.80/7.34 % Current number of unprocessed clauses: 4603
% 6.80/7.34 % ...number of literals in the above : 17447
% 6.80/7.34 % Current number of archived formulas : 0
% 6.80/7.34 % Current number of archived clauses : 734
% 6.80/7.34 % Clause-clause subsumption calls (NU) : 502352
% 6.80/7.34 % Rec. Clause-clause subsumption calls : 136280
% 6.80/7.34 % Non-unit clause-clause subsumptions : 762
% 6.80/7.34 % Unit Clause-clause subsumption calls : 27750
% 6.80/7.34 % Rewrite failures with RHS unbound : 0
% 6.80/7.34 % BW rewrite match attempts : 1
% 6.80/7.34 % BW rewrite match successes : 1
% 6.80/7.34 % Condensation attempts : 0
% 6.80/7.34 % Condensation successes : 0
% 6.80/7.34 % Termbank termtop insertions : 389996
% 6.80/7.34 % Search garbage collected termcells : 131057
% 6.80/7.34
% 6.80/7.34 % -------------------------------------------------
% 6.80/7.34 % User time : 0.773 s
% 6.80/7.34 % System time : 0.188 s
% 6.80/7.34 % Total time : 0.961 s
% 6.80/7.34 % Maximum resident set size: 51812 pages
% 6.80/7.34
% 6.80/7.34 % -------------------------------------------------
% 6.80/7.34 % User time : 4.094 s
% 6.80/7.34 % System time : 0.595 s
% 6.80/7.34 % Total time : 4.689 s
% 6.80/7.34 % Maximum resident set size: 31488 pages
% 6.80/7.34 % E exiting
%------------------------------------------------------------------------------