%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : COL024-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 : n002.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:04 PM UTC 2026
% Result : Unsatisfiable 1.16s 1.88s
% Output : CNFRefutation 1.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of clauses : 9 ( 9 unt; 0 nHn; 4 RR)
% Number of literals : 9 ( 8 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 : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 13 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(m_definition,axiom,
apply(m,X1) = apply(X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m_definition) ).
cnf(b_definition,axiom,
apply(apply(apply(b,X1),X2),X3) = apply(X1,apply(X2,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_definition) ).
cnf(prove_fixed_point,negated_conjecture,
X1 != apply(combinator,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_fixed_point) ).
cnf(c_0_3,axiom,
apply(m,X1) = apply(X1,X1),
m_definition ).
cnf(c_0_4,axiom,
apply(apply(apply(b,X1),X2),X3) = apply(X1,apply(X2,X3)),
b_definition ).
cnf(c_0_5,negated_conjecture,
X1 != apply(combinator,X1),
prove_fixed_point ).
cnf(c_0_6,plain,
apply(X1,apply(X2,apply(apply(b,X1),X2))) = apply(m,apply(apply(b,X1),X2)),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_7,negated_conjecture,
apply(m,apply(apply(b,combinator),X1)) != apply(X1,apply(apply(b,combinator),X1)),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,negated_conjecture,
$false,
inference(er,[status(thm)],[c_0_7]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.22 % Problem : COL024-1 : TPTP v9.2.1. Released v1.0.0.
% 0.04/0.22 % 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.46 % Computer : n002.cluster.edu
% 0.14/0.46 % Model : x86_64 x86_64
% 0.14/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.46 % Memory : 8042.1875MB
% 0.14/0.46 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.46 % CPULimit : 300
% 0.14/0.46 % WCLimit : 300
% 0.14/0.46 % DateTime : Mon May 4 16:14:31 EDT 2026
% 0.14/0.46 % CPUTime :
% 0.14/0.47 % start to proof: theBenchmark
% 1.16/1.88 % Version : CSE_E---1.7
% 1.16/1.88 % Problem : theBenchmark.p
% 1.16/1.88 % SZS status Unsatisfiable for theBenchmark.p
% 1.16/1.88 % SZS output start CNFRefutation
% See solution above
% 1.16/1.88 % Total time : 1.403s
%------------------------------------------------------------------------------