%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : CAT003-1 : TPTP v9.2.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n015.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 5 04:11:37 PM UTC 2026
% Result : Unsatisfiable 3.95s 3.28s
% Output : CNFRefutation 3.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 17
% Syntax : Number of clauses : 61 ( 30 unt; 0 nHn; 55 RR)
% Number of literals : 117 ( 9 equ; 58 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 97 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associative_property1,axiom,
( defined(X1,X2)
| ~ product(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT001-0.ax',associative_property1) ).
cnf(ga_equals_d,hypothesis,
product(g,a,d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ga_equals_d) ).
cnf(ab_equals_c,hypothesis,
product(a,b,c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ab_equals_c) ).
cnf(associative_property2,axiom,
( defined(X2,X4)
| ~ product(X1,X2,X3)
| ~ defined(X3,X4) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT001-0.ax',associative_property2) ).
cnf(category_theory_axiom1,axiom,
( defined(X1,X5)
| ~ product(X1,X2,X3)
| ~ product(X2,X4,X5)
| ~ defined(X3,X4) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT001-0.ax',category_theory_axiom1) ).
cnf(product_on_domain,axiom,
product(X1,domain(X1),X1),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT001-0.ax',product_on_domain) ).
cnf(identity1,axiom,
( product(X1,X2,X2)
| ~ defined(X1,X2)
| ~ identity_map(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT001-0.ax',identity1) ).
cnf(domain_is_an_identity_map,axiom,
identity_map(domain(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT001-0.ax',domain_is_an_identity_map) ).
cnf(ha_equals_d,hypothesis,
product(h,a,d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ha_equals_d) ).
cnf(category_theory_axiom3,axiom,
( defined(X4,X1)
| ~ product(X1,X2,X3)
| ~ defined(X4,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT001-0.ax',category_theory_axiom3) ).
cnf(category_theory_axiom6,axiom,
( defined(X1,X3)
| ~ defined(X1,X2)
| ~ defined(X2,X3)
| ~ identity_map(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT001-0.ax',category_theory_axiom6) ).
cnf(closure_of_composition,axiom,
( product(X1,X2,compose(X1,X2))
| ~ defined(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT001-0.ax',closure_of_composition) ).
cnf(mapping_from_x_to_its_domain,axiom,
defined(X1,domain(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT001-0.ax',mapping_from_x_to_its_domain) ).
cnf(category_theory_axiom5,axiom,
( product(X6,X2,X5)
| ~ product(X1,X2,X3)
| ~ product(X4,X3,X5)
| ~ product(X4,X1,X6) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT001-0.ax',category_theory_axiom5) ).
cnf(composition_is_well_defined,axiom,
( X3 = X4
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT001-0.ax',composition_is_well_defined) ).
cnf(cancellation_for_product,hypothesis,
( X1 = X3
| ~ product(X1,c,X2)
| ~ product(X3,c,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cancellation_for_product) ).
cnf(prove_h_equals_g,negated_conjecture,
h != g,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_h_equals_g) ).
cnf(c_0_17,axiom,
( defined(X1,X2)
| ~ product(X1,X2,X3) ),
associative_property1 ).
cnf(c_0_18,hypothesis,
product(g,a,d),
ga_equals_d ).
cnf(c_0_19,hypothesis,
product(a,b,c),
ab_equals_c ).
cnf(c_0_20,axiom,
( defined(X2,X4)
| ~ product(X1,X2,X3)
| ~ defined(X3,X4) ),
associative_property2 ).
cnf(c_0_21,hypothesis,
defined(g,a),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,axiom,
( defined(X1,X5)
| ~ product(X1,X2,X3)
| ~ product(X2,X4,X5)
| ~ defined(X3,X4) ),
category_theory_axiom1 ).
cnf(c_0_23,hypothesis,
defined(a,b),
inference(spm,[status(thm)],[c_0_17,c_0_19]) ).
cnf(c_0_24,hypothesis,
( defined(X1,a)
| ~ product(X2,X1,g) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,axiom,
product(X1,domain(X1),X1),
product_on_domain ).
cnf(c_0_26,hypothesis,
( defined(X1,X2)
| ~ product(X3,b,X2)
| ~ product(X1,X3,a) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,axiom,
( product(X1,X2,X2)
| ~ defined(X1,X2)
| ~ identity_map(X1) ),
identity1 ).
cnf(c_0_28,hypothesis,
defined(domain(g),a),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,axiom,
identity_map(domain(X1)),
domain_is_an_identity_map ).
cnf(c_0_30,hypothesis,
product(h,a,d),
ha_equals_d ).
cnf(c_0_31,hypothesis,
( defined(X1,c)
| ~ product(X1,a,a) ),
inference(spm,[status(thm)],[c_0_26,c_0_19]) ).
cnf(c_0_32,hypothesis,
product(domain(g),a,a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]) ).
cnf(c_0_33,axiom,
( defined(X4,X1)
| ~ product(X1,X2,X3)
| ~ defined(X4,X3) ),
category_theory_axiom3 ).
cnf(c_0_34,hypothesis,
defined(h,a),
inference(spm,[status(thm)],[c_0_17,c_0_30]) ).
cnf(c_0_35,axiom,
( defined(X1,X3)
| ~ defined(X1,X2)
| ~ defined(X2,X3)
| ~ identity_map(X2) ),
category_theory_axiom6 ).
cnf(c_0_36,hypothesis,
defined(domain(g),c),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,hypothesis,
( defined(h,X1)
| ~ product(X1,X2,a) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,hypothesis,
( defined(X1,c)
| ~ defined(X1,domain(g)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_29])]) ).
cnf(c_0_39,hypothesis,
defined(h,domain(g)),
inference(spm,[status(thm)],[c_0_37,c_0_32]) ).
cnf(c_0_40,axiom,
( product(X1,X2,compose(X1,X2))
| ~ defined(X1,X2) ),
closure_of_composition ).
cnf(c_0_41,hypothesis,
defined(h,c),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_42,axiom,
defined(X1,domain(X1)),
mapping_from_x_to_its_domain ).
cnf(c_0_43,axiom,
( product(X6,X2,X5)
| ~ product(X1,X2,X3)
| ~ product(X4,X3,X5)
| ~ product(X4,X1,X6) ),
category_theory_axiom5 ).
cnf(c_0_44,hypothesis,
product(h,c,compose(h,c)),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_45,hypothesis,
defined(g,c),
inference(spm,[status(thm)],[c_0_38,c_0_42]) ).
cnf(c_0_46,hypothesis,
( product(X1,X2,compose(h,c))
| ~ product(h,X3,X1)
| ~ product(X3,X2,c) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_47,hypothesis,
product(g,c,compose(g,c)),
inference(spm,[status(thm)],[c_0_40,c_0_45]) ).
cnf(c_0_48,hypothesis,
( product(d,X1,compose(h,c))
| ~ product(a,X1,c) ),
inference(spm,[status(thm)],[c_0_46,c_0_30]) ).
cnf(c_0_49,hypothesis,
( product(X1,X2,compose(g,c))
| ~ product(g,X3,X1)
| ~ product(X3,X2,c) ),
inference(spm,[status(thm)],[c_0_43,c_0_47]) ).
cnf(c_0_50,axiom,
( X3 = X4
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
composition_is_well_defined ).
cnf(c_0_51,hypothesis,
product(d,b,compose(h,c)),
inference(spm,[status(thm)],[c_0_48,c_0_19]) ).
cnf(c_0_52,hypothesis,
( product(d,X1,compose(g,c))
| ~ product(a,X1,c) ),
inference(spm,[status(thm)],[c_0_49,c_0_18]) ).
cnf(c_0_53,hypothesis,
( X1 = compose(h,c)
| ~ product(d,b,X1) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_54,hypothesis,
product(d,b,compose(g,c)),
inference(spm,[status(thm)],[c_0_52,c_0_19]) ).
cnf(c_0_55,hypothesis,
( X1 = X3
| ~ product(X1,c,X2)
| ~ product(X3,c,X2) ),
cancellation_for_product ).
cnf(c_0_56,hypothesis,
compose(g,c) = compose(h,c),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_57,hypothesis,
( X1 = h
| ~ product(X1,c,compose(h,c)) ),
inference(spm,[status(thm)],[c_0_55,c_0_44]) ).
cnf(c_0_58,hypothesis,
product(g,c,compose(h,c)),
inference(rw,[status(thm)],[c_0_47,c_0_56]) ).
cnf(c_0_59,negated_conjecture,
h != g,
prove_h_equals_g ).
cnf(c_0_60,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : CAT003-1 : TPTP v9.2.1. Released v1.0.0.
% 0.00/0.11 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.13/0.32 % Computer : n015.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32 % CPULimit : 300
% 0.13/0.32 % WCLimit : 300
% 0.13/0.32 % DateTime : Tue May 5 10:47:16 EDT 2026
% 0.13/0.32 % CPUTime :
% 0.13/0.33 % start to proof: theBenchmark
% 3.95/3.28 % Version : CSE_E---1.7
% 3.95/3.28 % Problem : theBenchmark.p
% 3.95/3.28 % SZS status Unsatisfiable for theBenchmark.p
% 3.95/3.28 % SZS output start CNFRefutation
% See solution above
% 3.95/3.30 % Total time : 2.373s
%------------------------------------------------------------------------------