%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : KRS013-1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n002.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:34 PM UTC 2026
% Result : Unsatisfiable 0.14s 0.44s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 16
% Syntax : Number of clauses : 55 ( 6 unt; 16 nHn; 47 RR)
% Number of literals : 135 ( 0 equ; 70 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 13 ( 12 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-1 aty)
% Number of variables : 69 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_26,axiom,
( ~ s(X1,X3)
| ~ s(X1,X2)
| equalish(X2,X3)
| s2least(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_26) ).
cnf(clause_11,axiom,
( ~ t(X3,X2)
| ~ t(X3,X1)
| ~ t1most(X3)
| equalish(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_11) ).
cnf(clause_6,axiom,
( ~ t2least(X1)
| t(X1,u1r1(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).
cnf(clause_16,axiom,
( ~ s2least(X1)
| ~ r(X2,X1)
| ~ e(X2)
| c(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_16) ).
cnf(clause_15,axiom,
( ~ r(X2,X1)
| ~ e(X2)
| d(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_15) ).
cnf(clause_31,axiom,
( ~ equalish(u7r2(X1),u7r1(X1))
| s1most(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_31) ).
cnf(clause_32,axiom,
( s(X1,u7r1(X1))
| s1most(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_32) ).
cnf(clause_5,axiom,
( ~ equalish(u1r2(X1),u1r1(X1))
| ~ t2least(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_5) ).
cnf(clause_7,axiom,
( ~ t2least(X1)
| t(X1,u1r2(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_7) ).
cnf(clause_3,axiom,
( ~ c(X1)
| t2least(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).
cnf(clause_29,axiom,
( r(X1,u6r1(X1))
| f(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_29) ).
cnf(clause_9,axiom,
( ~ d(X1)
| t1most(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_9) ).
cnf(clause_28,axiom,
( ~ s1most(u6r1(X1))
| f(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_28) ).
cnf(clause_33,axiom,
( s(X1,u7r2(X1))
| s1most(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_33) ).
cnf(clause_2,negated_conjecture,
~ f(exist),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).
cnf(clause_1,negated_conjecture,
e(exist),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).
cnf(c_0_16,plain,
( ~ s(X1,X3)
| ~ s(X1,X2)
| equalish(X2,X3)
| s2least(X1) ),
inference(fof_simplification,[status(thm)],[clause_26]) ).
cnf(c_0_17,plain,
( ~ t(X3,X2)
| ~ t(X3,X1)
| ~ t1most(X3)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause_11]) ).
cnf(c_0_18,plain,
( ~ t2least(X1)
| t(X1,u1r1(X1)) ),
inference(fof_simplification,[status(thm)],[clause_6]) ).
cnf(c_0_19,plain,
( ~ s2least(X1)
| ~ r(X2,X1)
| ~ e(X2)
| c(X1) ),
inference(fof_simplification,[status(thm)],[clause_16]) ).
cnf(c_0_20,plain,
( ~ r(X2,X1)
| ~ e(X2)
| d(X1) ),
inference(fof_simplification,[status(thm)],[clause_15]) ).
cnf(c_0_21,plain,
( ~ equalish(u7r2(X1),u7r1(X1))
| s1most(X1) ),
inference(fof_simplification,[status(thm)],[clause_31]) ).
cnf(c_0_22,plain,
( ~ s(X1,X3)
| ~ s(X1,X2)
| equalish(X2,X3)
| s2least(X1) ),
c_0_16 ).
cnf(c_0_23,axiom,
( s(X1,u7r1(X1))
| s1most(X1) ),
clause_32 ).
cnf(c_0_24,plain,
( ~ equalish(u1r2(X1),u1r1(X1))
| ~ t2least(X1) ),
inference(fof_simplification,[status(thm)],[clause_5]) ).
cnf(c_0_25,plain,
( ~ t(X3,X2)
| ~ t(X3,X1)
| ~ t1most(X3)
| equalish(X1,X2) ),
c_0_17 ).
cnf(c_0_26,plain,
( ~ t2least(X1)
| t(X1,u1r1(X1)) ),
c_0_18 ).
cnf(c_0_27,plain,
( ~ t2least(X1)
| t(X1,u1r2(X1)) ),
inference(fof_simplification,[status(thm)],[clause_7]) ).
cnf(c_0_28,plain,
( ~ c(X1)
| t2least(X1) ),
inference(fof_simplification,[status(thm)],[clause_3]) ).
cnf(c_0_29,plain,
( ~ s2least(X1)
| ~ r(X2,X1)
| ~ e(X2)
| c(X1) ),
c_0_19 ).
cnf(c_0_30,axiom,
( r(X1,u6r1(X1))
| f(X1) ),
clause_29 ).
cnf(c_0_31,plain,
( ~ d(X1)
| t1most(X1) ),
inference(fof_simplification,[status(thm)],[clause_9]) ).
cnf(c_0_32,plain,
( ~ r(X2,X1)
| ~ e(X2)
| d(X1) ),
c_0_20 ).
cnf(c_0_33,plain,
( ~ s1most(u6r1(X1))
| f(X1) ),
inference(fof_simplification,[status(thm)],[clause_28]) ).
cnf(c_0_34,plain,
( ~ equalish(u7r2(X1),u7r1(X1))
| s1most(X1) ),
c_0_21 ).
cnf(c_0_35,plain,
( ~ s(X1,X2)
| equalish(X2,u7r1(X1))
| s2least(X1)
| s1most(X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_36,axiom,
( s(X1,u7r2(X1))
| s1most(X1) ),
clause_33 ).
cnf(c_0_37,plain,
( ~ equalish(u1r2(X1),u1r1(X1))
| ~ t2least(X1) ),
c_0_24 ).
cnf(c_0_38,plain,
( ~ t2least(X2)
| ~ t(X2,X1)
| ~ t1most(X2)
| equalish(X1,u1r1(X2)) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_39,plain,
( ~ t2least(X1)
| t(X1,u1r2(X1)) ),
c_0_27 ).
cnf(c_0_40,plain,
( ~ c(X1)
| t2least(X1) ),
c_0_28 ).
cnf(c_0_41,plain,
( ~ e(X1)
| ~ s2least(u6r1(X1))
| f(X1)
| c(u6r1(X1)) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_42,plain,
( ~ d(X1)
| t1most(X1) ),
c_0_31 ).
cnf(c_0_43,plain,
( ~ e(X1)
| f(X1)
| d(u6r1(X1)) ),
inference(spm,[status(thm)],[c_0_32,c_0_30]) ).
cnf(c_0_44,plain,
( ~ s1most(u6r1(X1))
| f(X1) ),
c_0_33 ).
cnf(c_0_45,plain,
( s2least(X1)
| s1most(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).
cnf(c_0_46,negated_conjecture,
~ f(exist),
inference(fof_simplification,[status(thm)],[clause_2]) ).
cnf(c_0_47,plain,
( ~ t2least(X1)
| ~ t1most(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]) ).
cnf(c_0_48,plain,
( ~ e(X1)
| ~ s2least(u6r1(X1))
| f(X1)
| t2least(u6r1(X1)) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_49,plain,
( ~ e(X1)
| f(X1)
| t1most(u6r1(X1)) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_50,plain,
( f(X1)
| s2least(u6r1(X1)) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_51,negated_conjecture,
~ f(exist),
c_0_46 ).
cnf(c_0_52,plain,
( ~ e(X1)
| f(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]),c_0_50]) ).
cnf(c_0_53,negated_conjecture,
e(exist),
clause_1 ).
cnf(c_0_54,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS013-1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n002.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 20 22:53:17 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.42 Running first-order theorem proving
% 0.14/0.42 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.14/0.44 % Version: 3.5.1
% 0.14/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.44 % Starting sh5l with 300s (1) cores
% 0.14/0.44 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1877220 completed with status 0
% 0.14/0.44 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.44 % No SInE strategy applied
% 0.14/0.44 % Search class: FGHNF-FFMF11-SFFFFFNN
% 0.14/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.44 % Starting G-E--_107_C18_F1_PI_AE_Q4_CS_SP_PS_S4S with 136s (1) cores
% 0.14/0.44 % Starting G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.14/0.44 % Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y with 136s (1) cores
% 0.14/0.44 % SubtermCWHack with pid 1877225 completed with status 0
% 0.14/0.44 % Result found by SubtermCWHack
% 0.14/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.44 % No SInE strategy applied
% 0.14/0.44 % Search class: FGHNF-FFMF11-SFFFFFNN
% 0.14/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.44 % Preprocessing time : 0.001 s
% 0.14/0.44
% 0.14/0.44 % Proof found!
% 0.14/0.44 % SZS status Unsatisfiable
% 0.14/0.44 % SZS output start CNFRefutation
% See solution above
% 0.14/0.44 % Parsed axioms : 33
% 0.14/0.44 % Removed by relevancy pruning/SinE : 0
% 0.14/0.44 % Initial clauses : 33
% 0.14/0.44 % Removed in clause preprocessing : 0
% 0.14/0.44 % Initial clauses in saturation : 33
% 0.14/0.44 % Processed clauses : 57
% 0.14/0.44 % ...of these trivial : 0
% 0.14/0.44 % ...subsumed : 2
% 0.14/0.44 % ...remaining for further processing : 55
% 0.14/0.44 % Other redundant clauses eliminated : 0
% 0.14/0.44 % Clauses deleted for lack of memory : 0
% 0.14/0.44 % Backward-subsumed : 7
% 0.14/0.44 % Backward-rewritten : 0
% 0.14/0.44 % Generated clauses : 47
% 0.14/0.44 % ...of the previous two non-redundant : 27
% 0.14/0.44 % ...aggressively subsumed : 0
% 0.14/0.44 % Contextual simplify-reflections : 5
% 0.14/0.44 % Paramodulations : 47
% 0.14/0.44 % Factorizations : 0
% 0.14/0.44 % NegExts : 0
% 0.14/0.44 % Equation resolutions : 0
% 0.14/0.44 % Disequality decompositions : 0
% 0.14/0.44 % Total rewrite steps : 1
% 0.14/0.44 % ...of those cached : 0
% 0.14/0.44 % Propositional unsat checks : 0
% 0.14/0.44 % Propositional check models : 0
% 0.14/0.44 % Propositional check unsatisfiable : 0
% 0.14/0.44 % Propositional clauses : 0
% 0.14/0.44 % Propositional clauses after purity: 0
% 0.14/0.44 % Propositional unsat core size : 0
% 0.14/0.44 % Propositional preprocessing time : 0.000
% 0.14/0.44 % Propositional encoding time : 0.000
% 0.14/0.44 % Propositional solver time : 0.000
% 0.14/0.44 % Success case prop preproc time : 0.000
% 0.14/0.44 % Success case prop encoding time : 0.000
% 0.14/0.44 % Success case prop solver time : 0.000
% 0.14/0.44 % Current number of processed clauses : 48
% 0.14/0.44 % Positive orientable unit clauses : 1
% 0.14/0.44 % Positive unorientable unit clauses: 0
% 0.14/0.44 % Negative unit clauses : 1
% 0.14/0.44 % Non-unit-clauses : 46
% 0.14/0.44 % Current number of unprocessed clauses: 3
% 0.14/0.44 % ...number of literals in the above : 12
% 0.14/0.44 % Current number of archived formulas : 0
% 0.14/0.44 % Current number of archived clauses : 7
% 0.14/0.44 % Clause-clause subsumption calls (NU) : 539
% 0.14/0.44 % Rec. Clause-clause subsumption calls : 395
% 0.14/0.44 % Non-unit clause-clause subsumptions : 14
% 0.14/0.44 % Unit Clause-clause subsumption calls : 0
% 0.14/0.44 % Rewrite failures with RHS unbound : 0
% 0.14/0.44 % BW rewrite match attempts : 0
% 0.14/0.44 % BW rewrite match successes : 0
% 0.14/0.44 % Condensation attempts : 0
% 0.14/0.44 % Condensation successes : 0
% 0.14/0.44 % Termbank termtop insertions : 1807
% 0.14/0.44 % Search garbage collected termcells : 82
% 0.14/0.44
% 0.14/0.44 % -------------------------------------------------
% 0.14/0.44 % User time : 0.004 s
% 0.14/0.44 % System time : 0.003 s
% 0.14/0.44 % Total time : 0.007 s
% 0.14/0.44 % Maximum resident set size: 3656 pages
% 0.14/0.44
% 0.14/0.44 % -------------------------------------------------
% 0.14/0.44 % User time : 0.013 s
% 0.14/0.44 % System time : 0.016 s
% 0.14/0.44 % Total time : 0.029 s
% 0.14/0.44 % Maximum resident set size: 4608 pages
% 0.14/0.44 % E exiting
%------------------------------------------------------------------------------