%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : COL052-2 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n014.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 : Fri Sep 25 01:01:53 PM UTC 2026
% Result : Unsatisfiable 6.28s 1.25s
% Output : Proof 6.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 7
% Syntax : Number of formulae : 46 ( 38 unt; 0 def)
% Number of atoms : 54 ( 38 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 22 ( 14 ~; 8 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-4 aty)
% Number of variables : 56 ( 2 sgn 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f2,axiom,
( agreeable(X)
| response(X,Z) != response(compatible(X),Z) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',agreeable2) ).
fof(f2_nnf,plain,
! [X,Z] :
( agreeable(X)
| response(X,Z) != response(compatible(X),Z) ),
inference(nnf_transformation,[status(thm)],[f2]) ).
fof(f2_sk,plain,
! [X,Z] :
( agreeable(X)
| response(X,Z) != response(compatible(X),Z) ),
inference(skolemisation,[status(esa)],[f2_nnf]) ).
cnf(c2,plain,
( agreeable(X0)
| response(X0,X1) != response(compatible(X0),X1) ),
inference(cnf_transformation,[status(esa)],[f2_sk]) ).
cnf(t5,plain,
ifeq(response(X1,X2),response(compatible(X1),X2),agreeable(X1),true) = true,
inference(equality_encoding,[status(esa)],[c2]) ).
cnf(t19,plain,
ifeq(response(X1,X2),response(compatible(X1),X2),agreeable(X1),true) = true,
inference(orient,[status(thm)],[t5]) ).
cnf(f0,axiom,
response(compose(X,Y),W) = response(X,response(Y,W)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',composer_exists) ).
fof(f0_nnf,plain,
! [X,Y,W] : response(compose(X,Y),W) = response(X,response(Y,W)),
inference(nnf_transformation,[status(thm)],[f0]) ).
fof(f0_sk,plain,
! [X,Y,W] : response(compose(X,Y),W) = response(X,response(Y,W)),
inference(skolemisation,[status(esa)],[f0_nnf]) ).
cnf(c0,plain,
response(compose(X0,X1),X2) = response(X0,response(X1,X2)),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(t4,plain,
response(compose(X1,X2),X3) = response(X1,response(X2,X3)),
inference(equality_encoding,[status(esa)],[c0]) ).
cnf(t8,plain,
response(compose(X1,X2),X3) = response(X1,response(X2,X3)),
inference(orient,[status(thm)],[t4]) ).
cnf(f5,hypothesis,
c = compose(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_composes_a_with_b) ).
fof(f5_nnf,plain,
c = compose(a,b),
inference(nnf_transformation,[status(thm)],[f5]) ).
cnf(c5,plain,
c = compose(a,b),
inference(cnf_transformation,[status(esa)],[f5_nnf]) ).
cnf(t1,plain,
compose(a,b) = c,
inference(equality_encoding,[status(esa)],[c5]) ).
cnf(t25,plain,
compose(a,b) = c,
inference(orient,[status(thm)],[t1]) ).
cnf(t26,plain,
response(a,response(b,X1)) = response(c,X1),
inference(cp,[status(thm)],[t8,t25]) ).
cnf(t27,plain,
response(a,response(b,X1)) = response(c,X1),
inference(orient,[status(thm)],[t26]) ).
cnf(t29,plain,
true = ifeq(response(c,X1),response(compatible(a),response(b,X1)),agreeable(a),true),
inference(cp,[status(thm)],[t19,t27]) ).
cnf(t45,plain,
ifeq(response(c,X1),response(compatible(a),response(b,X1)),agreeable(a),true) = true,
inference(orient,[status(thm)],[t29]) ).
cnf(f1,axiom,
( response(X,common_bird(Y)) = response(Y,common_bird(Y))
| ~ agreeable(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',agreeable1) ).
fof(f1_nnf,plain,
! [X,Y] :
( response(X,common_bird(Y)) = response(Y,common_bird(Y))
| ~ agreeable(X) ),
inference(nnf_transformation,[status(thm)],[f1]) ).
fof(f1_sk,plain,
! [X,Y] :
( response(X,common_bird(Y)) = response(Y,common_bird(Y))
| ~ agreeable(X) ),
inference(skolemisation,[status(esa)],[f1_nnf]) ).
cnf(c1,plain,
( response(X0,common_bird(X1)) = response(X1,common_bird(X1))
| ~ agreeable(X0) ),
inference(cnf_transformation,[status(esa)],[f1_sk]) ).
cnf(hi1,axiom,
ifeq(agreeable(X0),true,response(X0,common_bird(X1)),response(X1,common_bird(X1))) = response(X1,common_bird(X1)),
inference(equality_encoding,[status(esa)],[c1]) ).
cnf(f3,hypothesis,
agreeable(c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_is_agreeable) ).
fof(f3_nnf,plain,
agreeable(c),
inference(nnf_transformation,[status(thm)],[f3]) ).
cnf(c3,plain,
agreeable(c),
inference(cnf_transformation,[status(esa)],[f3_nnf]) ).
cnf(hi3,axiom,
agreeable(c) = true,
inference(equality_encoding,[status(esa)],[c3]) ).
cnf(t3,plain,
response(c,common_bird(X1)) = response(X1,common_bird(X1)),
inference(hyper_resolution,[status(thm)],[hi1,hi3]) ).
cnf(t9,plain,
response(X1,common_bird(X1)) = response(c,common_bird(X1)),
inference(orient,[status(thm)],[t3]) ).
cnf(t10,plain,
response(c,common_bird(compose(X1,X2))) = response(X1,response(X2,common_bird(compose(X1,X2)))),
inference(cp,[status(thm)],[t9,t8]) ).
cnf(t34,plain,
response(X1,response(X2,common_bird(compose(X1,X2)))) = response(c,common_bird(compose(X1,X2))),
inference(orient,[status(thm)],[t10]) ).
cnf(t48,plain,
true = ifeq(response(c,common_bird(compose(compatible(a),b))),response(c,common_bird(compose(compatible(a),b))),agreeable(a),true),
inference(cp,[status(thm)],[t45,t34]) ).
cnf(t2,plain,
ifeq(X1,X1,X2,X3) = X2,
introduced(definition) ).
cnf(t7,plain,
ifeq(X1,X1,X2,X3) = X2,
inference(orient,[status(thm)],[t2]) ).
cnf(t57,plain,
true = agreeable(a),
inference(step,[status(thm)],[t48,t7]) ).
cnf(t51,plain,
agreeable(a) = true,
inference(orient,[status(thm)],[t57]) ).
cnf(f4,negated_conjecture,
~ agreeable(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_a_is_agreeable) ).
fof(f4_nnf,plain,
~ agreeable(a),
inference(nnf_transformation,[status(thm)],[f4]) ).
fof(f4_sk,plain,
~ agreeable(a),
inference(skolemisation,[status(esa)],[f4_nnf]) ).
cnf(c4,plain,
~ agreeable(a),
inference(cnf_transformation,[status(esa)],[f4_sk]) ).
cnf(goal_0,negated_conjecture,
agreeable(a) != true,
inference(equality_encoding,[status(esa)],[c4]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t51]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COL052-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.09/0.36 % Computer : n014.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Fri Sep 25 07:21:32 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 6.28/1.25 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.28/1.25 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------