%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : COL003-15 : TPTP v9.2.1. Released v2.1.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:11:59 PM UTC 2026
% Result : Unsatisfiable 1.54s 1.81s
% Output : CNFRefutation 1.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of clauses : 18 ( 18 unt; 0 nHn; 6 RR)
% Number of literals : 18 ( 17 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 23 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(w_definition,axiom,
apply(apply(w,X1),X2) = apply(apply(X1,X2),X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',w_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(strong_fixed_point,axiom,
strong_fixed_point = apply(apply(b,apply(apply(b,apply(w,w)),w)),apply(apply(b,b),b)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',strong_fixed_point) ).
cnf(prove_strong_fixed_point,negated_conjecture,
apply(strong_fixed_point,fixed_pt) != apply(fixed_pt,apply(strong_fixed_point,fixed_pt)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_strong_fixed_point) ).
cnf(c_0_4,axiom,
apply(apply(w,X1),X2) = apply(apply(X1,X2),X2),
w_definition ).
cnf(c_0_5,axiom,
apply(apply(apply(b,X1),X2),X3) = apply(X1,apply(X2,X3)),
b_definition ).
cnf(c_0_6,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_7,axiom,
strong_fixed_point = apply(apply(b,apply(apply(b,apply(w,w)),w)),apply(apply(b,b),b)),
strong_fixed_point ).
cnf(c_0_8,plain,
apply(apply(apply(w,b),X1),X2) = apply(X1,apply(X1,X2)),
inference(spm,[status(thm)],[c_0_5,c_0_4]) ).
cnf(c_0_9,plain,
apply(apply(apply(w,apply(b,apply(b,X1))),X2),X3) = apply(X1,apply(apply(X2,X2),X3)),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_10,plain,
apply(apply(w,w),X1) = apply(apply(X1,X1),X1),
inference(spm,[status(thm)],[c_0_4,c_0_4]) ).
cnf(c_0_11,plain,
apply(apply(b,apply(apply(b,apply(w,w)),w)),apply(apply(w,w),b)) = strong_fixed_point,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_4]),c_0_4]) ).
cnf(c_0_12,plain,
apply(apply(apply(w,w),b),X1) = apply(b,apply(b,X1)),
inference(spm,[status(thm)],[c_0_8,c_0_4]) ).
cnf(c_0_13,plain,
apply(apply(w,apply(w,apply(b,apply(b,X1)))),X2) = apply(X1,apply(apply(w,w),X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_4]) ).
cnf(c_0_14,plain,
apply(apply(w,w),apply(w,apply(b,apply(b,X1)))) = apply(strong_fixed_point,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_11]),c_0_12]),c_0_5]) ).
cnf(c_0_15,negated_conjecture,
apply(strong_fixed_point,fixed_pt) != apply(fixed_pt,apply(strong_fixed_point,fixed_pt)),
prove_strong_fixed_point ).
cnf(c_0_16,plain,
apply(X1,apply(strong_fixed_point,X1)) = apply(strong_fixed_point,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_13]),c_0_14]),c_0_14]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : COL003-15 : TPTP v9.2.1. Released v2.1.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.14/0.32 % Computer : n002.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:14:01 EDT 2026
% 0.14/0.32 % CPUTime :
% 0.14/0.33 % start to proof: theBenchmark
% 1.54/1.81 % Version : CSE_E---1.7
% 1.54/1.81 % Problem : theBenchmark.p
% 1.54/1.81 % SZS status Unsatisfiable for theBenchmark.p
% 1.54/1.81 % SZS output start CNFRefutation
% See solution above
% 1.54/1.81 % Total time : 1.370s
%------------------------------------------------------------------------------