%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : COL054-1 : TPTP v9.2.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n018.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 0.25s 1.60s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 13
% Syntax : Number of clauses : 29 ( 17 unt; 0 nHn; 15 RR)
% Number of literals : 43 ( 42 equ; 24 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 52 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(composer_exists,hypothesis,
response(compose(X1,X2),X3) = response(X1,response(X2,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',composer_exists) ).
cnf(prove_birds_are_compatible,negated_conjecture,
( response(a,X1) != X2
| response(b,X2) != X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_birds_are_compatible) ).
cnf(mocking_bird_exists,axiom,
response(mocking_bird,X1) = response(X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mocking_bird_exists) ).
cnf(i_0_3,hypothesis,
response(compose(X1,X2),X3) = response(X1,response(X2,X3)),
composer_exists,
[final] ).
cnf(i_0_4,negated_conjecture,
( response(a,X1) != X2
| response(b,X2) != X1 ),
prove_birds_are_compatible,
[final] ).
cnf(i_0_5,axiom,
response(mocking_bird,X1) = response(X1,X1),
mocking_bird_exists,
[final] ).
cnf(i_0_6,axiom,
X1 = X1 ).
cnf(i_0_7,axiom,
( X1 = X2
| X2 != X1 ) ).
cnf(i_0_8,axiom,
( X1 = X2
| X1 != X3
| X3 != X2 ) ).
cnf(i_0_9,axiom,
( X1 != X2
| response(X1,X3) = response(X2,X3) ) ).
cnf(i_0_10,axiom,
( X1 != X2
| response(X3,X1) = response(X3,X2) ) ).
cnf(i_0_6_001,axiom,
X1 = X1 ).
cnf(i_0_7_002,axiom,
( X1 = X2
| X2 != X1 ) ).
cnf(i_0_8_003,axiom,
( X1 = X2
| X1 != X3
| X3 != X2 ) ).
cnf(i_0_9_004,axiom,
( X1 != X2
| response(X1,X3) = response(X2,X3) ) ).
cnf(i_0_10_005,axiom,
( X1 != X2
| response(X3,X1) = response(X3,X2) ) ).
cnf(i_0_11,plain,
response(X1,response(X2,X3)) = response(compose(X1,X2),X3),
inference(scs_inference,[],[i_0_3,i_0_7]) ).
cnf(i_0_12,plain,
response(a,response(compose(b,X1),X2)) != response(X1,X2),
inference(scs_inference,[],[i_0_3,i_0_7,i_0_4]) ).
cnf(i_0_13,plain,
( response(b,X1) != X2
| response(a,X2) != X1 ),
inference(rename_variables,[],[i_0_4]) ).
cnf(i_0_14,plain,
response(compose(b,a),X1) != X1,
inference(scs_inference,[],[i_0_3,i_0_7,i_0_4,i_0_10]) ).
cnf(i_0_15,plain,
response(a,response(compose(b,a),a)) != response(mocking_bird,a),
inference(scs_inference,[],[i_0_3,i_0_5,i_0_7,i_0_4,i_0_10,i_0_8]) ).
cnf(i_0_16,plain,
response(mocking_bird,X1) = response(X1,X1),
inference(rename_variables,[],[i_0_5]) ).
cnf(i_0_17,plain,
response(X1,X1) = response(mocking_bird,X1),
inference(scs_inference,[],[i_0_5,i_0_7]) ).
cnf(i_0_18,plain,
response(a,response(compose(b,X1),X1)) != response(mocking_bird,X1),
inference(scs_inference,[],[i_0_12,i_0_5,i_0_7,i_0_8]) ).
cnf(i_0_19,plain,
response(mocking_bird,X1) = response(X1,X1),
inference(rename_variables,[],[i_0_5]) ).
cnf(i_0_20,plain,
response(a,response(compose(b,X1),X2)) != response(X1,X2),
inference(rename_variables,[],[i_0_12]) ).
cnf(i_0_21,plain,
response(a,response(mocking_bird,b)) != b,
inference(scs_inference,[],[i_0_12,i_0_5,i_0_7,i_0_8,i_0_4]) ).
cnf(i_0_22,plain,
( response(b,X1) != X2
| response(a,X2) != X1 ),
inference(rename_variables,[],[i_0_4]) ).
cnf(i_0_23,plain,
$false,
inference(scs_inference,[],[i_0_12,i_0_11,i_0_17,i_0_8]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : COL054-1 : TPTP v9.2.1. Released v1.0.0.
% 0.00/0.11 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.14/0.32 % Computer : n018.cluster.edu
% 0.14/0.32 % Model : x86_64 x86_64
% 0.14/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.32 % Memory : 8042.1875MB
% 0.14/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.32 % CPULimit : 300
% 0.14/0.32 % WCLimit : 300
% 0.14/0.32 % DateTime : Mon May 4 16:15:02 EDT 2026
% 0.14/0.32 % CPUTime :
% 0.14/0.33 % start to proof: theBenchmark
% 0.25/1.60 % Version : CSE_E---1.7
% 0.25/1.60 % Problem : theBenchmark.p
% 0.25/1.60 % SZS status Unsatisfiable for theBenchmark.p
% 0.25/1.60 % SZS output start CNFRefutation
% See solution above
% 0.25/1.63 % Total time : 1.272s
%------------------------------------------------------------------------------