%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : HAL007+1 : TPTP v9.3.1. Released v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n017.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 12:45:15 PM UTC 2026
% Result : Satisfiable 0.31s 0.64s
% Output : Saturation 0.31s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_20ERROR: Could not build tree for root c_0_33ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_15,plain,
( ~ element(X3,X2)
| ~ element(X1,X2)
| element(subtract(X2,X1,X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]),
[final] ).
cnf(c_0_16,plain,
( ~ element(X1,X2)
| subtract(X2,X1,X1) = zero(X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]),
[final] ).
cnf(c_0_24,plain,
( ~ element(X2,X1)
| element(zero(X1),X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]),
[final] ).
cnf(c_0_25,plain,
( ~ morphism(X2,X4,X5)
| ~ morphism(X1,X3,X4)
| ~ exact(X1,X2)
| apply(X2,X6) != zero(X5)
| ~ element(X6,X4)
| element(esk5_6(X1,X2,X3,X4,X5,X6),X3) ),
inference(split_conjunct,[status(thm)],[c_0_17]),
[final] ).
cnf(c_0_27,plain,
( ~ morphism(X1,X2,X3)
| ~ surjection(X1)
| ~ element(X4,X3)
| element(esk3_4(X1,X2,X3,X4),X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]),
[final] ).
cnf(c_0_28,plain,
( ~ element(X3,X2)
| ~ element(X1,X2)
| subtract(X2,X1,subtract(X2,X1,X3)) = X3 ),
inference(split_conjunct,[status(thm)],[c_0_19]),
[final] ).
cnf(c_0_33,plain,
( ~ morphism(X4,X8,X7)
| ~ morphism(X3,X5,X8)
| ~ morphism(X1,X6,X7)
| ~ morphism(X2,X5,X6)
| apply(X1,apply(X2,esk8_5(X2,X1,X3,X4,X5))) != apply(X4,apply(X3,esk8_5(X2,X1,X3,X4,X5)))
| commute(X2,X1,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_20]),
[final] ).
cnf(c_0_34,plain,
( ~ element(X9,X5)
| ~ morphism(X4,X8,X7)
| ~ morphism(X3,X5,X8)
| ~ morphism(X2,X6,X7)
| ~ morphism(X1,X5,X6)
| ~ commute(X1,X2,X3,X4)
| apply(X2,apply(X1,X9)) = apply(X4,apply(X3,X9)) ),
inference(split_conjunct,[status(thm)],[c_0_21]),
[final] ).
cnf(c_0_35,plain,
( ~ morphism(X2,X4,X5)
| ~ morphism(X1,X3,X4)
| exact(X1,X2)
| apply(X2,esk6_5(X1,X2,X3,X4,X5)) = zero(X5)
| apply(X1,esk7_5(X1,X2,X3,X4,X5)) = esk6_5(X1,X2,X3,X4,X5) ),
inference(split_conjunct,[status(thm)],[c_0_22]),
[final] ).
cnf(c_0_36,plain,
( ~ morphism(X2,X4,X5)
| ~ morphism(X1,X3,X4)
| exact(X1,X2)
| element(esk6_5(X1,X2,X3,X4,X5),X4)
| apply(X1,esk7_5(X1,X2,X3,X4,X5)) = esk6_5(X1,X2,X3,X4,X5) ),
inference(split_conjunct,[status(thm)],[c_0_22]),
[final] ).
cnf(c_0_37,plain,
( ~ morphism(X2,X4,X5)
| ~ morphism(X1,X3,X4)
| exact(X1,X2)
| apply(X2,esk6_5(X1,X2,X3,X4,X5)) = zero(X5)
| element(esk7_5(X1,X2,X3,X4,X5),X3) ),
inference(split_conjunct,[status(thm)],[c_0_22]),
[final] ).
cnf(c_0_38,plain,
( ~ morphism(X2,X4,X5)
| ~ morphism(X1,X3,X4)
| exact(X1,X2)
| element(esk6_5(X1,X2,X3,X4,X5),X4)
| element(esk7_5(X1,X2,X3,X4,X5),X3) ),
inference(split_conjunct,[status(thm)],[c_0_22]),
[final] ).
cnf(c_0_39,plain,
( ~ morphism(X2,X4,X5)
| ~ morphism(X1,X3,X4)
| apply(X1,X6) != esk6_5(X1,X2,X3,X4,X5)
| ~ element(X6,X3)
| apply(X2,esk6_5(X1,X2,X3,X4,X5)) != zero(X5)
| ~ element(esk6_5(X1,X2,X3,X4,X5),X4)
| exact(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]),
[final] ).
cnf(c_0_40,plain,
( ~ element(X5,X2)
| ~ element(X4,X2)
| ~ morphism(X1,X2,X3)
| apply(X1,subtract(X2,X4,X5)) = subtract(X3,apply(X1,X4),apply(X1,X5)) ),
inference(split_conjunct,[status(thm)],[c_0_23]),
[final] ).
cnf(c_0_41,plain,
( ~ morphism(X4,X8,X7)
| ~ morphism(X3,X5,X8)
| ~ morphism(X2,X6,X7)
| ~ morphism(X1,X5,X6)
| commute(X1,X2,X3,X4)
| element(esk8_5(X1,X2,X3,X4,X5),X5) ),
inference(split_conjunct,[status(thm)],[c_0_20]),
[final] ).
cnf(c_0_42,plain,
( ~ morphism(X2,X4,X5)
| ~ morphism(X1,X3,X4)
| ~ exact(X1,X2)
| apply(X2,X6) != zero(X5)
| ~ element(X6,X4)
| apply(X1,esk5_6(X1,X2,X3,X4,X5,X6)) = X6 ),
inference(split_conjunct,[status(thm)],[c_0_17]),
[final] ).
cnf(c_0_43,plain,
( ~ morphism(X5,X1,X6)
| ~ morphism(X2,X6,X4)
| ~ element(X3,X6)
| ~ exact(X5,X2)
| apply(X2,X3) != zero(X4)
| element(zero(X1),X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]),
[final] ).
cnf(c_0_44,plain,
( ~ morphism(X1,X6,X4)
| ~ morphism(X2,X5,X6)
| ~ element(X3,X5)
| ~ exact(X2,X1)
| apply(X1,apply(X2,X3)) = zero(X4) ),
inference(er,[status(thm)],[c_0_26]),
[final] ).
cnf(c_0_45,plain,
( ~ morphism(X2,X1,X4)
| ~ element(X3,X4)
| ~ surjection(X2)
| element(zero(X1),X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_27]),
[final] ).
cnf(c_0_46,plain,
( ~ element(X2,X1)
| subtract(X1,X2,zero(X1)) = X2 ),
inference(spm,[status(thm)],[c_0_28,c_0_16]),
[final] ).
cnf(c_0_47,plain,
( ~ morphism(X1,X2,X3)
| injection(X1)
| apply(X1,esk1_2(X1,X2)) = apply(X1,esk2_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_29]),
[final] ).
cnf(c_0_48,plain,
( ~ morphism(X1,X2,X3)
| ~ surjection(X1)
| ~ element(X4,X3)
| apply(X1,esk3_4(X1,X2,X3,X4)) = X4 ),
inference(split_conjunct,[status(thm)],[c_0_18]),
[final] ).
cnf(c_0_49,plain,
( apply(X1,X4) != apply(X1,X5)
| ~ element(X5,X2)
| ~ element(X4,X2)
| ~ morphism(X1,X2,X3)
| ~ injection(X1)
| X4 = X5 ),
inference(split_conjunct,[status(thm)],[c_0_30]),
[final] ).
cnf(c_0_50,plain,
( ~ morphism(X3,X2,X4)
| ~ element(X1,X2)
| element(apply(X3,X1),X4) ),
inference(split_conjunct,[status(thm)],[c_0_31]),
[final] ).
cnf(c_0_51,plain,
( ~ morphism(X1,X2,X3)
| injection(X1)
| element(esk2_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]),
[final] ).
cnf(c_0_52,plain,
( ~ morphism(X1,X2,X3)
| injection(X1)
| element(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]),
[final] ).
cnf(c_0_53,plain,
( ~ morphism(X1,X2,X3)
| surjection(X1)
| element(esk4_3(X1,X2,X3),X3) ),
inference(split_conjunct,[status(thm)],[c_0_32]),
[final] ).
cnf(c_0_54,plain,
( ~ morphism(X1,X2,X3)
| apply(X1,zero(X2)) = zero(X3) ),
inference(split_conjunct,[status(thm)],[c_0_31]),
[final] ).
cnf(c_0_55,plain,
( ~ morphism(X3,X2,X4)
| apply(X3,X1) != esk4_3(X3,X2,X4)
| ~ element(X1,X2)
| surjection(X3) ),
inference(split_conjunct,[status(thm)],[c_0_32]),
[final] ).
cnf(c_0_56,plain,
( ~ morphism(X1,X2,X3)
| esk1_2(X1,X2) != esk2_2(X1,X2)
| injection(X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : HAL007+1 : TPTP v9.3.1. Released v6.4.0.
% 0.00/0.09 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.22/0.49 % Computer : n017.cluster.edu
% 0.22/0.49 % Model : x86_64 x86_64
% 0.22/0.49 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.22/0.49 % Memory : 8046.5625MB
% 0.22/0.49 % OS : Linux 6.8.0-71-generic
% 0.22/0.49 % CPULimit : 300
% 0.22/0.49 % WCLimit : 300
% 0.22/0.49 % DateTime : Sun Sep 20 20:40:12 UTC 2026
% 0.22/0.49 % CPUTime :
% 0.22/0.49 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.26/0.57 Running first-order theorem proving
% 0.26/0.57 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.31/0.64 % Version: 3.5.1
% 0.31/0.64 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.31/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.31/0.64 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.31/0.64 % Starting new_bool_3 with 300s (1) cores
% 0.31/0.64 % Starting new_bool_1 with 300s (1) cores
% 0.31/0.64 % Starting sh5l with 300s (1) cores
% 0.31/0.64 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 602260 completed with status 1
% 0.31/0.64 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.31/0.64 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.31/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.31/0.64 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.31/0.64 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.31/0.64 % No SInE strategy applied
% 0.31/0.64 % Search class: FGUSF-FFMF33-MFFFFFNN
% 0.31/0.64 % partial match(1): FGUSF-FFMM33-MFFFFFNN
% 0.31/0.64 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.31/0.64 % Starting SubtermCWHack with 136s (1) cores
% 0.31/0.64 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.31/0.64 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_RG_S2sX with 254s (1) cores
% 0.31/0.64 % Starting new_bool_3 with 254s (1) cores
% 0.31/0.64 % Starting new_bool_1 with 254s (1) cores
% 0.31/0.64 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 602280 completed with status 1
% 0.31/0.64 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.31/0.64 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.31/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.31/0.64 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.31/0.64 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.31/0.64 % No SInE strategy applied
% 0.31/0.64 % Search class: FGUSF-FFMF33-MFFFFFNN
% 0.31/0.64 % partial match(1): FGUSF-FFMM33-MFFFFFNN
% 0.31/0.64 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.31/0.64 % Starting SubtermCWHack with 136s (1) cores
% 0.31/0.64 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.31/0.64 % Preprocessing time : 0.003 s
% 0.31/0.64 % Presaturation interreduction done
% 0.31/0.64
% 0.31/0.64 % No proof found!
% 0.31/0.64 % SZS status Satisfiable
% 0.31/0.64 % SZS output start Saturation
% See solution above
% 0.31/0.64 % Parsed axioms : 13
% 0.31/0.64 % Removed by relevancy pruning/SinE : 0
% 0.31/0.64 % Initial clauses : 27
% 0.31/0.64 % Removed in clause preprocessing : 0
% 0.31/0.64 % Initial clauses in saturation : 27
% 0.31/0.64 % Processed clauses : 61
% 0.31/0.64 % ...of these trivial : 0
% 0.31/0.64 % ...subsumed : 3
% 0.31/0.64 % ...remaining for further processing : 58
% 0.31/0.64 % Other redundant clauses eliminated : 2
% 0.31/0.64 % Clauses deleted for lack of memory : 0
% 0.31/0.64 % Backward-subsumed : 0
% 0.31/0.64 % Backward-rewritten : 0
% 0.31/0.64 % Generated clauses : 10
% 0.31/0.64 % ...of the previous two non-redundant : 8
% 0.31/0.64 % ...aggressively subsumed : 0
% 0.31/0.64 % Contextual simplify-reflections : 0
% 0.31/0.64 % Paramodulations : 8
% 0.31/0.64 % Factorizations : 0
% 0.31/0.64 % NegExts : 0
% 0.31/0.64 % Equation resolutions : 2
% 0.31/0.64 % Disequality decompositions : 0
% 0.31/0.64 % Total rewrite steps : 0
% 0.31/0.64 % ...of those cached : 0
% 0.31/0.64 % Propositional unsat checks : 0
% 0.31/0.64 % Propositional check models : 0
% 0.31/0.64 % Propositional check unsatisfiable : 0
% 0.31/0.64 % Propositional clauses : 0
% 0.31/0.64 % Propositional clauses after purity: 0
% 0.31/0.64 % Propositional unsat core size : 0
% 0.31/0.64 % Propositional preprocessing time : 0.000
% 0.31/0.64 % Propositional encoding time : 0.000
% 0.31/0.64 % Propositional solver time : 0.000
% 0.31/0.64 % Success case prop preproc time : 0.000
% 0.31/0.64 % Success case prop encoding time : 0.000
% 0.31/0.64 % Success case prop solver time : 0.000
% 0.31/0.64 % Current number of processed clauses : 30
% 0.31/0.64 % Positive orientable unit clauses : 0
% 0.31/0.64 % Positive unorientable unit clauses: 0
% 0.31/0.64 % Negative unit clauses : 0
% 0.31/0.64 % Non-unit-clauses : 30
% 0.31/0.64 % Current number of unprocessed clauses: 0
% 0.31/0.64 % ...number of literals in the above : 0
% 0.31/0.64 % Current number of archived formulas : 0
% 0.31/0.64 % Current number of archived clauses : 26
% 0.31/0.64 % Clause-clause subsumption calls (NU) : 207
% 0.31/0.64 % Rec. Clause-clause subsumption calls : 30
% 0.31/0.64 % Non-unit clause-clause subsumptions : 3
% 0.31/0.64 % Unit Clause-clause subsumption calls : 0
% 0.31/0.64 % Rewrite failures with RHS unbound : 0
% 0.31/0.64 % BW rewrite match attempts : 0
% 0.31/0.64 % BW rewrite match successes : 0
% 0.31/0.64 % Condensation attempts : 0
% 0.31/0.64 % Condensation successes : 0
% 0.31/0.64 % Termbank termtop insertions : 3881
% 0.31/0.64 % Search garbage collected termcells : 891
% 0.31/0.64
% 0.31/0.64 % -------------------------------------------------
% 0.31/0.64 % User time : 0.022 s
% 0.31/0.64 % System time : 0.004 s
% 0.31/0.64 % Total time : 0.026 s
% 0.31/0.64 % Maximum resident set size: 3664 pages
% 0.31/0.64
% 0.31/0.64 % -------------------------------------------------
% 0.31/0.64 % User time : 0.038 s
% 0.31/0.64 % System time : 0.018 s
% 0.31/0.64 % Total time : 0.056 s
% 0.31/0.64 % Maximum resident set size: 4864 pages
% 0.31/0.64 % E exiting
%------------------------------------------------------------------------------