↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : SWV076+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 : n009.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.14s 0.68s
% Output   : CNFRefutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   11 (   7 unt;   0 def)
%            Number of atoms       :   19 (   2 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   14 (   6   ~;   2   |;   4   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   4 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_0017,conjecture,
    ( ( leq(pv31,minus(n5,n1))
      & leq(n0,pv31) )
   => ( leq(pv31,minus(n5,n1))
      & leq(n0,pv31) ) ),
    file('theBenchmark.p',cl5_nebula_array_0017) ).

fof(cl5_nebula_array_0017_neg,negated_conjecture,
    ~ ( ( leq(pv31,minus(n5,n1))
        & leq(n0,pv31) )
     => ( leq(pv31,minus(n5,n1))
        & leq(n0,pv31) ) ),
    inference(assume_negation,[status(cth)],[cl5_nebula_array_0017]) ).

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

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

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

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

cnf(c_361,negated_conjecture,
    ( ~ leq(pv31,minus(n5,n1))
    | ~ leq(n0,pv31) ),
    inference(clausify,[status(thm)],[cl5_nebula_array_0017_neg]) ).

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

cnf(c_364,negated_conjecture,
    ~ leq(pv31,pred(n5)),
    inference(resolve,[status(thm)],[c_358,c_363]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV076+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.10/0.56  % Computer : n009.cluster.edu
% 0.10/0.56  % Model    : x86_64 x86_64
% 0.10/0.56  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.56  % Memory   : 8046.5625MB
% 0.10/0.56  % OS       : Linux 6.8.0-71-generic
% 0.10/0.56  % CPULimit : 300
% 0.10/0.56  % WCLimit  : 300
% 0.10/0.56  % DateTime : Sat Sep 26 13:10:59 UTC 2026
% 0.10/0.56  % CPUTime  : 
% 0.10/0.57  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.57  % Process 220619 was started by sandbox on n009,
% 0.10/0.57  % Sat Sep 26 13:10:59 2026
% 0.10/0.57  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.10/0.62  
% 0.10/0.62  % From the command line: assign(max_seconds, 300).
% 0.14/0.68  
% 0.14/0.68  % SZS status Theorem for theBenchmark
% 0.14/0.68  
% 0.14/0.68  % Proof 1 at 0.04 (+ 0.00) seconds.
% 0.14/0.68  % Length of proof is 8.
% 0.14/0.68  % Level of proof is 3.
% 0.14/0.68  % Maximum clause weight is 16.000.
% 0.14/0.68  % Given clauses 0.
% 0.14/0.68  
% 0.14/0.68  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------