%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : KRS003-1 : TPTP v9.3.1. Released v2.0.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 01:00:32 PM UTC 2026
% Result : Unsatisfiable 0.14s 0.59s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 10
% Syntax : Number of clauses : 35 ( 9 unt; 0 nHn; 35 RR)
% Number of literals : 69 ( 0 equ; 38 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% 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)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_11,axiom,
( ~ s(X3,X2)
| ~ s(X3,X1)
| ~ s1most(X3)
| equalish(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_11) ).
cnf(clause_6,axiom,
( ~ s2least(X1)
| s(X1,u1r1(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_6) ).
cnf(clause_15,axiom,
( ~ e(X1)
| c(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_15) ).
cnf(clause_16,axiom,
( ~ f(X1)
| d(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_16) ).
cnf(clause_5,axiom,
( ~ equalish(u1r2(X1),u1r1(X1))
| ~ s2least(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_5) ).
cnf(clause_7,axiom,
( ~ s2least(X1)
| s(X1,u1r2(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_7) ).
cnf(clause_3,axiom,
( ~ c(X1)
| s2least(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_3) ).
cnf(clause_1,negated_conjecture,
e(exist),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_1) ).
cnf(clause_9,axiom,
( ~ d(X1)
| s1most(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_9) ).
cnf(clause_2,negated_conjecture,
f(exist),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_2) ).
cnf(c_0_10,plain,
( ~ s(X3,X2)
| ~ s(X3,X1)
| ~ s1most(X3)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause_11]) ).
cnf(c_0_11,plain,
( ~ s2least(X1)
| s(X1,u1r1(X1)) ),
inference(fof_simplification,[status(thm)],[clause_6]) ).
cnf(c_0_12,plain,
( ~ e(X1)
| c(X1) ),
inference(fof_simplification,[status(thm)],[clause_15]) ).
cnf(c_0_13,plain,
( ~ f(X1)
| d(X1) ),
inference(fof_simplification,[status(thm)],[clause_16]) ).
cnf(c_0_14,plain,
( ~ equalish(u1r2(X1),u1r1(X1))
| ~ s2least(X1) ),
inference(fof_simplification,[status(thm)],[clause_5]) ).
cnf(c_0_15,plain,
( ~ s(X3,X2)
| ~ s(X3,X1)
| ~ s1most(X3)
| equalish(X1,X2) ),
c_0_10 ).
cnf(c_0_16,plain,
( ~ s2least(X1)
| s(X1,u1r1(X1)) ),
c_0_11 ).
cnf(c_0_17,plain,
( ~ s2least(X1)
| s(X1,u1r2(X1)) ),
inference(fof_simplification,[status(thm)],[clause_7]) ).
cnf(c_0_18,plain,
( ~ c(X1)
| s2least(X1) ),
inference(fof_simplification,[status(thm)],[clause_3]) ).
cnf(c_0_19,plain,
( ~ e(X1)
| c(X1) ),
c_0_12 ).
cnf(c_0_20,negated_conjecture,
e(exist),
clause_1 ).
cnf(c_0_21,plain,
( ~ d(X1)
| s1most(X1) ),
inference(fof_simplification,[status(thm)],[clause_9]) ).
cnf(c_0_22,plain,
( ~ f(X1)
| d(X1) ),
c_0_13 ).
cnf(c_0_23,negated_conjecture,
f(exist),
clause_2 ).
cnf(c_0_24,plain,
( ~ equalish(u1r2(X1),u1r1(X1))
| ~ s2least(X1) ),
c_0_14 ).
cnf(c_0_25,plain,
( ~ s2least(X2)
| ~ s(X2,X1)
| ~ s1most(X2)
| equalish(X1,u1r1(X2)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_26,plain,
( ~ s2least(X1)
| s(X1,u1r2(X1)) ),
c_0_17 ).
cnf(c_0_27,plain,
( ~ c(X1)
| s2least(X1) ),
c_0_18 ).
cnf(c_0_28,negated_conjecture,
c(exist),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_29,plain,
( ~ d(X1)
| s1most(X1) ),
c_0_21 ).
cnf(c_0_30,negated_conjecture,
d(exist),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_31,plain,
( ~ s2least(X1)
| ~ s1most(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
cnf(c_0_32,negated_conjecture,
s2least(exist),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,negated_conjecture,
s1most(exist),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS003-1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.52 % Computer : n018.cluster.edu
% 0.09/0.52 % Model : x86_64 x86_64
% 0.09/0.52 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.52 % Memory : 8046.5625MB
% 0.09/0.52 % OS : Linux 6.8.0-71-generic
% 0.09/0.52 % CPULimit : 300
% 0.09/0.52 % WCLimit : 300
% 0.09/0.52 % DateTime : Sun Sep 20 22:51:58 UTC 2026
% 0.09/0.53 % CPUTime :
% 0.09/0.53 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.57 Running first-order theorem proving
% 0.14/0.57 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.14/0.59 % Version: 3.5.1
% 0.14/0.59 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.59 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.59 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.59 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.59 % Starting sh5l with 300s (1) cores
% 0.14/0.59 % sh5l with pid 368505 completed with status 0
% 0.14/0.59 % Result found by sh5l
% 0.14/0.59 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.59 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.59 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.59 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.59 % Starting sh5l with 300s (1) cores
% 0.14/0.59 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.14/0.59 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.59 % Search class: FGHNF-FFSF11-SFFFFFNN
% 0.14/0.59 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.59 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.59 % SubtermCWHack with pid 368507 completed with status 0
% 0.14/0.59 % Result found by SubtermCWHack
% 0.14/0.59 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.59 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.59 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.59 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.59 % Starting sh5l with 300s (1) cores
% 0.14/0.59 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.14/0.59 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.59 % Search class: FGHNF-FFSF11-SFFFFFNN
% 0.14/0.59 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.59 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.59 % Preprocessing time : 0.001 s
% 0.14/0.59
% 0.14/0.59 % Proof found!
% 0.14/0.59 % SZS status Unsatisfiable
% 0.14/0.59 % SZS output start CNFRefutation
% See solution above
% 0.14/0.59 % Parsed axioms : 16
% 0.14/0.59 % Removed by relevancy pruning/SinE : 0
% 0.14/0.59 % Initial clauses : 16
% 0.14/0.59 % Removed in clause preprocessing : 0
% 0.14/0.59 % Initial clauses in saturation : 16
% 0.14/0.59 % Processed clauses : 25
% 0.14/0.59 % ...of these trivial : 0
% 0.14/0.59 % ...subsumed : 0
% 0.14/0.59 % ...remaining for further processing : 25
% 0.14/0.59 % Other redundant clauses eliminated : 0
% 0.14/0.59 % Clauses deleted for lack of memory : 0
% 0.14/0.59 % Backward-subsumed : 3
% 0.14/0.59 % Backward-rewritten : 0
% 0.14/0.59 % Generated clauses : 18
% 0.14/0.59 % ...of the previous two non-redundant : 10
% 0.14/0.59 % ...aggressively subsumed : 0
% 0.14/0.59 % Contextual simplify-reflections : 2
% 0.14/0.59 % Paramodulations : 18
% 0.14/0.59 % Factorizations : 0
% 0.14/0.59 % NegExts : 0
% 0.14/0.59 % Equation resolutions : 0
% 0.14/0.59 % Disequality decompositions : 0
% 0.14/0.59 % Total rewrite steps : 1
% 0.14/0.59 % ...of those cached : 0
% 0.14/0.59 % Propositional unsat checks : 0
% 0.14/0.59 % Propositional check models : 0
% 0.14/0.59 % Propositional check unsatisfiable : 0
% 0.14/0.59 % Propositional clauses : 0
% 0.14/0.59 % Propositional clauses after purity: 0
% 0.14/0.59 % Propositional unsat core size : 0
% 0.14/0.59 % Propositional preprocessing time : 0.000
% 0.14/0.59 % Propositional encoding time : 0.000
% 0.14/0.59 % Propositional solver time : 0.000
% 0.14/0.59 % Success case prop preproc time : 0.000
% 0.14/0.59 % Success case prop encoding time : 0.000
% 0.14/0.59 % Success case prop solver time : 0.000
% 0.14/0.59 % Current number of processed clauses : 22
% 0.14/0.59 % Positive orientable unit clauses : 6
% 0.14/0.59 % Positive unorientable unit clauses: 0
% 0.14/0.59 % Negative unit clauses : 0
% 0.14/0.59 % Non-unit-clauses : 16
% 0.14/0.59 % Current number of unprocessed clauses: 1
% 0.14/0.59 % ...number of literals in the above : 4
% 0.14/0.59 % Current number of archived formulas : 0
% 0.14/0.59 % Current number of archived clauses : 3
% 0.14/0.59 % Clause-clause subsumption calls (NU) : 48
% 0.14/0.59 % Rec. Clause-clause subsumption calls : 36
% 0.14/0.59 % Non-unit clause-clause subsumptions : 5
% 0.14/0.59 % Unit Clause-clause subsumption calls : 0
% 0.14/0.59 % Rewrite failures with RHS unbound : 0
% 0.14/0.59 % BW rewrite match attempts : 0
% 0.14/0.59 % BW rewrite match successes : 0
% 0.14/0.59 % Condensation attempts : 0
% 0.14/0.59 % Condensation successes : 0
% 0.14/0.59 % Termbank termtop insertions : 626
% 0.14/0.59 % Search garbage collected termcells : 37
% 0.14/0.59
% 0.14/0.59 % -------------------------------------------------
% 0.14/0.59 % User time : 0.003 s
% 0.14/0.59 % System time : 0.001 s
% 0.14/0.59 % Total time : 0.005 s
% 0.14/0.59 % Maximum resident set size: 3640 pages
% 0.14/0.59
% 0.14/0.59 % -------------------------------------------------
% 0.14/0.59 % User time : 0.005 s
% 0.14/0.59 % System time : 0.005 s
% 0.14/0.59 % Total time : 0.011 s
% 0.14/0.59 % Maximum resident set size: 4608 pages
% 0.14/0.59 % E exiting
%------------------------------------------------------------------------------