%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : COL083-1 : TPTP v9.3.1. Released v2.6.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 : n006.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:31 AM UTC 2026
% Result : Unsatisfiable 0.13s 10.40s
% Output : Proof 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 4
% Syntax : Number of clauses : 11 ( 9 unt; 0 nHn; 8 RR)
% Number of literals : 15 ( 12 equ; 6 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 19 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(composer_exists,hypothesis,
response(compose(A,B),C) = response(A,response(B,C)),
file('theBenchmark.p',composer_exists) ).
cnf(prove_birds_are_compatible_1,negated_conjecture,
response(a,A) != B,
file('theBenchmark.p',prove_birds_are_compatible_1) ).
cnf(equality_1,axiom,
Eq_x_0 = Eq_x_0,
theory(equality,[reflexivity]) ).
cnf(equality_4,axiom,
( response(Eq_x_0,Eq_x_1) = response(Eq_y_0,Eq_y_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(t1,plain,
response(a,response(compose(U_107,U_108),U_109)) != response(a,response(U_107,response(U_108,U_109))),
inference(start,[status(thm),parent(0:0)],[prove_birds_are_compatible_1]) ).
cnf(t2,plain,
( response(compose(U_107,U_108),U_109) != response(U_107,response(U_108,U_109))
| a != a
| response(a,response(compose(U_107,U_108),U_109)) = response(a,response(U_107,response(U_108,U_109))) ),
inference(extension,[status(thm),parent(t1:1)],[equality_4]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
a = a,
inference(extension,[status(thm),parent(t2:2)],[equality_1]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
response(compose(U_107,U_108),U_109) = response(U_107,response(U_108,U_109)),
inference(extension,[status(thm),parent(t2:3)],[composer_exists]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t2:3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : COL083-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.03 This is a CNF_UNS_RFO_PEQ_UEQ 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/10.38 % Computer : n006.cluster.edu
% 0.10/10.38 % Model : x86_64 x86_64
% 0.10/10.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/10.38 % Memory : 8046.5625MB
% 0.10/10.38 % OS : Linux 6.8.0-71-generic
% 0.10/10.38 % CPULimit : 300
% 0.10/10.38 % WCLimit : 300
% 0.10/10.38 % DateTime : Sun Sep 20 14:51:55 UTC 2026
% 0.10/10.38 % CPUTime :
% 0.13/10.40 % SZS status Unsatisfiable for theBenchmark
% 0.13/10.40 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------