%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : KRS003_1 : TPTP v9.3.1. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n015.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:01:17 PM UTC 2026
% Result : Theorem 0.24s 0.56s
% Output : CNFRefutation 0.24s
% 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/sandbox2/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/sandbox2/benchmark/theBenchmark.p',clause_11) ).
tff(clause_6,axiom,
! [X1: unreal] :
( s2least(X1)
=> s(X1,u1r1(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).
tff(clause_15,axiom,
! [X1: unreal] :
( e(X1)
=> c(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_15) ).
tff(clause_16,axiom,
! [X1: unreal] :
( f(X1)
=> d(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_16) ).
tff(clause_5,axiom,
! [X1: unreal] :
~ ( equalish(u1r2(X1),u1r1(X1))
& s2least(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_5) ).
tff(clause_7,axiom,
! [X1: unreal] :
( s2least(X1)
=> s(X1,u1r2(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_7) ).
tff(clause_3,axiom,
! [X1: unreal] :
( c(X1)
=> s2least(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).
tff(clause_9,axiom,
! [X1: unreal] :
( d(X1)
=> s1most(X1) ),
file('/export/starexec/sandbox2/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,
! [X14: real,X15: real,X16: unreal] :
( equalish(X15,X14)
| ~ s(X16,X14)
| ~ s(X16,X15)
| ~ s1most(X16) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[clause_11])])]) ).
tff(c_0_12,plain,
! [X7: unreal] :
( s(X7,u1r1(X7))
| ~ s2least(X7) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[clause_6])])]) ).
tff(c_0_13,plain,
! [X20: unreal] :
( c(X20)
| ~ e(X20) ),
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,
! [X21: unreal] :
( d(X21)
| ~ f(X21) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[clause_16])])]) ).
tff(c_0_16,plain,
! [X6: unreal] :
( ~ equalish(u1r2(X6),u1r1(X6))
| ~ s2least(X6) ),
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,
! [X8: unreal] :
( s(X8,u1r2(X8))
| ~ s2least(X8) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[clause_7])])]) ).
tff(c_0_20,plain,
! [X4: unreal] :
( s2least(X4)
| ~ c(X4) ),
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,
! [X12: unreal] :
( s1most(X12)
| ~ d(X12) ),
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.04 % Problem : KRS003_1 : TPTP v9.3.1. Released v5.0.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.46 % Computer : n015.cluster.edu
% 0.19/0.46 % Model : x86_64 x86_64
% 0.19/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.46 % Memory : 8046.5625MB
% 0.19/0.46 % OS : Linux 6.8.0-71-generic
% 0.19/0.46 % CPULimit : 300
% 0.19/0.46 % WCLimit : 300
% 0.19/0.46 % DateTime : Sun Sep 20 22:53:06 UTC 2026
% 0.19/0.46 % CPUTime :
% 0.19/0.46 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.52 Running first-order theorem proving
% 0.19/0.52 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
% 0.24/0.56 % Version: 3.5.1
% 0.24/0.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.56 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.56 % Starting sh5l with 300s (1) cores
% 0.24/0.56 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 4120680 completed with status 0
% 0.24/0.56 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.24/0.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.56 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.56 % No SInE strategy applied
% 0.24/0.56 % Search class: FGHNF-FFSF11-SFFFFFNN
% 0.24/0.56 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.56 % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.24/0.56 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.24/0.56 % Starting new_bool_3 with 136s (1) cores
% 0.24/0.56 % Starting new_bool_1 with 136s (1) cores
% 0.24/0.56 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 4120687 completed with status 0
% 0.24/0.56 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.24/0.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.56 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.56 % No SInE strategy applied
% 0.24/0.56 % Search class: FGHNF-FFSF11-SFFFFFNN
% 0.24/0.56 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.56 % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.24/0.56 % Preprocessing time : 0.002 s
% 0.24/0.56 % Presaturation interreduction done
% 0.24/0.56
% 0.24/0.56 % Proof found!
% 0.24/0.56 % SZS status Theorem
% 0.24/0.56 % SZS output start CNFRefutation
% See solution above
% 0.24/0.56 % Parsed axioms : 30
% 0.24/0.56 % Removed by relevancy pruning/SinE : 0
% 0.24/0.56 % Initial clauses : 31
% 0.24/0.56 % Removed in clause preprocessing : 15
% 0.24/0.56 % Initial clauses in saturation : 16
% 0.24/0.56 % Processed clauses : 38
% 0.24/0.56 % ...of these trivial : 0
% 0.24/0.56 % ...subsumed : 0
% 0.24/0.56 % ...remaining for further processing : 38
% 0.24/0.56 % Other redundant clauses eliminated : 0
% 0.24/0.56 % Clauses deleted for lack of memory : 0
% 0.24/0.56 % Backward-subsumed : 2
% 0.24/0.56 % Backward-rewritten : 0
% 0.24/0.56 % Generated clauses : 12
% 0.24/0.56 % ...of the previous two non-redundant : 7
% 0.24/0.56 % ...aggressively subsumed : 0
% 0.24/0.56 % Contextual simplify-reflections : 1
% 0.24/0.56 % Paramodulations : 12
% 0.24/0.56 % Factorizations : 0
% 0.24/0.56 % NegExts : 0
% 0.24/0.56 % Equation resolutions : 0
% 0.24/0.56 % Disequality decompositions : 0
% 0.24/0.56 % Total rewrite steps : 1
% 0.24/0.56 % ...of those cached : 0
% 0.24/0.56 % Propositional unsat checks : 0
% 0.24/0.56 % Propositional check models : 0
% 0.24/0.56 % Propositional check unsatisfiable : 0
% 0.24/0.56 % Propositional clauses : 0
% 0.24/0.56 % Propositional clauses after purity: 0
% 0.24/0.56 % Propositional unsat core size : 0
% 0.24/0.56 % Propositional preprocessing time : 0.000
% 0.24/0.56 % Propositional encoding time : 0.000
% 0.24/0.56 % Propositional solver time : 0.000
% 0.24/0.56 % Success case prop preproc time : 0.000
% 0.24/0.56 % Success case prop encoding time : 0.000
% 0.24/0.56 % Success case prop solver time : 0.000
% 0.24/0.56 % Current number of processed clauses : 20
% 0.24/0.56 % Positive orientable unit clauses : 6
% 0.24/0.56 % Positive unorientable unit clauses: 0
% 0.24/0.56 % Negative unit clauses : 0
% 0.24/0.56 % Non-unit-clauses : 14
% 0.24/0.56 % Current number of unprocessed clauses: 1
% 0.24/0.56 % ...number of literals in the above : 4
% 0.24/0.56 % Current number of archived formulas : 0
% 0.24/0.56 % Current number of archived clauses : 18
% 0.24/0.56 % Clause-clause subsumption calls (NU) : 45
% 0.24/0.56 % Rec. Clause-clause subsumption calls : 36
% 0.24/0.56 % Non-unit clause-clause subsumptions : 3
% 0.24/0.56 % Unit Clause-clause subsumption calls : 0
% 0.24/0.56 % Rewrite failures with RHS unbound : 0
% 0.24/0.56 % BW rewrite match attempts : 0
% 0.24/0.56 % BW rewrite match successes : 0
% 0.24/0.56 % Condensation attempts : 0
% 0.24/0.56 % Condensation successes : 0
% 0.24/0.56 % Termbank termtop insertions : 1402
% 0.24/0.56 % Search garbage collected termcells : 141
% 0.24/0.56
% 0.24/0.56 % -------------------------------------------------
% 0.24/0.56 % User time : 0.009 s
% 0.24/0.56 % System time : 0.005 s
% 0.24/0.56 % Total time : 0.014 s
% 0.24/0.56 % Maximum resident set size: 3644 pages
% 0.24/0.56
% 0.24/0.56 % -------------------------------------------------
% 0.24/0.56 % User time : 0.020 s
% 0.24/0.56 % System time : 0.014 s
% 0.24/0.56 % Total time : 0.033 s
% 0.24/0.56 % Maximum resident set size: 4864 pages
% 0.24/0.56 % E exiting
%------------------------------------------------------------------------------