↑ Up

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

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

% Computer : n014.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:44 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(reflexivity_leq,axiom,
    ! [X] : leq(X,X),
    file('theBenchmark.p',reflexivity_leq) ).

fof(cl5_nebula_array_0006,conjecture,
    ( ( leq(pv53,minus(n5,n1))
      & leq(pv10,minus(n135300,n1))
      & leq(n0,pv53)
      & leq(n0,pv10) )
   => ( leq(pv53,minus(n5,n1))
      & leq(pv10,minus(n135300,n1))
      & leq(n0,pv53)
      & leq(n0,pv10)
      & leq(n0,n0) ) ),
    file('theBenchmark.p',cl5_nebula_array_0006) ).

fof(cl5_nebula_array_0006_neg,negated_conjecture,
    ~ ( ( leq(pv53,minus(n5,n1))
        & leq(pv10,minus(n135300,n1))
        & leq(n0,pv53)
        & leq(n0,pv10) )
     => ( leq(pv53,minus(n5,n1))
        & leq(pv10,minus(n135300,n1))
        & leq(n0,pv53)
        & leq(n0,pv10)
        & leq(n0,n0) ) ),
    inference(assume_negation,[status(cth)],[cl5_nebula_array_0006]) ).

cnf(c_64,plain,
    leq(A,A),
    inference(clausify,[status(thm)],[reflexivity_leq]) ).

cnf(c_363,negated_conjecture,
    leq(n0,pv10),
    inference(clausify,[status(thm)],[cl5_nebula_array_0006_neg]) ).

cnf(c_364,negated_conjecture,
    leq(n0,pv53),
    inference(clausify,[status(thm)],[cl5_nebula_array_0006_neg]) ).

cnf(c_365,negated_conjecture,
    leq(pv10,minus(n135300,n1)),
    inference(clausify,[status(thm)],[cl5_nebula_array_0006_neg]) ).

cnf(c_366,negated_conjecture,
    leq(pv53,minus(n5,n1)),
    inference(clausify,[status(thm)],[cl5_nebula_array_0006_neg]) ).

cnf(c_367,negated_conjecture,
    ( ~ leq(pv53,minus(n5,n1))
    | ~ leq(pv10,minus(n135300,n1))
    | ~ leq(n0,pv53)
    | ~ leq(n0,pv10)
    | ~ leq(n0,n0) ),
    inference(clausify,[status(thm)],[cl5_nebula_array_0006_neg]) ).

cnf(c_369,negated_conjecture,
    ( ~ leq(pv53,minus(n5,n1))
    | ~ leq(pv10,minus(n135300,n1))
    | ~ leq(n0,pv53)
    | ~ leq(n0,pv10) ),
    inference(resolve,[status(thm)],[c_64,c_367]) ).

cnf(c_370,negated_conjecture,
    ( ~ leq(pv53,minus(n5,n1))
    | ~ leq(pv10,minus(n135300,n1))
    | ~ leq(n0,pv53) ),
    inference(resolve,[status(thm)],[c_363,c_369]) ).

cnf(c_371,negated_conjecture,
    ( ~ leq(pv53,minus(n5,n1))
    | ~ leq(pv10,minus(n135300,n1)) ),
    inference(resolve,[status(thm)],[c_364,c_370]) ).

cnf(c_372,negated_conjecture,
    ~ leq(pv53,minus(n5,n1)),
    inference(resolve,[status(thm)],[c_365,c_371]) ).

cnf(c_368,negated_conjecture,
    $false,
    inference(resolve,[status(thm)],[c_366,c_372]) ).

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