%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CAT004-2 : TPTP v9.3.1. Released v1.0.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 12:07:58 PM UTC 2026
% Result : Unsatisfiable 0.51s 0.48s
% Output : CNFRefutation 0.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of clauses : 43 ( 19 unt; 0 nHn; 43 RR)
% Number of literals : 97 ( 96 equ; 59 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 52 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(codomain_domain2,axiom,
( codomain(X1) != domain(X2)
| codomain(compose(X1,X2)) = codomain(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT002-0.ax',codomain_domain2) ).
cnf(codomain_of_a_equals_domain_of_b,hypothesis,
codomain(a) = domain(b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',codomain_of_a_equals_domain_of_b) ).
cnf(epimorphism2,hypothesis,
( compose(b,X3) != X2
| codomain(b) != domain(X3)
| compose(b,X1) != X2
| codomain(b) != domain(X1)
| X1 = X3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',epimorphism2) ).
cnf(codomain_domain1,axiom,
( codomain(X1) != domain(X2)
| domain(compose(X1,X2)) = domain(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT002-0.ax',codomain_domain1) ).
cnf(codomain_of_ab_equals_domain_of_h,hypothesis,
codomain(compose(a,b)) = domain(h),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',codomain_of_ab_equals_domain_of_h) ).
cnf(star_property,axiom,
( codomain(X2) != domain(X3)
| codomain(X1) != domain(X2)
| compose(X1,compose(X2,X3)) = compose(compose(X1,X2),X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT002-0.ax',star_property) ).
cnf(epimorphism1,hypothesis,
( compose(a,X3) != X2
| codomain(a) != domain(X3)
| compose(a,X1) != X2
| codomain(a) != domain(X1)
| X1 = X3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',epimorphism1) ).
cnf(codomain_of_ab_equals_domain_of_g,hypothesis,
codomain(compose(a,b)) = domain(g),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',codomain_of_ab_equals_domain_of_g) ).
cnf(prove_h_equals_g,negated_conjecture,
h != g,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_h_equals_g) ).
cnf(ab_h_equals_ab_g,hypothesis,
compose(compose(a,b),h) = compose(compose(a,b),g),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ab_h_equals_ab_g) ).
cnf(c_0_10,plain,
( codomain(X1) != domain(X2)
| codomain(compose(X1,X2)) = codomain(X2) ),
inference(fof_simplification,[status(thm)],[codomain_domain2]) ).
cnf(c_0_11,plain,
( codomain(X1) != domain(X2)
| codomain(compose(X1,X2)) = codomain(X2) ),
c_0_10 ).
cnf(c_0_12,hypothesis,
codomain(a) = domain(b),
codomain_of_a_equals_domain_of_b ).
cnf(c_0_13,hypothesis,
( compose(b,X3) != X2
| codomain(b) != domain(X3)
| compose(b,X1) != X2
| codomain(b) != domain(X1)
| X1 = X3 ),
inference(fof_simplification,[status(thm)],[epimorphism2]) ).
cnf(c_0_14,plain,
( codomain(X1) != domain(X2)
| domain(compose(X1,X2)) = domain(X1) ),
inference(fof_simplification,[status(thm)],[codomain_domain1]) ).
cnf(c_0_15,hypothesis,
( domain(b) != domain(X1)
| codomain(compose(a,X1)) = codomain(X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,hypothesis,
codomain(compose(a,b)) = domain(h),
codomain_of_ab_equals_domain_of_h ).
cnf(c_0_17,hypothesis,
( compose(b,X3) != X2
| codomain(b) != domain(X3)
| compose(b,X1) != X2
| codomain(b) != domain(X1)
| X1 = X3 ),
c_0_13 ).
cnf(c_0_18,plain,
( codomain(X2) != domain(X3)
| codomain(X1) != domain(X2)
| compose(X1,compose(X2,X3)) = compose(compose(X1,X2),X3) ),
inference(fof_simplification,[status(thm)],[star_property]) ).
cnf(c_0_19,hypothesis,
( compose(a,X3) != X2
| codomain(a) != domain(X3)
| compose(a,X1) != X2
| codomain(a) != domain(X1)
| X1 = X3 ),
inference(fof_simplification,[status(thm)],[epimorphism1]) ).
cnf(c_0_20,plain,
( codomain(X1) != domain(X2)
| domain(compose(X1,X2)) = domain(X1) ),
c_0_14 ).
cnf(c_0_21,hypothesis,
codomain(b) = domain(h),
inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_15]),c_0_16]) ).
cnf(c_0_22,hypothesis,
( codomain(b) != domain(X1)
| codomain(b) != domain(X2)
| compose(b,X1) != compose(b,X2)
| X1 = X2 ),
inference(er,[status(thm)],[c_0_17]) ).
cnf(c_0_23,plain,
( codomain(X2) != domain(X3)
| codomain(X1) != domain(X2)
| compose(X1,compose(X2,X3)) = compose(compose(X1,X2),X3) ),
c_0_18 ).
cnf(c_0_24,hypothesis,
( compose(a,X3) != X2
| codomain(a) != domain(X3)
| compose(a,X1) != X2
| codomain(a) != domain(X1)
| X1 = X3 ),
c_0_19 ).
cnf(c_0_25,hypothesis,
( domain(h) != domain(X1)
| domain(compose(b,X1)) = domain(b) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,hypothesis,
codomain(compose(a,b)) = domain(g),
codomain_of_ab_equals_domain_of_g ).
cnf(c_0_27,hypothesis,
( domain(h) != domain(X1)
| domain(h) != domain(X2)
| compose(b,X1) != compose(b,X2)
| X1 = X2 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_21]),c_0_21]) ).
cnf(c_0_28,negated_conjecture,
h != g,
inference(fof_simplification,[status(thm)],[prove_h_equals_g]) ).
cnf(c_0_29,hypothesis,
( codomain(X1) != domain(b)
| domain(h) != domain(X2)
| compose(compose(X1,b),X2) = compose(X1,compose(b,X2)) ),
inference(spm,[status(thm)],[c_0_23,c_0_21]) ).
cnf(c_0_30,hypothesis,
( domain(b) != domain(X1)
| domain(b) != domain(X2)
| compose(a,X1) != compose(a,X2)
| X1 = X2 ),
inference(er,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_12]),c_0_12])]) ).
cnf(c_0_31,hypothesis,
domain(compose(b,h)) = domain(b),
inference(er,[status(thm)],[c_0_25]) ).
cnf(c_0_32,hypothesis,
domain(g) = domain(h),
inference(rw,[status(thm)],[c_0_26,c_0_16]) ).
cnf(c_0_33,hypothesis,
( domain(h) != domain(X1)
| compose(b,X1) != compose(b,h)
| X1 = h ),
inference(er,[status(thm)],[c_0_27]) ).
cnf(c_0_34,negated_conjecture,
h != g,
c_0_28 ).
cnf(c_0_35,hypothesis,
( domain(h) != domain(X1)
| compose(compose(a,b),X1) = compose(a,compose(b,X1)) ),
inference(spm,[status(thm)],[c_0_29,c_0_12]) ).
cnf(c_0_36,hypothesis,
( domain(b) != domain(X1)
| compose(a,X1) != compose(a,compose(b,h))
| X1 = compose(b,h) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_37,hypothesis,
domain(compose(b,g)) = domain(b),
inference(spm,[status(thm)],[c_0_25,c_0_32]) ).
cnf(c_0_38,hypothesis,
compose(b,g) != compose(b,h),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_32]),c_0_34]) ).
cnf(c_0_39,hypothesis,
compose(compose(a,b),h) = compose(compose(a,b),g),
ab_h_equals_ab_g ).
cnf(c_0_40,hypothesis,
compose(compose(a,b),h) = compose(a,compose(b,h)),
inference(er,[status(thm)],[c_0_35]) ).
cnf(c_0_41,hypothesis,
compose(a,compose(b,g)) != compose(a,compose(b,h)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]) ).
cnf(c_0_42,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_32]),c_0_39]),c_0_40]),c_0_41]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CAT004-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.02/0.37 % Computer : n020.cluster.edu
% 0.02/0.37 % Model : x86_64 x86_64
% 0.02/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.02/0.37 % Memory : 8046.5625MB
% 0.02/0.37 % OS : Linux 6.8.0-71-generic
% 0.02/0.37 % CPULimit : 300
% 0.02/0.37 % WCLimit : 300
% 0.02/0.37 % DateTime : Mon Sep 21 13:56:18 UTC 2026
% 0.02/0.37 % CPUTime :
% 0.02/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.02/0.42 Running first-order theorem proving
% 0.02/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.51/0.48 % Version: 3.5.1
% 0.51/0.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.51/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.51/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.51/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.51/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.51/0.48 % Starting sh5l with 300s (1) cores
% 0.51/0.48 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3098623 completed with status 0
% 0.51/0.48 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.51/0.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.51/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.51/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.51/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.51/0.48 % No SInE strategy applied
% 0.51/0.48 % Search class: FHUPM-FFSS21-SFFFFFNN
% 0.51/0.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.51/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.51/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.51/0.48 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4d with 136s (1) cores
% 0.51/0.48 % Starting new_bool_3 with 136s (1) cores
% 0.51/0.48 % Starting new_bool_1 with 136s (1) cores
% 0.51/0.48 % G-E--_208_C18_F1_SE_CS_SP_PS_S4d with pid 3098631 completed with status 0
% 0.51/0.48 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S4d
% 0.51/0.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.51/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.51/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.51/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.51/0.48 % No SInE strategy applied
% 0.51/0.48 % Search class: FHUPM-FFSS21-SFFFFFNN
% 0.51/0.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.51/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.51/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.51/0.48 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4d with 136s (1) cores
% 0.51/0.48 % Preprocessing time : 0.001 s
% 0.51/0.48 % Presaturation interreduction done
% 0.51/0.48
% 0.51/0.48 % Proof found!
% 0.51/0.48 % SZS status Unsatisfiable
% 0.51/0.48 % SZS output start CNFRefutation
% See solution above
% 0.51/0.48 % Parsed axioms : 14
% 0.51/0.48 % Removed by relevancy pruning/SinE : 0
% 0.51/0.48 % Initial clauses : 14
% 0.51/0.48 % Removed in clause preprocessing : 0
% 0.51/0.48 % Initial clauses in saturation : 14
% 0.51/0.48 % Processed clauses : 938
% 0.51/0.48 % ...of these trivial : 6
% 0.51/0.48 % ...subsumed : 648
% 0.51/0.48 % ...remaining for further processing : 283
% 0.51/0.48 % Other redundant clauses eliminated : 2
% 0.51/0.48 % Clauses deleted for lack of memory : 0
% 0.51/0.48 % Backward-subsumed : 23
% 0.51/0.48 % Backward-rewritten : 10
% 0.51/0.48 % Generated clauses : 1633
% 0.51/0.48 % ...of the previous two non-redundant : 1455
% 0.51/0.48 % ...aggressively subsumed : 0
% 0.51/0.48 % Contextual simplify-reflections : 0
% 0.51/0.48 % Paramodulations : 1583
% 0.51/0.48 % Factorizations : 0
% 0.51/0.48 % NegExts : 0
% 0.51/0.48 % Equation resolutions : 50
% 0.51/0.48 % Disequality decompositions : 0
% 0.51/0.48 % Total rewrite steps : 587
% 0.51/0.48 % ...of those cached : 530
% 0.51/0.48 % Propositional unsat checks : 0
% 0.51/0.48 % Propositional check models : 0
% 0.51/0.48 % Propositional check unsatisfiable : 0
% 0.51/0.48 % Propositional clauses : 0
% 0.51/0.48 % Propositional clauses after purity: 0
% 0.51/0.48 % Propositional unsat core size : 0
% 0.51/0.48 % Propositional preprocessing time : 0.000
% 0.51/0.48 % Propositional encoding time : 0.000
% 0.51/0.48 % Propositional solver time : 0.000
% 0.51/0.48 % Success case prop preproc time : 0.000
% 0.51/0.48 % Success case prop encoding time : 0.000
% 0.51/0.48 % Success case prop solver time : 0.000
% 0.51/0.48 % Current number of processed clauses : 234
% 0.51/0.48 % Positive orientable unit clauses : 35
% 0.51/0.48 % Positive unorientable unit clauses: 0
% 0.51/0.48 % Negative unit clauses : 3
% 0.51/0.48 % Non-unit-clauses : 196
% 0.51/0.48 % Current number of unprocessed clauses: 486
% 0.51/0.48 % ...number of literals in the above : 1249
% 0.51/0.48 % Current number of archived formulas : 0
% 0.51/0.48 % Current number of archived clauses : 47
% 0.51/0.48 % Clause-clause subsumption calls (NU) : 2548
% 0.51/0.48 % Rec. Clause-clause subsumption calls : 2539
% 0.51/0.48 % Non-unit clause-clause subsumptions : 669
% 0.51/0.48 % Unit Clause-clause subsumption calls : 3
% 0.51/0.48 % Rewrite failures with RHS unbound : 0
% 0.51/0.48 % BW rewrite match attempts : 7
% 0.51/0.48 % BW rewrite match successes : 4
% 0.51/0.48 % Condensation attempts : 0
% 0.51/0.48 % Condensation successes : 0
% 0.51/0.48 % Termbank termtop insertions : 20632
% 0.51/0.48 % Search garbage collected termcells : 34
% 0.51/0.48
% 0.51/0.48 % -------------------------------------------------
% 0.51/0.48 % User time : 0.036 s
% 0.51/0.48 % System time : 0.007 s
% 0.51/0.48 % Total time : 0.044 s
% 0.51/0.48 % Maximum resident set size: 3640 pages
% 0.51/0.48
% 0.51/0.48 % -------------------------------------------------
% 0.51/0.48 % User time : 0.171 s
% 0.51/0.48 % System time : 0.021 s
% 0.51/0.48 % Total time : 0.192 s
% 0.51/0.48 % Maximum resident set size: 4864 pages
% 0.51/0.48 % E exiting
%------------------------------------------------------------------------------