↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : SWV068+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 : n006.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.26s 0.63s
% Output   : CNFRefutation 0.26s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    2
% Syntax   : Number of formulae    :    6 (   4 unt;   0 def)
%            Number of atoms       :   10 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :    6 (   2   ~;   0   |;   2   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   2 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn   0   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(cl5_nebula_array_0009,conjecture,
    ( ( leq(pv10,minus(n135300,n1))
      & leq(n0,pv10) )
   => true ),
    file('theBenchmark.p',cl5_nebula_array_0009) ).

fof(cl5_nebula_array_0009_neg,negated_conjecture,
    ~ ( ( leq(pv10,minus(n135300,n1))
        & leq(n0,pv10) )
     => true ),
    inference(assume_negation,[status(cth)],[cl5_nebula_array_0009]) ).

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

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

cnf(c_365,negated_conjecture,
    ~ true,
    inference(clausify,[status(thm)],[cl5_nebula_array_0009_neg]) ).

cnf(c_366,negated_conjecture,
    $false,
    inference(resolve,[status(thm)],[c_321,c_365]) ).

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