%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : COL044-3 : TPTP v9.2.1. Released v1.2.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 : n013.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:07 PM UTC 2026
% Result : Unsatisfiable 2.22s 2.01s
% Output : CNFRefutation 2.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of clauses : 17 ( 15 unt; 0 nHn; 7 RR)
% Number of literals : 19 ( 14 equ; 6 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 12 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 32 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(n_definition,axiom,
apply(apply(apply(n,X1),X2),X3) = apply(apply(apply(X1,X3),X2),X3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',n_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_strong_fixed_point,negated_conjecture,
~ fixed_point(apply(apply(b,apply(apply(b,apply(apply(n,apply(apply(b,b),apply(apply(n,apply(n,apply(b,b))),n))),n)),b)),b)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_strong_fixed_point) ).
cnf(strong_fixed_point,axiom,
( fixed_point(X1)
| apply(X1,fixed_pt) != apply(fixed_pt,apply(X1,fixed_pt)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',strong_fixed_point) ).
cnf(c_0_4,axiom,
apply(apply(apply(n,X1),X2),X3) = apply(apply(apply(X1,X3),X2),X3),
n_definition ).
cnf(c_0_5,axiom,
apply(apply(apply(b,X1),X2),X3) = apply(X1,apply(X2,X3)),
b_definition ).
cnf(c_0_6,negated_conjecture,
~ fixed_point(apply(apply(b,apply(apply(b,apply(apply(n,apply(apply(b,b),apply(apply(n,apply(n,apply(b,b))),n))),n)),b)),b)),
prove_strong_fixed_point ).
cnf(c_0_7,axiom,
( fixed_point(X1)
| apply(X1,fixed_pt) != apply(fixed_pt,apply(X1,fixed_pt)) ),
strong_fixed_point ).
cnf(c_0_8,plain,
apply(apply(apply(n,apply(apply(b,X1),X2)),X3),X4) = apply(apply(apply(X1,apply(X2,X4)),X3),X4),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_9,plain,
apply(apply(apply(n,apply(b,X1)),X2),X3) = apply(apply(X1,apply(X3,X2)),X3),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_10,negated_conjecture,
apply(fixed_pt,apply(apply(apply(n,apply(apply(b,b),apply(apply(n,apply(n,apply(b,b))),n))),n),apply(b,apply(b,fixed_pt)))) != apply(apply(apply(n,apply(apply(b,b),apply(apply(n,apply(n,apply(b,b))),n))),n),apply(b,apply(b,fixed_pt))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_5]),c_0_5]),c_0_5]),c_0_5]) ).
cnf(c_0_11,plain,
apply(apply(apply(n,apply(apply(b,b),X1)),X2),X3) = apply(apply(X1,X3),apply(X2,X3)),
inference(spm,[status(thm)],[c_0_5,c_0_8]) ).
cnf(c_0_12,plain,
apply(apply(apply(apply(n,apply(b,b)),X1),X2),X3) = apply(apply(X2,X1),apply(X2,X3)),
inference(spm,[status(thm)],[c_0_5,c_0_9]) ).
cnf(c_0_13,negated_conjecture,
apply(fixed_pt,apply(apply(apply(apply(n,apply(n,apply(b,b))),n),apply(b,apply(b,fixed_pt))),apply(n,apply(b,apply(b,fixed_pt))))) != apply(apply(apply(apply(n,apply(n,apply(b,b))),n),apply(b,apply(b,fixed_pt))),apply(n,apply(b,apply(b,fixed_pt)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_11]) ).
cnf(c_0_14,plain,
apply(apply(apply(n,apply(n,apply(b,b))),X1),X2) = apply(apply(X1,X2),apply(X1,X2)),
inference(spm,[status(thm)],[c_0_4,c_0_12]) ).
cnf(c_0_15,plain,
apply(apply(apply(n,apply(b,apply(b,X1))),X2),X3) = apply(X1,apply(apply(X3,X2),X3)),
inference(spm,[status(thm)],[c_0_5,c_0_9]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : COL044-3 : TPTP v9.2.1. Released v1.2.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.16/0.33 % Computer : n013.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:15:11 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 2.22/2.01 % Version : CSE_E---1.7
% 2.22/2.01 % Problem : theBenchmark.p
% 2.22/2.01 % SZS status Unsatisfiable for theBenchmark.p
% 2.22/2.01 % SZS output start CNFRefutation
% See solution above
% 2.22/2.02 % Total time : 1.373s
%------------------------------------------------------------------------------