%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : KRS014-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:34 PM UTC 2026
% Result : Satisfiable 0.12s 0.47s
% Output : Saturation 0.12s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_20ERROR: Could not build tree for root c_0_54ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_24,plain,
( ~ equalish(u2r1(X2,X3,X1),X2)
| ~ s(X1,X3)
| ~ s(X1,X2)
| equalish(X2,X3)
| s2exact(X1) ),
c_0_18,
[final] ).
cnf(c_0_25,plain,
( ~ s(X2,X1)
| ~ s2exact(X2)
| equalish(X1,u2r2(X2))
| equalish(X1,u2r3(X2)) ),
c_0_19,
[final] ).
cnf(c_0_26,plain,
( ~ equalish(u2r1(X2,X3,X1),X3)
| ~ s(X1,X3)
| ~ s(X1,X2)
| equalish(X2,X3)
| s2exact(X1) ),
c_0_20,
[final] ).
cnf(c_0_28,plain,
( ~ r(X2,X1)
| ~ r1exact(X2)
| equalish(X1,u1r2(X2)) ),
c_0_21,
[final] ).
cnf(c_0_29,plain,
( ~ s(X1,X2)
| ~ e(X1)
| r(X1,X2) ),
c_0_22,
[final] ).
cnf(c_0_30,negated_conjecture,
e(exists),
clause_1,
[final] ).
cnf(c_0_31,plain,
( ~ equalish(u1r1(X2,X1),X2)
| ~ r(X1,X2)
| r1exact(X1) ),
c_0_23,
[final] ).
cnf(c_0_37,plain,
( ~ s(X3,X2)
| ~ s(X3,u2r2(X1))
| ~ s(X1,u2r1(u2r2(X1),X2,X3))
| ~ s2exact(X1)
| s2exact(X3)
| equalish(u2r2(X1),X2)
| equalish(u2r1(u2r2(X1),X2,X3),u2r3(X1)) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]),
[final] ).
cnf(c_0_38,plain,
( ~ s(X3,X1)
| ~ s(X3,u2r2(X2))
| ~ s(X2,u2r1(X1,u2r2(X2),X3))
| ~ s2exact(X2)
| s2exact(X3)
| equalish(X1,u2r2(X2))
| equalish(u2r1(X1,u2r2(X2),X3),u2r3(X2)) ),
inference(spm,[status(thm)],[c_0_26,c_0_25]),
[final] ).
cnf(c_0_39,plain,
( ~ equalish(u2r3(X1),u2r2(X1))
| ~ s2exact(X1) ),
c_0_27,
[final] ).
cnf(c_0_40,plain,
( ~ s(X3,X2)
| ~ s(X3,u1r2(X1))
| ~ r(X1,u2r1(u1r2(X1),X2,X3))
| ~ r1exact(X1)
| s2exact(X3)
| equalish(u1r2(X1),X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_28]),
[final] ).
cnf(c_0_41,negated_conjecture,
( ~ s(exists,X1)
| r(exists,X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]),
[final] ).
cnf(c_0_42,plain,
( ~ s(X3,X1)
| ~ s(X3,u1r2(X2))
| ~ r(X2,u2r1(X1,u1r2(X2),X3))
| ~ r1exact(X2)
| s2exact(X3)
| equalish(X1,u1r2(X2)) ),
inference(spm,[status(thm)],[c_0_26,c_0_28]),
[final] ).
cnf(c_0_43,plain,
( ~ r(X1,u1r2(X2))
| ~ r(X2,u1r1(u1r2(X2),X1))
| ~ r1exact(X2)
| r1exact(X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_28]),
[final] ).
cnf(c_0_47,plain,
( ~ s2exact(X1)
| s(X1,u2r3(X1)) ),
c_0_32,
[final] ).
cnf(c_0_49,plain,
( ~ r(X1,X2)
| ~ e(X1)
| s(X1,X2) ),
c_0_33,
[final] ).
cnf(c_0_50,plain,
( ~ r1exact(X1)
| r(X1,u1r2(X1)) ),
c_0_34,
[final] ).
cnf(c_0_51,plain,
( ~ e(X1)
| r1exact(X1) ),
c_0_35,
[final] ).
cnf(c_0_53,plain,
( ~ e(X1)
| s2exact(X1) ),
c_0_36,
[final] ).
cnf(c_0_54,plain,
( ~ s(X2,u2r2(X1))
| ~ s(X2,u2r3(X1))
| ~ s(X1,u2r1(u2r2(X1),u2r3(X1),X2))
| ~ s2exact(X1)
| s2exact(X2)
| equalish(u2r2(X1),u2r3(X1)) ),
inference(spm,[status(thm)],[c_0_26,c_0_37]),
[final] ).
cnf(c_0_55,plain,
( ~ s(X1,u2r3(X2))
| ~ s(X1,u2r2(X2))
| ~ s(X2,u2r1(u2r3(X2),u2r2(X2),X1))
| ~ s2exact(X2)
| s2exact(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_38]),c_0_39]),
[final] ).
cnf(c_0_56,negated_conjecture,
( ~ s(X2,X1)
| ~ s(X2,u1r2(exists))
| ~ s(exists,u2r1(u1r2(exists),X1,X2))
| ~ r1exact(exists)
| s2exact(X2)
| equalish(u1r2(exists),X1) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]),
[final] ).
cnf(c_0_57,negated_conjecture,
( ~ s(X2,X1)
| ~ s(X2,u1r2(exists))
| ~ s(exists,u2r1(X1,u1r2(exists),X2))
| ~ r1exact(exists)
| s2exact(X2)
| equalish(X1,u1r2(exists)) ),
inference(spm,[status(thm)],[c_0_42,c_0_41]),
[final] ).
cnf(c_0_58,plain,
( ~ s(X1,u1r1(u2r2(X1),X2))
| ~ r(X2,u2r2(X1))
| ~ s2exact(X1)
| r1exact(X2)
| equalish(u1r1(u2r2(X1),X2),u2r3(X1)) ),
inference(spm,[status(thm)],[c_0_31,c_0_25]),
[final] ).
cnf(c_0_59,negated_conjecture,
( ~ s(exists,u1r1(u1r2(exists),X1))
| ~ r(X1,u1r2(exists))
| ~ r1exact(exists)
| r1exact(X1) ),
inference(spm,[status(thm)],[c_0_43,c_0_41]),
[final] ).
cnf(c_0_60,plain,
( ~ s(X1,X3)
| ~ s(X1,X2)
| s(X1,u2r1(X2,X3,X1))
| equalish(X2,X3)
| s2exact(X1) ),
c_0_44,
[final] ).
cnf(c_0_61,plain,
( ~ s(X1,u0r1(X1))
| ~ r(X1,u0r1(X1))
| ~ s2exact(X1)
| ~ r1exact(X1)
| e(X1) ),
c_0_45,
[final] ).
cnf(c_0_62,plain,
( ~ s2exact(X1)
| ~ r1exact(X1)
| r(X1,u0r1(X1))
| s(X1,u0r1(X1))
| e(X1) ),
c_0_46,
[final] ).
cnf(c_0_63,plain,
( ~ s2exact(X1)
| equalish(u2r3(X1),u2r3(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_25]),c_0_47]),
[final] ).
cnf(c_0_64,plain,
( ~ r(X1,X2)
| r(X1,u1r1(X2,X1))
| r1exact(X1) ),
c_0_48,
[final] ).
cnf(c_0_65,plain,
( ~ e(X1)
| s(X1,u1r2(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51]),
[final] ).
cnf(c_0_66,plain,
( ~ s2exact(X1)
| s(X1,u2r2(X1)) ),
c_0_52,
[final] ).
cnf(c_0_67,negated_conjecture,
s2exact(exists),
inference(spm,[status(thm)],[c_0_53,c_0_30]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS014-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.39 % Computer : n016.cluster.edu
% 0.12/0.39 % Model : x86_64 x86_64
% 0.12/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39 % Memory : 8046.5625MB
% 0.12/0.39 % OS : Linux 6.8.0-71-generic
% 0.12/0.39 % CPULimit : 300
% 0.12/0.39 % WCLimit : 300
% 0.12/0.39 % DateTime : Sun Sep 20 22:55:22 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.44 Running first-order theorem proving
% 0.12/0.44 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.12/0.47 % Version: 3.5.1
% 0.12/0.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.47 % Starting sh5l with 300s (1) cores
% 0.12/0.47 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 970798 completed with status 1
% 0.12/0.47 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.47 % No SInE strategy applied
% 0.12/0.47 % Search class: FGHNF-FFSF31-SFFFFFNN
% 0.12/0.47 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.47 % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.12/0.47 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.12/0.47 % Starting new_bool_3 with 136s (1) cores
% 0.12/0.47 % Starting new_bool_1 with 136s (1) cores
% 0.12/0.47 % SubtermCWHack with pid 970802 completed with status 1
% 0.12/0.47 % Result found by SubtermCWHack
% 0.12/0.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.47 % No SInE strategy applied
% 0.12/0.47 % Search class: FGHNF-FFSF31-SFFFFFNN
% 0.12/0.47 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.47 % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.47 % Preprocessing time : 0.001 s
% 0.12/0.47
% 0.12/0.47 % No proof found!
% 0.12/0.47 % SZS status Satisfiable
% 0.12/0.47 % SZS output start Saturation
% See solution above
% 0.12/0.47 % Parsed axioms : 18
% 0.12/0.47 % Removed by relevancy pruning/SinE : 0
% 0.12/0.47 % Initial clauses : 18
% 0.12/0.47 % Removed in clause preprocessing : 0
% 0.12/0.47 % Initial clauses in saturation : 18
% 0.12/0.47 % Processed clauses : 34
% 0.12/0.47 % ...of these trivial : 0
% 0.12/0.47 % ...subsumed : 1
% 0.12/0.47 % ...remaining for further processing : 33
% 0.12/0.47 % Other redundant clauses eliminated : 0
% 0.12/0.47 % Clauses deleted for lack of memory : 0
% 0.12/0.47 % Backward-subsumed : 0
% 0.12/0.47 % Backward-rewritten : 0
% 0.12/0.47 % Generated clauses : 25
% 0.12/0.47 % ...of the previous two non-redundant : 16
% 0.12/0.47 % ...aggressively subsumed : 0
% 0.12/0.47 % Contextual simplify-reflections : 3
% 0.12/0.47 % Paramodulations : 25
% 0.12/0.47 % Factorizations : 0
% 0.12/0.47 % NegExts : 0
% 0.12/0.47 % Equation resolutions : 0
% 0.12/0.47 % Disequality decompositions : 0
% 0.12/0.47 % Total rewrite steps : 5
% 0.12/0.47 % ...of those cached : 3
% 0.12/0.47 % Propositional unsat checks : 0
% 0.12/0.47 % Propositional check models : 0
% 0.12/0.47 % Propositional check unsatisfiable : 0
% 0.12/0.47 % Propositional clauses : 0
% 0.12/0.47 % Propositional clauses after purity: 0
% 0.12/0.47 % Propositional unsat core size : 0
% 0.12/0.47 % Propositional preprocessing time : 0.000
% 0.12/0.47 % Propositional encoding time : 0.000
% 0.12/0.47 % Propositional solver time : 0.000
% 0.12/0.47 % Success case prop preproc time : 0.000
% 0.12/0.47 % Success case prop encoding time : 0.000
% 0.12/0.47 % Success case prop solver time : 0.000
% 0.12/0.47 % Current number of processed clauses : 33
% 0.12/0.47 % Positive orientable unit clauses : 2
% 0.12/0.47 % Positive unorientable unit clauses: 0
% 0.12/0.47 % Negative unit clauses : 0
% 0.12/0.47 % Non-unit-clauses : 31
% 0.12/0.47 % Current number of unprocessed clauses: 0
% 0.12/0.47 % ...number of literals in the above : 0
% 0.12/0.47 % Current number of archived formulas : 0
% 0.12/0.47 % Current number of archived clauses : 0
% 0.12/0.47 % Clause-clause subsumption calls (NU) : 192
% 0.12/0.47 % Rec. Clause-clause subsumption calls : 34
% 0.12/0.47 % Non-unit clause-clause subsumptions : 4
% 0.12/0.47 % Unit Clause-clause subsumption calls : 1
% 0.12/0.47 % Rewrite failures with RHS unbound : 0
% 0.12/0.47 % BW rewrite match attempts : 0
% 0.12/0.47 % BW rewrite match successes : 0
% 0.12/0.47 % Condensation attempts : 0
% 0.12/0.47 % Condensation successes : 0
% 0.12/0.47 % Termbank termtop insertions : 1528
% 0.12/0.47 % Search garbage collected termcells : 54
% 0.12/0.47
% 0.12/0.47 % -------------------------------------------------
% 0.12/0.47 % User time : 0.006 s
% 0.12/0.47 % System time : 0.003 s
% 0.12/0.47 % Total time : 0.008 s
% 0.12/0.47 % Maximum resident set size: 3644 pages
% 0.12/0.47
% 0.12/0.47 % -------------------------------------------------
% 0.12/0.47 % User time : 0.012 s
% 0.12/0.47 % System time : 0.011 s
% 0.12/0.47 % Total time : 0.024 s
% 0.12/0.47 % Maximum resident set size: 4608 pages
% 0.12/0.47 % E exiting
%------------------------------------------------------------------------------