↑ Up

LisaST---0.9.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : SWV214+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 : n004.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:39 AM UTC 2026

% Result   : Theorem 9.31s 4.34s
% Output   : CNFRefutation 9.31s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   12 (   6 unt;   0 def)
%            Number of atoms       :  156 ( 147 equ)
%            Maximal formula atoms :   71 (  13 avg)
%            Number of connectives :  216 (  72   ~;   4   |; 136   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   40 (   8 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   13 (  13 usr;  10 con; 0-2 aty)
%            Number of variables   :    4 (   0 sgn   4   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(quaternion_ds1_symm_0121,conjecture,
    ! [X0,X1] :
      ( ( leq(X1,n5)
        & leq(X0,n5)
        & leq(n0,X1)
        & leq(n0,X0) )
     => ( ( n5 = X1
          & n2 = X0
          & n1 = X1
          & n1 = X0
          & ~ ( n5 = X1
              & n5 = X0 )
          & ~ ( n5 = X0
              & n4 = X1 )
          & ~ ( n5 = X1
              & n4 = X0 )
          & ~ ( n4 = X1
              & n4 = X0 )
          & ~ ( n5 = X0
              & n3 = X1 )
          & ~ ( n4 = X0
              & n3 = X1 )
          & ~ ( n5 = X1
              & n3 = X0 )
          & ~ ( n4 = X1
              & n3 = X0 )
          & ~ ( n3 = X1
              & n3 = X0 )
          & ~ ( n5 = X0
              & n2 = X1 )
          & ~ ( n4 = X0
              & n2 = X1 )
          & ~ ( n3 = X0
              & n2 = X1 )
          & ~ ( n5 = X1
              & n2 = X0 )
          & ~ ( n4 = X1
              & n2 = X0 )
          & ~ ( n3 = X1
              & n2 = X0 )
          & ~ ( n2 = X1
              & n2 = X0 )
          & ~ ( n5 = X0
              & n1 = X1 )
          & ~ ( n4 = X0
              & n1 = X1 )
          & ~ ( n3 = X0
              & n1 = X1 )
          & ~ ( n2 = X0
              & n1 = X1 )
          & ~ ( n5 = X1
              & n1 = X0 )
          & ~ ( n4 = X1
              & n1 = X0 )
          & ~ ( n3 = X1
              & n1 = X0 )
          & ~ ( n2 = X1
              & n1 = X0 )
          & ~ ( n5 = X0
              & n0 = X1 )
          & ~ ( n4 = X0
              & n0 = X1 )
          & ~ ( n3 = X0
              & n0 = X1 )
          & ~ ( n5 = X1
              & n0 = X0 )
          & ~ ( n4 = X1
              & n0 = X0 )
          & ~ ( n3 = X1
              & n0 = X0 )
          & ~ ( n2 = X1
              & n0 = X0 ) )
       => n0 = times(divide(n1,n400),'a$uselect2'(sigma,n1)) ) ) ).

fof(negated_conjecture,negated_conjecture,
    ~ ! [X0,X1] :
        ( ( leq(X1,n5)
          & leq(X0,n5)
          & leq(n0,X1)
          & leq(n0,X0) )
       => ( ( n5 = X1
            & n2 = X0
            & n1 = X1
            & n1 = X0
            & ~ ( n5 = X1
                & n5 = X0 )
            & ~ ( n5 = X0
                & n4 = X1 )
            & ~ ( n5 = X1
                & n4 = X0 )
            & ~ ( n4 = X1
                & n4 = X0 )
            & ~ ( n5 = X0
                & n3 = X1 )
            & ~ ( n4 = X0
                & n3 = X1 )
            & ~ ( n5 = X1
                & n3 = X0 )
            & ~ ( n4 = X1
                & n3 = X0 )
            & ~ ( n3 = X1
                & n3 = X0 )
            & ~ ( n5 = X0
                & n2 = X1 )
            & ~ ( n4 = X0
                & n2 = X1 )
            & ~ ( n3 = X0
                & n2 = X1 )
            & ~ ( n5 = X1
                & n2 = X0 )
            & ~ ( n4 = X1
                & n2 = X0 )
            & ~ ( n3 = X1
                & n2 = X0 )
            & ~ ( n2 = X1
                & n2 = X0 )
            & ~ ( n5 = X0
                & n1 = X1 )
            & ~ ( n4 = X0
                & n1 = X1 )
            & ~ ( n3 = X0
                & n1 = X1 )
            & ~ ( n2 = X0
                & n1 = X1 )
            & ~ ( n5 = X1
                & n1 = X0 )
            & ~ ( n4 = X1
                & n1 = X0 )
            & ~ ( n3 = X1
                & n1 = X0 )
            & ~ ( n2 = X1
                & n1 = X0 )
            & ~ ( n5 = X0
                & n0 = X1 )
            & ~ ( n4 = X0
                & n0 = X1 )
            & ~ ( n3 = X0
                & n0 = X1 )
            & ~ ( n5 = X1
                & n0 = X0 )
            & ~ ( n4 = X1
                & n0 = X0 )
            & ~ ( n3 = X1
                & n0 = X0 )
            & ~ ( n2 = X1
                & n0 = X0 ) )
         => n0 = times(divide(n1,n400),'a$uselect2'(sigma,n1)) ) ),
    inference(negate_conjecture,[status(cth)],[quaternion_ds1_symm_0121]) ).

cnf(c174,plain,
    ( n2 != sK182
    | n1 != sK181 ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c198,plain,
    n1 = sK181,
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c199,plain,
    n1 = sK182,
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c200,plain,
    n2 = sK181,
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    sK181 = sK182,
    inference(demodulation,[status(thm)],[c199,c198]) ).

cnf(d1,plain,
    ( n2 != sK182
    | sK181 != sK181 ),
    inference(demodulation,[status(thm)],[c174,c198]) ).

cnf(d2,plain,
    ( sK181 != sK182
    | sK181 != sK181 ),
    inference(demodulation,[status(thm)],[d1,c200]) ).

cnf(d3,plain,
    ( sK181 != sK181
    | sK181 != sK181 ),
    inference(demodulation,[status(thm)],[d2,d0]) ).

cnf(d4,plain,
    sK181 != sK181,
    inference(equality_resolution,[status(thm)],[d3]) ).

cnf(d5,plain,
    $false,
    inference(equality_resolution,[status(thm)],[d4]) ).

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