%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : COL056-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 : n003.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:10 PM UTC 2026
% Result : Unsatisfiable 1.26s 1.71s
% Output : CNFRefutation 1.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of clauses : 11 ( 11 unt; 0 nHn; 9 RR)
% Number of literals : 11 ( 10 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 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 : 14 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_there_exists_a_happy_bird,negated_conjecture,
response(X1,X2) != X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_there_exists_a_happy_bird) ).
cnf(composer_exists,axiom,
response(compose(X1,X2),X3) = response(X1,response(X2,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',composer_exists) ).
cnf(a_to_c_responds_b,hypothesis,
response(a,c) = b,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_to_c_responds_b) ).
cnf(a_to_b_responds_c,hypothesis,
response(a,b) = c,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_to_b_responds_c) ).
cnf(c_0_4,negated_conjecture,
response(X1,X2) != X2,
prove_there_exists_a_happy_bird ).
cnf(c_0_5,axiom,
response(compose(X1,X2),X3) = response(X1,response(X2,X3)),
composer_exists ).
cnf(c_0_6,negated_conjecture,
response(X1,response(X2,X3)) != X3,
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_7,hypothesis,
response(a,c) = b,
a_to_c_responds_b ).
cnf(c_0_8,hypothesis,
response(a,b) = c,
a_to_b_responds_c ).
cnf(c_0_9,hypothesis,
response(X1,b) != c,
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,hypothesis,
$false,
inference(sr,[status(thm)],[c_0_8,c_0_9]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : COL056-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.16/0.33 % Computer : n003.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:14:56 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 1.26/1.71 % Version : CSE_E---1.7
% 1.26/1.71 % Problem : theBenchmark.p
% 1.26/1.71 % SZS status Unsatisfiable for theBenchmark.p
% 1.26/1.71 % SZS output start CNFRefutation
% See solution above
% 1.26/1.71 % Total time : 1.368s
%------------------------------------------------------------------------------