%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR090+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 : n026.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 4.14s 13.23s
% Output : CNFRefutation 4.14s
% 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_ALL,conjecture,
s__temporalPart(s__Time17_1,s__Time17_3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_from_ALL) ).
fof(kb_SUMO_28419,axiom,
! [X1034,X1035,X1097] :
( ( s__instance(X1034,s__TimePosition)
& s__instance(X1035,s__TimePosition)
& s__instance(X1097,s__TimePosition) )
=> ( ( s__temporalPart(X1035,X1097)
& s__temporalPart(X1034,X1035) )
=> s__temporalPart(X1034,X1097) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+2.ax',kb_SUMO_28419) ).
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_4,axiom,
s__temporalPart(s__Time17_1,s__Time17_2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_4) ).
fof(local_5,axiom,
s__temporalPart(s__Time17_2,s__Time17_3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_5) ).
fof(kb_SUMO_27777,axiom,
s__subclass(s__TimeInterval,s__TimePosition),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+2.ax',kb_SUMO_27777) ).
fof(local_3,axiom,
s__instance(s__Time17_3,s__TimeInterval),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_3) ).
fof(local_2,axiom,
s__instance(s__Time17_2,s__TimeInterval),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_2) ).
fof(local_1,axiom,
s__instance(s__Time17_1,s__TimeInterval),
file('/export/starexec/sandbox/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_ALL]) ).
fof(c_0_11,plain,
! [X2350,X2351,X2352] :
( s__temporalPart(X2350,X2352)
| ~ s__temporalPart(X2351,X2352)
| ~ s__temporalPart(X2350,X2351)
| ~ s__instance(X2350,s__TimePosition)
| ~ s__instance(X2351,s__TimePosition)
| ~ s__instance(X2352,s__TimePosition) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_28419])])]) ).
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,
! [X2522,X2523,X2524] :
( s__instance(X2524,X2523)
| ~ s__instance(X2524,X2522)
| ~ s__subclass(X2522,X2523)
| ~ s__instance(X2522,s__SetOrClass)
| ~ s__instance(X2523,s__SetOrClass) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_26636])])]) ).
fof(c_0_14,plain,
! [X2520,X2521] :
( ( ~ s__subclass(X2520,X2521)
| s__instance(X2521,s__SetOrClass) )
& ( ~ s__subclass(X2520,X2521)
| s__instance(X2520,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_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__subclass(X3,X2)
| ~ s__instance(X1,X3)
| 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_27777]) ).
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+6 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/10.37 % Computer : n026.cluster.edu
% 0.10/10.37 % Model : x86_64 x86_64
% 0.10/10.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/10.37 % Memory : 8046.5625MB
% 0.10/10.37 % OS : Linux 6.8.0-71-generic
% 0.10/10.38 % CPULimit : 300
% 0.10/10.38 % WCLimit : 300
% 0.10/10.38 % DateTime : Mon Sep 21 14:57:33 UTC 2026
% 0.10/10.38 % CPUTime :
% 0.10/10.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/10.42 Running first-order theorem proving
% 0.14/10.42 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
% 4.14/13.23 % Version: 3.5.1
% 4.14/13.23 % Preprocessing class: FMLLSMSLSSSNFFN.
% 4.14/13.23 % Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 4.14/13.23 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1490s (5) cores
% 4.14/13.23 % Starting new_bool_3 with 298s (1) cores
% 4.14/13.23 % Starting new_bool_1 with 298s (1) cores
% 4.14/13.23 % Starting sh5l with 298s (1) cores
% 4.14/13.23 % new_bool_1 with pid 2549367 completed with status 0
% 4.14/13.23 % Result found by new_bool_1
% 4.14/13.23 % Preprocessing class: FMLLSMSLSSSNFFN.
% 4.14/13.23 % Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 4.14/13.23 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1490s (5) cores
% 4.14/13.23 % Starting new_bool_3 with 298s (1) cores
% 4.14/13.23 % Starting new_bool_1 with 298s (1) cores
% 4.14/13.23 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 4.14/13.23 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 4.14/13.23 % Search class: FGHSS-FSLM31-MFFFFFNN
% 4.14/13.23 % partial match(1): FGHSM-FSLM31-MFFFFFNN
% 4.14/13.23 % Scheduled 8 strats onto 1 cores with 298 seconds (298 total)
% 4.14/13.23 % Starting SubtermCWHack with 27s (1) cores
% 4.14/13.23 % SubtermCWHack with pid 2549369 completed with status 0
% 4.14/13.23 % Result found by SubtermCWHack
% 4.14/13.23 % Preprocessing class: FMLLSMSLSSSNFFN.
% 4.14/13.23 % Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 4.14/13.23 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1490s (5) cores
% 4.14/13.23 % Starting new_bool_3 with 298s (1) cores
% 4.14/13.23 % Starting new_bool_1 with 298s (1) cores
% 4.14/13.23 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 4.14/13.23 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 4.14/13.23 % Search class: FGHSS-FSLM31-MFFFFFNN
% 4.14/13.23 % partial match(1): FGHSM-FSLM31-MFFFFFNN
% 4.14/13.23 % Scheduled 8 strats onto 1 cores with 298 seconds (298 total)
% 4.14/13.23 % Starting SubtermCWHack with 27s (1) cores
% 4.14/13.23 % Preprocessing time : 0.017 s
% 4.14/13.23
% 4.14/13.23 % Proof found!
% 4.14/13.23 % SZS status Theorem
% 4.14/13.23 % SZS output start CNFRefutation
% See solution above
% 4.14/13.23 % Parsed axioms : 55592
% 4.14/13.23 % Removed by relevancy pruning/SinE : 55419
% 4.14/13.23 % Initial clauses : 221
% 4.14/13.23 % Removed in clause preprocessing : 8
% 4.14/13.23 % Initial clauses in saturation : 213
% 4.14/13.23 % Processed clauses : 1383
% 4.14/13.23 % ...of these trivial : 13
% 4.14/13.23 % ...subsumed : 478
% 4.14/13.23 % ...remaining for further processing : 892
% 4.14/13.23 % Other redundant clauses eliminated : 3
% 4.14/13.23 % Clauses deleted for lack of memory : 0
% 4.14/13.23 % Backward-subsumed : 6
% 4.14/13.23 % Backward-rewritten : 0
% 4.14/13.23 % Generated clauses : 1489
% 4.14/13.23 % ...of the previous two non-redundant : 1388
% 4.14/13.23 % ...aggressively subsumed : 0
% 4.14/13.23 % Contextual simplify-reflections : 69
% 4.14/13.23 % Paramodulations : 1485
% 4.14/13.23 % Factorizations : 0
% 4.14/13.23 % NegExts : 0
% 4.14/13.23 % Equation resolutions : 4
% 4.14/13.23 % Disequality decompositions : 0
% 4.14/13.23 % Total rewrite steps : 142
% 4.14/13.23 % ...of those cached : 103
% 4.14/13.23 % Propositional unsat checks : 0
% 4.14/13.23 % Propositional check models : 0
% 4.14/13.23 % Propositional check unsatisfiable : 0
% 4.14/13.23 % Propositional clauses : 0
% 4.14/13.23 % Propositional clauses after purity: 0
% 4.14/13.23 % Propositional unsat core size : 0
% 4.14/13.23 % Propositional preprocessing time : 0.000
% 4.14/13.23 % Propositional encoding time : 0.000
% 4.14/13.23 % Propositional solver time : 0.000
% 4.14/13.23 % Success case prop preproc time : 0.000
% 4.14/13.23 % Success case prop encoding time : 0.000
% 4.14/13.23 % Success case prop solver time : 0.000
% 4.14/13.23 % Current number of processed clauses : 883
% 4.14/13.23 % Positive orientable unit clauses : 59
% 4.14/13.23 % Positive unorientable unit clauses: 0
% 4.14/13.23 % Negative unit clauses : 2
% 4.14/13.23 % Non-unit-clauses : 822
% 4.14/13.23 % Current number of unprocessed clauses: 218
% 4.14/13.23 % ...number of literals in the above : 1716
% 4.14/13.23 % Current number of archived formulas : 0
% 4.14/13.23 % Current number of archived clauses : 6
% 4.14/13.23 % Clause-clause subsumption calls (NU) : 70379
% 4.14/13.23 % Rec. Clause-clause subsumption calls : 24600
% 4.14/13.23 % Non-unit clause-clause subsumptions : 552
% 4.14/13.23 % Unit Clause-clause subsumption calls : 131
% 4.14/13.23 % Rewrite failures with RHS unbound : 0
% 4.14/13.23 % BW rewrite match attempts : 0
% 4.14/13.23 % BW rewrite match successes : 0
% 4.14/13.23 % Condensation attempts : 0
% 4.14/13.23 % Condensation successes : 0
% 4.14/13.23 % Termbank termtop insertions : 696825
% 4.14/13.23 % Search garbage collected termcells : 293651
% 4.14/13.23
% 4.14/13.23 % -------------------------------------------------
% 4.14/13.23 % User time : 0.394 s
% 4.14/13.23 % System time : 0.198 s
% 4.14/13.23 % Total time : 0.591 s
% 4.14/13.23 % Maximum resident set size: 137016 pages
% 4.14/13.23
% 4.14/13.23 % -------------------------------------------------
% 4.14/13.23 % User time : 2.383 s
% 4.14/13.23 % System time : 0.321 s
% 4.14/13.23 % Total time : 2.704 s
% 4.14/13.23 % Maximum resident set size: 63744 pages
% 4.14/13.23 % E exiting
%------------------------------------------------------------------------------