%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR106+7 : 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 : n020.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:56 PM UTC 2026
% Result : Theorem 45.44s 11.39s
% Output : CNFRefutation 45.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 13 ( 9 unt; 0 def)
% Number of atoms : 17 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 16 ( 12 ~; 2 |; 0 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 15 ( 3 sgn 5 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_from_ALL,conjecture,
? [X2341,X2342] : ~ s__before(X2341,X2342),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_from_ALL) ).
fof(kb_SUMO_27908,axiom,
! [X851] :
( s__instance(X851,s__TimePoint)
=> ~ s__before(X851,X851) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+2.ax',kb_SUMO_27908) ).
fof(kb_SUMO_33361,axiom,
s__instance(s__PositiveInfinity,s__TimePoint),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+2.ax',kb_SUMO_33361) ).
fof(c_0_3,negated_conjecture,
~ ? [X2341,X2342] : ~ s__before(X2341,X2342),
inference(assume_negation,[status(cth)],[prove_from_ALL]) ).
fof(c_0_4,plain,
! [X851] :
( s__instance(X851,s__TimePoint)
=> ~ s__before(X851,X851) ),
inference(fof_simplification,[status(thm)],[kb_SUMO_27908]) ).
fof(c_0_5,negated_conjecture,
~ ? [X2341,X2342] : ~ s__before(X2341,X2342),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_6,plain,
! [X2375] :
( ~ s__before(X2375,X2375)
| ~ s__instance(X2375,s__TimePoint) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_7,negated_conjecture,
! [X2343,X2344] : s__before(X2343,X2344),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])]) ).
cnf(c_0_8,plain,
( ~ s__before(X1,X1)
| ~ s__instance(X1,s__TimePoint) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
s__before(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
s__instance(s__PositiveInfinity,s__TimePoint),
inference(split_conjunct,[status(thm)],[kb_SUMO_33361]) ).
cnf(c_0_11,plain,
~ s__instance(X1,s__TimePoint),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9])]) ).
cnf(c_0_12,plain,
$false,
inference(sr,[status(thm)],[c_0_10,c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : CSR106+7 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/0.47 % Computer : n020.cluster.edu
% 0.20/0.47 % Model : x86_64 x86_64
% 0.20/0.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.47 % Memory : 8046.5625MB
% 0.20/0.47 % OS : Linux 6.8.0-71-generic
% 0.20/0.47 % CPULimit : 300
% 0.20/0.47 % WCLimit : 300
% 0.20/0.47 % DateTime : Mon Sep 21 15:00:48 UTC 2026
% 0.20/0.48 % CPUTime :
% 0.20/0.48 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/0.56 Running first-order theorem proving
% 0.23/0.56 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
% 45.44/11.39 % Version: 3.5.1
% 45.44/11.39 % Preprocessing class: FMLLSMSLSSSNFFN.
% 45.44/11.39 % Scheduled 4 strats onto 8 cores with 297 seconds (2376 total)
% 45.44/11.39 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1485s (5) cores
% 45.44/11.39 % Starting new_bool_3 with 297s (1) cores
% 45.44/11.39 % Starting new_bool_1 with 297s (1) cores
% 45.44/11.39 % Starting sh5l with 297s (1) cores
% 45.44/11.39 % sh5l with pid 3206213 completed with status 0
% 45.44/11.39 % Result found by sh5l
% 45.44/11.39 % Preprocessing class: FMLLSMSLSSSNFFN.
% 45.44/11.39 % Scheduled 4 strats onto 8 cores with 297 seconds (2376 total)
% 45.44/11.39 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1485s (5) cores
% 45.44/11.39 % Starting new_bool_3 with 297s (1) cores
% 45.44/11.39 % Starting new_bool_1 with 297s (1) cores
% 45.44/11.39 % Starting sh5l with 297s (1) cores
% 45.44/11.39 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 45.44/11.39 % SinE strategy is gf500_gu_R04_F100_L20000
% 45.44/11.39 % Search class: FGHSM-SMLM33-MFFFFFNN
% 45.44/11.39 % partial match(1): FGHSM-SMLM32-MFFFFFNN
% 45.44/11.39 % Scheduled 13 strats onto 1 cores with 294 seconds (294 total)
% 45.44/11.39 % Starting SubtermCWHack with 27s (1) cores
% 45.44/11.39 % SubtermCWHack with pid 3206223 completed with status 0
% 45.44/11.39 % Result found by SubtermCWHack
% 45.44/11.39 % Preprocessing class: FMLLSMSLSSSNFFN.
% 45.44/11.39 % Scheduled 4 strats onto 8 cores with 297 seconds (2376 total)
% 45.44/11.39 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1485s (5) cores
% 45.44/11.39 % Starting new_bool_3 with 297s (1) cores
% 45.44/11.39 % Starting new_bool_1 with 297s (1) cores
% 45.44/11.39 % Starting sh5l with 297s (1) cores
% 45.44/11.39 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 45.44/11.39 % SinE strategy is gf500_gu_R04_F100_L20000
% 45.44/11.39 % Search class: FGHSM-SMLM33-MFFFFFNN
% 45.44/11.39 % partial match(1): FGHSM-SMLM32-MFFFFFNN
% 45.44/11.39 % Scheduled 13 strats onto 1 cores with 294 seconds (294 total)
% 45.44/11.39 % Starting SubtermCWHack with 27s (1) cores
% 45.44/11.39 % Preprocessing time : 0.484 s
% 45.44/11.39
% 45.44/11.39 % Proof found!
% 45.44/11.39 % SZS status Theorem
% 45.44/11.39 % SZS output start CNFRefutation
% See solution above
% 45.44/11.39 % Parsed axioms : 55594
% 45.44/11.39 % Removed by relevancy pruning/SinE : 48559
% 45.44/11.39 % Initial clauses : 12738
% 45.44/11.39 % Removed in clause preprocessing : 731
% 45.44/11.39 % Initial clauses in saturation : 12007
% 45.44/11.39 % Processed clauses : 4133
% 45.44/11.39 % ...of these trivial : 774
% 45.44/11.39 % ...subsumed : 1
% 45.44/11.39 % ...remaining for further processing : 3358
% 45.44/11.39 % Other redundant clauses eliminated : 22
% 45.44/11.39 % Clauses deleted for lack of memory : 0
% 45.44/11.39 % Backward-subsumed : 1
% 45.44/11.39 % Backward-rewritten : 1
% 45.44/11.39 % Generated clauses : 9680
% 45.44/11.39 % ...of the previous two non-redundant : 9562
% 45.44/11.39 % ...aggressively subsumed : 0
% 45.44/11.39 % Contextual simplify-reflections : 0
% 45.44/11.39 % Paramodulations : 9657
% 45.44/11.39 % Factorizations : 0
% 45.44/11.39 % NegExts : 0
% 45.44/11.39 % Equation resolutions : 22
% 45.44/11.39 % Disequality decompositions : 0
% 45.44/11.39 % Total rewrite steps : 886
% 45.44/11.39 % ...of those cached : 541
% 45.44/11.39 % Propositional unsat checks : 0
% 45.44/11.39 % Propositional check models : 0
% 45.44/11.39 % Propositional check unsatisfiable : 0
% 45.44/11.39 % Propositional clauses : 0
% 45.44/11.39 % Propositional clauses after purity: 0
% 45.44/11.39 % Propositional unsat core size : 0
% 45.44/11.39 % Propositional preprocessing time : 0.000
% 45.44/11.39 % Propositional encoding time : 0.000
% 45.44/11.39 % Propositional solver time : 0.000
% 45.44/11.39 % Success case prop preproc time : 0.000
% 45.44/11.39 % Success case prop encoding time : 0.000
% 45.44/11.39 % Success case prop solver time : 0.000
% 45.44/11.39 % Current number of processed clauses : 3350
% 45.44/11.39 % Positive orientable unit clauses : 3134
% 45.44/11.39 % Positive unorientable unit clauses: 0
% 45.44/11.39 % Negative unit clauses : 3
% 45.44/11.39 % Non-unit-clauses : 213
% 45.44/11.39 % Current number of unprocessed clauses: 17436
% 45.44/11.39 % ...number of literals in the above : 73097
% 45.44/11.39 % Current number of archived formulas : 0
% 45.44/11.39 % Current number of archived clauses : 3
% 45.44/11.39 % Clause-clause subsumption calls (NU) : 8870
% 45.44/11.39 % Rec. Clause-clause subsumption calls : 7923
% 45.44/11.39 % Non-unit clause-clause subsumptions : 1
% 45.44/11.39 % Unit Clause-clause subsumption calls : 72969
% 45.44/11.39 % Rewrite failures with RHS unbound : 0
% 45.44/11.39 % BW rewrite match attempts : 46
% 45.44/11.39 % BW rewrite match successes : 1
% 45.44/11.39 % Condensation attempts : 0
% 45.44/11.39 % Condensation successes : 0
% 45.44/11.39 % Termbank termtop insertions : 1919240
% 45.44/11.39 % Search garbage collected termcells : 474088
% 45.44/11.39
% 45.44/11.39 % -------------------------------------------------
% 45.44/11.39 % User time : 4.235 s
% 45.44/11.39 % System time : 0.539 s
% 45.44/11.39 % Total time : 4.775 s
% 45.44/11.39 % Maximum resident set size: 168212 pages
% 45.44/11.39
% 45.44/11.39 % -------------------------------------------------
% 45.44/11.39 % User time : 7.671 s
% 45.44/11.39 % System time : 0.708 s
% 45.44/11.39 % Total time : 8.379 s
% 45.44/11.39 % Maximum resident set size: 63744 pages
% 45.44/11.39 % E exiting
%------------------------------------------------------------------------------