%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : COL053-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n018.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:25 AM UTC 2026
% Result : Unsatisfiable 0.11s 0.38s
% Output : Proof 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 3
% Syntax : Number of clauses : 10 ( 8 unt; 0 nHn; 9 RR)
% Number of literals : 14 ( 11 equ; 6 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 7 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(composer_exists,axiom,
response(compose(X,Y),W) = response(X,response(Y,W)),
file('theBenchmark.p',composer_exists) ).
cnf(prove_bird_exists,negated_conjecture,
response(U,f(U)) != response(a,response(b,response(c,f(U)))),
file('theBenchmark.p',prove_bird_exists) ).
cnf(equality_3,axiom,
( Eq_x_0 = Eq_x_2
| Eq_x_1 != Eq_x_2
| Eq_x_0 != Eq_x_1 ),
theory(equality,[transitivity]) ).
cnf(t1,plain,
response(compose(compose(a,b),c),f(compose(compose(a,b),c))) != response(a,response(b,response(c,f(compose(compose(a,b),c))))),
inference(start,[status(thm),parent(0:0)],[prove_bird_exists]) ).
cnf(t2,plain,
( response(compose(a,b),response(c,f(compose(compose(a,b),c)))) != response(a,response(b,response(c,f(compose(compose(a,b),c)))))
| response(compose(compose(a,b),c),f(compose(compose(a,b),c))) != response(compose(a,b),response(c,f(compose(compose(a,b),c))))
| response(compose(compose(a,b),c),f(compose(compose(a,b),c))) = response(a,response(b,response(c,f(compose(compose(a,b),c))))) ),
inference(extension,[status(thm),parent(t1:1)],[equality_3]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
response(compose(compose(a,b),c),f(compose(compose(a,b),c))) = response(compose(a,b),response(c,f(compose(compose(a,b),c)))),
inference(extension,[status(thm),parent(t2:2)],[composer_exists]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
response(compose(a,b),response(c,f(compose(compose(a,b),c)))) = response(a,response(b,response(c,f(compose(compose(a,b),c))))),
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 : COL053-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03 This is a CNF_UNS_RFO_PEQ_UEQ problem
% 0.00/0.03 % Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.35 % Computer : n018.cluster.edu
% 0.07/0.35 % Model : x86_64 x86_64
% 0.07/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.35 % Memory : 8046.5625MB
% 0.07/0.35 % OS : Linux 6.8.0-71-generic
% 0.07/0.35 % CPULimit : 300
% 0.07/0.35 % WCLimit : 300
% 0.07/0.35 % DateTime : Sun Sep 20 14:45:43 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.38 % SZS status Unsatisfiable for theBenchmark
% 0.11/0.38 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------