%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : COL052-2 : TPTP v9.2.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n017.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 5 04:12:09 PM UTC 2026
% Result : Unsatisfiable 1.29s 1.72s
% Output : CNFRefutation 1.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of clauses : 20 ( 12 unt; 0 nHn; 11 RR)
% Number of literals : 29 ( 14 equ; 12 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 : 28 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(composer_exists,axiom,
response(compose(X1,X2),X3) = response(X1,response(X2,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',composer_exists) ).
cnf(c_composes_a_with_b,hypothesis,
c = compose(a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_composes_a_with_b) ).
cnf(agreeable1,axiom,
( response(X1,common_bird(X2)) = response(X2,common_bird(X2))
| ~ agreeable(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',agreeable1) ).
cnf(c_is_agreeable,hypothesis,
agreeable(c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_is_agreeable) ).
cnf(agreeable2,axiom,
( agreeable(X1)
| response(X1,X2) != response(compatible(X1),X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',agreeable2) ).
cnf(prove_a_is_agreeable,negated_conjecture,
~ agreeable(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_a_is_agreeable) ).
cnf(c_0_6,axiom,
response(compose(X1,X2),X3) = response(X1,response(X2,X3)),
composer_exists ).
cnf(c_0_7,hypothesis,
c = compose(a,b),
c_composes_a_with_b ).
cnf(c_0_8,axiom,
( response(X1,common_bird(X2)) = response(X2,common_bird(X2))
| ~ agreeable(X1) ),
agreeable1 ).
cnf(c_0_9,hypothesis,
response(a,response(b,X1)) = response(c,X1),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,plain,
( response(X1,common_bird(X1)) = response(X2,response(X3,common_bird(X1)))
| ~ agreeable(compose(X2,X3)) ),
inference(spm,[status(thm)],[c_0_6,c_0_8]) ).
cnf(c_0_11,hypothesis,
agreeable(c),
c_is_agreeable ).
cnf(c_0_12,axiom,
( agreeable(X1)
| response(X1,X2) != response(compatible(X1),X2) ),
agreeable2 ).
cnf(c_0_13,plain,
( response(X1,common_bird(compose(X2,X3))) = response(X2,response(X3,common_bird(compose(X2,X3))))
| ~ agreeable(X1) ),
inference(spm,[status(thm)],[c_0_6,c_0_8]) ).
cnf(c_0_14,hypothesis,
response(X1,common_bird(X1)) = response(c,common_bird(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_7]),c_0_11])]) ).
cnf(c_0_15,plain,
( agreeable(X1)
| response(X2,common_bird(compose(compatible(X1),X3))) != response(X1,response(X3,common_bird(compose(compatible(X1),X3))))
| ~ agreeable(X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
~ agreeable(a),
prove_a_is_agreeable ).
cnf(c_0_17,hypothesis,
( response(X1,common_bird(X2)) = response(c,common_bird(X2))
| ~ agreeable(X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_14]) ).
cnf(c_0_18,hypothesis,
~ agreeable(X1),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_9]),c_0_16]),c_0_17]) ).
cnf(c_0_19,hypothesis,
$false,
inference(sr,[status(thm)],[c_0_11,c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : COL052-2 : TPTP v9.2.1. Released v1.0.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.33 % Computer : n017.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Mon May 4 16:13:43 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 1.29/1.72 % Version : CSE_E---1.7
% 1.29/1.72 % Problem : theBenchmark.p
% 1.29/1.72 % SZS status Unsatisfiable for theBenchmark.p
% 1.29/1.72 % SZS output start CNFRefutation
% See solution above
% 1.29/1.72 % Total time : 1.369s
%------------------------------------------------------------------------------