↑ Up

Prover9---2026-6A.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : COL080-1 : TPTP v9.3.1. Released v1.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n018.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 : Sun Sep 27 06:57:39 AM UTC 2026

% Result   : Unsatisfiable 0.15s 5.41s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   20 (  17 unt;   0 def)
%            Number of atoms       :   23 (  22 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   17 (  14   ~;   3   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   2 avg)
%            Maximal term depth    :   10 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   19 (   1 sgn   7   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(k_definition,axiom,
    ! [VAR_0,VAR_1] : apply(k(VAR_0),VAR_1) = VAR_0,
    file('theBenchmark.p',k_definition) ).

cnf(c_1,plain,
    apply(k(A),B) = A,
    inference(clausify,[status(thm)],[k_definition]) ).

fof(abstraction,axiom,
    ! [VAR_0,VAR_1,VAR_2] : apply(apply(apply(abstraction,VAR_0),VAR_1),VAR_2) = apply(apply(VAR_0,k(VAR_2)),apply(VAR_1,VAR_2)),
    file('theBenchmark.p',abstraction) ).

cnf(c_7,plain,
    apply(apply(apply(abstraction,A),B),C) = apply(apply(A,k(C)),apply(B,C)),
    inference(clausify,[status(thm)],[abstraction]) ).

fof(extensionality2,axiom,
    ! [VAR_0,VAR_1] :
      ( apply(VAR_0,n(VAR_0,VAR_1)) != apply(VAR_1,n(VAR_0,VAR_1))
      | VAR_0 = VAR_1 ),
    file('theBenchmark.p',extensionality2) ).

cnf(c_10,plain,
    ( apply(A,n(A,B)) != apply(B,n(A,B))
    | A = B ),
    inference(clausify,[status(thm)],[extensionality2]) ).

cnf(c_11,plain,
    ( apply(B,n(A,B)) != apply(A,n(A,B))
    | A = B ),
    inference(copy,[status(thm)],[c_10]) ).

fof(prove_TRC2b,axiom,
    k(b) != apply(abstraction,apply(abstraction,k(b))),
    file('theBenchmark.p',prove_TRC2b) ).

cnf(c_15,plain,
    k(b) != apply(abstraction,apply(abstraction,k(b))),
    inference(clausify,[status(thm)],[prove_TRC2b]) ).

cnf(c_16,plain,
    apply(abstraction,apply(abstraction,k(b))) != k(b),
    inference(copy,[status(thm)],[c_15]) ).

cnf(c_26,plain,
    apply(apply(apply(abstraction,k(A)),B),C) = apply(A,apply(B,C)),
    inference(paramod,[status(thm)],[c_1,c_7]) ).

cnf(c_235,plain,
    apply(k(b),n(apply(abstraction,apply(abstraction,k(b))),k(b))) != apply(apply(abstraction,apply(abstraction,k(b))),n(apply(abstraction,apply(abstraction,k(b))),k(b))),
    inference(resolve,[status(thm)],[c_11,c_16]) ).

cnf(c_236,plain,
    b != apply(apply(abstraction,apply(abstraction,k(b))),n(apply(abstraction,apply(abstraction,k(b))),k(b))),
    inference(paramod,[status(thm)],[c_1,c_235]) ).

cnf(c_59,plain,
    apply(apply(abstraction,apply(abstraction,k(b))),n(apply(abstraction,apply(abstraction,k(b))),k(b))) != b,
    inference(copy,[status(thm)],[c_236]) ).

cnf(c_237,plain,
    apply(b,n(apply(apply(abstraction,apply(abstraction,k(b))),n(apply(abstraction,apply(abstraction,k(b))),k(b))),b)) != apply(apply(apply(abstraction,apply(abstraction,k(b))),n(apply(abstraction,apply(abstraction,k(b))),k(b))),n(apply(apply(abstraction,apply(abstraction,k(b))),n(apply(abstraction,apply(abstraction,k(b))),k(b))),b)),
    inference(resolve,[status(thm)],[c_11,c_59]) ).

cnf(c_90,plain,
    apply(apply(apply(abstraction,apply(abstraction,k(b))),n(apply(abstraction,apply(abstraction,k(b))),k(b))),n(apply(apply(abstraction,apply(abstraction,k(b))),n(apply(abstraction,apply(abstraction,k(b))),k(b))),b)) != apply(b,n(apply(apply(abstraction,apply(abstraction,k(b))),n(apply(abstraction,apply(abstraction,k(b))),k(b))),b)),
    inference(copy,[status(thm)],[c_237]) ).

cnf(c_238,plain,
    apply(apply(apply(abstraction,k(b)),k(n(apply(apply(abstraction,apply(abstraction,k(b))),n(apply(abstraction,apply(abstraction,k(b))),k(b))),b))),apply(n(apply(abstraction,apply(abstraction,k(b))),k(b)),n(apply(apply(abstraction,apply(abstraction,k(b))),n(apply(abstraction,apply(abstraction,k(b))),k(b))),b))) != apply(b,n(apply(apply(abstraction,apply(abstraction,k(b))),n(apply(abstraction,apply(abstraction,k(b))),k(b))),b)),
    inference(paramod,[status(thm)],[c_7,c_90]) ).

cnf(c_239,plain,
    apply(b,apply(k(n(apply(apply(abstraction,apply(abstraction,k(b))),n(apply(abstraction,apply(abstraction,k(b))),k(b))),b)),apply(n(apply(abstraction,apply(abstraction,k(b))),k(b)),n(apply(apply(abstraction,apply(abstraction,k(b))),n(apply(abstraction,apply(abstraction,k(b))),k(b))),b)))) != apply(b,n(apply(apply(abstraction,apply(abstraction,k(b))),n(apply(abstraction,apply(abstraction,k(b))),k(b))),b)),
    inference(paramod,[status(thm)],[c_26,c_238]) ).

cnf(c_240,plain,
    apply(b,n(apply(apply(abstraction,apply(abstraction,k(b))),n(apply(abstraction,apply(abstraction,k(b))),k(b))),b)) != apply(b,n(apply(apply(abstraction,apply(abstraction,k(b))),n(apply(abstraction,apply(abstraction,k(b))),k(b))),b)),
    inference(paramod,[status(thm)],[c_1,c_239]) ).

cnf(c_234,plain,
    $false,
    inference(copy,[status(thm)],[c_240]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : COL080-1 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.03  % Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/5.36  % Computer : n018.cluster.edu
% 0.09/5.36  % Model    : x86_64 x86_64
% 0.09/5.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.36  % Memory   : 8046.5625MB
% 0.09/5.36  % OS       : Linux 6.8.0-71-generic
% 0.09/5.36  % CPULimit : 300
% 0.09/5.36  % WCLimit  : 300
% 0.09/5.36  % DateTime : Sat Sep 26 23:14:29 UTC 2026
% 0.09/5.36  % CPUTime  : 
% 0.09/5.36  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/5.36  % Process 1684404 was started by sandbox2 on n018,
% 0.09/5.36  % Sat Sep 26 23:14:29 2026
% 0.09/5.36  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.09/5.36  
% 0.09/5.36  % From the command line: assign(max_seconds, 300).
% 0.15/5.41  
% 0.15/5.41  % SZS status Unsatisfiable for theBenchmark
% 0.15/5.41  
% 0.15/5.41  % Proof 1 at 0.03 (+ 0.01) seconds.
% 0.15/5.41  % Length of proof is 10.
% 0.15/5.41  % Level of proof is 4.
% 0.15/5.41  % Maximum clause weight is 56.000.
% 0.15/5.41  % Given clauses 32.
% 0.15/5.41  
% 0.15/5.41  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------