↑ Up

LisaST---0.9.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : SET959+1 : TPTP v9.3.1. Bugfixed v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/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 08:33:38 AM UTC 2026

% Result   : Theorem 11.02s 1.80s
% Output   : CNFRefutation 11.02s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   29 (   5 unt;   0 def)
%            Number of atoms       :   75 (  32 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   70 (  24   ~;  32   |;   8   &)
%                                         (   3 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   4 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   2 con; 0-2 aty)
%            Number of variables   :   35 (   0 sgn  23   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(t2_tarski,axiom,
    ! [X0,X1] :
      ( ! [X2] :
          ( in(X2,X0)
        <=> in(X2,X1) )
     => X0 = X1 ) ).

fof(t112_zfmisc_1,conjecture,
    ! [X0,X1] :
      ( ( ! [X2,X3] :
            ( in('ordered$upair'(X2,X3),X0)
          <=> in('ordered$upair'(X2,X3),X1) )
        & ! [X2] :
            ~ ( ! [X3,X4] : X2 != 'ordered$upair'(X3,X4)
              & in(X2,X1) )
        & ! [X2] :
            ~ ( ! [X3,X4] : X2 != 'ordered$upair'(X3,X4)
              & in(X2,X0) ) )
     => X0 = X1 ) ).

fof(negated_conjecture,negated_conjecture,
    ~ ! [X0,X1] :
        ( ( ! [X2,X3] :
              ( in('ordered$upair'(X2,X3),X0)
            <=> in('ordered$upair'(X2,X3),X1) )
          & ! [X2] :
              ~ ( ! [X3,X4] : X2 != 'ordered$upair'(X3,X4)
                & in(X2,X1) )
          & ! [X2] :
              ~ ( ! [X3,X4] : X2 != 'ordered$upair'(X3,X4)
                & in(X2,X0) ) )
       => X0 = X1 ),
    inference(negate_conjecture,[status(cth)],[t112_zfmisc_1]) ).

cnf(c7,plain,
    ( X0 = X1
    | in(sK12(X0,X1),X1)
    | in(sK12(X0,X1),X0) ),
    inference(clausification,[status(esa)],[t2_tarski]) ).

cnf(c8,plain,
    ( X0 = X1
    | ~ in(sK12(X0,X1),X0)
    | ~ in(sK12(X0,X1),X1) ),
    inference(clausification,[status(esa)],[t2_tarski]) ).

cnf(c10,plain,
    ( X0 = 'ordered$upair'(sK16(X0),sK17(X0))
    | ~ in(X0,sK13) ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c11,plain,
    ( X0 = 'ordered$upair'(sK19(X0),sK20(X0))
    | ~ in(X0,sK14) ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c12,plain,
    ( in('ordered$upair'(X0,X1),sK14)
    | ~ in('ordered$upair'(X0,X1),sK13) ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c13,plain,
    ( ~ in('ordered$upair'(X0,X1),sK14)
    | in('ordered$upair'(X0,X1),sK13) ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c14,plain,
    sK13 != sK14,
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    ( sK12(sK13,X0) = 'ordered$upair'(sK16(sK12(sK13,X0)),sK17(sK12(sK13,X0)))
    | in(sK12(sK13,X0),X0)
    | sK13 = X0 ),
    inference(resolution,[status(thm)],[c7,c10]) ).

cnf(d1,plain,
    ( sK12(X0,sK14) = 'ordered$upair'(sK19(sK12(X0,sK14)),sK20(sK12(X0,sK14)))
    | in(sK12(X0,sK14),X0)
    | X0 = sK14 ),
    inference(resolution,[status(thm)],[c7,c11]) ).

cnf(d2,plain,
    ( sK12(sK13,sK14) = 'ordered$upair'(sK16(sK12(sK13,sK14)),sK17(sK12(sK13,sK14)))
    | sK12(sK13,sK14) = 'ordered$upair'(sK19(sK12(sK13,sK14)),sK20(sK12(sK13,sK14)))
    | sK13 = sK14 ),
    inference(resolution,[status(thm)],[d1,c10]) ).

cnf(d3,plain,
    ( sK12(sK13,sK14) = 'ordered$upair'(sK19(sK12(sK13,sK14)),sK20(sK12(sK13,sK14)))
    | sK12(sK13,sK14) = 'ordered$upair'(sK16(sK12(sK13,sK14)),sK17(sK12(sK13,sK14))) ),
    inference(resolution,[status(thm)],[c14,d2]) ).

cnf(d4,plain,
    ( sK12(sK13,sK14) = 'ordered$upair'(sK16(sK12(sK13,sK14)),sK17(sK12(sK13,sK14)))
    | in('ordered$upair'(sK19(sK12(sK13,sK14)),sK20(sK12(sK13,sK14))),sK13)
    | ~ in(sK12(sK13,sK14),sK14) ),
    inference(superposition,[status(thm)],[d3,c13]) ).

cnf(d5,plain,
    ( sK12(sK13,sK14) = 'ordered$upair'(sK16(sK12(sK13,sK14)),sK17(sK12(sK13,sK14)))
    | ~ in(sK12(sK13,sK14),sK14)
    | sK12(sK13,sK14) = 'ordered$upair'(sK16(sK12(sK13,sK14)),sK17(sK12(sK13,sK14)))
    | in(sK12(sK13,sK14),sK13) ),
    inference(superposition,[status(thm)],[d3,d4]) ).

cnf(d6,plain,
    ( sK13 = sK14
    | sK12(sK13,sK14) = 'ordered$upair'(sK16(sK12(sK13,sK14)),sK17(sK12(sK13,sK14)))
    | in(sK12(sK13,sK14),sK13)
    | sK12(sK13,sK14) = 'ordered$upair'(sK16(sK12(sK13,sK14)),sK17(sK12(sK13,sK14))) ),
    inference(resolution,[status(thm)],[d5,d0]) ).

cnf(d7,plain,
    ( in(sK12(sK13,sK14),sK13)
    | sK12(sK13,sK14) = 'ordered$upair'(sK16(sK12(sK13,sK14)),sK17(sK12(sK13,sK14))) ),
    inference(resolution,[status(thm)],[c14,d6]) ).

cnf(d8,plain,
    ( sK12(sK13,sK14) = 'ordered$upair'(sK16(sK12(sK13,sK14)),sK17(sK12(sK13,sK14)))
    | sK12(sK13,sK14) = 'ordered$upair'(sK16(sK12(sK13,sK14)),sK17(sK12(sK13,sK14))) ),
    inference(resolution,[status(thm)],[d7,c10]) ).

cnf(d9,plain,
    ( in('ordered$upair'(sK16(sK12(sK13,sK14)),sK17(sK12(sK13,sK14))),sK14)
    | ~ in(sK12(sK13,sK14),sK13) ),
    inference(superposition,[status(thm)],[d8,c12]) ).

cnf(d10,plain,
    ( ~ in(sK12(sK13,sK14),sK13)
    | in(sK12(sK13,sK14),sK14) ),
    inference(demodulation,[status(thm)],[d9,d8]) ).

cnf(d11,plain,
    ( in('ordered$upair'(sK16(sK12(sK13,sK14)),sK17(sK12(sK13,sK14))),sK13)
    | ~ in(sK12(sK13,sK14),sK14) ),
    inference(superposition,[status(thm)],[d8,c13]) ).

cnf(d12,plain,
    ( ~ in(sK12(sK13,sK14),sK14)
    | in(sK12(sK13,sK14),sK13) ),
    inference(demodulation,[status(thm)],[d11,d8]) ).

cnf(d13,plain,
    ( in(sK12(sK13,sK14),sK13)
    | sK13 = sK14
    | in(sK12(sK13,sK14),sK13) ),
    inference(resolution,[status(thm)],[d12,c7]) ).

cnf(d14,plain,
    in(sK12(sK13,sK14),sK13),
    inference(resolution,[status(thm)],[c14,d13]) ).

cnf(d15,plain,
    in(sK12(sK13,sK14),sK14),
    inference(resolution,[status(thm)],[d14,d10]) ).

cnf(d16,plain,
    ( ~ in(sK12(sK13,sK14),sK14)
    | sK13 = sK14 ),
    inference(resolution,[status(thm)],[d14,c8]) ).

cnf(d17,plain,
    ~ in(sK12(sK13,sK14),sK14),
    inference(resolution,[status(thm)],[c14,d16]) ).

cnf(d18,plain,
    $false,
    inference(resolution,[status(thm)],[d17,d15]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET959+1 : TPTP v9.3.1. Bugfixed v4.0.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.35  % Computer : n005.cluster.edu
% 0.08/0.35  % Model    : x86_64 x86_64
% 0.08/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35  % Memory   : 8046.5625MB
% 0.08/0.35  % OS       : Linux 6.8.0-71-generic
% 0.08/0.35  % CPULimit : 300
% 0.08/0.35  % WCLimit  : 300
% 0.08/0.35  % DateTime : Sat Sep 26 08:27:31 UTC 2026
% 0.08/0.35  % CPUTime  : 
% 0.08/0.35  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 11.02/1.80  % SZS status Theorem for theBenchmark.p
% 11.02/1.80  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------