↑ Up

LisaST---0.9.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : SET108+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/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 08:32:04 AM UTC 2026

% Result   : Theorem 13.63s 2.20s
% Output   : CNFRefutation 13.63s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   16 (   5 unt;   0 def)
%            Number of atoms       :   44 (  24 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   49 (  21   ~;  16   |;  12   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   21 (   9 sgn   2   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(existence_of_first_and_second,conjecture,
    ! [X0] :
    ? [X1,X2] :
      ( ( X2 = X0
        & X1 = X0
        & ~ ? [X3,X4] :
              ( X0 = 'ordered$upair'(X3,X4)
              & member(X4,'universal$uclass')
              & member(X3,'universal$uclass') ) )
      | ( X0 = 'ordered$upair'(X1,X2)
        & member(X2,'universal$uclass')
        & member(X1,'universal$uclass') ) ) ).

fof(negated_conjecture,negated_conjecture,
    ~ ! [X0] :
      ? [X1,X2] :
        ( ( X2 = X0
          & X1 = X0
          & ~ ? [X3,X4] :
                ( X0 = 'ordered$upair'(X3,X4)
                & member(X4,'universal$uclass')
                & member(X3,'universal$uclass') ) )
        | ( X0 = 'ordered$upair'(X1,X2)
          & member(X2,'universal$uclass')
          & member(X1,'universal$uclass') ) ),
    inference(negate_conjecture,[status(cth)],[existence_of_first_and_second]) ).

cnf(c89,plain,
    ( sK90 != 'ordered$upair'(X0,X1)
    | ~ member(X1,'universal$uclass')
    | ~ member(X0,'universal$uclass') ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c90,plain,
    ( X1 != sK90
    | X0 != sK90
    | member(sK93,'universal$uclass') ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c91,plain,
    ( X1 != sK90
    | X0 != sK90
    | member(sK94,'universal$uclass') ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c92,plain,
    ( X1 != sK90
    | X0 != sK90
    | sK90 = 'ordered$upair'(sK93,sK94) ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    ( sK90 = 'ordered$upair'(sK93,sK94)
    | X0 != sK90 ),
    inference(equality_resolution,[status(thm)],[c92]) ).

cnf(d1,plain,
    sK90 = 'ordered$upair'(sK93,sK94),
    inference(equality_resolution,[status(thm)],[d0]) ).

cnf(d2,plain,
    ( ~ member(sK94,'universal$uclass')
    | ~ member(sK93,'universal$uclass')
    | sK90 != sK90 ),
    inference(superposition,[status(thm)],[d1,c89]) ).

cnf(d3,plain,
    ( member(sK93,'universal$uclass')
    | X0 != sK90 ),
    inference(equality_resolution,[status(thm)],[c90]) ).

cnf(d4,plain,
    member(sK93,'universal$uclass'),
    inference(equality_resolution,[status(thm)],[d3]) ).

cnf(d5,plain,
    ( ~ member(sK94,'universal$uclass')
    | sK90 != sK90 ),
    inference(resolution,[status(thm)],[d4,d2]) ).

cnf(d6,plain,
    ( member(sK94,'universal$uclass')
    | X0 != sK90 ),
    inference(equality_resolution,[status(thm)],[c91]) ).

cnf(d7,plain,
    member(sK94,'universal$uclass'),
    inference(equality_resolution,[status(thm)],[d6]) ).

cnf(d8,plain,
    sK90 != sK90,
    inference(resolution,[status(thm)],[d7,d5]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET108+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.36  % Computer : n006.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Sat Sep 26 07:08:25 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 13.63/2.20  % SZS status Theorem for theBenchmark.p
% 13.63/2.20  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------