↑ Up

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

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

% Computer : n019.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:06:46 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(pred_minus_1,axiom,
    ! [X] : minus(X,n1) = pred(X),
    file('theBenchmark.p',pred_minus_1) ).

fof(cl5_nebula_array_0019,conjecture,
    ( ( leq(pv31,minus(n5,n1))
      & leq(n0,pv31) )
   => ( ( n0 = pv70
       => true )
      & ( n0 != pv70
       => ( leq(pv31,minus(n5,n1))
          & leq(n0,pv31) ) ) ) ),
    file('theBenchmark.p',cl5_nebula_array_0019) ).

fof(cl5_nebula_array_0019_neg,negated_conjecture,
    ~ ( ( leq(pv31,minus(n5,n1))
        & leq(n0,pv31) )
     => ( ( n0 = pv70
         => true )
        & ( n0 != pv70
         => ( leq(pv31,minus(n5,n1))
            & leq(n0,pv31) ) ) ) ),
    inference(assume_negation,[status(cth)],[cl5_nebula_array_0019]) ).

cnf(c_300,plain,
    minus(A,n1) = pred(A),
    inference(clausify,[status(thm)],[pred_minus_1]) ).

fof(ttrue,axiom,
    true,
    file('theBenchmark.p',ttrue) ).

cnf(c_319,plain,
    true,
    inference(clausify,[status(thm)],[ttrue]) ).

cnf(c_358,negated_conjecture,
    leq(n0,pv31),
    inference(clausify,[status(thm)],[cl5_nebula_array_0019_neg]) ).

cnf(c_359,negated_conjecture,
    leq(pv31,minus(n5,n1)),
    inference(clausify,[status(thm)],[cl5_nebula_array_0019_neg]) ).

cnf(c_360,negated_conjecture,
    leq(pv31,pred(n5)),
    inference(paramod,[status(thm)],[c_300,c_359]) ).

cnf(c_361,negated_conjecture,
    ( ~ true
    | pv70 != n0 ),
    inference(clausify,[status(thm)],[cl5_nebula_array_0019_neg]) ).

cnf(c_362,negated_conjecture,
    pv70 != n0,
    inference(resolve,[status(thm)],[c_319,c_361]) ).

cnf(c_363,negated_conjecture,
    ( pv70 = n0
    | ~ leq(pv31,minus(n5,n1))
    | ~ leq(n0,pv31) ),
    inference(clausify,[status(thm)],[cl5_nebula_array_0019_neg]) ).

cnf(c_365,negated_conjecture,
    ( pv70 = n0
    | ~ leq(pv31,pred(n5))
    | ~ leq(n0,pv31) ),
    inference(paramod,[status(thm)],[c_300,c_363]) ).

cnf(c_366,negated_conjecture,
    ( pv70 = n0
    | ~ leq(pv31,pred(n5)) ),
    inference(resolve,[status(thm)],[c_358,c_365]) ).

cnf(c_367,negated_conjecture,
    pv70 = n0,
    inference(resolve,[status(thm)],[c_360,c_366]) ).

cnf(c_364,negated_conjecture,
    $false,
    inference(resolve,[status(thm)],[c_362,c_367]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV078+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.37  % Computer : n019.cluster.edu
% 0.12/0.37  % Model    : x86_64 x86_64
% 0.12/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37  % Memory   : 8046.5625MB
% 0.12/0.37  % OS       : Linux 6.8.0-71-generic
% 0.12/0.37  % CPULimit : 300
% 0.12/0.37  % WCLimit  : 300
% 0.12/0.37  % DateTime : Sat Sep 26 13:11:03 UTC 2026
% 0.12/0.37  % CPUTime  : 
% 0.12/0.37  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.12/0.37  % Process 1396548 was started by sandbox on n019,
% 0.12/0.37  % Sat Sep 26 13:11:03 2026
% 0.12/0.37  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.12/0.43  
% 0.12/0.43  % From the command line: assign(max_seconds, 300).
% 0.12/0.48  
% 0.12/0.48  % SZS status Theorem for theBenchmark
% 0.12/0.48  
% 0.12/0.48  % Proof 1 at 0.03 (+ 0.00) seconds.
% 0.12/0.48  % Length of proof is 11.
% 0.12/0.48  % Level of proof is 3.
% 0.12/0.48  % Maximum clause weight is 16.000.
% 0.12/0.48  % Given clauses 0.
% 0.12/0.48  
% 0.12/0.48  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------