↑ Up

Twee---2.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Twee---2.7
% Problem  : COL046-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n010.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:16 AM UTC 2026

% Result   : Unsatisfiable 162.08s 20.73s
% Output   : CNFRefutation 162.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   28 (  28 unt;   0 nHn;   5 RR)
%            Number of literals    :   28 (  27 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;   3 con; 0-2 aty)
%            Number of variables   :   54 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(c1,negated_conjecture,
    apply(Y,f(Y)) != apply(f(Y),apply(Y,f(Y))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_fixed_point) ).

cnf(c2,axiom,
    apply(apply(apply(b,X),Y2),Z) = apply(X,apply(Y2,Z)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_definition) ).

cnf(c3,plain,
    apply(apply(apply(b,X3),X2),apply(apply(b,X3),X2)) = apply(X3,apply(X2,apply(apply(b,X3),X2))),
    inference(substitution,[status(thm)],[c2]) ).

cnf(c4,plain,
    apply(X3,apply(X2,apply(apply(b,X3),X2))) = apply(apply(apply(b,X3),X2),apply(apply(b,X3),X2)),
    inference(symmetry,[status(thm)],[c3]) ).

cnf(c5,axiom,
    apply(m,X2) = apply(X2,X2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m_definition) ).

cnf(c6,plain,
    apply(m,apply(apply(b,X3),X2)) = apply(apply(apply(b,X3),X2),apply(apply(b,X3),X2)),
    inference(substitution,[status(thm)],[c5]) ).

cnf(c7,plain,
    apply(apply(apply(b,X3),X2),apply(apply(b,X3),X2)) = apply(m,apply(apply(b,X3),X2)),
    inference(symmetry,[status(thm)],[c6]) ).

cnf(c8,plain,
    apply(X3,apply(X2,apply(apply(b,X3),X2))) = apply(m,apply(apply(b,X3),X2)),
    inference(transitivity,[status(thm)],[c4,c7]) ).

cnf(c9,plain,
    apply(apply(s,b),apply(m,apply(apply(b,apply(s,b)),m))) = apply(m,apply(apply(b,apply(s,b)),m)),
    inference(substitution,[status(thm)],[c8]) ).

cnf(c10,plain,
    apply(m,apply(apply(b,apply(s,b)),m)) = apply(apply(s,b),apply(m,apply(apply(b,apply(s,b)),m))),
    inference(symmetry,[status(thm)],[c9]) ).

cnf(c11,plain,
    apply(s,apply(m,apply(apply(b,apply(s,b)),m))) = apply(s,apply(apply(s,b),apply(m,apply(apply(b,apply(s,b)),m)))),
    inference(congruence,[status(thm)],[c10]) ).

cnf(c12,plain,
    apply(apply(s,apply(m,apply(apply(b,apply(s,b)),m))),X2) = apply(apply(s,apply(apply(s,b),apply(m,apply(apply(b,apply(s,b)),m)))),X2),
    inference(congruence,[status(thm)],[c11]) ).

cnf(c13,plain,
    apply(apply(apply(s,apply(m,apply(apply(b,apply(s,b)),m))),X2),f(apply(apply(s,apply(m,apply(apply(b,apply(s,b)),m))),X2))) = apply(apply(apply(s,apply(apply(s,b),apply(m,apply(apply(b,apply(s,b)),m)))),X2),f(apply(apply(s,apply(m,apply(apply(b,apply(s,b)),m))),X2))),
    inference(congruence,[status(thm)],[c12]) ).

cnf(c14,axiom,
    apply(apply(apply(s,X2),Y2),Z2) = apply(apply(X2,Z2),apply(Y2,Z2)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s_definition) ).

cnf(c15,plain,
    apply(apply(apply(s,apply(apply(s,b),X3)),X2),X4) = apply(apply(apply(apply(s,b),X3),X4),apply(X2,X4)),
    inference(substitution,[status(thm)],[c14]) ).

cnf(c16,plain,
    apply(apply(apply(s,b),X2),X3) = apply(apply(b,X3),apply(X2,X3)),
    inference(substitution,[status(thm)],[c14]) ).

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

cnf(c18,plain,
    apply(apply(apply(b,X4),apply(X3,X4)),X2) = apply(X4,apply(apply(X3,X4),X2)),
    inference(substitution,[status(thm)],[c2]) ).

cnf(c19,plain,
    apply(apply(apply(apply(s,b),X3),X4),X2) = apply(X4,apply(apply(X3,X4),X2)),
    inference(transitivity,[status(thm)],[c17,c18]) ).

cnf(c20,plain,
    apply(apply(apply(apply(s,b),X4),X2),apply(X3,X2)) = apply(X2,apply(apply(X4,X2),apply(X3,X2))),
    inference(substitution,[status(thm)],[c19]) ).

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

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

cnf(c23,plain,
    apply(apply(X4,X2),apply(X3,X2)) = apply(apply(apply(s,X4),X3),X2),
    inference(symmetry,[status(thm)],[c22]) ).

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

cnf(c25,plain,
    apply(apply(apply(s,apply(apply(s,b),X4)),X3),X2) = apply(X2,apply(apply(apply(s,X4),X3),X2)),
    inference(transitivity,[status(thm)],[c21,c24]) ).

cnf(c26,plain,
    apply(apply(apply(s,apply(apply(s,b),apply(m,apply(apply(b,apply(s,b)),m)))),X2),f(apply(apply(s,apply(m,apply(apply(b,apply(s,b)),m))),X2))) = apply(f(apply(apply(s,apply(m,apply(apply(b,apply(s,b)),m))),X2)),apply(apply(apply(s,apply(m,apply(apply(b,apply(s,b)),m))),X2),f(apply(apply(s,apply(m,apply(apply(b,apply(s,b)),m))),X2)))),
    inference(substitution,[status(thm)],[c25]) ).

cnf(c27,plain,
    apply(apply(apply(s,apply(m,apply(apply(b,apply(s,b)),m))),X2),f(apply(apply(s,apply(m,apply(apply(b,apply(s,b)),m))),X2))) = apply(f(apply(apply(s,apply(m,apply(apply(b,apply(s,b)),m))),X2)),apply(apply(apply(s,apply(m,apply(apply(b,apply(s,b)),m))),X2),f(apply(apply(s,apply(m,apply(apply(b,apply(s,b)),m))),X2)))),
    inference(transitivity,[status(thm)],[c13,c26]) ).

cnf(c28,plain,
    $false,
    inference(resolution,[status(thm)],[c1,c27]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : COL046-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.17  % Computer : n010.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:31:17 UTC 2026
% 0.08/0.17  % CPUTime  : 
% 0.08/0.17  Running run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% 162.08/20.73  Command-line arguments: --lhs-weight 1 --flip-ordering --normalise-queue-percent 10 --cp-renormalise-threshold 10 --complete-subsets --ground-joining-incomplete-limit 15 --flatten-regeneralise
% 162.08/20.73  
% 162.08/20.73  % SZS status Unsatisfiable
% 162.08/20.73  
% 162.08/20.73  % SZS output start CNFRefutation
% See solution above
% 162.08/20.74  
% 162.08/20.74  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------