%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : KRS007-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 : n008.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:33 PM UTC 2026
% Result : Satisfiable 0.12s 0.45s
% Output : Saturation 0.12s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_26ERROR: Could not build tree for root c_0_32ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_32,plain,
( ~ s(X3,X2)
| ~ s(X3,X1)
| ~ s1most(X3)
| equalish(X1,X2) ),
c_0_26,
[final] ).
cnf(c_0_33,plain,
( ~ s2least(X1)
| s(X1,u1r1(X1)) ),
c_0_27,
[final] ).
cnf(c_0_38,plain,
( ~ d(X4)
| ~ r(X1,X4)
| ~ c(X3)
| ~ r(X1,X3)
| ~ r(X1,X2)
| e(X1) ),
c_0_28,
[final] ).
cnf(c_0_39,plain,
( ~ r2least(X1)
| r(X1,u6r2(X1)) ),
c_0_29,
[final] ).
cnf(c_0_41,plain,
( ~ r2least(X1)
| r(X1,u6r1(X1)) ),
c_0_30,
[final] ).
cnf(c_0_42,plain,
( ~ equalish(u1r2(X1),u1r1(X1))
| ~ s2least(X1) ),
c_0_31,
[final] ).
cnf(c_0_44,plain,
( ~ s2least(X1)
| s(X1,u1r2(X1)) ),
c_0_34,
[final] ).
cnf(c_0_45,plain,
( ~ c(X1)
| s2least(X1) ),
c_0_35,
[final] ).
cnf(c_0_46,plain,
( ~ e(X1)
| c(u4r2(X1)) ),
c_0_36,
[final] ).
cnf(c_0_52,plain,
( ~ s(X1,X3)
| ~ s(X1,X2)
| equalish(X2,X3)
| s2least(X1) ),
c_0_37,
[final] ).
cnf(c_0_53,axiom,
( s(X1,u3r1(X1))
| s1most(X1) ),
clause_13,
[final] ).
cnf(c_0_58,plain,
( ~ c(X2)
| ~ d(u6r2(X1))
| ~ r(X1,X3)
| ~ r(X1,X2)
| ~ r2least(X1)
| e(X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]),
[final] ).
cnf(c_0_59,plain,
( ~ s1most(X1)
| d(X1) ),
c_0_40,
[final] ).
cnf(c_0_60,plain,
( ~ c(X2)
| ~ d(u6r1(X1))
| ~ r(X1,X3)
| ~ r(X1,X2)
| ~ r2least(X1)
| e(X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_41]),
[final] ).
cnf(c_0_61,plain,
( ~ s2least(X1)
| ~ s1most(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]),
[final] ).
cnf(c_0_62,plain,
( ~ e(X1)
| s2least(u4r2(X1)) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]),
[final] ).
cnf(c_0_63,plain,
( ~ r(X1,X3)
| ~ r(X1,X2)
| equalish(X2,X3)
| r2least(X1) ),
c_0_47,
[final] ).
cnf(c_0_64,plain,
( ~ e(X1)
| r(X1,u4r3(X1)) ),
c_0_48,
[final] ).
cnf(c_0_65,plain,
( ~ e(X1)
| r(X1,u4r2(X1)) ),
c_0_49,
[final] ).
cnf(c_0_66,plain,
( ~ e(X1)
| r(X1,u4r1(X1)) ),
c_0_50,
[final] ).
cnf(c_0_67,plain,
( ~ equalish(u3r2(X1),u3r1(X1))
| s1most(X1) ),
c_0_51,
[final] ).
cnf(c_0_69,axiom,
( s(X1,u3r2(X1))
| s1most(X1) ),
clause_14,
[final] ).
cnf(c_0_71,plain,
( ~ d(X1)
| s1most(X1) ),
c_0_54,
[final] ).
cnf(c_0_72,plain,
( ~ e(X1)
| d(u4r3(X1)) ),
c_0_55,
[final] ).
cnf(c_0_75,negated_conjecture,
~ f(exist),
c_0_56,
[final] ).
cnf(c_0_76,plain,
( ~ r2least(X1)
| f(X1) ),
c_0_57,
[final] ).
cnf(c_0_77,plain,
( ~ c(X2)
| ~ s1most(u6r2(X1))
| ~ r(X1,X3)
| ~ r(X1,X2)
| ~ r2least(X1)
| e(X1) ),
inference(spm,[status(thm)],[c_0_58,c_0_59]),
[final] ).
cnf(c_0_78,plain,
( ~ c(X2)
| ~ s1most(u6r1(X1))
| ~ r(X1,X3)
| ~ r(X1,X2)
| ~ r2least(X1)
| e(X1) ),
inference(spm,[status(thm)],[c_0_60,c_0_59]),
[final] ).
cnf(c_0_79,plain,
( ~ e(X1)
| ~ s1most(u4r2(X1)) ),
inference(spm,[status(thm)],[c_0_61,c_0_62]),
[final] ).
cnf(c_0_80,plain,
( ~ e(X1)
| ~ r(X1,X2)
| equalish(X2,u4r3(X1))
| r2least(X1) ),
inference(spm,[status(thm)],[c_0_63,c_0_64]),
[final] ).
cnf(c_0_81,plain,
( ~ e(X1)
| ~ r(X1,X2)
| equalish(X2,u4r2(X1))
| r2least(X1) ),
inference(spm,[status(thm)],[c_0_63,c_0_65]),
[final] ).
cnf(c_0_82,plain,
( ~ e(X1)
| ~ r(X1,X2)
| equalish(X2,u4r1(X1))
| r2least(X1) ),
inference(spm,[status(thm)],[c_0_63,c_0_66]),
[final] ).
cnf(c_0_83,plain,
( s2least(X1)
| s1most(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_69]),
[final] ).
cnf(c_0_84,plain,
( ~ equalish(u6r2(X1),u6r1(X1))
| ~ r2least(X1) ),
c_0_70,
[final] ).
cnf(c_0_85,plain,
( ~ e(X1)
| s1most(u4r3(X1)) ),
inference(spm,[status(thm)],[c_0_71,c_0_72]),
[final] ).
cnf(c_0_86,plain,
( ~ f(X1)
| r2least(X1) ),
c_0_73,
[final] ).
cnf(c_0_87,plain,
( ~ s2least(X1)
| c(X1) ),
c_0_74,
[final] ).
cnf(c_0_88,negated_conjecture,
~ r2least(exist),
inference(spm,[status(thm)],[c_0_75,c_0_76]),
[final] ).
cnf(c_0_89,negated_conjecture,
e(exist),
clause_1,
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS007-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.12/0.37 % Computer : n008.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Sun Sep 20 22:51:08 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/0.42 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.12/0.45 % Version: 3.5.1
% 0.12/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.45 % Starting sh5l with 300s (1) cores
% 0.12/0.45 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3769168 completed with status 1
% 0.12/0.45 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.45 % No SInE strategy applied
% 0.12/0.45 % Search class: FGHNF-FFSF11-SFFFFFNN
% 0.12/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.12/0.45 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.12/0.45 % Starting new_bool_3 with 136s (1) cores
% 0.12/0.45 % Starting new_bool_1 with 136s (1) cores
% 0.12/0.45 % SubtermCWHack with pid 3769174 completed with status 1
% 0.12/0.45 % Result found by SubtermCWHack
% 0.12/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.45 % No SInE strategy applied
% 0.12/0.45 % Search class: FGHNF-FFSF11-SFFFFFNN
% 0.12/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.45 % Preprocessing time : 0.001 s
% 0.12/0.45
% 0.12/0.45 % No proof found!
% 0.12/0.45 % SZS status Satisfiable
% 0.12/0.45 % SZS output start Saturation
% See solution above
% 0.12/0.45 % Parsed axioms : 26
% 0.12/0.45 % Removed by relevancy pruning/SinE : 0
% 0.12/0.45 % Initial clauses : 26
% 0.12/0.45 % Removed in clause preprocessing : 0
% 0.12/0.45 % Initial clauses in saturation : 26
% 0.12/0.45 % Processed clauses : 43
% 0.12/0.45 % ...of these trivial : 0
% 0.12/0.45 % ...subsumed : 2
% 0.12/0.45 % ...remaining for further processing : 41
% 0.12/0.45 % Other redundant clauses eliminated : 0
% 0.12/0.45 % Clauses deleted for lack of memory : 0
% 0.12/0.45 % Backward-subsumed : 2
% 0.12/0.45 % Backward-rewritten : 0
% 0.12/0.45 % Generated clauses : 30
% 0.12/0.45 % ...of the previous two non-redundant : 17
% 0.12/0.45 % ...aggressively subsumed : 0
% 0.12/0.45 % Contextual simplify-reflections : 2
% 0.12/0.45 % Paramodulations : 30
% 0.12/0.45 % Factorizations : 0
% 0.12/0.45 % NegExts : 0
% 0.12/0.45 % Equation resolutions : 0
% 0.12/0.45 % Disequality decompositions : 0
% 0.12/0.45 % Total rewrite steps : 0
% 0.12/0.45 % ...of those cached : 0
% 0.12/0.45 % Propositional unsat checks : 0
% 0.12/0.45 % Propositional check models : 0
% 0.12/0.45 % Propositional check unsatisfiable : 0
% 0.12/0.45 % Propositional clauses : 0
% 0.12/0.45 % Propositional clauses after purity: 0
% 0.12/0.45 % Propositional unsat core size : 0
% 0.12/0.45 % Propositional preprocessing time : 0.000
% 0.12/0.45 % Propositional encoding time : 0.000
% 0.12/0.45 % Propositional solver time : 0.000
% 0.12/0.45 % Success case prop preproc time : 0.000
% 0.12/0.45 % Success case prop encoding time : 0.000
% 0.12/0.45 % Success case prop solver time : 0.000
% 0.12/0.45 % Current number of processed clauses : 39
% 0.12/0.45 % Positive orientable unit clauses : 1
% 0.12/0.45 % Positive unorientable unit clauses: 0
% 0.12/0.45 % Negative unit clauses : 2
% 0.12/0.45 % Non-unit-clauses : 36
% 0.12/0.45 % Current number of unprocessed clauses: 0
% 0.12/0.45 % ...number of literals in the above : 0
% 0.12/0.45 % Current number of archived formulas : 0
% 0.12/0.45 % Current number of archived clauses : 2
% 0.12/0.45 % Clause-clause subsumption calls (NU) : 447
% 0.12/0.45 % Rec. Clause-clause subsumption calls : 188
% 0.12/0.45 % Non-unit clause-clause subsumptions : 6
% 0.12/0.45 % Unit Clause-clause subsumption calls : 0
% 0.12/0.45 % Rewrite failures with RHS unbound : 0
% 0.12/0.45 % BW rewrite match attempts : 0
% 0.12/0.45 % BW rewrite match successes : 0
% 0.12/0.45 % Condensation attempts : 0
% 0.12/0.45 % Condensation successes : 0
% 0.12/0.45 % Termbank termtop insertions : 1280
% 0.12/0.45 % Search garbage collected termcells : 65
% 0.12/0.45
% 0.12/0.45 % -------------------------------------------------
% 0.12/0.45 % User time : 0.005 s
% 0.12/0.45 % System time : 0.004 s
% 0.12/0.45 % Total time : 0.009 s
% 0.12/0.45 % Maximum resident set size: 3652 pages
% 0.12/0.45
% 0.12/0.45 % -------------------------------------------------
% 0.12/0.45 % User time : 0.018 s
% 0.12/0.45 % System time : 0.014 s
% 0.12/0.45 % Total time : 0.032 s
% 0.12/0.45 % Maximum resident set size: 4608 pages
% 0.12/0.45 % E exiting
%------------------------------------------------------------------------------