%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : CSR090+3 : 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 : n018.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:46 PM UTC 2026
% Result : Theorem 30.61s 11.32s
% Output : CNFRefutation 30.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of formulae : 36 ( 20 unt; 0 def)
% Number of atoms : 130 ( 14 equ)
% Maximal formula atoms : 45 ( 3 avg)
% Number of connectives : 158 ( 64 ~; 66 |; 21 &)
% ( 1 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-3 aty)
% Number of variables : 47 ( 8 sgn 27 !; 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_32603,axiom,
! [X137,X12,X136] :
( X12 = s__UnionFn(X136,X137)
<=> ! [X1138,X34,X1139] :
( ( s__instance(X137,s__SetOrClass)
& s__instance(X12,s__SetOrClass)
& s__instance(X136,s__SetOrClass) )
=> ( ( s__instance(X1139,X12)
& s__instance(X34,X137)
& s__instance(X1138,X136) )
=> ( ( s__instance(X1139,X137)
| s__instance(X1139,X136) )
& s__instance(X34,X12)
& s__instance(X1138,X12) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+2.ax',kb_SUMO_32603) ).
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(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,negated_conjecture,
~ s__temporalPart(s__Time17_1,s__Time17_3),
inference(fof_simplification,[status(thm)],[c_0_10]) ).
fof(c_0_12,plain,
! [X2432,X2433,X2434,X2435,X2436,X2437,X2438,X2439,X2440] :
( ( X2439 = s__UnionFn(X2440,X2438)
| ~ s__instance(esk8_3(X2438,X2439,X2440),X2439)
| ~ s__instance(esk7_3(X2438,X2439,X2440),X2439)
| ~ s__instance(esk9_3(X2438,X2439,X2440),X2438) )
& ( X2439 = s__UnionFn(X2440,X2438)
| ~ s__instance(esk8_3(X2438,X2439,X2440),X2439)
| ~ s__instance(esk7_3(X2438,X2439,X2440),X2439)
| ~ s__instance(esk9_3(X2438,X2439,X2440),X2440) )
& ( X2439 = s__UnionFn(X2440,X2438)
| s__instance(esk9_3(X2438,X2439,X2440),X2439) )
& ( X2439 = s__UnionFn(X2440,X2438)
| s__instance(esk8_3(X2438,X2439,X2440),X2438) )
& ( X2439 = s__UnionFn(X2440,X2438)
| s__instance(esk7_3(X2438,X2439,X2440),X2440) )
& ( X2439 = s__UnionFn(X2440,X2438)
| s__instance(X2438,s__SetOrClass) )
& ( X2439 = s__UnionFn(X2440,X2438)
| s__instance(X2439,s__SetOrClass) )
& ( X2439 = s__UnionFn(X2440,X2438)
| s__instance(X2440,s__SetOrClass) )
& ( X2433 != s__UnionFn(X2434,X2432)
| ~ s__instance(X2432,s__SetOrClass)
| ~ s__instance(X2433,s__SetOrClass)
| ~ s__instance(X2434,s__SetOrClass)
| ~ s__instance(X2437,X2433)
| ~ s__instance(X2436,X2432)
| ~ s__instance(X2435,X2434)
| s__instance(X2437,X2432)
| s__instance(X2437,X2434) )
& ( X2433 != s__UnionFn(X2434,X2432)
| ~ s__instance(X2432,s__SetOrClass)
| ~ s__instance(X2433,s__SetOrClass)
| ~ s__instance(X2434,s__SetOrClass)
| ~ s__instance(X2437,X2433)
| ~ s__instance(X2436,X2432)
| ~ s__instance(X2435,X2434)
| s__instance(X2436,X2433) )
& ( X2433 != s__UnionFn(X2434,X2432)
| ~ s__instance(X2432,s__SetOrClass)
| ~ s__instance(X2433,s__SetOrClass)
| ~ s__instance(X2434,s__SetOrClass)
| ~ s__instance(X2437,X2433)
| ~ s__instance(X2436,X2432)
| ~ s__instance(X2435,X2434)
| s__instance(X2435,X2433) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_32603])])])])])])]) ).
fof(c_0_13,negated_conjecture,
~ s__temporalPart(s__Time17_1,s__Time17_3),
inference(fof_nnf,[status(thm)],[c_0_11]) ).
cnf(c_0_14,plain,
( X2 = s__UnionFn(X3,X1)
| s__instance(X1,s__SetOrClass) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,negated_conjecture,
~ s__temporalPart(s__Time17_1,s__Time17_3),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,plain,
( s__instance(X3,s__SetOrClass)
| X1 = X2 ),
inference(pm,[status(thm)],[c_0_14,c_0_14]) ).
fof(c_0_17,plain,
! [X2378,X2379,X2380] :
( s__temporalPart(X2378,X2380)
| ~ s__temporalPart(X2379,X2380)
| ~ s__temporalPart(X2378,X2379)
| ~ s__instance(X2378,s__TimePosition)
| ~ s__instance(X2379,s__TimePosition)
| ~ s__instance(X2380,s__TimePosition) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_28419])])]) ).
fof(c_0_18,plain,
! [X2417,X2418,X2419] :
( s__instance(X2419,X2418)
| ~ s__instance(X2419,X2417)
| ~ s__subclass(X2417,X2418)
| ~ s__instance(X2417,s__SetOrClass)
| ~ s__instance(X2418,s__SetOrClass) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_26636])])]) ).
cnf(c_0_19,negated_conjecture,
( ~ s__temporalPart(s__Time17_1,X2)
| s__instance(X1,s__SetOrClass) ),
inference(pm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
s__temporalPart(s__Time17_1,s__Time17_2),
inference(split_conjunct,[status(thm)],[local_4]) ).
cnf(c_0_21,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_17]) ).
cnf(c_0_22,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_18]) ).
cnf(c_0_23,negated_conjecture,
s__instance(X1,s__SetOrClass),
inference(pm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,negated_conjecture,
( ~ s__instance(X1,s__TimePosition)
| ~ s__instance(s__Time17_3,s__TimePosition)
| ~ s__instance(s__Time17_1,s__TimePosition)
| ~ s__temporalPart(X1,s__Time17_3)
| ~ s__temporalPart(s__Time17_1,X1) ),
inference(pm,[status(thm)],[c_0_15,c_0_21]) ).
cnf(c_0_25,plain,
s__temporalPart(s__Time17_2,s__Time17_3),
inference(split_conjunct,[status(thm)],[local_5]) ).
cnf(c_0_26,plain,
( ~ s__subclass(X3,X2)
| ~ s__instance(X1,X3)
| s__instance(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23]),c_0_23])]) ).
cnf(c_0_27,plain,
s__subclass(s__TimeInterval,s__TimePosition),
inference(split_conjunct,[status(thm)],[kb_SUMO_27777]) ).
cnf(c_0_28,negated_conjecture,
( ~ s__instance(s__Time17_2,s__TimePosition)
| ~ s__instance(s__Time17_3,s__TimePosition)
| ~ s__instance(s__Time17_1,s__TimePosition) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_24,c_0_25]),c_0_20])]) ).
cnf(c_0_29,plain,
( ~ s__instance(X1,s__TimeInterval)
| s__instance(X1,s__TimePosition) ),
inference(pm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,plain,
s__instance(s__Time17_3,s__TimeInterval),
inference(split_conjunct,[status(thm)],[local_3]) ).
cnf(c_0_31,negated_conjecture,
( ~ s__instance(s__Time17_2,s__TimePosition)
| ~ s__instance(s__Time17_1,s__TimePosition) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).
cnf(c_0_32,plain,
s__instance(s__Time17_2,s__TimeInterval),
inference(split_conjunct,[status(thm)],[local_2]) ).
cnf(c_0_33,negated_conjecture,
~ s__instance(s__Time17_1,s__TimePosition),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_31,c_0_29]),c_0_32])]) ).
cnf(c_0_34,plain,
s__instance(s__Time17_1,s__TimeInterval),
inference(split_conjunct,[status(thm)],[local_1]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_33,c_0_29]),c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : CSR090+3 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.45 % Computer : n018.cluster.edu
% 0.18/0.45 % Model : x86_64 x86_64
% 0.18/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.45 % Memory : 8046.5625MB
% 0.18/0.45 % OS : Linux 6.8.0-71-generic
% 0.18/0.45 % CPULimit : 300
% 0.18/0.45 % WCLimit : 300
% 0.18/0.45 % DateTime : Mon Sep 21 14:56:44 UTC 2026
% 0.18/0.46 % CPUTime :
% 0.18/0.46 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/0.53 Running first-order theorem proving
% 0.24/0.53 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
% 30.61/11.32 % Version: 3.5.1
% 30.61/11.32 % Preprocessing class: FLLLSMSLSSSNFFN.
% 30.61/11.32 % Scheduled 4 strats onto 8 cores with 294 seconds (2352 total)
% 30.61/11.32 % Starting G-E--_300_C01_S5PRR_S00 with 1470s (5) cores
% 30.61/11.32 % Starting new_bool_3 with 294s (1) cores
% 30.61/11.32 % Starting new_bool_1 with 294s (1) cores
% 30.61/11.32 % Starting sh5l with 294s (1) cores
% 30.61/11.32 % G-E--_300_C01_S5PRR_S00 with pid 2163144 completed with status 0
% 30.61/11.32 % Result found by G-E--_300_C01_S5PRR_S00
% 30.61/11.32 % Preprocessing class: FLLLSMSLSSSNFFN.
% 30.61/11.32 % Scheduled 4 strats onto 8 cores with 294 seconds (2352 total)
% 30.61/11.32 % Starting G-E--_300_C01_S5PRR_S00 with 1470s (5) cores
% 30.61/11.32 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 30.61/11.32 % SinE strategy is gf200_h_gu_R03_F100_L20000
% 30.61/11.32 % Search class: FGHSM-SSLM33-MFFFFFNN
% 30.61/11.32 % Scheduled 7 strats onto 5 cores with 1470 seconds (1470 total)
% 30.61/11.32 % Starting SubtermCWHack with 133s (1) cores
% 30.61/11.32 % Starting G-E--_300_C01_S5PRR_S00 with 148s (1) cores
% 30.61/11.32 % Starting G-E--_200_B02_F1_AE_CS_SP_PI_S2k with 133s (1) cores
% 30.61/11.32 % Starting new_bool_3 with 133s (1) cores
% 30.61/11.32 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 133s (1) cores
% 30.61/11.32 % G-E--_300_C01_S5PRR_S00 with pid 2163149 completed with status 0
% 30.61/11.32 % Result found by G-E--_300_C01_S5PRR_S00
% 30.61/11.32 % Preprocessing class: FLLLSMSLSSSNFFN.
% 30.61/11.32 % Scheduled 4 strats onto 8 cores with 294 seconds (2352 total)
% 30.61/11.32 % Starting G-E--_300_C01_S5PRR_S00 with 1470s (5) cores
% 30.61/11.32 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 30.61/11.32 % SinE strategy is gf200_h_gu_R03_F100_L20000
% 30.61/11.32 % Search class: FGHSM-SSLM33-MFFFFFNN
% 30.61/11.32 % Scheduled 7 strats onto 5 cores with 1470 seconds (1470 total)
% 30.61/11.32 % Starting SubtermCWHack with 133s (1) cores
% 30.61/11.32 % Starting G-E--_300_C01_S5PRR_S00 with 148s (1) cores
% 30.61/11.32 % Preprocessing time : 0.068 s
% 30.61/11.32
% 30.61/11.32 % Proof found!
% 30.61/11.32 % SZS status Theorem
% 30.61/11.32 % SZS output start CNFRefutation
% See solution above
% 30.61/11.32 % Parsed axioms : 145107
% 30.61/11.32 % Removed by relevancy pruning/SinE : 144211
% 30.61/11.32 % Initial clauses : 1172
% 30.61/11.32 % Removed in clause preprocessing : 38
% 30.61/11.32 % Initial clauses in saturation : 1134
% 30.61/11.32 % Processed clauses : 6762
% 30.61/11.32 % ...of these trivial : 89
% 30.61/11.32 % ...subsumed : 2636
% 30.61/11.32 % ...remaining for further processing : 4037
% 30.61/11.32 % Other redundant clauses eliminated : 0
% 30.61/11.32 % Clauses deleted for lack of memory : 0
% 30.61/11.32 % Backward-subsumed : 83
% 30.61/11.32 % Backward-rewritten : 37
% 30.61/11.32 % Generated clauses : 48435
% 30.61/11.32 % ...of the previous two non-redundant : 41455
% 30.61/11.32 % ...aggressively subsumed : 0
% 30.61/11.32 % Contextual simplify-reflections : 0
% 30.61/11.32 % Paramodulations : 48421
% 30.61/11.32 % Factorizations : 8
% 30.61/11.32 % NegExts : 0
% 30.61/11.32 % Equation resolutions : 6
% 30.61/11.32 % Disequality decompositions : 0
% 30.61/11.32 % Total rewrite steps : 11974
% 30.61/11.32 % ...of those cached : 11681
% 30.61/11.32 % Propositional unsat checks : 0
% 30.61/11.32 % Propositional check models : 0
% 30.61/11.32 % Propositional check unsatisfiable : 0
% 30.61/11.32 % Propositional clauses : 0
% 30.61/11.32 % Propositional clauses after purity: 0
% 30.61/11.32 % Propositional unsat core size : 0
% 30.61/11.32 % Propositional preprocessing time : 0.000
% 30.61/11.32 % Propositional encoding time : 0.000
% 30.61/11.32 % Propositional solver time : 0.000
% 30.61/11.32 % Success case prop preproc time : 0.000
% 30.61/11.32 % Success case prop encoding time : 0.000
% 30.61/11.32 % Success case prop solver time : 0.000
% 30.61/11.32 % Current number of processed clauses : 3917
% 30.61/11.32 % Positive orientable unit clauses : 634
% 30.61/11.32 % Positive unorientable unit clauses: 0
% 30.61/11.32 % Negative unit clauses : 11
% 30.61/11.32 % Non-unit-clauses : 3272
% 30.61/11.32 % Current number of unprocessed clauses: 34441
% 30.61/11.32 % ...number of literals in the above : 165001
% 30.61/11.32 % Current number of archived formulas : 0
% 30.61/11.32 % Current number of archived clauses : 120
% 30.61/11.32 % Clause-clause subsumption calls (NU) : 1039332
% 30.61/11.32 % Rec. Clause-clause subsumption calls : 800076
% 30.61/11.32 % Non-unit clause-clause subsumptions : 2709
% 30.61/11.32 % Unit Clause-clause subsumption calls : 158614
% 30.61/11.32 % Rewrite failures with RHS unbound : 0
% 30.61/11.32 % BW rewrite match attempts : 249
% 30.61/11.32 % BW rewrite match successes : 22
% 30.61/11.32 % Condensation attempts : 0
% 30.61/11.32 % Condensation successes : 0
% 30.61/11.32 % Termbank termtop insertions : 1359863
% 30.61/11.32 % Search garbage collected termcells : 469750
% 30.61/11.32
% 30.61/11.32 % -------------------------------------------------
% 30.61/11.32 % User time : 3.231 s
% 30.61/11.32 % System time : 0.534 s
% 30.61/11.32 % Total time : 3.765 s
% 30.61/11.32 % Maximum resident set size: 177904 pages
% 30.61/11.32
% 30.61/11.32 % -------------------------------------------------
% 30.61/11.32 % User time : 20.418 s
% 30.61/11.32 % System time : 2.103 s
% 30.61/11.32 % Total time : 22.521 s
% 30.61/11.32 % Maximum resident set size: 103936 pages
% 30.61/11.32 % E exiting
%------------------------------------------------------------------------------