%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : COL052-1 : 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 : n007.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.23s 1.72s
% Output : CNFRefutation 1.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of clauses : 12 ( 12 unt; 0 nHn; 6 RR)
% Number of literals : 12 ( 11 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 14 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(agreeable1,hypothesis,
response(c,common_bird(X1)) = response(X1,common_bird(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',agreeable1) ).
cnf(composer_exists,axiom,
response(compose(X1,X2),X3) = response(X1,response(X2,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',composer_exists) ).
cnf(prove_a_is_agreeable,negated_conjecture,
response(a,X1) != response(odd_bird,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_a_is_agreeable) ).
cnf(c_composes_a_with_b,hypothesis,
c = compose(a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_composes_a_with_b) ).
cnf(c_0_4,hypothesis,
response(c,common_bird(X1)) = response(X1,common_bird(X1)),
agreeable1 ).
cnf(c_0_5,axiom,
response(compose(X1,X2),X3) = response(X1,response(X2,X3)),
composer_exists ).
cnf(c_0_6,negated_conjecture,
response(a,X1) != response(odd_bird,X1),
prove_a_is_agreeable ).
cnf(c_0_7,hypothesis,
response(X1,response(X2,common_bird(compose(X1,X2)))) = response(c,common_bird(compose(X1,X2))),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_8,hypothesis,
c = compose(a,b),
c_composes_a_with_b ).
cnf(c_0_9,negated_conjecture,
response(a,response(X1,common_bird(compose(odd_bird,X1)))) != response(c,common_bird(compose(odd_bird,X1))),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,hypothesis,
response(a,response(b,X1)) = response(c,X1),
inference(spm,[status(thm)],[c_0_5,c_0_8]) ).
cnf(c_0_11,hypothesis,
$false,
inference(spm,[status(thm)],[c_0_9,c_0_10]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : COL052-1 : 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.15/0.33 % Computer : n007.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Mon May 4 16:14:24 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 1.23/1.72 % Version : CSE_E---1.7
% 1.23/1.72 % Problem : theBenchmark.p
% 1.23/1.72 % SZS status Unsatisfiable for theBenchmark.p
% 1.23/1.72 % SZS output start CNFRefutation
% See solution above
% 1.23/1.72 % Total time : 1.371s
%------------------------------------------------------------------------------