%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : CAT006-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n015.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 : Sun Sep 27 06:55:56 AM UTC 2026
% Result : Unsatisfiable 0.14s 0.42s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 10
% Syntax : Number of formulae : 40 ( 20 unt; 0 def)
% Number of atoms : 74 ( 5 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 73 ( 39 ~; 34 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 58 ( 2 sgn 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(codomain_is_an_identity_map,axiom,
! [VAR_0] : identity_map(codomain(VAR_0)),
file('theBenchmark.p',codomain_is_an_identity_map) ).
cnf(c_3,plain,
identity_map(codomain(A)),
inference(clausify,[status(thm)],[codomain_is_an_identity_map]) ).
fof(identity1,axiom,
! [VAR_0,VAR_1] :
( product(VAR_0,VAR_1,VAR_1)
| ~ identity_map(VAR_0)
| ~ defined(VAR_0,VAR_1) ),
file('theBenchmark.p',identity1) ).
cnf(c_4,plain,
( product(A,B,B)
| ~ identity_map(A)
| ~ defined(A,B) ),
inference(clausify,[status(thm)],[identity1]) ).
fof(identity2,axiom,
! [VAR_0,VAR_1] :
( product(VAR_0,VAR_1,VAR_0)
| ~ identity_map(VAR_1)
| ~ defined(VAR_0,VAR_1) ),
file('theBenchmark.p',identity2) ).
cnf(c_5,plain,
( product(A,B,A)
| ~ identity_map(B)
| ~ defined(A,B) ),
inference(clausify,[status(thm)],[identity2]) ).
fof(h_is_the_identity_map,axiom,
identity_map(h),
file('theBenchmark.p',h_is_the_identity_map) ).
cnf(c_6,plain,
identity_map(h),
inference(clausify,[status(thm)],[h_is_the_identity_map]) ).
cnf(c_8,plain,
( product(h,A,A)
| ~ defined(h,A) ),
inference(resolve,[status(thm)],[c_6,c_4]) ).
cnf(c_9,plain,
( product(A,h,A)
| ~ defined(A,h) ),
inference(resolve,[status(thm)],[c_6,c_5]) ).
cnf(c_11,plain,
( product(A,codomain(B),A)
| ~ defined(A,codomain(B)) ),
inference(resolve,[status(thm)],[c_5,c_3]) ).
fof(prove_codomain_of_a_is_h,axiom,
codomain(a) != h,
file('theBenchmark.p',prove_codomain_of_a_is_h) ).
cnf(c_16,plain,
codomain(a) != h,
inference(clausify,[status(thm)],[prove_codomain_of_a_is_h]) ).
fof(ha_defined,axiom,
defined(h,a),
file('theBenchmark.p',ha_defined) ).
cnf(c_17,plain,
defined(h,a),
inference(clausify,[status(thm)],[ha_defined]) ).
fof(composition_is_well_defined,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3] :
( VAR_2 = VAR_3
| ~ product(VAR_0,VAR_1,VAR_3)
| ~ product(VAR_0,VAR_1,VAR_2) ),
file('theBenchmark.p',composition_is_well_defined) ).
cnf(c_18,plain,
( C = D
| ~ product(A,B,D)
| ~ product(A,B,C) ),
inference(clausify,[status(thm)],[composition_is_well_defined]) ).
fof(product_on_codomain,axiom,
! [VAR_0] : product(codomain(VAR_0),VAR_0,VAR_0),
file('theBenchmark.p',product_on_codomain) ).
cnf(c_19,plain,
product(codomain(A),A,A),
inference(clausify,[status(thm)],[product_on_codomain]) ).
fof(category_theory_axiom3,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3] :
( defined(VAR_3,VAR_0)
| ~ defined(VAR_3,VAR_2)
| ~ product(VAR_0,VAR_1,VAR_2) ),
file('theBenchmark.p',category_theory_axiom3) ).
cnf(c_25,plain,
( defined(D,A)
| ~ defined(D,C)
| ~ product(A,B,C) ),
inference(clausify,[status(thm)],[category_theory_axiom3]) ).
fof(category_theory_axiom2,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3,VAR_4,VAR_5] :
( product(VAR_0,VAR_5,VAR_4)
| ~ product(VAR_1,VAR_3,VAR_5)
| ~ product(VAR_2,VAR_3,VAR_4)
| ~ product(VAR_0,VAR_1,VAR_2) ),
file('theBenchmark.p',category_theory_axiom2) ).
cnf(c_26,plain,
( product(A,F,E)
| ~ product(B,D,F)
| ~ product(C,D,E)
| ~ product(A,B,C) ),
inference(clausify,[status(thm)],[category_theory_axiom2]) ).
cnf(c_39,plain,
product(h,a,a),
inference(resolve,[status(thm)],[c_8,c_17]) ).
cnf(c_227,plain,
( B = A
| ~ product(codomain(A),A,B) ),
inference(resolve,[status(thm)],[c_18,c_19]) ).
cnf(c_40,plain,
~ product(codomain(h),h,codomain(a)),
inference(resolve,[status(thm)],[c_227,c_16]) ).
cnf(c_228,plain,
( defined(A,codomain(B))
| ~ defined(A,B) ),
inference(resolve,[status(thm)],[c_25,c_19]) ).
cnf(c_59,plain,
defined(h,codomain(a)),
inference(resolve,[status(thm)],[c_228,c_17]) ).
cnf(c_229,plain,
( defined(A,h)
| ~ defined(A,a) ),
inference(resolve,[status(thm)],[c_25,c_39]) ).
cnf(c_69,plain,
defined(h,h),
inference(resolve,[status(thm)],[c_229,c_17]) ).
cnf(c_77,plain,
product(h,h,h),
inference(resolve,[status(thm)],[c_9,c_69]) ).
cnf(c_230,plain,
( product(codomain(A),D,C)
| ~ product(A,B,D)
| ~ product(A,B,C) ),
inference(resolve,[status(thm)],[c_26,c_19]) ).
cnf(c_231,plain,
( product(codomain(h),h,A)
| ~ product(h,h,A) ),
inference(resolve,[status(thm)],[c_230,c_77]) ).
cnf(c_78,plain,
~ product(h,h,codomain(a)),
inference(resolve,[status(thm)],[c_231,c_40]) ).
cnf(c_87,plain,
product(h,codomain(a),h),
inference(resolve,[status(thm)],[c_11,c_59]) ).
cnf(c_88,plain,
product(h,codomain(a),codomain(a)),
inference(resolve,[status(thm)],[c_8,c_59]) ).
cnf(c_232,plain,
( product(h,C,B)
| ~ product(h,A,C)
| ~ product(h,A,B) ),
inference(resolve,[status(thm)],[c_26,c_77]) ).
cnf(c_233,plain,
( product(h,h,A)
| ~ product(h,codomain(a),A) ),
inference(resolve,[status(thm)],[c_232,c_87]) ).
cnf(c_234,plain,
~ product(h,codomain(a),codomain(a)),
inference(resolve,[status(thm)],[c_233,c_78]) ).
cnf(c_226,plain,
$false,
inference(resolve,[status(thm)],[c_88,c_234]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CAT006-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.37 % Computer : n015.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Sat Sep 26 22:51:59 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.37 % Process 963390 was started by sandbox2 on n015,
% 0.09/0.37 % Sat Sep 26 22:51:59 2026
% 0.09/0.37 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.09/0.38
% 0.09/0.38 % From the command line: assign(max_seconds, 300).
% 0.14/0.42
% 0.14/0.42 % SZS status Unsatisfiable for theBenchmark
% 0.14/0.42
% 0.14/0.42 % Proof 1 at 0.02 (+ 0.01) seconds.
% 0.14/0.42 % Length of proof is 22.
% 0.14/0.42 % Level of proof is 6.
% 0.14/0.42 % Maximum clause weight is 21.000.
% 0.14/0.42 % Given clauses 69.
% 0.14/0.42
% 0.14/0.42 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------