%------------------------------------------------------------------------------
% File : Twee---2.7
% Problem : COL061-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n019.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:19 AM UTC 2026
% Result : Unsatisfiable 0.57s 0.32s
% Output : CNFRefutation 0.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of clauses : 24 ( 24 unt; 0 nHn; 22 RR)
% Number of literals : 24 ( 23 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 : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 6 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c1,negated_conjecture,
apply(apply(apply(X,f(X)),g(X)),h(X)) != apply(f(X),apply(h(X),g(X))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_q1_combinator) ).
cnf(c2,axiom,
apply(apply(apply(b,X2),Y),Z) = apply(X2,apply(Y,Z)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_definition) ).
cnf(c3,plain,
apply(apply(apply(b,apply(t,t)),apply(apply(b,b),b)),f(apply(apply(b,apply(t,t)),apply(apply(b,b),b)))) = apply(apply(t,t),apply(apply(apply(b,b),b),f(apply(apply(b,apply(t,t)),apply(apply(b,b),b))))),
inference(substitution,[status(thm)],[c2]) ).
cnf(c4,plain,
apply(apply(apply(apply(b,apply(t,t)),apply(apply(b,b),b)),f(apply(apply(b,apply(t,t)),apply(apply(b,b),b)))),g(apply(apply(b,apply(t,t)),apply(apply(b,b),b)))) = apply(apply(apply(t,t),apply(apply(apply(b,b),b),f(apply(apply(b,apply(t,t)),apply(apply(b,b),b))))),g(apply(apply(b,apply(t,t)),apply(apply(b,b),b)))),
inference(congruence,[status(thm)],[c3]) ).
cnf(c5,plain,
apply(apply(apply(apply(apply(b,apply(t,t)),apply(apply(b,b),b)),f(apply(apply(b,apply(t,t)),apply(apply(b,b),b)))),g(apply(apply(b,apply(t,t)),apply(apply(b,b),b)))),h(apply(apply(b,apply(t,t)),apply(apply(b,b),b)))) = apply(apply(apply(apply(t,t),apply(apply(apply(b,b),b),f(apply(apply(b,apply(t,t)),apply(apply(b,b),b))))),g(apply(apply(b,apply(t,t)),apply(apply(b,b),b)))),h(apply(apply(b,apply(t,t)),apply(apply(b,b),b)))),
inference(congruence,[status(thm)],[c4]) ).
cnf(c6,axiom,
apply(apply(t,X2),Y2) = apply(Y2,X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t_definition) ).
cnf(c7,plain,
apply(apply(t,t),apply(apply(apply(b,b),b),f(apply(apply(b,apply(t,t)),apply(apply(b,b),b))))) = apply(apply(apply(apply(b,b),b),f(apply(apply(b,apply(t,t)),apply(apply(b,b),b)))),t),
inference(substitution,[status(thm)],[c6]) ).
cnf(c8,plain,
apply(apply(apply(t,t),apply(apply(apply(b,b),b),f(apply(apply(b,apply(t,t)),apply(apply(b,b),b))))),g(apply(apply(b,apply(t,t)),apply(apply(b,b),b)))) = apply(apply(apply(apply(apply(b,b),b),f(apply(apply(b,apply(t,t)),apply(apply(b,b),b)))),t),g(apply(apply(b,apply(t,t)),apply(apply(b,b),b)))),
inference(congruence,[status(thm)],[c7]) ).
cnf(c9,plain,
apply(apply(apply(apply(t,t),apply(apply(apply(b,b),b),f(apply(apply(b,apply(t,t)),apply(apply(b,b),b))))),g(apply(apply(b,apply(t,t)),apply(apply(b,b),b)))),h(apply(apply(b,apply(t,t)),apply(apply(b,b),b)))) = apply(apply(apply(apply(apply(apply(b,b),b),f(apply(apply(b,apply(t,t)),apply(apply(b,b),b)))),t),g(apply(apply(b,apply(t,t)),apply(apply(b,b),b)))),h(apply(apply(b,apply(t,t)),apply(apply(b,b),b)))),
inference(congruence,[status(thm)],[c8]) ).
cnf(c10,plain,
apply(apply(apply(b,b),b),f(apply(apply(b,apply(t,t)),apply(apply(b,b),b)))) = apply(b,apply(b,f(apply(apply(b,apply(t,t)),apply(apply(b,b),b))))),
inference(substitution,[status(thm)],[c2]) ).
cnf(c11,plain,
apply(apply(apply(apply(b,b),b),f(apply(apply(b,apply(t,t)),apply(apply(b,b),b)))),t) = apply(apply(b,apply(b,f(apply(apply(b,apply(t,t)),apply(apply(b,b),b))))),t),
inference(congruence,[status(thm)],[c10]) ).
cnf(c12,plain,
apply(apply(apply(apply(apply(b,b),b),f(apply(apply(b,apply(t,t)),apply(apply(b,b),b)))),t),g(apply(apply(b,apply(t,t)),apply(apply(b,b),b)))) = apply(apply(apply(b,apply(b,f(apply(apply(b,apply(t,t)),apply(apply(b,b),b))))),t),g(apply(apply(b,apply(t,t)),apply(apply(b,b),b)))),
inference(congruence,[status(thm)],[c11]) ).
cnf(c13,plain,
apply(apply(apply(apply(apply(apply(b,b),b),f(apply(apply(b,apply(t,t)),apply(apply(b,b),b)))),t),g(apply(apply(b,apply(t,t)),apply(apply(b,b),b)))),h(apply(apply(b,apply(t,t)),apply(apply(b,b),b)))) = apply(apply(apply(apply(b,apply(b,f(apply(apply(b,apply(t,t)),apply(apply(b,b),b))))),t),g(apply(apply(b,apply(t,t)),apply(apply(b,b),b)))),h(apply(apply(b,apply(t,t)),apply(apply(b,b),b)))),
inference(congruence,[status(thm)],[c12]) ).
cnf(c14,plain,
apply(apply(apply(b,apply(b,f(apply(apply(b,apply(t,t)),apply(apply(b,b),b))))),t),g(apply(apply(b,apply(t,t)),apply(apply(b,b),b)))) = apply(apply(b,f(apply(apply(b,apply(t,t)),apply(apply(b,b),b)))),apply(t,g(apply(apply(b,apply(t,t)),apply(apply(b,b),b))))),
inference(substitution,[status(thm)],[c2]) ).
cnf(c15,plain,
apply(apply(apply(apply(b,apply(b,f(apply(apply(b,apply(t,t)),apply(apply(b,b),b))))),t),g(apply(apply(b,apply(t,t)),apply(apply(b,b),b)))),h(apply(apply(b,apply(t,t)),apply(apply(b,b),b)))) = apply(apply(apply(b,f(apply(apply(b,apply(t,t)),apply(apply(b,b),b)))),apply(t,g(apply(apply(b,apply(t,t)),apply(apply(b,b),b))))),h(apply(apply(b,apply(t,t)),apply(apply(b,b),b)))),
inference(congruence,[status(thm)],[c14]) ).
cnf(c16,plain,
apply(apply(apply(b,f(apply(apply(b,apply(t,t)),apply(apply(b,b),b)))),apply(t,g(apply(apply(b,apply(t,t)),apply(apply(b,b),b))))),h(apply(apply(b,apply(t,t)),apply(apply(b,b),b)))) = apply(f(apply(apply(b,apply(t,t)),apply(apply(b,b),b))),apply(apply(t,g(apply(apply(b,apply(t,t)),apply(apply(b,b),b)))),h(apply(apply(b,apply(t,t)),apply(apply(b,b),b))))),
inference(substitution,[status(thm)],[c2]) ).
cnf(c17,plain,
apply(apply(t,g(apply(apply(b,apply(t,t)),apply(apply(b,b),b)))),h(apply(apply(b,apply(t,t)),apply(apply(b,b),b)))) = apply(h(apply(apply(b,apply(t,t)),apply(apply(b,b),b))),g(apply(apply(b,apply(t,t)),apply(apply(b,b),b)))),
inference(substitution,[status(thm)],[c6]) ).
cnf(c18,plain,
apply(f(apply(apply(b,apply(t,t)),apply(apply(b,b),b))),apply(apply(t,g(apply(apply(b,apply(t,t)),apply(apply(b,b),b)))),h(apply(apply(b,apply(t,t)),apply(apply(b,b),b))))) = apply(f(apply(apply(b,apply(t,t)),apply(apply(b,b),b))),apply(h(apply(apply(b,apply(t,t)),apply(apply(b,b),b))),g(apply(apply(b,apply(t,t)),apply(apply(b,b),b))))),
inference(congruence,[status(thm)],[c17]) ).
cnf(c19,plain,
apply(apply(apply(b,f(apply(apply(b,apply(t,t)),apply(apply(b,b),b)))),apply(t,g(apply(apply(b,apply(t,t)),apply(apply(b,b),b))))),h(apply(apply(b,apply(t,t)),apply(apply(b,b),b)))) = apply(f(apply(apply(b,apply(t,t)),apply(apply(b,b),b))),apply(h(apply(apply(b,apply(t,t)),apply(apply(b,b),b))),g(apply(apply(b,apply(t,t)),apply(apply(b,b),b))))),
inference(transitivity,[status(thm)],[c16,c18]) ).
cnf(c20,plain,
apply(apply(apply(apply(b,apply(b,f(apply(apply(b,apply(t,t)),apply(apply(b,b),b))))),t),g(apply(apply(b,apply(t,t)),apply(apply(b,b),b)))),h(apply(apply(b,apply(t,t)),apply(apply(b,b),b)))) = apply(f(apply(apply(b,apply(t,t)),apply(apply(b,b),b))),apply(h(apply(apply(b,apply(t,t)),apply(apply(b,b),b))),g(apply(apply(b,apply(t,t)),apply(apply(b,b),b))))),
inference(transitivity,[status(thm)],[c15,c19]) ).
cnf(c21,plain,
apply(apply(apply(apply(apply(apply(b,b),b),f(apply(apply(b,apply(t,t)),apply(apply(b,b),b)))),t),g(apply(apply(b,apply(t,t)),apply(apply(b,b),b)))),h(apply(apply(b,apply(t,t)),apply(apply(b,b),b)))) = apply(f(apply(apply(b,apply(t,t)),apply(apply(b,b),b))),apply(h(apply(apply(b,apply(t,t)),apply(apply(b,b),b))),g(apply(apply(b,apply(t,t)),apply(apply(b,b),b))))),
inference(transitivity,[status(thm)],[c13,c20]) ).
cnf(c22,plain,
apply(apply(apply(apply(t,t),apply(apply(apply(b,b),b),f(apply(apply(b,apply(t,t)),apply(apply(b,b),b))))),g(apply(apply(b,apply(t,t)),apply(apply(b,b),b)))),h(apply(apply(b,apply(t,t)),apply(apply(b,b),b)))) = apply(f(apply(apply(b,apply(t,t)),apply(apply(b,b),b))),apply(h(apply(apply(b,apply(t,t)),apply(apply(b,b),b))),g(apply(apply(b,apply(t,t)),apply(apply(b,b),b))))),
inference(transitivity,[status(thm)],[c9,c21]) ).
cnf(c23,plain,
apply(apply(apply(apply(apply(b,apply(t,t)),apply(apply(b,b),b)),f(apply(apply(b,apply(t,t)),apply(apply(b,b),b)))),g(apply(apply(b,apply(t,t)),apply(apply(b,b),b)))),h(apply(apply(b,apply(t,t)),apply(apply(b,b),b)))) = apply(f(apply(apply(b,apply(t,t)),apply(apply(b,b),b))),apply(h(apply(apply(b,apply(t,t)),apply(apply(b,b),b))),g(apply(apply(b,apply(t,t)),apply(apply(b,b),b))))),
inference(transitivity,[status(thm)],[c5,c22]) ).
cnf(c24,plain,
$false,
inference(resolution,[status(thm)],[c1,c23]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : COL061-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03 % Command : run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.16 % Computer : n019.cluster.edu
% 0.09/0.16 % Model : x86_64 x86_64
% 0.09/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.16 % Memory : 8046.5625MB
% 0.09/0.16 % OS : Linux 6.8.0-71-generic
% 0.09/0.16 % CPULimit : 300
% 0.09/0.16 % WCLimit : 300
% 0.09/0.16 % DateTime : Mon Sep 28 21:32:29 UTC 2026
% 0.09/0.16 % CPUTime :
% 0.09/0.16 Running run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.57/0.32 Command-line arguments: --lhs-weight 9 --flip-ordering --complete-subsets --normalise-queue-percent 10 --cp-renormalise-threshold 10
% 0.57/0.32
% 0.57/0.32 % SZS status Unsatisfiable
% 0.57/0.32
% 0.57/0.33 % SZS output start CNFRefutation
% See solution above
% 0.57/0.34
% 0.57/0.34 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------