%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : KRS006-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 : n016.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.05s 0.44s
% Output : Saturation 0.05s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_27ERROR: Could not build tree for root c_0_30ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_30,plain,
( ~ s(X3,X2)
| ~ s(X3,X1)
| ~ s1most(X3)
| equalish(X1,X2) ),
c_0_27,
[final] ).
cnf(c_0_31,plain,
( ~ s2least(X1)
| s(X1,u1r1(X1)) ),
c_0_28,
[final] ).
cnf(c_0_36,plain,
( ~ equalish(u1r2(X1),u1r1(X1))
| ~ s2least(X1) ),
c_0_29,
[final] ).
cnf(c_0_38,plain,
( ~ s2least(X1)
| s(X1,u1r2(X1)) ),
c_0_32,
[final] ).
cnf(c_0_39,plain,
( ~ c(X1)
| s2least(X1) ),
c_0_33,
[final] ).
cnf(c_0_40,plain,
( ~ e(X1)
| c(u4r1(X1)) ),
c_0_34,
[final] ).
cnf(c_0_46,plain,
( ~ s(X1,X3)
| ~ s(X1,X2)
| equalish(X2,X3)
| s2least(X1) ),
c_0_35,
[final] ).
cnf(c_0_47,axiom,
( s(X1,u3r1(X1))
| s1most(X1) ),
clause_16,
[final] ).
cnf(c_0_50,negated_conjecture,
c(u4r1(exist)),
clause_5,
[final] ).
cnf(c_0_51,plain,
( ~ s2least(X1)
| ~ s1most(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]),
[final] ).
cnf(c_0_52,plain,
( ~ e(X1)
| s2least(u4r1(X1)) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]),
[final] ).
cnf(c_0_53,plain,
( ~ r(X3,X2)
| ~ r(X3,X1)
| ~ r1most(X3)
| equalish(X1,X2) ),
c_0_41,
[final] ).
cnf(c_0_54,plain,
( ~ e(X1)
| r(X1,u4r1(X1)) ),
c_0_42,
[final] ).
cnf(c_0_55,plain,
( ~ e(X1)
| r1most(X1) ),
c_0_43,
[final] ).
cnf(c_0_56,plain,
( ~ e(X1)
| r(X1,u4r2(X1)) ),
c_0_44,
[final] ).
cnf(c_0_57,plain,
( ~ equalish(u3r2(X1),u3r1(X1))
| s1most(X1) ),
c_0_45,
[final] ).
cnf(c_0_59,axiom,
( s(X1,u3r2(X1))
| s1most(X1) ),
clause_17,
[final] ).
cnf(c_0_61,negated_conjecture,
r(exist,u4r1(exist)),
clause_3,
[final] ).
cnf(c_0_62,negated_conjecture,
r1most(exist),
clause_2,
[final] ).
cnf(c_0_64,plain,
( ~ d(X1)
| s1most(X1) ),
c_0_48,
[final] ).
cnf(c_0_65,plain,
( ~ e(X1)
| d(u4r2(X1)) ),
c_0_49,
[final] ).
cnf(c_0_68,negated_conjecture,
s2least(u4r1(exist)),
inference(spm,[status(thm)],[c_0_39,c_0_50]),
[final] ).
cnf(c_0_69,negated_conjecture,
d(u4r2(exist)),
clause_4,
[final] ).
cnf(c_0_70,plain,
( ~ e(X1)
| ~ s1most(u4r1(X1)) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]),
[final] ).
cnf(c_0_71,plain,
( ~ e(X2)
| ~ r(X2,X1)
| equalish(X1,u4r1(X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_55]),
[final] ).
cnf(c_0_72,plain,
( ~ e(X2)
| ~ r(X2,X1)
| equalish(X1,u4r2(X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_56]),c_0_55]),
[final] ).
cnf(c_0_73,plain,
( s2least(X1)
| s1most(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59]),
[final] ).
cnf(c_0_74,plain,
( ~ d(X3)
| ~ r(X1,X3)
| ~ c(X2)
| ~ r(X1,X2)
| ~ r1most(X1)
| e(X1) ),
c_0_60,
[final] ).
cnf(c_0_75,negated_conjecture,
( ~ r(exist,X1)
| equalish(X1,u4r1(exist)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_61]),c_0_62])]),
[final] ).
cnf(c_0_76,plain,
( ~ equalish(u5r2(X1),u5r1(X1))
| r1most(X1) ),
c_0_63,
[final] ).
cnf(c_0_77,axiom,
( r(X1,u5r1(X1))
| r1most(X1) ),
clause_26,
[final] ).
cnf(c_0_78,axiom,
( r(X1,u5r2(X1))
| r1most(X1) ),
clause_27,
[final] ).
cnf(c_0_79,plain,
( ~ e(X1)
| s1most(u4r2(X1)) ),
inference(spm,[status(thm)],[c_0_64,c_0_65]),
[final] ).
cnf(c_0_80,plain,
( ~ s2least(X1)
| c(X1) ),
c_0_66,
[final] ).
cnf(c_0_81,plain,
( ~ s1most(X1)
| d(X1) ),
c_0_67,
[final] ).
cnf(c_0_82,negated_conjecture,
~ s1most(u4r1(exist)),
inference(spm,[status(thm)],[c_0_51,c_0_68]),
[final] ).
cnf(c_0_83,negated_conjecture,
s1most(u4r2(exist)),
inference(spm,[status(thm)],[c_0_64,c_0_69]),
[final] ).
cnf(c_0_84,negated_conjecture,
e(exist),
clause_1,
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS006-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.12/0.36 % Computer : n016.cluster.edu
% 0.12/0.36 % Model : x86_64 x86_64
% 0.12/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.36 % Memory : 8046.5625MB
% 0.12/0.36 % OS : Linux 6.8.0-71-generic
% 0.12/0.36 % CPULimit : 300
% 0.12/0.36 % WCLimit : 300
% 0.12/0.36 % DateTime : Sun Sep 20 22:55:07 UTC 2026
% 0.05/0.36 % CPUTime :
% 0.05/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.05/0.41 Running first-order theorem proving
% 0.05/0.41 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.05/0.44 % Version: 3.5.1
% 0.05/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.05/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.05/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.05/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.05/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.05/0.44 % Starting sh5l with 300s (1) cores
% 0.05/0.44 % sh5l with pid 970388 completed with status 1
% 0.05/0.44 % Result found by sh5l
% 0.05/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.05/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.05/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.05/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.05/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.05/0.44 % Starting sh5l with 300s (1) cores
% 0.05/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.05/0.44 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.05/0.44 % Search class: FGHNF-FFSS11-SFFFFFNN
% 0.05/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.05/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.05/0.44 % SubtermCWHack with pid 970396 completed with status 1
% 0.05/0.44 % Result found by SubtermCWHack
% 0.05/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.05/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.05/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.05/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.05/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.05/0.44 % Starting sh5l with 300s (1) cores
% 0.05/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.05/0.44 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.05/0.44 % Search class: FGHNF-FFSS11-SFFFFFNN
% 0.05/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.05/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.05/0.44 % Preprocessing time : 0.001 s
% 0.05/0.44
% 0.05/0.44 % No proof found!
% 0.05/0.44 % SZS status Satisfiable
% 0.05/0.44 % SZS output start Saturation
% See solution above
% 0.05/0.44 % Parsed axioms : 27
% 0.05/0.44 % Removed by relevancy pruning/SinE : 0
% 0.05/0.44 % Initial clauses : 27
% 0.05/0.44 % Removed in clause preprocessing : 0
% 0.05/0.44 % Initial clauses in saturation : 27
% 0.05/0.44 % Processed clauses : 42
% 0.05/0.44 % ...of these trivial : 0
% 0.05/0.44 % ...subsumed : 2
% 0.05/0.44 % ...remaining for further processing : 40
% 0.05/0.44 % Other redundant clauses eliminated : 0
% 0.05/0.44 % Clauses deleted for lack of memory : 0
% 0.05/0.44 % Backward-subsumed : 2
% 0.05/0.44 % Backward-rewritten : 0
% 0.05/0.44 % Generated clauses : 29
% 0.05/0.44 % ...of the previous two non-redundant : 15
% 0.05/0.44 % ...aggressively subsumed : 0
% 0.05/0.44 % Contextual simplify-reflections : 4
% 0.05/0.44 % Paramodulations : 29
% 0.05/0.44 % Factorizations : 0
% 0.05/0.44 % NegExts : 0
% 0.05/0.44 % Equation resolutions : 0
% 0.05/0.44 % Disequality decompositions : 0
% 0.05/0.44 % Total rewrite steps : 3
% 0.05/0.44 % ...of those cached : 1
% 0.05/0.44 % Propositional unsat checks : 0
% 0.05/0.44 % Propositional check models : 0
% 0.05/0.44 % Propositional check unsatisfiable : 0
% 0.05/0.44 % Propositional clauses : 0
% 0.05/0.44 % Propositional clauses after purity: 0
% 0.05/0.44 % Propositional unsat core size : 0
% 0.05/0.44 % Propositional preprocessing time : 0.000
% 0.05/0.44 % Propositional encoding time : 0.000
% 0.05/0.44 % Propositional solver time : 0.000
% 0.05/0.44 % Success case prop preproc time : 0.000
% 0.05/0.44 % Success case prop encoding time : 0.000
% 0.05/0.44 % Success case prop solver time : 0.000
% 0.05/0.44 % Current number of processed clauses : 38
% 0.05/0.44 % Positive orientable unit clauses : 7
% 0.05/0.44 % Positive unorientable unit clauses: 0
% 0.05/0.44 % Negative unit clauses : 1
% 0.05/0.44 % Non-unit-clauses : 30
% 0.05/0.44 % Current number of unprocessed clauses: 0
% 0.05/0.44 % ...number of literals in the above : 0
% 0.05/0.44 % Current number of archived formulas : 0
% 0.05/0.44 % Current number of archived clauses : 2
% 0.05/0.44 % Clause-clause subsumption calls (NU) : 127
% 0.05/0.44 % Rec. Clause-clause subsumption calls : 99
% 0.05/0.44 % Non-unit clause-clause subsumptions : 8
% 0.05/0.44 % Unit Clause-clause subsumption calls : 24
% 0.05/0.44 % Rewrite failures with RHS unbound : 0
% 0.05/0.44 % BW rewrite match attempts : 0
% 0.05/0.44 % BW rewrite match successes : 0
% 0.05/0.44 % Condensation attempts : 0
% 0.05/0.44 % Condensation successes : 0
% 0.05/0.44 % Termbank termtop insertions : 1142
% 0.05/0.44 % Search garbage collected termcells : 63
% 0.05/0.44
% 0.05/0.44 % -------------------------------------------------
% 0.05/0.44 % User time : 0.005 s
% 0.05/0.44 % System time : 0.002 s
% 0.05/0.44 % Total time : 0.007 s
% 0.05/0.44 % Maximum resident set size: 3652 pages
% 0.05/0.44
% 0.05/0.44 % -------------------------------------------------
% 0.05/0.44 % User time : 0.008 s
% 0.05/0.44 % System time : 0.006 s
% 0.05/0.44 % Total time : 0.014 s
% 0.05/0.44 % Maximum resident set size: 4608 pages
% 0.05/0.44 % E exiting
%------------------------------------------------------------------------------