↑ Up

LisaST---0.9.THM-CRf.s

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

% Computer : n016.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:13:19 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(mDefSub,definition,
    ! [X0] :
      ( aSet0(X0)
     => ! [X1] :
          ( aSubsetOf0(X1,X0)
        <=> ( ! [X2] :
                ( aElementOf0(X2,X1)
               => aElementOf0(X2,X0) )
            & aSet0(X1) ) ) ) ).

fof(mSubTrans,axiom,
    ! [X0,X1,X2] :
      ( ( aSet0(X2)
        & aSet0(X1)
        & aSet0(X0) )
     => ( ( aSubsetOf0(X1,X2)
          & aSubsetOf0(X0,X1) )
       => aSubsetOf0(X0,X2) ) ) ).

fof(m__4891,hypothesis,
    ( xO = sdtlcdtrc0(xe,sdtlbdtrb0(xd,szDzizrdt0(xd)))
    & aSet0(xO) ) ).

fof(m__5093,hypothesis,
    ( xQ != slcrc0
    & aSubsetOf0(xQ,xO) ) ).

fof(m__5164,hypothesis,
    ( xP = sdtmndt0(xQ,szmzizndt0(xQ))
    & aSet0(xP) ) ).

fof(m__5195,hypothesis,
    aSubsetOf0(xP,xQ) ).

fof(m__,conjecture,
    aSubsetOf0(xP,xO) ).

fof(negated_conjecture,negated_conjecture,
    ~ aSubsetOf0(xP,xO),
    inference(negate_conjecture,[status(cth)],[m__]) ).

cnf(c7,plain,
    ( aSet0(X1)
    | ~ aSubsetOf0(X1,X0)
    | ~ aSet0(X0) ),
    inference(clausification,[status(esa)],[mDefSub]) ).

cnf(c14,plain,
    ( aSubsetOf0(X2,X1)
    | ~ aSubsetOf0(X2,X0)
    | ~ aSet0(X2)
    | ~ aSet0(X0)
    | ~ aSet0(X1)
    | ~ aSubsetOf0(X0,X1) ),
    inference(clausification,[status(esa)],[mSubTrans]) ).

cnf(c220,plain,
    aSet0(xO),
    inference(clausification,[status(esa)],[m__4891]) ).

cnf(c229,plain,
    aSubsetOf0(xQ,xO),
    inference(clausification,[status(esa)],[m__5093]) ).

cnf(c234,plain,
    aSet0(xP),
    inference(clausification,[status(esa)],[m__5164]) ).

cnf(c238,plain,
    aSubsetOf0(xP,xQ),
    inference(clausification,[status(esa)],[m__5195]) ).

cnf(c239,plain,
    ~ aSubsetOf0(xP,xO),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    ( ~ aSubsetOf0(X0,xQ)
    | aSubsetOf0(X0,xO)
    | ~ aSet0(xQ)
    | ~ aSet0(xO)
    | ~ aSet0(X0) ),
    inference(resolution,[status(thm)],[c229,c14]) ).

cnf(d1,plain,
    ( ~ aSubsetOf0(X0,xQ)
    | aSubsetOf0(X0,xO)
    | ~ aSet0(xQ)
    | ~ aSet0(X0) ),
    inference(resolution,[status(thm)],[c220,d0]) ).

cnf(d2,plain,
    ( ~ aSet0(xO)
    | aSet0(xQ) ),
    inference(resolution,[status(thm)],[c229,c7]) ).

cnf(d3,plain,
    aSet0(xQ),
    inference(resolution,[status(thm)],[c220,d2]) ).

cnf(d4,plain,
    ( ~ aSubsetOf0(X0,xQ)
    | aSubsetOf0(X0,xO)
    | ~ aSet0(X0) ),
    inference(resolution,[status(thm)],[d3,d1]) ).

cnf(d5,plain,
    ( aSubsetOf0(xP,xO)
    | ~ aSet0(xP) ),
    inference(resolution,[status(thm)],[d4,c238]) ).

cnf(d6,plain,
    ~ aSet0(xP),
    inference(resolution,[status(thm)],[c239,d5]) ).

cnf(d7,plain,
    $false,
    inference(resolution,[status(thm)],[c234,d6]) ).

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