↑ Up

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

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

% Computer : n003.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:25 AM UTC 2026

% Result   : Theorem 0.13s 0.37s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   12 (   5 unt;   0 def)
%            Number of atoms       :   40 (   0 equ)
%            Maximal formula atoms :    7 (   3 avg)
%            Number of connectives :   44 (  16   ~;  12   |;  10   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-1 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :   13 (   0 sgn   8   !;   3   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(prove_this,conjecture,
    ( ( ~ ! [X] :
            ( a(X)
           => b(X) )
      & ! [X] :
          ( a(X)
         => ( c(X)
            | b(X) ) ) )
   => ? [X] :
        ( c(X)
        & a(X) ) ),
    file('theBenchmark.p',prove_this) ).

fof(prove_this_neg,negated_conjecture,
    ~ ( ( ~ ! [X] :
              ( a(X)
             => b(X) )
        & ! [X] :
            ( a(X)
           => ( c(X)
              | b(X) ) ) )
     => ? [X] :
          ( c(X)
          & a(X) ) ),
    inference(assume_negation,[status(cth)],[prove_this]) ).

fof(nnf_1,plain,
    ( ! [X] :
        ( ~ c(X)
        | ~ a(X) )
    & ? [X1] :
        ( ~ b(X1)
        & a(X1) )
    & ! [X0] :
        ( c(X0)
        | b(X0)
        | ~ a(X0) ) ),
    inference(fof_nnf,[status(thm)],[prove_this_neg]) ).

fof(sk_prove_this_neg,plain,
    ( ! [X] :
        ( ~ c(X)
        | ~ a(X) )
    & ~ b(sK0)
    & a(sK0)
    & ! [X0] :
        ( c(X0)
        | b(X0)
        | ~ a(X0) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X1,sK0)],[nnf_1]) ).

cnf(c_2,negated_conjecture,
    a(sK0),
    inference(split_conjunct,[status(thm)],[sk_prove_this_neg]) ).

cnf(c_3,negated_conjecture,
    ( c(A)
    | b(A)
    | ~ a(A) ),
    inference(split_conjunct,[status(thm)],[sk_prove_this_neg]) ).

cnf(c_4,negated_conjecture,
    ( ~ c(A)
    | ~ a(A) ),
    inference(split_conjunct,[status(thm)],[sk_prove_this_neg]) ).

cnf(c_5,negated_conjecture,
    ~ b(sK0),
    inference(split_conjunct,[status(thm)],[sk_prove_this_neg]) ).

cnf(c_6,negated_conjecture,
    ( c(sK0)
    | b(sK0) ),
    inference(resolve,[status(thm)],[c_2,c_3]) ).

cnf(c_7,negated_conjecture,
    ~ c(sK0),
    inference(resolve,[status(thm)],[c_4,c_2]) ).

cnf(c_8,negated_conjecture,
    c(sK0),
    inference(resolve,[status(thm)],[c_5,c_6]) ).

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

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