↑ Up

LisaST---0.9.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : SWC026+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n015.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 08:53:59 AM UTC 2026

% Result   : Theorem 18.26s 4.45s
% Output   : CNFRefutation 18.26s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   18 (   7 unt;   0 def)
%            Number of atoms       :   54 (  45 equ)
%            Maximal formula atoms :   14 (   3 avg)
%            Number of connectives :   60 (  24   ~;  22   |;   6   &)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :    8 (   0 sgn   8   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(co1,conjecture,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ! [X2] :
              ( ssList(X2)
             => ! [X3] :
                  ( ssList(X3)
                 => ( ( ( nil = X1
                        | nil != X0 )
                      & ( nil = X0
                        | nil != X1 ) )
                    | ( nil = X3
                      & nil != X2 )
                    | ( nil = X2
                      & nil != X3 )
                    | X0 != X2
                    | X1 != X3 ) ) ) ) ) ).

fof(negated_conjecture,negated_conjecture,
    ~ ! [X0] :
        ( ssList(X0)
       => ! [X1] :
            ( ssList(X1)
           => ! [X2] :
                ( ssList(X2)
               => ! [X3] :
                    ( ssList(X3)
                   => ( ( ( nil = X1
                          | nil != X0 )
                        & ( nil = X0
                          | nil != X1 ) )
                      | ( nil = X3
                        & nil != X2 )
                      | ( nil = X2
                        & nil != X3 )
                      | X0 != X2
                      | X1 != X3 ) ) ) ) ),
    inference(negate_conjecture,[status(cth)],[co1]) ).

cnf(c212,plain,
    sK254 = sK256,
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c213,plain,
    sK253 = sK255,
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c214,plain,
    ( nil != sK255
    | nil = sK256 ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c215,plain,
    ( nil != sK256
    | nil = sK255 ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c216,plain,
    ( nil = sK253
    | nil = sK254 ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c219,plain,
    ( nil != sK254
    | nil != sK253 ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    ( nil = sK256
    | nil != sK253 ),
    inference(demodulation,[status(thm)],[c214,c213]) ).

cnf(d1,plain,
    ( nil = sK254
    | nil != sK253 ),
    inference(demodulation,[status(thm)],[d0,c212]) ).

cnf(d2,plain,
    ( nil != sK256
    | nil = sK253 ),
    inference(demodulation,[status(thm)],[c215,c213]) ).

cnf(d3,plain,
    ( nil != sK254
    | nil = sK253 ),
    inference(demodulation,[status(thm)],[d2,c212]) ).

cnf(d4,plain,
    ( nil = sK253
    | nil = sK253
    | nil != nil ),
    inference(superposition,[status(thm)],[c216,d3]) ).

cnf(d5,plain,
    nil = sK253,
    inference(equality_resolution,[status(thm)],[d4]) ).

cnf(d6,plain,
    nil = sK254,
    inference(resolution,[status(thm)],[d5,d1]) ).

cnf(d7,plain,
    nil != sK254,
    inference(resolution,[status(thm)],[d5,c219]) ).

cnf(d8,plain,
    nil != nil,
    inference(demodulation,[status(thm)],[d7,d6]) ).

cnf(d9,plain,
    $false,
    inference(equality_resolution,[status(thm)],[d8]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SWC026+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.43  % Computer : n015.cluster.edu
% 0.18/0.43  % Model    : x86_64 x86_64
% 0.18/0.43  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.43  % Memory   : 8046.5625MB
% 0.18/0.43  % OS       : Linux 6.8.0-71-generic
% 0.18/0.43  % CPULimit : 300
% 0.18/0.44  % WCLimit  : 300
% 0.18/0.44  % DateTime : Sat Sep 26 12:08:45 UTC 2026
% 0.18/0.44  % CPUTime  : 
% 0.18/0.44  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 18.26/4.45  % SZS status Theorem for theBenchmark.p
% 18.26/4.45  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------