%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : CAT010-4 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n010.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:57 AM UTC 2026
% Result : Unsatisfiable 0.18s 0.69s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 27 ( 17 unt; 0 def)
% Number of atoms : 37 ( 18 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 22 ( 12 ~; 10 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 31 ( 1 sgn 9 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_codomain_of_ab_equals_codomain_of_a,axiom,
codomain(compose(a,b)) != codomain(a),
file('theBenchmark.p',prove_codomain_of_ab_equals_codomain_of_a) ).
cnf(c_4,plain,
codomain(compose(a,b)) != codomain(a),
inference(clausify,[status(thm)],[prove_codomain_of_ab_equals_codomain_of_a]) ).
fof(ab_exists,axiom,
there_exists(compose(a,b)),
file('theBenchmark.p',ab_exists) ).
cnf(c_5,plain,
there_exists(compose(a,b)),
inference(clausify,[status(thm)],[ab_exists]) ).
fof(compose_codomain,axiom,
! [VAR_0] : compose(codomain(VAR_0),VAR_0) = VAR_0,
file('theBenchmark.p',compose_codomain) ).
cnf(c_6,plain,
compose(codomain(A),A) = A,
inference(clausify,[status(thm)],[compose_codomain]) ).
fof(associativity_of_compose,axiom,
! [VAR_0,VAR_1,VAR_2] : compose(VAR_0,compose(VAR_1,VAR_2)) = compose(compose(VAR_0,VAR_1),VAR_2),
file('theBenchmark.p',associativity_of_compose) ).
cnf(c_8,plain,
compose(A,compose(B,C)) = compose(compose(A,B),C),
inference(clausify,[status(thm)],[associativity_of_compose]) ).
cnf(c_9,plain,
compose(compose(A,B),C) = compose(A,compose(B,C)),
inference(copy,[status(thm)],[c_8]) ).
fof(domain_codomain_composition1,axiom,
! [VAR_0,VAR_1] :
( domain(VAR_0) = codomain(VAR_1)
| ~ there_exists(compose(VAR_0,VAR_1)) ),
file('theBenchmark.p',domain_codomain_composition1) ).
cnf(c_12,plain,
( domain(A) = codomain(B)
| ~ there_exists(compose(A,B)) ),
inference(clausify,[status(thm)],[domain_codomain_composition1]) ).
cnf(c_13,plain,
( codomain(B) = domain(A)
| ~ there_exists(compose(A,B)) ),
inference(copy,[status(thm)],[c_12]) ).
fof(composition_implies_domain,axiom,
! [VAR_0,VAR_1] :
( there_exists(domain(VAR_0))
| ~ there_exists(compose(VAR_0,VAR_1)) ),
file('theBenchmark.p',composition_implies_domain) ).
cnf(c_14,plain,
( there_exists(domain(A))
| ~ there_exists(compose(A,B)) ),
inference(clausify,[status(thm)],[composition_implies_domain]) ).
fof(domain_has_elements,axiom,
! [VAR_0] :
( there_exists(VAR_0)
| ~ there_exists(domain(VAR_0)) ),
file('theBenchmark.p',domain_has_elements) ).
cnf(c_16,plain,
( there_exists(A)
| ~ there_exists(domain(A)) ),
inference(clausify,[status(thm)],[domain_has_elements]) ).
cnf(c_120,plain,
compose(A,B) = compose(codomain(A),compose(A,B)),
inference(paramod,[status(thm)],[c_6,c_9]) ).
cnf(c_17,plain,
compose(codomain(A),compose(A,B)) = compose(A,B),
inference(copy,[status(thm)],[c_120]) ).
cnf(c_121,plain,
( codomain(A) = domain(codomain(A))
| ~ there_exists(A) ),
inference(paramod,[status(thm)],[c_6,c_13]) ).
cnf(c_21,plain,
( domain(codomain(A)) = codomain(A)
| ~ there_exists(A) ),
inference(copy,[status(thm)],[c_121]) ).
cnf(c_24,plain,
there_exists(domain(a)),
inference(resolve,[status(thm)],[c_14,c_5]) ).
cnf(c_30,plain,
( codomain(compose(A,B)) = domain(codomain(A))
| ~ there_exists(compose(A,B)) ),
inference(paramod,[status(thm)],[c_17,c_13]) ).
cnf(c_40,plain,
there_exists(a),
inference(resolve,[status(thm)],[c_16,c_24]) ).
cnf(c_50,plain,
domain(codomain(a)) = codomain(a),
inference(resolve,[status(thm)],[c_21,c_40]) ).
cnf(c_122,plain,
codomain(compose(a,b)) = domain(codomain(a)),
inference(resolve,[status(thm)],[c_30,c_5]) ).
cnf(c_118,plain,
codomain(compose(a,b)) = codomain(a),
inference(paramod,[status(thm)],[c_50,c_122]) ).
cnf(c_119,plain,
$false,
inference(resolve,[status(thm)],[c_118,c_4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : CAT010-4 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.65 % Computer : n010.cluster.edu
% 0.18/0.65 % Model : x86_64 x86_64
% 0.18/0.65 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.65 % Memory : 8046.5625MB
% 0.18/0.65 % OS : Linux 6.8.0-71-generic
% 0.18/0.65 % CPULimit : 300
% 0.18/0.65 % WCLimit : 300
% 0.18/0.65 % DateTime : Sat Sep 26 22:49:36 UTC 2026
% 0.18/0.66 % CPUTime :
% 0.18/0.66 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.18/0.66 % Process 219095 was started by sandbox on n010,
% 0.18/0.66 % Sat Sep 26 22:49:36 2026
% 0.18/0.66 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.18/0.67
% 0.18/0.67 % From the command line: assign(max_seconds, 300).
% 0.18/0.69
% 0.18/0.69 % SZS status Unsatisfiable for theBenchmark
% 0.18/0.69
% 0.18/0.69 % Proof 1 at 0.01 (+ 0.01) seconds.
% 0.18/0.69 % Length of proof is 17.
% 0.18/0.69 % Level of proof is 5.
% 0.18/0.69 % Maximum clause weight is 36.000.
% 0.18/0.69 % Given clauses 38.
% 0.18/0.69
% 0.18/0.69 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------