↑ Up

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

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

% Computer : n016.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:43:26 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(prove_this,conjecture,
    ! [A,B] :
      ( ! [Y] :
          ( q(Y)
         => p(Y) )
     => ? [X] :
          ( ( q(X)
           => p(B) )
          & ( p(X)
           => p(A) ) ) ),
    file('theBenchmark.p',prove_this) ).

fof(prove_this_neg,negated_conjecture,
    ~ ! [A,B] :
        ( ! [Y] :
            ( q(Y)
           => p(Y) )
       => ? [X] :
            ( ( q(X)
             => p(B) )
            & ( p(X)
             => p(A) ) ) ),
    inference(assume_negation,[status(cth)],[prove_this]) ).

fof(nnf_1,plain,
    ? [A,B] :
      ( ! [X] :
          ( ( ~ p(B)
            & q(X) )
          | ( ~ p(A)
            & p(X) ) )
      & ! [Y] :
          ( p(Y)
          | ~ q(Y) ) ),
    inference(fof_nnf,[status(thm)],[prove_this_neg]) ).

fof(sk_prove_this_neg_sk,plain,
    ( ! [X] :
        ( ( ~ p(sK1)
          & q(X) )
        | ( ~ p(sK0)
          & p(X) ) )
    & ! [Y] :
        ( p(Y)
        | ~ q(Y) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(A,sK0),skolemize(B,sK1)],[nnf_1]) ).

fof(sk_prove_this_neg,plain,
    ( ( ~ p(sK1)
      | ~ p(sK0) )
    & ! [VAR_0] :
        ( q(VAR_0)
        | ~ p(sK0) )
    & ! [VAR_0] :
        ( ~ p(sK1)
        | p(VAR_0) )
    & ! [VAR_0] :
        ( q(VAR_0)
        | p(VAR_0) )
    & ! [VAR_0] :
        ( p(VAR_0)
        | ~ q(VAR_0) ) ),
    inference(cnf_transformation,[status(thm)],[sk_prove_this_neg_sk]) ).

cnf(c_2,negated_conjecture,
    ( q(A)
    | p(A) ),
    inference(split_conjunct,[status(thm)],[sk_prove_this_neg]) ).

cnf(c_3,negated_conjecture,
    ( p(A)
    | ~ q(A) ),
    inference(split_conjunct,[status(thm)],[sk_prove_this_neg]) ).

cnf(c_5,negated_conjecture,
    ( p(A)
    | p(A) ),
    inference(resolve,[status(thm)],[c_2,c_3]) ).

cnf(c_6,negated_conjecture,
    p(A),
    inference(copy,[status(thm)],[c_5]) ).

cnf(c_7,negated_conjecture,
    ( ~ p(sK1)
    | ~ p(sK0) ),
    inference(split_conjunct,[status(thm)],[sk_prove_this_neg]) ).

cnf(c_9,negated_conjecture,
    ~ p(sK1),
    inference(resolve,[status(thm)],[c_6,c_7]) ).

cnf(c_8,negated_conjecture,
    $false,
    inference(resolve,[status(thm)],[c_6,c_9]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN950+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.03  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/5.38   % Computer : n016.cluster.edu
% 0.09/5.38   % Model    : x86_64 x86_64
% 0.09/5.38   % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.38   % Memory   : 8046.5625MB
% 0.09/5.38   % OS       : Linux 6.8.0-71-generic
% 0.08/15.41  % CPULimit : 300
% 0.08/15.41  % WCLimit  : 300
% 0.08/15.41  % DateTime : Sat Sep 26 18:51:49 UTC 2026
% 0.08/15.41  % CPUTime  : 
% 0.08/15.41  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.08/15.41  % Process 1953416 was started by sandbox on n019,
% 0.08/15.41  % Sat Sep 26 18:51:49 2026
% 0.08/15.41  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.08/15.42  
% 0.08/15.42  % From the command line: assign(max_seconds, 300).
% 0.08/15.42  
% 0.08/15.42  % SZS status Theorem for theBenchmark
% 0.08/15.42  
% 0.08/15.42  % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.08/15.42  % Length of proof is 7.
% 0.08/15.42  % Level of proof is 4.
% 0.08/15.42  % Maximum clause weight is 2.000.
% 0.08/15.42  % Given clauses 0.
% 0.08/15.42  
% 0.08/15.42  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------