%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : KRS003_1 : TPTP v9.3.1. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/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 01:00:32 PM UTC 2026
% Result : Theorem 0.15s 0.44s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of formulae : 37 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 75 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 74 ( 36 ~; 27 |; 4 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 33 ( 0 sgn 33 !; 0 ?; 33 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
unreal: $tType ).
tff(decl_sort2,type,
real: $tType ).
tff(decl_23,type,
u1r1: unreal > real ).
tff(decl_24,type,
u1r2: unreal > real ).
tff(decl_27,type,
exist: unreal ).
tff(decl_28,type,
f: unreal > $o ).
tff(decl_29,type,
d: unreal > $o ).
tff(decl_30,type,
e: unreal > $o ).
tff(decl_31,type,
s1most: unreal > $o ).
tff(decl_32,type,
s: ( real * unreal ) > $o ).
tff(decl_33,type,
c: unreal > $o ).
tff(decl_34,type,
equalish: ( real * real ) > $o ).
tff(decl_35,type,
s2least: unreal > $o ).
tff(clause_1__clause_2,conjecture,
( ~ f(exist)
| ~ e(exist) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_1__clause_2) ).
tff(clause_11,axiom,
! [X2: real,X3: real,X1: unreal] :
( ( s(X1,X2)
& s(X1,X3)
& s1most(X1) )
=> equalish(X3,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_11) ).
tff(clause_6,axiom,
! [X1: unreal] :
( s2least(X1)
=> s(X1,u1r1(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_6) ).
tff(clause_15,axiom,
! [X1: unreal] :
( e(X1)
=> c(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_15) ).
tff(clause_16,axiom,
! [X1: unreal] :
( f(X1)
=> d(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_16) ).
tff(clause_5,axiom,
! [X1: unreal] :
~ ( equalish(u1r2(X1),u1r1(X1))
& s2least(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_5) ).
tff(clause_7,axiom,
! [X1: unreal] :
( s2least(X1)
=> s(X1,u1r2(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_7) ).
tff(clause_3,axiom,
! [X1: unreal] :
( c(X1)
=> s2least(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_3) ).
tff(clause_9,axiom,
! [X1: unreal] :
( d(X1)
=> s1most(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_9) ).
tff(c_0_9,negated_conjecture,
~ ( ~ f(exist)
| ~ e(exist) ),
inference(assume_negation,[status(cth)],[clause_1__clause_2]) ).
tff(c_0_10,negated_conjecture,
~ ( ~ f(exist)
| ~ e(exist) ),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
tff(c_0_11,plain,
! [X10: real,X11: real,X12: unreal] :
( equalish(X11,X10)
| ~ s(X12,X10)
| ~ s(X12,X11)
| ~ s1most(X12) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[clause_11])])]) ).
tff(c_0_12,plain,
! [X17: unreal] :
( s(X17,u1r1(X17))
| ~ s2least(X17) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[clause_6])])]) ).
tff(c_0_13,plain,
! [X5: unreal] :
( c(X5)
| ~ e(X5) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[clause_15])])]) ).
tff(c_0_14,negated_conjecture,
( f(exist)
& e(exist) ),
inference(fof_nnf,[status(thm)],[c_0_10]) ).
tff(c_0_15,plain,
! [X4: unreal] :
( d(X4)
| ~ f(X4) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[clause_16])])]) ).
tff(c_0_16,plain,
! [X16: unreal] :
( ~ equalish(u1r2(X16),u1r1(X16))
| ~ s2least(X16) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[clause_5])])]) ).
tcf(c_0_17,plain,
! [X1: unreal,X2: real,X3: real] :
( ~ s(X1,X3)
| ~ s(X1,X2)
| ~ s1most(X1)
| equalish(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
tcf(c_0_18,plain,
! [X1: unreal] :
( ~ s2least(X1)
| s(X1,u1r1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
tff(c_0_19,plain,
! [X18: unreal] :
( s(X18,u1r2(X18))
| ~ s2least(X18) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[clause_7])])]) ).
tff(c_0_20,plain,
! [X8: unreal] :
( s2least(X8)
| ~ c(X8) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[clause_3])])]) ).
tcf(c_0_21,plain,
! [X1: unreal] :
( ~ e(X1)
| c(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
tcf(c_0_22,negated_conjecture,
e(exist),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
tff(c_0_23,plain,
! [X6: unreal] :
( s1most(X6)
| ~ d(X6) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[clause_9])])]) ).
tcf(c_0_24,plain,
! [X1: unreal] :
( ~ f(X1)
| d(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
tcf(c_0_25,negated_conjecture,
f(exist),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
tcf(c_0_26,plain,
! [X1: unreal] :
( ~ equalish(u1r2(X1),u1r1(X1))
| ~ s2least(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
tcf(c_0_27,plain,
! [X2: real,X1: unreal] :
( ~ s1most(X1)
| ~ s(X1,X2)
| ~ s2least(X1)
| equalish(X2,u1r1(X1)) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
tcf(c_0_28,plain,
! [X1: unreal] :
( ~ s2least(X1)
| s(X1,u1r2(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
tcf(c_0_29,plain,
! [X1: unreal] :
( ~ c(X1)
| s2least(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
tcf(c_0_30,negated_conjecture,
c(exist),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
tcf(c_0_31,plain,
! [X1: unreal] :
( ~ d(X1)
| s1most(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
tcf(c_0_32,negated_conjecture,
d(exist),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
tcf(c_0_33,plain,
! [X1: unreal] :
( ~ s1most(X1)
| ~ s2least(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).
tcf(c_0_34,negated_conjecture,
s2least(exist),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
tcf(c_0_35,negated_conjecture,
s1most(exist),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS003_1 : TPTP v9.3.1. Released v5.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.36 % Computer : n003.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8046.5625MB
% 0.15/0.36 % OS : Linux 6.8.0-71-generic
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Sun Sep 20 22:51:31 UTC 2026
% 0.15/0.36 % CPUTime :
% 0.15/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 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
% 0.15/0.44 % Version: 3.5.1
% 0.15/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.44 % Starting sh5l with 300s (1) cores
% 0.15/0.44 % sh5l with pid 2788356 completed with status 0
% 0.15/0.44 % Result found by sh5l
% 0.15/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.44 % Starting sh5l with 300s (1) cores
% 0.15/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.15/0.44 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.44 % Search class: FGHNF-FFSF11-SFFFFFNN
% 0.15/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.44 % SubtermCWHack with pid 2788358 completed with status 0
% 0.15/0.44 % Result found by SubtermCWHack
% 0.15/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.44 % Starting sh5l with 300s (1) cores
% 0.15/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.15/0.44 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.44 % Search class: FGHNF-FFSF11-SFFFFFNN
% 0.15/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.44 % Preprocessing time : 0.001 s
% 0.15/0.44
% 0.15/0.44 % Proof found!
% 0.15/0.44 % SZS status Theorem
% 0.15/0.44 % SZS output start CNFRefutation
% See solution above
% 0.15/0.44 % Parsed axioms : 30
% 0.15/0.44 % Removed by relevancy pruning/SinE : 15
% 0.15/0.44 % Initial clauses : 16
% 0.15/0.44 % Removed in clause preprocessing : 0
% 0.15/0.44 % Initial clauses in saturation : 16
% 0.15/0.44 % Processed clauses : 26
% 0.15/0.44 % ...of these trivial : 0
% 0.15/0.44 % ...subsumed : 0
% 0.15/0.44 % ...remaining for further processing : 26
% 0.15/0.44 % Other redundant clauses eliminated : 0
% 0.15/0.44 % Clauses deleted for lack of memory : 0
% 0.15/0.44 % Backward-subsumed : 4
% 0.15/0.44 % Backward-rewritten : 0
% 0.15/0.44 % Generated clauses : 18
% 0.15/0.44 % ...of the previous two non-redundant : 10
% 0.15/0.44 % ...aggressively subsumed : 0
% 0.15/0.44 % Contextual simplify-reflections : 2
% 0.15/0.44 % Paramodulations : 18
% 0.15/0.44 % Factorizations : 0
% 0.15/0.44 % NegExts : 0
% 0.15/0.44 % Equation resolutions : 0
% 0.15/0.44 % Disequality decompositions : 0
% 0.15/0.44 % Total rewrite steps : 1
% 0.15/0.44 % ...of those cached : 0
% 0.15/0.44 % Propositional unsat checks : 0
% 0.15/0.44 % Propositional check models : 0
% 0.15/0.44 % Propositional check unsatisfiable : 0
% 0.15/0.44 % Propositional clauses : 0
% 0.15/0.44 % Propositional clauses after purity: 0
% 0.15/0.44 % Propositional unsat core size : 0
% 0.15/0.44 % Propositional preprocessing time : 0.000
% 0.15/0.44 % Propositional encoding time : 0.000
% 0.15/0.44 % Propositional solver time : 0.000
% 0.15/0.44 % Success case prop preproc time : 0.000
% 0.15/0.44 % Success case prop encoding time : 0.000
% 0.15/0.44 % Success case prop solver time : 0.000
% 0.15/0.44 % Current number of processed clauses : 22
% 0.15/0.44 % Positive orientable unit clauses : 6
% 0.15/0.44 % Positive unorientable unit clauses: 0
% 0.15/0.44 % Negative unit clauses : 0
% 0.15/0.44 % Non-unit-clauses : 16
% 0.15/0.44 % Current number of unprocessed clauses: 0
% 0.15/0.44 % ...number of literals in the above : 0
% 0.15/0.44 % Current number of archived formulas : 0
% 0.15/0.44 % Current number of archived clauses : 4
% 0.15/0.44 % Clause-clause subsumption calls (NU) : 59
% 0.15/0.44 % Rec. Clause-clause subsumption calls : 45
% 0.15/0.44 % Non-unit clause-clause subsumptions : 6
% 0.15/0.44 % Unit Clause-clause subsumption calls : 0
% 0.15/0.44 % Rewrite failures with RHS unbound : 0
% 0.15/0.44 % BW rewrite match attempts : 0
% 0.15/0.44 % BW rewrite match successes : 0
% 0.15/0.44 % Condensation attempts : 0
% 0.15/0.44 % Condensation successes : 0
% 0.15/0.44 % Termbank termtop insertions : 1269
% 0.15/0.44 % Search garbage collected termcells : 142
% 0.15/0.44
% 0.15/0.44 % -------------------------------------------------
% 0.15/0.44 % User time : 0.005 s
% 0.15/0.44 % System time : 0.003 s
% 0.15/0.44 % Total time : 0.008 s
% 0.15/0.44 % Maximum resident set size: 3644 pages
% 0.15/0.44
% 0.15/0.44 % -------------------------------------------------
% 0.15/0.44 % User time : 0.006 s
% 0.15/0.44 % System time : 0.008 s
% 0.15/0.44 % Total time : 0.014 s
% 0.15/0.44 % Maximum resident set size: 4864 pages
% 0.15/0.44 % E exiting
%------------------------------------------------------------------------------