%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : COL049-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 : n023.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.36s 1.76s
% Output : CNFRefutation 1.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of clauses : 14 ( 14 unt; 0 nHn; 5 RR)
% Number of literals : 14 ( 13 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 9 ( 2 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 : 24 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
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(w_definition,axiom,
apply(apply(w,X1),X2) = apply(apply(X1,X2),X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',w_definition) ).
cnf(prove_strong_fixed_point,negated_conjecture,
apply(X1,f(X1)) != apply(f(X1),apply(X1,f(X1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_strong_fixed_point) ).
cnf(m_definition,axiom,
apply(m,X1) = apply(X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',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,axiom,
apply(apply(w,X1),X2) = apply(apply(X1,X2),X2),
w_definition ).
cnf(c_0_6,negated_conjecture,
apply(X1,f(X1)) != apply(f(X1),apply(X1,f(X1))),
prove_strong_fixed_point ).
cnf(c_0_7,plain,
apply(apply(w,apply(b,X1)),X2) = apply(X1,apply(X2,X2)),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_8,axiom,
apply(m,X1) = apply(X1,X1),
m_definition ).
cnf(c_0_9,negated_conjecture,
apply(f(apply(apply(b,X1),X2)),apply(X1,apply(X2,f(apply(apply(b,X1),X2))))) != apply(X1,apply(X2,f(apply(apply(b,X1),X2)))),
inference(spm,[status(thm)],[c_0_6,c_0_4]) ).
cnf(c_0_10,plain,
apply(apply(w,apply(b,X1)),X2) = apply(X1,apply(m,X2)),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,negated_conjecture,
apply(f(apply(apply(b,X1),apply(apply(b,X2),X3))),apply(X1,apply(X2,apply(X3,f(apply(apply(b,X1),apply(apply(b,X2),X3))))))) != apply(X1,apply(X2,apply(X3,f(apply(apply(b,X1),apply(apply(b,X2),X3)))))),
inference(spm,[status(thm)],[c_0_9,c_0_4]) ).
cnf(c_0_12,plain,
apply(X1,apply(m,apply(w,apply(b,X1)))) = apply(m,apply(w,apply(b,X1))),
inference(spm,[status(thm)],[c_0_8,c_0_10]) ).
cnf(c_0_13,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_11,c_0_12]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : COL049-1 : TPTP v9.2.1. Released v1.0.0.
% 0.00/0.12 % 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.15/0.33 % Computer : n023.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:15:53 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 1.36/1.76 % Version : CSE_E---1.7
% 1.36/1.76 % Problem : theBenchmark.p
% 1.36/1.76 % SZS status Unsatisfiable for theBenchmark.p
% 1.36/1.76 % SZS output start CNFRefutation
% See solution above
% 1.36/1.76 % Total time : 1.369s
%------------------------------------------------------------------------------