↑ Up

Twee---2.7.UNS-CRf.s

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

% Computer : n013.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:13 AM UTC 2026

% Result   : Unsatisfiable 0.11s 0.28s
% Output   : CNFRefutation 0.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   15 (  15 unt;   0 nHn;   6 RR)
%            Number of literals    :   15 (  14 equ;   1 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    8 (   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   :   23 (   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(l,X),Y2) = apply(X,apply(Y2,Y2)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l_definition) ).

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

cnf(c4,axiom,
    apply(apply(apply(q,X2),Y2),Z) = apply(Y2,apply(X2,Z)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',q_definition) ).

cnf(c5,plain,
    apply(apply(apply(q,X3),X4),apply(X2,X2)) = apply(X4,apply(X3,apply(X2,X2))),
    inference(substitution,[status(thm)],[c4]) ).

cnf(c6,plain,
    apply(apply(l,apply(apply(q,X3),X4)),X2) = apply(X4,apply(X3,apply(X2,X2))),
    inference(transitivity,[status(thm)],[c3,c5]) ).

cnf(c7,plain,
    apply(apply(l,apply(apply(q,q),w)),apply(l,apply(apply(q,q),w))) = apply(w,apply(q,apply(apply(l,apply(apply(q,q),w)),apply(l,apply(apply(q,q),w))))),
    inference(substitution,[status(thm)],[c6]) ).

cnf(c8,plain,
    apply(apply(apply(l,apply(apply(q,q),w)),apply(l,apply(apply(q,q),w))),f(apply(apply(l,apply(apply(q,q),w)),apply(l,apply(apply(q,q),w))))) = apply(apply(w,apply(q,apply(apply(l,apply(apply(q,q),w)),apply(l,apply(apply(q,q),w))))),f(apply(apply(l,apply(apply(q,q),w)),apply(l,apply(apply(q,q),w))))),
    inference(congruence,[status(thm)],[c7]) ).

cnf(c9,axiom,
    apply(apply(w,X2),Y2) = apply(apply(X2,Y2),Y2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',w_definition) ).

cnf(c10,plain,
    apply(apply(w,apply(q,X2)),X3) = apply(apply(apply(q,X2),X3),X3),
    inference(substitution,[status(thm)],[c9]) ).

cnf(c11,plain,
    apply(apply(apply(q,X2),X3),X3) = apply(X3,apply(X2,X3)),
    inference(substitution,[status(thm)],[c4]) ).

cnf(c12,plain,
    apply(apply(w,apply(q,X2)),X3) = apply(X3,apply(X2,X3)),
    inference(transitivity,[status(thm)],[c10,c11]) ).

cnf(c13,plain,
    apply(apply(w,apply(q,apply(apply(l,apply(apply(q,q),w)),apply(l,apply(apply(q,q),w))))),f(apply(apply(l,apply(apply(q,q),w)),apply(l,apply(apply(q,q),w))))) = apply(f(apply(apply(l,apply(apply(q,q),w)),apply(l,apply(apply(q,q),w)))),apply(apply(apply(l,apply(apply(q,q),w)),apply(l,apply(apply(q,q),w))),f(apply(apply(l,apply(apply(q,q),w)),apply(l,apply(apply(q,q),w)))))),
    inference(substitution,[status(thm)],[c12]) ).

cnf(c14,plain,
    apply(apply(apply(l,apply(apply(q,q),w)),apply(l,apply(apply(q,q),w))),f(apply(apply(l,apply(apply(q,q),w)),apply(l,apply(apply(q,q),w))))) = apply(f(apply(apply(l,apply(apply(q,q),w)),apply(l,apply(apply(q,q),w)))),apply(apply(apply(l,apply(apply(q,q),w)),apply(l,apply(apply(q,q),w))),f(apply(apply(l,apply(apply(q,q),w)),apply(l,apply(apply(q,q),w)))))),
    inference(transitivity,[status(thm)],[c8,c13]) ).

cnf(c15,plain,
    $false,
    inference(resolution,[status(thm)],[c1,c14]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : COL035-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03  % Command  : run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.17  % Computer : n013.cluster.edu
% 0.11/0.17  % Model    : x86_64 x86_64
% 0.11/0.17  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.17  % Memory   : 8046.5625MB
% 0.11/0.17  % OS       : Linux 6.8.0-71-generic
% 0.11/0.17  % CPULimit : 300
% 0.11/0.17  % WCLimit  : 300
% 0.11/0.17  % DateTime : Mon Sep 28 21:29:36 UTC 2026
% 0.11/0.17  % CPUTime  : 
% 0.11/0.17  Running run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.28  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.11/0.28  
% 0.11/0.28  % SZS status Unsatisfiable
% 0.11/0.28  
% 0.11/0.28  % SZS output start CNFRefutation
% See solution above
% 0.11/0.29  
% 0.11/0.29  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------