↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : SWV061+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:43 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(cl5_nebula_array_0002,conjecture,
    ( true
   => ( ( gt(loopcounter,n1)
       => true )
      & ( ~ gt(loopcounter,n1)
       => true ) ) ),
    file('theBenchmark.p',cl5_nebula_array_0002) ).

fof(cl5_nebula_array_0002_neg,negated_conjecture,
    ~ ( true
     => ( ( gt(loopcounter,n1)
         => true )
        & ( ~ gt(loopcounter,n1)
         => true ) ) ),
    inference(assume_negation,[status(cth)],[cl5_nebula_array_0002]) ).

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

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

cnf(c_356,negated_conjecture,
    ~ true,
    inference(clausify,[status(thm)],[cl5_nebula_array_0002_neg]) ).

cnf(c_357,negated_conjecture,
    $false,
    inference(resolve,[status(thm)],[c_321,c_356]) ).

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