↑ Up

LisaST---0.9.THM-CRf.s

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

% Computer : n005.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 06:47:21 AM UTC 2026

% Result   : Theorem 11.32s 1.88s
% Output   : CNFRefutation 11.32s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   38 (  15 unt;   0 def)
%            Number of atoms       :  102 (  36 equ)
%            Maximal formula atoms :   14 (   2 avg)
%            Number of connectives :  100 (  36   ~;  30   |;   8   &)
%                                         (   0 <=>;  26  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   3 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   2 con; 0-2 aty)
%            Number of variables   :   39 (   0 sgn  24   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(ax1,axiom,
    ! [X0] :
      ( sorti1(X0)
     => ! [X1] :
          ( sorti1(X1)
         => sorti1(op1(X0,X1)) ) ) ).

fof(ax2,axiom,
    ! [X0] :
      ( sorti2(X0)
     => ! [X1] :
          ( sorti2(X1)
         => sorti2(op2(X0,X1)) ) ) ).

fof(ax3,axiom,
    ! [X0] :
      ( sorti1(X0)
     => ! [X1] :
          ( sorti1(X1)
         => ( op1(X0,X1) = X0
            | op1(X0,X0) != X1 ) ) ) ).

fof(ax4,axiom,
    ~ ! [X0] :
        ( sorti2(X0)
       => ! [X1] :
            ( sorti2(X1)
           => ( op2(X0,X1) = X0
              | op2(X0,X0) != X1 ) ) ) ).

fof(co1,conjecture,
    ( ( ! [X1] :
          ( sorti2(X1)
         => sorti1(j(X1)) )
      & ! [X0] :
          ( sorti1(X0)
         => sorti2(h(X0)) ) )
   => ~ ( ! [X7] :
            ( sorti1(X7)
           => j(h(X7)) = X7 )
        & ! [X6] :
            ( sorti2(X6)
           => h(j(X6)) = X6 )
        & ! [X4] :
            ( sorti2(X4)
           => ! [X5] :
                ( sorti2(X5)
               => j(op2(X4,X5)) = op1(j(X4),j(X5)) ) )
        & ! [X2] :
            ( sorti1(X2)
           => ! [X3] :
                ( sorti1(X3)
               => h(op1(X2,X3)) = op2(h(X2),h(X3)) ) ) ) ) ).

fof(negated_conjecture,negated_conjecture,
    ~ ( ( ! [X1] :
            ( sorti2(X1)
           => sorti1(j(X1)) )
        & ! [X0] :
            ( sorti1(X0)
           => sorti2(h(X0)) ) )
     => ~ ( ! [X7] :
              ( sorti1(X7)
             => j(h(X7)) = X7 )
          & ! [X6] :
              ( sorti2(X6)
             => h(j(X6)) = X6 )
          & ! [X4] :
              ( sorti2(X4)
             => ! [X5] :
                  ( sorti2(X5)
                 => j(op2(X4,X5)) = op1(j(X4),j(X5)) ) )
          & ! [X2] :
              ( sorti1(X2)
             => ! [X3] :
                  ( sorti1(X3)
                 => h(op1(X2,X3)) = op2(h(X2),h(X3)) ) ) ) ),
    inference(negate_conjecture,[status(cth)],[co1]) ).

cnf(c0,plain,
    ( sorti1(op1(X0,X1))
    | ~ sorti1(X1)
    | ~ sorti1(X0) ),
    inference(clausification,[status(esa)],[ax1]) ).

cnf(c1,plain,
    ( sorti2(op2(X0,X1))
    | ~ sorti2(X1)
    | ~ sorti2(X0) ),
    inference(clausification,[status(esa)],[ax2]) ).

cnf(c2,plain,
    ( op1(X0,X1) = X0
    | op1(X0,X0) != X1
    | ~ sorti1(X1)
    | ~ sorti1(X0) ),
    inference(clausification,[status(esa)],[ax3]) ).

cnf(c3,plain,
    sorti2(sK6),
    inference(clausification,[status(esa)],[ax4]) ).

cnf(c4,plain,
    sorti2(sK7),
    inference(clausification,[status(esa)],[ax4]) ).

cnf(c5,plain,
    op2(sK6,sK6) = sK7,
    inference(clausification,[status(esa)],[ax4]) ).

cnf(c6,plain,
    op2(sK6,sK7) != sK6,
    inference(clausification,[status(esa)],[ax4]) ).

cnf(c8,plain,
    ( sorti1(j(X0))
    | ~ sorti2(X0) ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c10,plain,
    ( j(op2(X0,X1)) = op1(j(X0),j(X1))
    | ~ sorti2(X1)
    | ~ sorti2(X0) ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c11,plain,
    ( h(j(X0)) = X0
    | ~ sorti2(X0) ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    h(j(sK6)) = sK6,
    inference(resolution,[status(thm)],[c3,c11]) ).

cnf(d1,plain,
    ( ~ sorti2(X0)
    | j(op2(sK6,X0)) = op1(j(sK6),j(X0)) ),
    inference(resolution,[status(thm)],[c10,c3]) ).

cnf(d2,plain,
    j(op2(sK6,sK7)) = op1(j(sK6),j(sK7)),
    inference(resolution,[status(thm)],[d1,c4]) ).

cnf(d3,plain,
    j(op2(sK6,sK6)) = op1(j(sK6),j(sK6)),
    inference(resolution,[status(thm)],[d1,c3]) ).

cnf(d4,plain,
    j(sK7) = op1(j(sK6),j(sK6)),
    inference(demodulation,[status(thm)],[d3,c5]) ).

cnf(d5,plain,
    ( ~ sorti1(X0)
    | ~ sorti1(op1(X0,X0))
    | op1(X0,op1(X0,X0)) = X0 ),
    inference(equality_resolution,[status(thm)],[c2]) ).

cnf(d6,plain,
    ( ~ sorti1(j(sK6))
    | op1(j(sK6),op1(j(sK6),j(sK6))) = j(sK6)
    | ~ sorti1(j(sK7)) ),
    inference(superposition,[status(thm)],[d4,d5]) ).

cnf(d7,plain,
    ( ~ sorti1(j(sK7))
    | ~ sorti1(j(sK6))
    | op1(j(sK6),j(sK7)) = j(sK6) ),
    inference(demodulation,[status(thm)],[d6,d4]) ).

cnf(d8,plain,
    ( ~ sorti1(j(sK7))
    | ~ sorti1(j(sK6))
    | j(op2(sK6,sK7)) = j(sK6) ),
    inference(demodulation,[status(thm)],[d7,d2]) ).

cnf(d9,plain,
    ( ~ sorti1(j(sK6))
    | ~ sorti1(j(sK6))
    | sorti1(j(sK7)) ),
    inference(superposition,[status(thm)],[d4,c0]) ).

cnf(d10,plain,
    ( ~ sorti2(sK6)
    | sorti1(j(sK7)) ),
    inference(resolution,[status(thm)],[d9,c8]) ).

cnf(d11,plain,
    sorti1(j(sK7)),
    inference(resolution,[status(thm)],[c3,d10]) ).

cnf(d12,plain,
    ( ~ sorti1(j(sK6))
    | j(op2(sK6,sK7)) = j(sK6) ),
    inference(resolution,[status(thm)],[d11,d8]) ).

cnf(d13,plain,
    ( ~ sorti2(sK6)
    | j(op2(sK6,sK7)) = j(sK6) ),
    inference(resolution,[status(thm)],[d12,c8]) ).

cnf(d14,plain,
    j(op2(sK6,sK7)) = j(sK6),
    inference(resolution,[status(thm)],[c3,d13]) ).

cnf(d15,plain,
    ( ~ sorti2(X1)
    | ~ sorti2(X0)
    | h(j(op2(X0,X1))) = op2(X0,X1) ),
    inference(resolution,[status(thm)],[c11,c1]) ).

cnf(d16,plain,
    ( ~ sorti2(X0)
    | h(j(op2(sK6,X0))) = op2(sK6,X0) ),
    inference(resolution,[status(thm)],[d15,c3]) ).

cnf(d17,plain,
    h(j(op2(sK6,sK7))) = op2(sK6,sK7),
    inference(resolution,[status(thm)],[d16,c4]) ).

cnf(d18,plain,
    h(j(sK6)) = op2(sK6,sK7),
    inference(demodulation,[status(thm)],[d17,d14]) ).

cnf(d19,plain,
    sK6 = op2(sK6,sK7),
    inference(demodulation,[status(thm)],[d18,d0]) ).

cnf(d20,plain,
    sK6 != sK6,
    inference(demodulation,[status(thm)],[c6,d19]) ).

cnf(d21,plain,
    $false,
    inference(equality_resolution,[status(thm)],[d20]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : ALG070+1 : TPTP v9.3.1. Released v2.7.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.35  % Computer : n005.cluster.edu
% 0.07/0.35  % Model    : x86_64 x86_64
% 0.07/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.35  % Memory   : 8046.5625MB
% 0.07/0.35  % OS       : Linux 6.8.0-71-generic
% 0.07/0.35  % CPULimit : 300
% 0.07/0.35  % WCLimit  : 300
% 0.07/0.35  % DateTime : Sat Sep 26 21:05:02 UTC 2026
% 0.07/0.35  % CPUTime  : 
% 0.07/0.35  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 11.32/1.88  % SZS status Theorem for theBenchmark.p
% 11.32/1.88  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------