↑ Up

Twee---2.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Twee---2.7
% Problem  : COL006-6 : TPTP v9.3.1. Released v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_twee /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n020.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:09 AM UTC 2026

% Result   : Unsatisfiable 0.10s 0.26s
% Output   : CNFRefutation 0.51s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   20
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   54 (  54 unt;   0 nHn;   6 RR)
%            Number of literals    :   54 (  53 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    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :  116 (  19 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(c1,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(c2,axiom,
    strong_fixed_point = apply(apply(s,apply(k,apply(apply(s,apply(apply(s,k),k)),apply(apply(s,k),k)))),apply(apply(s,apply(apply(s,apply(k,s)),k)),apply(k,apply(apply(s,apply(apply(s,k),k)),apply(apply(s,k),k))))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',step) ).

cnf(c3,plain,
    apply(strong_fixed_point,X2) = apply(apply(apply(s,apply(k,apply(apply(s,apply(apply(s,k),k)),apply(apply(s,k),k)))),apply(apply(s,apply(apply(s,apply(k,s)),k)),apply(k,apply(apply(s,apply(apply(s,k),k)),apply(apply(s,k),k))))),X2),
    inference(congruence,[status(thm)],[c2]) ).

cnf(c4,plain,
    apply(X2,apply(strong_fixed_point,X2)) = apply(X2,apply(apply(apply(s,apply(k,apply(apply(s,apply(apply(s,k),k)),apply(apply(s,k),k)))),apply(apply(s,apply(apply(s,apply(k,s)),k)),apply(k,apply(apply(s,apply(apply(s,k),k)),apply(apply(s,k),k))))),X2)),
    inference(congruence,[status(thm)],[c3]) ).

cnf(c5,axiom,
    apply(apply(apply(s,X),Y),Z) = apply(apply(X,Z),apply(Y,Z)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',s_definition) ).

cnf(c6,plain,
    apply(apply(apply(s,apply(k,X2)),X4),X3) = apply(apply(apply(k,X2),X3),apply(X4,X3)),
    inference(substitution,[status(thm)],[c5]) ).

cnf(c7,axiom,
    apply(apply(k,X2),Y2) = X2,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',k_definition) ).

cnf(c8,plain,
    apply(apply(k,X3),X2) = X3,
    inference(substitution,[status(thm)],[c7]) ).

cnf(c9,plain,
    apply(apply(apply(k,X4),X2),apply(X3,X2)) = apply(X4,apply(X3,X2)),
    inference(congruence,[status(thm)],[c8]) ).

cnf(c10,plain,
    apply(apply(apply(s,apply(k,X4)),X3),X2) = apply(X4,apply(X3,X2)),
    inference(transitivity,[status(thm)],[c6,c9]) ).

cnf(c11,plain,
    apply(apply(apply(s,apply(k,apply(apply(s,apply(apply(s,k),X2)),apply(apply(s,k),X5)))),apply(apply(s,apply(apply(s,apply(k,s)),k)),apply(k,X3))),X4) = apply(apply(apply(s,apply(apply(s,k),X2)),apply(apply(s,k),X5)),apply(apply(apply(s,apply(apply(s,apply(k,s)),k)),apply(k,X3)),X4)),
    inference(substitution,[status(thm)],[c10]) ).

cnf(c12,plain,
    apply(apply(apply(s,apply(apply(s,k),X4)),X3),X2) = apply(apply(apply(apply(s,k),X4),X2),apply(X3,X2)),
    inference(substitution,[status(thm)],[c5]) ).

cnf(c13,plain,
    apply(apply(apply(s,k),X3),X2) = apply(apply(k,X2),apply(X3,X2)),
    inference(substitution,[status(thm)],[c5]) ).

cnf(c14,plain,
    apply(apply(k,X2),apply(X3,X2)) = X2,
    inference(substitution,[status(thm)],[c7]) ).

cnf(c15,plain,
    apply(apply(apply(s,k),X3),X2) = X2,
    inference(transitivity,[status(thm)],[c13,c14]) ).

cnf(c16,plain,
    apply(apply(apply(apply(s,k),X4),X2),apply(X3,X2)) = apply(X2,apply(X3,X2)),
    inference(congruence,[status(thm)],[c15]) ).

cnf(c17,plain,
    apply(apply(apply(s,apply(apply(s,k),X4)),X3),X2) = apply(X2,apply(X3,X2)),
    inference(transitivity,[status(thm)],[c12,c16]) ).

cnf(c18,plain,
    apply(apply(apply(s,apply(apply(s,k),X3)),apply(apply(s,k),X2)),X4) = apply(X4,apply(apply(apply(s,k),X2),X4)),
    inference(substitution,[status(thm)],[c17]) ).

cnf(c19,plain,
    apply(apply(apply(s,k),X2),X3) = X3,
    inference(substitution,[status(thm)],[c15]) ).

cnf(c20,plain,
    apply(X3,apply(apply(apply(s,k),X2),X3)) = apply(X3,X3),
    inference(congruence,[status(thm)],[c19]) ).

cnf(c21,plain,
    apply(apply(apply(s,apply(apply(s,k),X3)),apply(apply(s,k),X2)),X4) = apply(X4,X4),
    inference(transitivity,[status(thm)],[c18,c20]) ).

cnf(c22,plain,
    apply(apply(apply(s,apply(apply(s,k),X3)),apply(apply(s,k),X2)),apply(apply(apply(s,apply(apply(s,apply(k,s)),k)),apply(k,X4)),X5)) = apply(apply(apply(apply(s,apply(apply(s,apply(k,s)),k)),apply(k,X4)),X5),apply(apply(apply(s,apply(apply(s,apply(k,s)),k)),apply(k,X4)),X5)),
    inference(substitution,[status(thm)],[c21]) ).

cnf(c23,plain,
    apply(apply(apply(s,X4),apply(k,X2)),X3) = apply(apply(X4,X3),apply(apply(k,X2),X3)),
    inference(substitution,[status(thm)],[c5]) ).

cnf(c24,plain,
    apply(apply(k,X2),X3) = X2,
    inference(substitution,[status(thm)],[c7]) ).

cnf(c25,plain,
    apply(apply(X4,X3),apply(apply(k,X2),X3)) = apply(apply(X4,X3),X2),
    inference(congruence,[status(thm)],[c24]) ).

cnf(c26,plain,
    apply(apply(apply(s,X4),apply(k,X2)),X3) = apply(apply(X4,X3),X2),
    inference(transitivity,[status(thm)],[c23,c25]) ).

cnf(c27,plain,
    apply(apply(apply(s,apply(apply(s,apply(k,s)),k)),apply(k,X3)),X2) = apply(apply(apply(apply(s,apply(k,s)),k),X2),X3),
    inference(substitution,[status(thm)],[c26]) ).

cnf(c28,plain,
    apply(apply(apply(apply(s,apply(apply(s,apply(k,s)),k)),apply(k,X4)),X3),X2) = apply(apply(apply(apply(apply(s,apply(k,s)),k),X3),X4),X2),
    inference(congruence,[status(thm)],[c27]) ).

cnf(c29,plain,
    apply(apply(apply(s,apply(k,s)),k),X2) = apply(s,apply(k,X2)),
    inference(substitution,[status(thm)],[c10]) ).

cnf(c30,plain,
    apply(apply(apply(apply(s,apply(k,s)),k),X3),X2) = apply(apply(s,apply(k,X3)),X2),
    inference(congruence,[status(thm)],[c29]) ).

cnf(c31,plain,
    apply(apply(apply(apply(apply(s,apply(k,s)),k),X4),X3),X2) = apply(apply(apply(s,apply(k,X4)),X3),X2),
    inference(congruence,[status(thm)],[c30]) ).

cnf(c32,plain,
    apply(apply(apply(s,apply(k,X4)),X3),X2) = apply(apply(apply(k,X4),X2),apply(X3,X2)),
    inference(substitution,[status(thm)],[c5]) ).

cnf(c33,plain,
    apply(apply(k,X3),X2) = X3,
    inference(substitution,[status(thm)],[c7]) ).

cnf(c34,plain,
    apply(apply(apply(k,X4),X2),apply(X3,X2)) = apply(X4,apply(X3,X2)),
    inference(congruence,[status(thm)],[c33]) ).

cnf(c35,plain,
    apply(apply(apply(s,apply(k,X4)),X3),X2) = apply(X4,apply(X3,X2)),
    inference(transitivity,[status(thm)],[c32,c34]) ).

cnf(c36,plain,
    apply(apply(apply(apply(apply(s,apply(k,s)),k),X4),X3),X2) = apply(X4,apply(X3,X2)),
    inference(transitivity,[status(thm)],[c31,c35]) ).

cnf(c37,plain,
    apply(apply(apply(apply(apply(s,apply(k,s)),k),X3),X4),X2) = apply(X3,apply(X4,X2)),
    inference(substitution,[status(thm)],[c36]) ).

cnf(c38,plain,
    apply(apply(apply(apply(s,apply(apply(s,apply(k,s)),k)),apply(k,X4)),X3),X2) = apply(X3,apply(X4,X2)),
    inference(transitivity,[status(thm)],[c28,c37]) ).

cnf(c39,plain,
    apply(apply(apply(apply(s,apply(apply(s,apply(k,s)),k)),apply(k,X2)),X3),apply(apply(apply(s,apply(apply(s,apply(k,s)),k)),apply(k,X2)),X3)) = apply(X3,apply(X2,apply(apply(apply(s,apply(apply(s,apply(k,s)),k)),apply(k,X2)),X3))),
    inference(substitution,[status(thm)],[c38]) ).

cnf(c40,plain,
    apply(apply(apply(s,apply(k,X2)),apply(apply(s,apply(apply(s,apply(k,s)),k)),apply(k,X2))),X3) = apply(X2,apply(apply(apply(s,apply(apply(s,apply(k,s)),k)),apply(k,X2)),X3)),
    inference(substitution,[status(thm)],[c10]) ).

cnf(c41,plain,
    apply(X2,apply(apply(apply(s,apply(apply(s,apply(k,s)),k)),apply(k,X2)),X3)) = apply(apply(apply(s,apply(k,X2)),apply(apply(s,apply(apply(s,apply(k,s)),k)),apply(k,X2))),X3),
    inference(symmetry,[status(thm)],[c40]) ).

cnf(c42,plain,
    apply(X3,apply(X2,apply(apply(apply(s,apply(apply(s,apply(k,s)),k)),apply(k,X2)),X3))) = apply(X3,apply(apply(apply(s,apply(k,X2)),apply(apply(s,apply(apply(s,apply(k,s)),k)),apply(k,X2))),X3)),
    inference(congruence,[status(thm)],[c41]) ).

cnf(c43,plain,
    apply(apply(apply(apply(s,apply(apply(s,apply(k,s)),k)),apply(k,X2)),X3),apply(apply(apply(s,apply(apply(s,apply(k,s)),k)),apply(k,X2)),X3)) = apply(X3,apply(apply(apply(s,apply(k,X2)),apply(apply(s,apply(apply(s,apply(k,s)),k)),apply(k,X2))),X3)),
    inference(transitivity,[status(thm)],[c39,c42]) ).

cnf(c44,plain,
    apply(apply(apply(s,apply(apply(s,k),X3)),apply(apply(s,k),X2)),apply(apply(apply(s,apply(apply(s,apply(k,s)),k)),apply(k,X4)),X5)) = apply(X5,apply(apply(apply(s,apply(k,X4)),apply(apply(s,apply(apply(s,apply(k,s)),k)),apply(k,X4))),X5)),
    inference(transitivity,[status(thm)],[c22,c43]) ).

cnf(c45,plain,
    apply(apply(apply(s,apply(k,apply(apply(s,apply(apply(s,k),X3)),apply(apply(s,k),X2)))),apply(apply(s,apply(apply(s,apply(k,s)),k)),apply(k,X4))),X5) = apply(X5,apply(apply(apply(s,apply(k,X4)),apply(apply(s,apply(apply(s,apply(k,s)),k)),apply(k,X4))),X5)),
    inference(transitivity,[status(thm)],[c11,c44]) ).

cnf(c46,plain,
    apply(apply(apply(s,apply(k,apply(apply(s,apply(apply(s,k),k)),apply(apply(s,k),k)))),apply(apply(s,apply(apply(s,apply(k,s)),k)),apply(k,apply(apply(s,apply(apply(s,k),k)),apply(apply(s,k),k))))),X2) = apply(X2,apply(apply(apply(s,apply(k,apply(apply(s,apply(apply(s,k),k)),apply(apply(s,k),k)))),apply(apply(s,apply(apply(s,apply(k,s)),k)),apply(k,apply(apply(s,apply(apply(s,k),k)),apply(apply(s,k),k))))),X2)),
    inference(substitution,[status(thm)],[c45]) ).

cnf(c47,plain,
    apply(X2,apply(apply(apply(s,apply(k,apply(apply(s,apply(apply(s,k),k)),apply(apply(s,k),k)))),apply(apply(s,apply(apply(s,apply(k,s)),k)),apply(k,apply(apply(s,apply(apply(s,k),k)),apply(apply(s,k),k))))),X2)) = apply(apply(apply(s,apply(k,apply(apply(s,apply(apply(s,k),k)),apply(apply(s,k),k)))),apply(apply(s,apply(apply(s,apply(k,s)),k)),apply(k,apply(apply(s,apply(apply(s,k),k)),apply(apply(s,k),k))))),X2),
    inference(symmetry,[status(thm)],[c46]) ).

cnf(c48,plain,
    apply(apply(s,apply(k,apply(apply(s,apply(apply(s,k),k)),apply(apply(s,k),k)))),apply(apply(s,apply(apply(s,apply(k,s)),k)),apply(k,apply(apply(s,apply(apply(s,k),k)),apply(apply(s,k),k))))) = strong_fixed_point,
    inference(symmetry,[status(thm)],[c2]) ).

cnf(c49,plain,
    apply(apply(apply(s,apply(k,apply(apply(s,apply(apply(s,k),k)),apply(apply(s,k),k)))),apply(apply(s,apply(apply(s,apply(k,s)),k)),apply(k,apply(apply(s,apply(apply(s,k),k)),apply(apply(s,k),k))))),X2) = apply(strong_fixed_point,X2),
    inference(congruence,[status(thm)],[c48]) ).

cnf(c50,plain,
    apply(X2,apply(apply(apply(s,apply(k,apply(apply(s,apply(apply(s,k),k)),apply(apply(s,k),k)))),apply(apply(s,apply(apply(s,apply(k,s)),k)),apply(k,apply(apply(s,apply(apply(s,k),k)),apply(apply(s,k),k))))),X2)) = apply(strong_fixed_point,X2),
    inference(transitivity,[status(thm)],[c47,c49]) ).

cnf(c51,plain,
    apply(X2,apply(strong_fixed_point,X2)) = apply(strong_fixed_point,X2),
    inference(transitivity,[status(thm)],[c4,c50]) ).

cnf(c52,plain,
    apply(fixed_pt,apply(strong_fixed_point,fixed_pt)) = apply(strong_fixed_point,fixed_pt),
    inference(substitution,[status(thm)],[c51]) ).

cnf(c53,plain,
    apply(strong_fixed_point,fixed_pt) = apply(fixed_pt,apply(strong_fixed_point,fixed_pt)),
    inference(symmetry,[status(thm)],[c52]) ).

cnf(c54,plain,
    $false,
    inference(resolution,[status(thm)],[c1,c53]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : COL006-6 : TPTP v9.3.1. Released v2.1.0.
% 0.00/0.04  % Command  : run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.14  % Computer : n020.cluster.edu
% 0.10/0.14  % Model    : x86_64 x86_64
% 0.10/0.14  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.14  % Memory   : 8046.5625MB
% 0.10/0.14  % OS       : Linux 6.8.0-71-generic
% 0.10/0.14  % CPULimit : 300
% 0.10/0.14  % WCLimit  : 300
% 0.10/0.14  % DateTime : Mon Sep 28 21:30:19 UTC 2026
% 0.10/0.15  % CPUTime  : 
% 0.10/0.15  Running run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.26  Command-line arguments: --flatten --complete-subsets
% 0.10/0.26  
% 0.10/0.26  % SZS status Unsatisfiable
% 0.10/0.26  
% 0.10/0.27  % SZS output start CNFRefutation
% See solution above
% 0.51/0.30  
% 0.51/0.30  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------