%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : HAL003+3 : TPTP v9.3.1. Released v2.6.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:14 PM UTC 2026
% Result : Theorem 0.17s 0.55s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 22 ( 8 unt; 0 def)
% Number of atoms : 59 ( 7 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 65 ( 28 ~; 25 |; 8 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 38 ( 0 sgn 16 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(g_surjection,conjecture,
surjection(g),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',g_surjection) ).
fof(properties_for_surjection,axiom,
! [X1,X2,X3] :
( ( ! [X7] :
( element(X7,X3)
=> ? [X8] :
( apply(X1,X8) = X7
& element(X8,X2) ) )
& morphism(X1,X2,X3) )
=> surjection(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HAL001+0.ax',properties_for_surjection) ).
fof(subtract_in_domain,axiom,
! [X2,X5,X6] :
( ( element(X6,X2)
& element(X5,X2) )
=> element(subtract(X2,X5,X6),X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HAL001+0.ax',subtract_in_domain) ).
fof(lemma12,axiom,
! [X19] :
( element(X19,e)
=> ? [X21,X24] :
( apply(g,subtract(b,X21,X24)) = X19
& element(X24,b)
& element(X21,b) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lemma12) ).
fof(g_morphism,axiom,
morphism(g,b,e),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',g_morphism) ).
fof(c_0_5,negated_conjecture,
~ surjection(g),
inference(assume_negation,[status(cth)],[g_surjection]) ).
fof(c_0_6,plain,
! [X44,X45,X46,X48] :
( ( surjection(X44)
| ~ morphism(X44,X45,X46)
| apply(X44,X48) != esk4_3(X44,X45,X46)
| ~ element(X48,X45) )
& ( surjection(X44)
| ~ morphism(X44,X45,X46)
| element(esk4_3(X44,X45,X46),X46) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[properties_for_surjection])])])])])])]) ).
fof(c_0_7,plain,
! [X84,X85,X86] :
( element(subtract(X84,X85,X86),X84)
| ~ element(X86,X84)
| ~ element(X85,X84) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[subtract_in_domain])])]) ).
fof(c_0_8,negated_conjecture,
~ surjection(g),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
cnf(c_0_9,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_6]) ).
cnf(c_0_10,plain,
( ~ element(X3,X2)
| ~ element(X1,X2)
| element(subtract(X2,X1,X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_11,plain,
! [X104] :
( ( ~ element(X104,e)
| apply(g,subtract(b,esk14_1(X104),esk15_1(X104))) = X104 )
& ( ~ element(X104,e)
| element(esk15_1(X104),b) )
& ( ~ element(X104,e)
| element(esk14_1(X104),b) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[lemma12])])])])]) ).
fof(c_0_12,negated_conjecture,
~ surjection(g),
inference(fof_nnf,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( ~ morphism(X1,X2,X5)
| ~ element(X3,X2)
| ~ element(X4,X2)
| apply(X1,subtract(X2,X3,X4)) != esk4_3(X1,X2,X5)
| surjection(X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
( ~ element(X1,e)
| apply(g,subtract(b,esk14_1(X1),esk15_1(X1))) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
~ surjection(g),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
( ~ element(X1,e)
| element(esk14_1(X1),b) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( ~ element(X1,e)
| element(esk15_1(X1),b) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
( ~ morphism(g,b,X1)
| ~ element(esk4_3(g,b,X1),e) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]),c_0_16]),c_0_17]) ).
cnf(c_0_19,plain,
( ~ morphism(X1,X2,X3)
| surjection(X1)
| element(esk4_3(X1,X2,X3),X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_20,plain,
morphism(g,b,e),
inference(split_conjunct,[status(thm)],[g_morphism]) ).
cnf(c_0_21,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]),c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : HAL003+3 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.35 % Computer : n017.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Sun Sep 20 20:39:56 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/0.45 Running first-order theorem proving
% 0.17/0.45 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.17/0.55 % Version: 3.5.1
% 0.17/0.55 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.17/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.55 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.17/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.17/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.17/0.55 % Starting sh5l with 300s (1) cores
% 0.17/0.55 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 601844 completed with status 0
% 0.17/0.55 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.17/0.55 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.17/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.55 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.17/0.55 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.17/0.55 % No SInE strategy applied
% 0.17/0.55 % Search class: FGUSF-FFMM32-MFFFFFNN
% 0.17/0.55 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.55 % Starting SubtermCWHack with 136s (1) cores
% 0.17/0.55 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.17/0.55 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.17/0.55 % Starting new_bool_3 with 136s (1) cores
% 0.17/0.55 % Starting new_bool_1 with 136s (1) cores
% 0.17/0.55 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 601850 completed with status 0
% 0.17/0.55 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.17/0.55 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.17/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.55 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.17/0.55 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.17/0.55 % No SInE strategy applied
% 0.17/0.55 % Search class: FGUSF-FFMM32-MFFFFFNN
% 0.17/0.55 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.55 % Starting SubtermCWHack with 136s (1) cores
% 0.17/0.55 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.17/0.55 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.17/0.55 % Preprocessing time : 0.003 s
% 0.17/0.55 % Presaturation interreduction done
% 0.17/0.55
% 0.17/0.55 % Proof found!
% 0.17/0.55 % SZS status Theorem
% 0.17/0.55 % SZS output start CNFRefutation
% See solution above
% 0.17/0.56 % Parsed axioms : 34
% 0.17/0.56 % Removed by relevancy pruning/SinE : 0
% 0.17/0.56 % Initial clauses : 59
% 0.17/0.56 % Removed in clause preprocessing : 0
% 0.17/0.56 % Initial clauses in saturation : 59
% 0.17/0.56 % Processed clauses : 241
% 0.17/0.56 % ...of these trivial : 4
% 0.17/0.56 % ...subsumed : 36
% 0.17/0.56 % ...remaining for further processing : 201
% 0.17/0.56 % Other redundant clauses eliminated : 3
% 0.17/0.56 % Clauses deleted for lack of memory : 0
% 0.17/0.56 % Backward-subsumed : 3
% 0.17/0.56 % Backward-rewritten : 13
% 0.17/0.56 % Generated clauses : 325
% 0.17/0.56 % ...of the previous two non-redundant : 278
% 0.17/0.56 % ...aggressively subsumed : 0
% 0.17/0.56 % Contextual simplify-reflections : 3
% 0.17/0.56 % Paramodulations : 322
% 0.17/0.56 % Factorizations : 0
% 0.17/0.56 % NegExts : 0
% 0.17/0.56 % Equation resolutions : 3
% 0.17/0.56 % Disequality decompositions : 0
% 0.17/0.56 % Total rewrite steps : 89
% 0.17/0.56 % ...of those cached : 75
% 0.17/0.56 % Propositional unsat checks : 0
% 0.17/0.56 % Propositional check models : 0
% 0.17/0.56 % Propositional check unsatisfiable : 0
% 0.17/0.56 % Propositional clauses : 0
% 0.17/0.56 % Propositional clauses after purity: 0
% 0.17/0.56 % Propositional unsat core size : 0
% 0.17/0.56 % Propositional preprocessing time : 0.000
% 0.17/0.56 % Propositional encoding time : 0.000
% 0.17/0.56 % Propositional solver time : 0.000
% 0.17/0.56 % Success case prop preproc time : 0.000
% 0.17/0.56 % Success case prop encoding time : 0.000
% 0.17/0.56 % Success case prop solver time : 0.000
% 0.17/0.56 % Current number of processed clauses : 125
% 0.17/0.56 % Positive orientable unit clauses : 31
% 0.17/0.56 % Positive unorientable unit clauses: 0
% 0.17/0.56 % Negative unit clauses : 1
% 0.17/0.56 % Non-unit-clauses : 93
% 0.17/0.56 % Current number of unprocessed clauses: 121
% 0.17/0.56 % ...number of literals in the above : 544
% 0.17/0.56 % Current number of archived formulas : 0
% 0.17/0.56 % Current number of archived clauses : 74
% 0.17/0.56 % Clause-clause subsumption calls (NU) : 959
% 0.17/0.56 % Rec. Clause-clause subsumption calls : 426
% 0.17/0.56 % Non-unit clause-clause subsumptions : 41
% 0.17/0.56 % Unit Clause-clause subsumption calls : 31
% 0.17/0.56 % Rewrite failures with RHS unbound : 0
% 0.17/0.56 % BW rewrite match attempts : 7
% 0.17/0.56 % BW rewrite match successes : 7
% 0.17/0.56 % Condensation attempts : 0
% 0.17/0.56 % Condensation successes : 0
% 0.17/0.56 % Termbank termtop insertions : 9839
% 0.17/0.56 % Search garbage collected termcells : 967
% 0.17/0.56
% 0.17/0.56 % -------------------------------------------------
% 0.17/0.56 % User time : 0.039 s
% 0.17/0.56 % System time : 0.006 s
% 0.17/0.56 % Total time : 0.045 s
% 0.17/0.56 % Maximum resident set size: 3668 pages
% 0.17/0.56
% 0.17/0.56 % -------------------------------------------------
% 0.17/0.56 % User time : 0.274 s
% 0.17/0.56 % System time : 0.030 s
% 0.17/0.56 % Total time : 0.304 s
% 0.17/0.56 % Maximum resident set size: 4608 pages
% 0.17/0.56 % E exiting
%------------------------------------------------------------------------------