%------------------------------------------------------------------------------
% File : Twee---2.7
% Problem : COL044-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n016.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 09:37:15 AM UTC 2026
% Result : Unsatisfiable 0.08s 0.25s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of clauses : 18 ( 18 unt; 0 nHn; 2 RR)
% Number of literals : 18 ( 17 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 10 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 38 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c1,negated_conjecture,
apply(Y,f(Y)) != apply(f(Y),apply(Y,f(Y))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_fixed_point) ).
cnf(c2,axiom,
apply(apply(apply(n,X),Y2),Z) = apply(apply(apply(X,Z),Y2),Z),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',n_definition) ).
cnf(c3,plain,
apply(apply(apply(n,apply(b,X4)),X3),X2) = apply(apply(apply(apply(b,X4),X2),X3),X2),
inference(substitution,[status(thm)],[c2]) ).
cnf(c4,axiom,
apply(apply(apply(b,X2),Y2),Z2) = apply(X2,apply(Y2,Z2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_definition) ).
cnf(c5,plain,
apply(apply(apply(b,X4),X2),X3) = apply(X4,apply(X2,X3)),
inference(substitution,[status(thm)],[c4]) ).
cnf(c6,plain,
apply(apply(apply(apply(b,X4),X2),X3),X2) = apply(apply(X4,apply(X2,X3)),X2),
inference(congruence,[status(thm)],[c5]) ).
cnf(c7,plain,
apply(apply(apply(n,apply(b,X4)),X3),X2) = apply(apply(X4,apply(X2,X3)),X2),
inference(transitivity,[status(thm)],[c3,c6]) ).
cnf(c8,plain,
apply(apply(apply(n,apply(b,apply(b,X4))),X2),X3) = apply(apply(apply(b,X4),apply(X3,X2)),X3),
inference(substitution,[status(thm)],[c7]) ).
cnf(c9,plain,
apply(apply(apply(b,X4),apply(X3,X2)),X3) = apply(X4,apply(apply(X3,X2),X3)),
inference(substitution,[status(thm)],[c4]) ).
cnf(c10,plain,
apply(apply(apply(n,apply(b,apply(b,X4))),X2),X3) = apply(X4,apply(apply(X3,X2),X3)),
inference(transitivity,[status(thm)],[c8,c9]) ).
cnf(c11,plain,
apply(apply(apply(n,apply(b,apply(b,apply(n,b)))),X2),apply(n,apply(b,apply(b,apply(n,b))))) = apply(apply(n,b),apply(apply(apply(n,apply(b,apply(b,apply(n,b)))),X2),apply(n,apply(b,apply(b,apply(n,b)))))),
inference(substitution,[status(thm)],[c10]) ).
cnf(c12,plain,
apply(apply(apply(apply(n,apply(b,apply(b,apply(n,b)))),X2),apply(n,apply(b,apply(b,apply(n,b))))),f(apply(apply(apply(n,apply(b,apply(b,apply(n,b)))),X2),apply(n,apply(b,apply(b,apply(n,b))))))) = apply(apply(apply(n,b),apply(apply(apply(n,apply(b,apply(b,apply(n,b)))),X2),apply(n,apply(b,apply(b,apply(n,b)))))),f(apply(apply(apply(n,apply(b,apply(b,apply(n,b)))),X2),apply(n,apply(b,apply(b,apply(n,b))))))),
inference(congruence,[status(thm)],[c11]) ).
cnf(c13,plain,
apply(apply(apply(n,b),X2),X3) = apply(apply(apply(b,X3),X2),X3),
inference(substitution,[status(thm)],[c2]) ).
cnf(c14,plain,
apply(apply(apply(b,X3),X2),X3) = apply(X3,apply(X2,X3)),
inference(substitution,[status(thm)],[c4]) ).
cnf(c15,plain,
apply(apply(apply(n,b),X2),X3) = apply(X3,apply(X2,X3)),
inference(transitivity,[status(thm)],[c13,c14]) ).
cnf(c16,plain,
apply(apply(apply(n,b),apply(apply(apply(n,apply(b,apply(b,apply(n,b)))),X2),apply(n,apply(b,apply(b,apply(n,b)))))),f(apply(apply(apply(n,apply(b,apply(b,apply(n,b)))),X2),apply(n,apply(b,apply(b,apply(n,b))))))) = apply(f(apply(apply(apply(n,apply(b,apply(b,apply(n,b)))),X2),apply(n,apply(b,apply(b,apply(n,b)))))),apply(apply(apply(apply(n,apply(b,apply(b,apply(n,b)))),X2),apply(n,apply(b,apply(b,apply(n,b))))),f(apply(apply(apply(n,apply(b,apply(b,apply(n,b)))),X2),apply(n,apply(b,apply(b,apply(n,b)))))))),
inference(substitution,[status(thm)],[c15]) ).
cnf(c17,plain,
apply(apply(apply(apply(n,apply(b,apply(b,apply(n,b)))),X2),apply(n,apply(b,apply(b,apply(n,b))))),f(apply(apply(apply(n,apply(b,apply(b,apply(n,b)))),X2),apply(n,apply(b,apply(b,apply(n,b))))))) = apply(f(apply(apply(apply(n,apply(b,apply(b,apply(n,b)))),X2),apply(n,apply(b,apply(b,apply(n,b)))))),apply(apply(apply(apply(n,apply(b,apply(b,apply(n,b)))),X2),apply(n,apply(b,apply(b,apply(n,b))))),f(apply(apply(apply(n,apply(b,apply(b,apply(n,b)))),X2),apply(n,apply(b,apply(b,apply(n,b)))))))),
inference(transitivity,[status(thm)],[c12,c16]) ).
cnf(c18,plain,
$false,
inference(resolution,[status(thm)],[c1,c17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COL044-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.17 % Computer : n016.cluster.edu
% 0.08/0.17 % Model : x86_64 x86_64
% 0.08/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.17 % Memory : 8046.5625MB
% 0.08/0.17 % OS : Linux 6.8.0-71-generic
% 0.08/0.17 % CPULimit : 300
% 0.08/0.17 % WCLimit : 300
% 0.08/0.17 % DateTime : Mon Sep 28 21:35:33 UTC 2026
% 0.08/0.17 % CPUTime :
% 0.08/0.17 Running run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.25 Command-line arguments: --lhs-weight 1 --flip-ordering --normalise-queue-percent 10 --cp-renormalise-threshold 10 --complete-subsets --ground-joining-incomplete-limit 15 --flatten-every 2
% 0.08/0.25
% 0.08/0.25 % SZS status Unsatisfiable
% 0.08/0.25
% 0.08/0.25 % SZS output start CNFRefutation
% See solution above
% 0.19/0.26
% 0.19/0.26 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------