%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : KRS044+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n020.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:38 PM UTC 2026
% Result : Satisfiable 0.11s 0.45s
% Output : Saturation 0.11s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_17ERROR: Could not build tree for root c_0_39ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_19,plain,
( ~ ra_Px1(X1,X2)
| ~ cp(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]),
[final] ).
cnf(c_0_20,plain,
( ~ cpxcomp(X1)
| ra_Px1(X1,esk4_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_15]),
[final] ).
cnf(c_0_23,plain,
( ~ rf1(X1,X3)
| ~ rf1(X1,X2)
| X2 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_16]),
[final] ).
cnf(c_0_24,plain,
( ~ cSatisfiable(X1)
| rf1(X1,esk2_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_17]),
[final] ).
cnf(c_0_25,plain,
( ~ rf(X1,X3)
| ~ rf(X1,X2)
| X2 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_18]),
[final] ).
cnf(c_0_26,plain,
( ~ cSatisfiable(X1)
| rf(X1,esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_17]),
[final] ).
cnf(c_0_33,plain,
( ~ cp(X1)
| ~ cpxcomp(X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]),
[final] ).
cnf(c_0_34,plain,
( ~ cSatisfiable(X1)
| cpxcomp(esk2_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_17]),
[final] ).
cnf(c_0_35,plain,
( ~ ra_Px1(X1,X2)
| cpxcomp(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]),
[final] ).
cnf(c_0_36,plain,
( cp(X1)
| ra_Px1(X1,esk3_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_14]),
[final] ).
cnf(c_0_39,plain,
( ~ cpxcomp(X3)
| ~ rf1(X1,X3)
| ~ cp(X2)
| ~ rf(X1,X2)
| cSatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]),
[final] ).
cnf(c_0_40,plain,
( ~ cSatisfiable(X2)
| ~ rf1(X2,X1)
| X1 = esk2_1(X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]),
[final] ).
cnf(c_0_41,plain,
( ~ cSatisfiable(X2)
| ~ rf(X2,X1)
| X1 = esk1_1(X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]),
[final] ).
cnf(c_0_42,plain,
( ~ rs(X1,X3)
| ~ rs(X1,X2)
| X2 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_27]),
[final] ).
cnf(c_0_43,plain,
( ~ rinvS(X1,X2)
| rs(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]),
[final] ).
cnf(c_0_44,plain,
( ~ rs(X1,X2)
| rinvS(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]),
[final] ).
cnf(c_0_45,plain,
( ~ rf1(X1,X2)
| rinvF1(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]),
[final] ).
cnf(c_0_46,plain,
( ~ rf(X1,X2)
| rinvF(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]),
[final] ).
cnf(c_0_47,plain,
( ~ rs(X1,X2)
| rf1(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]),
[final] ).
cnf(c_0_48,plain,
( ~ rinvF1(X1,X2)
| rf1(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]),
[final] ).
cnf(c_0_49,plain,
( ~ rs(X1,X2)
| rf(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_32]),
[final] ).
cnf(c_0_50,plain,
( ~ rinvF(X1,X2)
| rf(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]),
[final] ).
cnf(c_0_51,plain,
( ~ cSatisfiable(X1)
| ~ cp(esk2_1(X1)) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]),
[final] ).
cnf(c_0_52,plain,
( cp(X1)
| cpxcomp(X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]),
[final] ).
cnf(c_0_53,plain,
( ~ cSatisfiable(X1)
| cp(esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_17]),
[final] ).
cnf(c_0_54,plain,
( ~ xsd_integer(X1)
| ~ xsd_string(X1) ),
inference(split_conjunct,[status(thm)],[c_0_37]),
[final] ).
cnf(c_0_55,plain,
( xsd_string(X1)
| xsd_integer(X1) ),
inference(split_conjunct,[status(thm)],[c_0_37]),
[final] ).
cnf(c_0_56,plain,
~ cowlNothing(X1),
inference(split_conjunct,[status(thm)],[c_0_38]),
[final] ).
cnf(c_0_57,plain,
cSatisfiable(i2003_11_14_17_16_1832),
inference(split_conjunct,[status(thm)],[axiom_11]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS044+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.38 % Computer : n020.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Sun Sep 20 22:52:32 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/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.11/0.45 % Version: 3.5.1
% 0.11/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.45 % Starting sh5l with 300s (1) cores
% 0.11/0.45 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1398984 completed with status 1
% 0.11/0.45 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.11/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.45 % No SInE strategy applied
% 0.11/0.45 % Search class: FGHSF-FFSF11-SFFFFFNN
% 0.11/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.11/0.45 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4d with 136s (1) cores
% 0.11/0.45 % Starting new_bool_3 with 136s (1) cores
% 0.11/0.45 % Starting new_bool_1 with 136s (1) cores
% 0.11/0.45 % SubtermCWHack with pid 1398998 completed with status 1
% 0.11/0.45 % Result found by SubtermCWHack
% 0.11/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.45 % No SInE strategy applied
% 0.11/0.45 % Search class: FGHSF-FFSF11-SFFFFFNN
% 0.11/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.45 % Preprocessing time : 0.002 s
% 0.11/0.45
% 0.11/0.45 % No proof found!
% 0.11/0.45 % SZS status Satisfiable
% 0.11/0.45 % SZS output start Saturation
% See solution above
% 0.11/0.45 % Parsed axioms : 35
% 0.11/0.45 % Removed by relevancy pruning/SinE : 0
% 0.11/0.45 % Initial clauses : 46
% 0.11/0.45 % Removed in clause preprocessing : 22
% 0.11/0.45 % Initial clauses in saturation : 24
% 0.11/0.45 % Processed clauses : 29
% 0.11/0.45 % ...of these trivial : 0
% 0.11/0.45 % ...subsumed : 0
% 0.11/0.45 % ...remaining for further processing : 29
% 0.11/0.45 % Other redundant clauses eliminated : 0
% 0.11/0.45 % Clauses deleted for lack of memory : 0
% 0.11/0.45 % Backward-subsumed : 0
% 0.11/0.45 % Backward-rewritten : 0
% 0.11/0.45 % Generated clauses : 13
% 0.11/0.45 % ...of the previous two non-redundant : 5
% 0.11/0.45 % ...aggressively subsumed : 0
% 0.11/0.45 % Contextual simplify-reflections : 0
% 0.11/0.45 % Paramodulations : 13
% 0.11/0.45 % Factorizations : 0
% 0.11/0.45 % NegExts : 0
% 0.11/0.45 % Equation resolutions : 0
% 0.11/0.45 % Disequality decompositions : 0
% 0.11/0.45 % Total rewrite steps : 0
% 0.11/0.45 % ...of those cached : 0
% 0.11/0.45 % Propositional unsat checks : 0
% 0.11/0.45 % Propositional check models : 0
% 0.11/0.45 % Propositional check unsatisfiable : 0
% 0.11/0.45 % Propositional clauses : 0
% 0.11/0.45 % Propositional clauses after purity: 0
% 0.11/0.45 % Propositional unsat core size : 0
% 0.11/0.45 % Propositional preprocessing time : 0.000
% 0.11/0.45 % Propositional encoding time : 0.000
% 0.11/0.45 % Propositional solver time : 0.000
% 0.11/0.45 % Success case prop preproc time : 0.000
% 0.11/0.45 % Success case prop encoding time : 0.000
% 0.11/0.45 % Success case prop solver time : 0.000
% 0.11/0.45 % Current number of processed clauses : 29
% 0.11/0.45 % Positive orientable unit clauses : 1
% 0.11/0.45 % Positive unorientable unit clauses: 0
% 0.11/0.45 % Negative unit clauses : 1
% 0.11/0.45 % Non-unit-clauses : 27
% 0.11/0.45 % Current number of unprocessed clauses: 0
% 0.11/0.45 % ...number of literals in the above : 0
% 0.11/0.45 % Current number of archived formulas : 0
% 0.11/0.45 % Current number of archived clauses : 1
% 0.11/0.45 % Clause-clause subsumption calls (NU) : 85
% 0.11/0.45 % Rec. Clause-clause subsumption calls : 52
% 0.11/0.45 % Non-unit clause-clause subsumptions : 0
% 0.11/0.45 % Unit Clause-clause subsumption calls : 0
% 0.11/0.45 % Rewrite failures with RHS unbound : 0
% 0.11/0.45 % BW rewrite match attempts : 0
% 0.11/0.45 % BW rewrite match successes : 0
% 0.11/0.45 % Condensation attempts : 0
% 0.11/0.45 % Condensation successes : 0
% 0.11/0.45 % Termbank termtop insertions : 3201
% 0.11/0.45 % Search garbage collected termcells : 729
% 0.11/0.45
% 0.11/0.45 % -------------------------------------------------
% 0.11/0.45 % User time : 0.008 s
% 0.11/0.45 % System time : 0.003 s
% 0.11/0.45 % Total time : 0.011 s
% 0.11/0.45 % Maximum resident set size: 3668 pages
% 0.11/0.45
% 0.11/0.45 % -------------------------------------------------
% 0.11/0.45 % User time : 0.022 s
% 0.11/0.45 % System time : 0.010 s
% 0.11/0.45 % Total time : 0.032 s
% 0.11/0.45 % Maximum resident set size: 4864 pages
% 0.11/0.45 % E exiting
%------------------------------------------------------------------------------