%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : COL052-2 : 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 : n026.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 204.52s 204.80s
% Output : Proof 204.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 9
% Syntax : Number of clauses : 32 ( 20 unt; 0 nHn; 30 RR)
% Number of literals : 49 ( 26 equ; 19 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 14 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(composer_exists,axiom,
response(compose(X,Y),W) = response(X,response(Y,W)),
file('theBenchmark.p',composer_exists) ).
cnf(agreeable1,axiom,
( response(X,common_bird(Y)) = response(Y,common_bird(Y))
| ~ agreeable(X) ),
file('theBenchmark.p',agreeable1) ).
cnf(agreeable2,axiom,
( agreeable(X)
| response(X,Z) != response(compatible(X),Z) ),
file('theBenchmark.p',agreeable2) ).
cnf(c_is_agreeable,hypothesis,
agreeable(c),
file('theBenchmark.p',c_is_agreeable) ).
cnf(prove_a_is_agreeable,negated_conjecture,
~ agreeable(a),
file('theBenchmark.p',prove_a_is_agreeable) ).
cnf(c_composes_a_with_b,hypothesis,
c = compose(a,b),
file('theBenchmark.p',c_composes_a_with_b) ).
cnf(equality_2,axiom,
( Eq_x_1 = Eq_x_0
| Eq_x_0 != Eq_x_1 ),
theory(equality,[symmetry]) ).
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(equality_8,axiom,
( agreeable(Eq_y_0)
| ~ agreeable(Eq_x_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(t1,plain,
~ agreeable(a),
inference(start,[status(thm),parent(0:0)],[prove_a_is_agreeable]) ).
cnf(t2,plain,
( response(a,response(b,common_bird(compose(compatible(a),b)))) != response(compatible(a),response(b,common_bird(compose(compatible(a),b))))
| agreeable(a) ),
inference(extension,[status(thm),parent(t1:1)],[agreeable2]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
( response(a,response(b,common_bird(compose(compatible(a),b)))) != response(compose(compatible(a),b),common_bird(compose(compatible(a),b)))
| response(compose(compatible(a),b),common_bird(compose(compatible(a),b))) != response(compatible(a),response(b,common_bird(compose(compatible(a),b))))
| response(a,response(b,common_bird(compose(compatible(a),b)))) = response(compatible(a),response(b,common_bird(compose(compatible(a),b)))) ),
inference(extension,[status(thm),parent(t2:2)],[equality_3]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
response(compose(compatible(a),b),common_bird(compose(compatible(a),b))) = response(compatible(a),response(b,common_bird(compose(compatible(a),b)))),
inference(extension,[status(thm),parent(t4:2)],[composer_exists]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t4:2]) ).
cnf(t8,plain,
( response(compose(compatible(a),b),common_bird(compose(compatible(a),b))) != response(a,response(b,common_bird(compose(compatible(a),b))))
| response(a,response(b,common_bird(compose(compatible(a),b)))) = response(compose(compatible(a),b),common_bird(compose(compatible(a),b))) ),
inference(extension,[status(thm),parent(t4:3)],[equality_2]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t4:3]) ).
cnf(t10,plain,
( response(compose(compatible(a),b),common_bird(compose(compatible(a),b))) != response(compose(a,b),common_bird(compose(compatible(a),b)))
| response(compose(a,b),common_bird(compose(compatible(a),b))) != response(a,response(b,common_bird(compose(compatible(a),b))))
| response(compose(compatible(a),b),common_bird(compose(compatible(a),b))) = response(a,response(b,common_bird(compose(compatible(a),b)))) ),
inference(extension,[status(thm),parent(t8:2)],[equality_3]) ).
cnf(t11,plain,
$false,
inference(connection,[status(thm),parent(t10:1)],[t10:1,t8:2]) ).
cnf(t12,plain,
response(compose(a,b),common_bird(compose(compatible(a),b))) = response(a,response(b,common_bird(compose(compatible(a),b)))),
inference(extension,[status(thm),parent(t10:2)],[composer_exists]) ).
cnf(t13,plain,
$false,
inference(connection,[status(thm),parent(t12:1)],[t12:1,t10:2]) ).
cnf(t14,plain,
( response(compose(a,b),common_bird(compose(compatible(a),b))) != response(compose(compatible(a),b),common_bird(compose(compatible(a),b)))
| response(compose(compatible(a),b),common_bird(compose(compatible(a),b))) = response(compose(a,b),common_bird(compose(compatible(a),b))) ),
inference(extension,[status(thm),parent(t10:3)],[equality_2]) ).
cnf(t15,plain,
$false,
inference(connection,[status(thm),parent(t14:1)],[t14:1,t10:3]) ).
cnf(t16,plain,
( ~ agreeable(compose(a,b))
| response(compose(a,b),common_bird(compose(compatible(a),b))) = response(compose(compatible(a),b),common_bird(compose(compatible(a),b))) ),
inference(extension,[status(thm),parent(t14:2)],[agreeable1]) ).
cnf(t17,plain,
$false,
inference(connection,[status(thm),parent(t16:1)],[t16:1,t14:2]) ).
cnf(t18,plain,
( c != compose(a,b)
| ~ agreeable(c)
| agreeable(compose(a,b)) ),
inference(extension,[status(thm),parent(t16:2)],[equality_8]) ).
cnf(t19,plain,
$false,
inference(connection,[status(thm),parent(t18:1)],[t18:1,t16:2]) ).
cnf(t20,plain,
agreeable(c),
inference(extension,[status(thm),parent(t18:2)],[c_is_agreeable]) ).
cnf(t21,plain,
$false,
inference(connection,[status(thm),parent(t20:1)],[t20:1,t18:2]) ).
cnf(t22,plain,
c = compose(a,b),
inference(extension,[status(thm),parent(t18:3)],[c_composes_a_with_b]) ).
cnf(t23,plain,
$false,
inference(connection,[status(thm),parent(t22:1)],[t22:1,t18:3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COL052-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03 This is a CNF_UNS_RFO_SEQ_HRN 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.08/0.38 % Computer : n026.cluster.edu
% 0.08/0.38 % Model : x86_64 x86_64
% 0.08/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.38 % Memory : 8046.5625MB
% 0.08/0.38 % OS : Linux 6.8.0-71-generic
% 0.08/0.38 % CPULimit : 300
% 0.08/0.38 % WCLimit : 300
% 0.08/0.38 % DateTime : Sun Sep 20 14:46:36 UTC 2026
% 0.08/0.38 % CPUTime :
% 204.52/204.80 % SZS status Unsatisfiable for theBenchmark
% 204.52/204.80 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------