%------------------------------------------------------------------------------
% File : Twee---2.7
% Problem : COL060-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n015.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.90s 0.56s
% Output : CNFRefutation 1.94s
% 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(g(X),apply(f(X),h(X))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_q_combinator) ).
cnf(c2,axiom,
apply(apply(apply(b,X2),Y),Z) = apply(X2,apply(Y,Z)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_definition) ).
cnf(c3,plain,
apply(apply(apply(b,apply(t,b)),apply(apply(b,b),t)),f(apply(apply(b,apply(t,b)),apply(apply(b,b),t)))) = apply(apply(t,b),apply(apply(apply(b,b),t),f(apply(apply(b,apply(t,b)),apply(apply(b,b),t))))),
inference(substitution,[status(thm)],[c2]) ).
cnf(c4,plain,
apply(apply(apply(apply(b,apply(t,b)),apply(apply(b,b),t)),f(apply(apply(b,apply(t,b)),apply(apply(b,b),t)))),g(apply(apply(b,apply(t,b)),apply(apply(b,b),t)))) = apply(apply(apply(t,b),apply(apply(apply(b,b),t),f(apply(apply(b,apply(t,b)),apply(apply(b,b),t))))),g(apply(apply(b,apply(t,b)),apply(apply(b,b),t)))),
inference(congruence,[status(thm)],[c3]) ).
cnf(c5,plain,
apply(apply(apply(apply(apply(b,apply(t,b)),apply(apply(b,b),t)),f(apply(apply(b,apply(t,b)),apply(apply(b,b),t)))),g(apply(apply(b,apply(t,b)),apply(apply(b,b),t)))),h(apply(apply(b,apply(t,b)),apply(apply(b,b),t)))) = apply(apply(apply(apply(t,b),apply(apply(apply(b,b),t),f(apply(apply(b,apply(t,b)),apply(apply(b,b),t))))),g(apply(apply(b,apply(t,b)),apply(apply(b,b),t)))),h(apply(apply(b,apply(t,b)),apply(apply(b,b),t)))),
inference(congruence,[status(thm)],[c4]) ).
cnf(c6,axiom,
apply(apply(t,X2),Y2) = apply(Y2,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t_definition) ).
cnf(c7,plain,
apply(apply(t,b),apply(apply(apply(b,b),t),f(apply(apply(b,apply(t,b)),apply(apply(b,b),t))))) = apply(apply(apply(apply(b,b),t),f(apply(apply(b,apply(t,b)),apply(apply(b,b),t)))),b),
inference(substitution,[status(thm)],[c6]) ).
cnf(c8,plain,
apply(apply(apply(t,b),apply(apply(apply(b,b),t),f(apply(apply(b,apply(t,b)),apply(apply(b,b),t))))),g(apply(apply(b,apply(t,b)),apply(apply(b,b),t)))) = apply(apply(apply(apply(apply(b,b),t),f(apply(apply(b,apply(t,b)),apply(apply(b,b),t)))),b),g(apply(apply(b,apply(t,b)),apply(apply(b,b),t)))),
inference(congruence,[status(thm)],[c7]) ).
cnf(c9,plain,
apply(apply(apply(apply(t,b),apply(apply(apply(b,b),t),f(apply(apply(b,apply(t,b)),apply(apply(b,b),t))))),g(apply(apply(b,apply(t,b)),apply(apply(b,b),t)))),h(apply(apply(b,apply(t,b)),apply(apply(b,b),t)))) = apply(apply(apply(apply(apply(apply(b,b),t),f(apply(apply(b,apply(t,b)),apply(apply(b,b),t)))),b),g(apply(apply(b,apply(t,b)),apply(apply(b,b),t)))),h(apply(apply(b,apply(t,b)),apply(apply(b,b),t)))),
inference(congruence,[status(thm)],[c8]) ).
cnf(c10,plain,
apply(apply(apply(b,b),t),f(apply(apply(b,apply(t,b)),apply(apply(b,b),t)))) = apply(b,apply(t,f(apply(apply(b,apply(t,b)),apply(apply(b,b),t))))),
inference(substitution,[status(thm)],[c2]) ).
cnf(c11,plain,
apply(apply(apply(apply(b,b),t),f(apply(apply(b,apply(t,b)),apply(apply(b,b),t)))),b) = apply(apply(b,apply(t,f(apply(apply(b,apply(t,b)),apply(apply(b,b),t))))),b),
inference(congruence,[status(thm)],[c10]) ).
cnf(c12,plain,
apply(apply(apply(apply(apply(b,b),t),f(apply(apply(b,apply(t,b)),apply(apply(b,b),t)))),b),g(apply(apply(b,apply(t,b)),apply(apply(b,b),t)))) = apply(apply(apply(b,apply(t,f(apply(apply(b,apply(t,b)),apply(apply(b,b),t))))),b),g(apply(apply(b,apply(t,b)),apply(apply(b,b),t)))),
inference(congruence,[status(thm)],[c11]) ).
cnf(c13,plain,
apply(apply(apply(apply(apply(apply(b,b),t),f(apply(apply(b,apply(t,b)),apply(apply(b,b),t)))),b),g(apply(apply(b,apply(t,b)),apply(apply(b,b),t)))),h(apply(apply(b,apply(t,b)),apply(apply(b,b),t)))) = apply(apply(apply(apply(b,apply(t,f(apply(apply(b,apply(t,b)),apply(apply(b,b),t))))),b),g(apply(apply(b,apply(t,b)),apply(apply(b,b),t)))),h(apply(apply(b,apply(t,b)),apply(apply(b,b),t)))),
inference(congruence,[status(thm)],[c12]) ).
cnf(c14,plain,
apply(apply(apply(b,apply(t,f(apply(apply(b,apply(t,b)),apply(apply(b,b),t))))),b),g(apply(apply(b,apply(t,b)),apply(apply(b,b),t)))) = apply(apply(t,f(apply(apply(b,apply(t,b)),apply(apply(b,b),t)))),apply(b,g(apply(apply(b,apply(t,b)),apply(apply(b,b),t))))),
inference(substitution,[status(thm)],[c2]) ).
cnf(c15,plain,
apply(apply(apply(apply(b,apply(t,f(apply(apply(b,apply(t,b)),apply(apply(b,b),t))))),b),g(apply(apply(b,apply(t,b)),apply(apply(b,b),t)))),h(apply(apply(b,apply(t,b)),apply(apply(b,b),t)))) = apply(apply(apply(t,f(apply(apply(b,apply(t,b)),apply(apply(b,b),t)))),apply(b,g(apply(apply(b,apply(t,b)),apply(apply(b,b),t))))),h(apply(apply(b,apply(t,b)),apply(apply(b,b),t)))),
inference(congruence,[status(thm)],[c14]) ).
cnf(c16,plain,
apply(apply(t,f(apply(apply(b,apply(t,b)),apply(apply(b,b),t)))),apply(b,g(apply(apply(b,apply(t,b)),apply(apply(b,b),t))))) = apply(apply(b,g(apply(apply(b,apply(t,b)),apply(apply(b,b),t)))),f(apply(apply(b,apply(t,b)),apply(apply(b,b),t)))),
inference(substitution,[status(thm)],[c6]) ).
cnf(c17,plain,
apply(apply(apply(t,f(apply(apply(b,apply(t,b)),apply(apply(b,b),t)))),apply(b,g(apply(apply(b,apply(t,b)),apply(apply(b,b),t))))),h(apply(apply(b,apply(t,b)),apply(apply(b,b),t)))) = apply(apply(apply(b,g(apply(apply(b,apply(t,b)),apply(apply(b,b),t)))),f(apply(apply(b,apply(t,b)),apply(apply(b,b),t)))),h(apply(apply(b,apply(t,b)),apply(apply(b,b),t)))),
inference(congruence,[status(thm)],[c16]) ).
cnf(c18,plain,
apply(apply(apply(b,g(apply(apply(b,apply(t,b)),apply(apply(b,b),t)))),f(apply(apply(b,apply(t,b)),apply(apply(b,b),t)))),h(apply(apply(b,apply(t,b)),apply(apply(b,b),t)))) = apply(g(apply(apply(b,apply(t,b)),apply(apply(b,b),t))),apply(f(apply(apply(b,apply(t,b)),apply(apply(b,b),t))),h(apply(apply(b,apply(t,b)),apply(apply(b,b),t))))),
inference(substitution,[status(thm)],[c2]) ).
cnf(c19,plain,
apply(apply(apply(t,f(apply(apply(b,apply(t,b)),apply(apply(b,b),t)))),apply(b,g(apply(apply(b,apply(t,b)),apply(apply(b,b),t))))),h(apply(apply(b,apply(t,b)),apply(apply(b,b),t)))) = apply(g(apply(apply(b,apply(t,b)),apply(apply(b,b),t))),apply(f(apply(apply(b,apply(t,b)),apply(apply(b,b),t))),h(apply(apply(b,apply(t,b)),apply(apply(b,b),t))))),
inference(transitivity,[status(thm)],[c17,c18]) ).
cnf(c20,plain,
apply(apply(apply(apply(b,apply(t,f(apply(apply(b,apply(t,b)),apply(apply(b,b),t))))),b),g(apply(apply(b,apply(t,b)),apply(apply(b,b),t)))),h(apply(apply(b,apply(t,b)),apply(apply(b,b),t)))) = apply(g(apply(apply(b,apply(t,b)),apply(apply(b,b),t))),apply(f(apply(apply(b,apply(t,b)),apply(apply(b,b),t))),h(apply(apply(b,apply(t,b)),apply(apply(b,b),t))))),
inference(transitivity,[status(thm)],[c15,c19]) ).
cnf(c21,plain,
apply(apply(apply(apply(apply(apply(b,b),t),f(apply(apply(b,apply(t,b)),apply(apply(b,b),t)))),b),g(apply(apply(b,apply(t,b)),apply(apply(b,b),t)))),h(apply(apply(b,apply(t,b)),apply(apply(b,b),t)))) = apply(g(apply(apply(b,apply(t,b)),apply(apply(b,b),t))),apply(f(apply(apply(b,apply(t,b)),apply(apply(b,b),t))),h(apply(apply(b,apply(t,b)),apply(apply(b,b),t))))),
inference(transitivity,[status(thm)],[c13,c20]) ).
cnf(c22,plain,
apply(apply(apply(apply(t,b),apply(apply(apply(b,b),t),f(apply(apply(b,apply(t,b)),apply(apply(b,b),t))))),g(apply(apply(b,apply(t,b)),apply(apply(b,b),t)))),h(apply(apply(b,apply(t,b)),apply(apply(b,b),t)))) = apply(g(apply(apply(b,apply(t,b)),apply(apply(b,b),t))),apply(f(apply(apply(b,apply(t,b)),apply(apply(b,b),t))),h(apply(apply(b,apply(t,b)),apply(apply(b,b),t))))),
inference(transitivity,[status(thm)],[c9,c21]) ).
cnf(c23,plain,
apply(apply(apply(apply(apply(b,apply(t,b)),apply(apply(b,b),t)),f(apply(apply(b,apply(t,b)),apply(apply(b,b),t)))),g(apply(apply(b,apply(t,b)),apply(apply(b,b),t)))),h(apply(apply(b,apply(t,b)),apply(apply(b,b),t)))) = apply(g(apply(apply(b,apply(t,b)),apply(apply(b,b),t))),apply(f(apply(apply(b,apply(t,b)),apply(apply(b,b),t))),h(apply(apply(b,apply(t,b)),apply(apply(b,b),t))))),
inference(transitivity,[status(thm)],[c5,c22]) ).
cnf(c24,plain,
$false,
inference(resolution,[status(thm)],[c1,c23]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COL060-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.22 % Computer : n015.cluster.edu
% 0.08/0.22 % Model : x86_64 x86_64
% 0.08/0.22 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.22 % Memory : 8046.5625MB
% 0.08/0.22 % OS : Linux 6.8.0-71-generic
% 0.08/0.22 % CPULimit : 300
% 0.08/0.22 % WCLimit : 300
% 0.08/0.22 % DateTime : Mon Sep 28 21:34:46 UTC 2026
% 0.08/0.22 % CPUTime :
% 0.08/0.22 Running run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.90/0.56 Command-line arguments: --flatten --complete-subsets
% 0.90/0.56
% 0.90/0.56 % SZS status Unsatisfiable
% 0.90/0.56
% 1.94/0.57 % SZS output start CNFRefutation
% See solution above
% 1.94/0.60
% 1.94/0.60 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------