↑ Up

LisaST---0.9.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : SWV061+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : casc-portfolio.sh -t 300 /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:01:20 AM UTC 2026

% Result   : Theorem 12.15s 2.47s
% Output   : CNFRefutation 12.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    1
% Syntax   : Number of formulae    :    5 (   3 unt;   0 def)
%            Number of atoms       :   13 (   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 ) ) ) ).

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

cnf(c156,plain,
    true,
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c160,plain,
    ~ true,
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    $false,
    inference(resolution,[status(thm)],[c156,c160]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV061+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.37  % Computer : n006.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Sat Sep 26 13:09:55 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 12.15/2.47  % SZS status Theorem for theBenchmark.p
% 12.15/2.47  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------