%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : CAT007-3 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n007.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 08:14:07 AM UTC 2026
% Result : Unsatisfiable 0.10s 0.38s
% Output : Proof 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 4
% Syntax : Number of clauses : 11 ( 9 unt; 0 nHn; 11 RR)
% Number of literals : 15 ( 0 equ; 6 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 2 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(domain_codomain_composition2,axiom,
( there_exists(compose(X,Y))
| ~ equalish(domain(X),codomain(Y))
| ~ there_exists(domain(X)) ),
file('theBenchmark.p',domain_codomain_composition2) ).
cnf(domain_of_c2_exists,hypothesis,
there_exists(domain(c2)),
file('theBenchmark.p',domain_of_c2_exists) ).
cnf(domain_of_c2_equals_codomain_of_c1,hypothesis,
equalish(domain(c2),codomain(c1)),
file('theBenchmark.p',domain_of_c2_equals_codomain_of_c1) ).
cnf(prove_c1_c2_is_defined,negated_conjecture,
~ there_exists(compose(c2,c1)),
file('theBenchmark.p',prove_c1_c2_is_defined) ).
cnf(t1,plain,
~ there_exists(compose(c2,c1)),
inference(start,[status(thm),parent(0:0)],[prove_c1_c2_is_defined]) ).
cnf(t2,plain,
( ~ equalish(domain(c2),codomain(c1))
| ~ there_exists(domain(c2))
| there_exists(compose(c2,c1)) ),
inference(extension,[status(thm),parent(t1:1)],[domain_codomain_composition2]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
there_exists(domain(c2)),
inference(extension,[status(thm),parent(t2:2)],[domain_of_c2_exists]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
equalish(domain(c2),codomain(c1)),
inference(extension,[status(thm),parent(t2:3)],[domain_of_c2_equals_codomain_of_c1]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t2:3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CAT007-3 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03 This is a CNF_UNS_RFO_NEQ_NHN problem
% 0.00/0.04 % Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.36 % Computer : n007.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sun Sep 20 14:02:49 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.38 % SZS status Unsatisfiable for theBenchmark
% 0.10/0.38 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------