↑ Up

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

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

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

% Result   : Theorem 0.10s 0.39s
% Output   : CNFRefutation 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    1
% Syntax   : Number of formulae    :    9 (   4 unt;   0 def)
%            Number of atoms       :   22 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   25 (  12   ~;   3   |;   6   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   1 con; 0-1 aty)
%            Number of variables   :   21 (   1 sgn  10   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(x2113,conjecture,
    ( ( ? [Z] :
        ! [X] :
          ( big_p(X)
         => ~ big_r(Z,X) )
      & ! [Y] :
        ? [W] : big_r(Y,W) )
   => ? [X] : ~ big_p(X) ),
    file('theBenchmark.p',x2113) ).

fof(x2113_neg,negated_conjecture,
    ~ ( ( ? [Z] :
          ! [X] :
            ( big_p(X)
           => ~ big_r(Z,X) )
        & ! [Y] :
          ? [W] : big_r(Y,W) )
     => ? [X] : ~ big_p(X) ),
    inference(assume_negation,[status(cth)],[x2113]) ).

fof(nnf_1,plain,
    ( ! [X] : big_p(X)
    & ? [Z] :
      ! [X0] :
        ( ~ big_r(Z,X0)
        | ~ big_p(X0) )
    & ! [Y] :
      ? [W] : big_r(Y,W) ),
    inference(fof_nnf,[status(thm)],[x2113_neg]) ).

fof(sk_x2113_neg,plain,
    ( ! [X] : big_p(X)
    & ! [X0] :
        ( ~ big_r(sK0,X0)
        | ~ big_p(X0) )
    & ! [Y] : big_r(Y,sK1(Y)) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK0]),skolemize(W,sK1(Y)),skolemize(Z,sK0)],[nnf_1]) ).

cnf(c_2,negated_conjecture,
    ( ~ big_r(sK0,A)
    | ~ big_p(A) ),
    inference(split_conjunct,[status(thm)],[sk_x2113_neg]) ).

cnf(c_3,negated_conjecture,
    big_r(A,sK1(A)),
    inference(split_conjunct,[status(thm)],[sk_x2113_neg]) ).

cnf(c_4,negated_conjecture,
    big_p(A),
    inference(split_conjunct,[status(thm)],[sk_x2113_neg]) ).

cnf(c_5,negated_conjecture,
    ~ big_p(sK1(sK0)),
    inference(resolve,[status(thm)],[c_2,c_3]) ).

cnf(c_6,negated_conjecture,
    $false,
    inference(resolve,[status(thm)],[c_4,c_5]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN362+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.37  % Computer : n008.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Sat Sep 26 17:38:54 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.37  % Process 4171444 was started by sandbox2 on n008,
% 0.10/0.37  % Sat Sep 26 17:38:54 2026
% 0.10/0.37  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.10/0.38  
% 0.10/0.38  % From the command line: assign(max_seconds, 300).
% 0.10/0.39  
% 0.10/0.39  % SZS status Theorem for theBenchmark
% 0.10/0.39  
% 0.10/0.39  % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.10/0.39  % Length of proof is 6.
% 0.10/0.39  % Level of proof is 3.
% 0.10/0.39  % Maximum clause weight is 0.000.
% 0.10/0.39  % Given clauses 0.
% 0.10/0.39  
% 0.10/0.39  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------