↑ Up

LisaST---0.9.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : SET700+4 : TPTP v9.3.1. Released v2.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/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:33:07 AM UTC 2026

% Result   : Theorem 24.20s 26.99s
% Output   : CNFRefutation 24.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   31 (   4 unt;   0 def)
%            Number of atoms       :   89 (   0 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   87 (  29   ~;  46   |;   4   &)
%                                         (   5 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   60 (   1 sgn  15   !;   0   ?)

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

fof(intersection,axiom,
    ! [X0,X1,X2] :
      ( member(X0,intersection(X1,X2))
    <=> ( member(X0,X2)
        & member(X0,X1) ) ) ).

fof(difference,axiom,
    ! [X0,X1,X2] :
      ( member(X0,difference(X2,X1))
    <=> ( ~ member(X0,X1)
        & member(X0,X2) ) ) ).

fof(thI34,conjecture,
    ! [X0,X1,X2] :
      ( ( subset(X1,X2)
        & subset(X0,X2) )
     => ( subset(X0,X1)
      <=> subset(intersection(X0,difference(X2,X1)),X1) ) ) ).

fof(negated_conjecture,negated_conjecture,
    ~ ! [X0,X1,X2] :
        ( ( subset(X1,X2)
          & subset(X0,X2) )
       => ( subset(X0,X1)
        <=> subset(intersection(X0,difference(X2,X1)),X1) ) ),
    inference(negate_conjecture,[status(cth)],[thI34]) ).

cnf(c0,plain,
    ( member(X2,X1)
    | ~ member(X2,X0)
    | ~ subset(X0,X1) ),
    inference(clausification,[status(esa)],[subset]) ).

cnf(c1,plain,
    ( member(sK3(X0,X1),X0)
    | subset(X0,X1) ),
    inference(clausification,[status(esa)],[subset]) ).

cnf(c2,plain,
    ( ~ member(sK3(X0,X1),X1)
    | subset(X0,X1) ),
    inference(clausification,[status(esa)],[subset]) ).

cnf(c8,plain,
    ( member(X0,X1)
    | ~ member(X0,intersection(X1,X2)) ),
    inference(clausification,[status(esa)],[intersection]) ).

cnf(c10,plain,
    ( ~ member(X0,X2)
    | ~ member(X0,X1)
    | member(X0,intersection(X1,X2)) ),
    inference(clausification,[status(esa)],[intersection]) ).

cnf(c17,plain,
    ( member(X0,X2)
    | ~ member(X0,X1)
    | member(X0,difference(X1,X2)) ),
    inference(clausification,[status(esa)],[difference]) ).

cnf(c29,plain,
    subset(sK31,sK33),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c32,plain,
    ( subset(intersection(sK31,difference(sK33,sK32)),sK32)
    | subset(sK31,sK32) ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c33,plain,
    ( ~ subset(sK31,sK32)
    | ~ subset(intersection(sK31,difference(sK33,sK32)),sK32) ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    ( member(X0,X3)
    | ~ subset(intersection(X2,X1),X3)
    | ~ member(X0,X2)
    | ~ member(X0,X1) ),
    inference(resolution,[status(thm)],[c10,c0]) ).

cnf(d1,plain,
    ( subset(sK31,sK32)
    | ~ member(X0,difference(sK33,sK32))
    | ~ member(X0,sK31)
    | member(X0,sK32) ),
    inference(resolution,[status(thm)],[d0,c32]) ).

cnf(d2,plain,
    ( ~ member(X0,sK33)
    | member(X0,sK32)
    | member(X0,sK32)
    | ~ member(X0,sK31)
    | subset(sK31,sK32) ),
    inference(resolution,[status(thm)],[d1,c17]) ).

cnf(d3,plain,
    ( member(sK3(X0,X1),X2)
    | ~ subset(X0,X2)
    | subset(X0,X1) ),
    inference(resolution,[status(thm)],[c1,c0]) ).

cnf(d4,plain,
    ( member(sK3(X0,X2),X3)
    | ~ subset(X1,X3)
    | subset(X0,X2)
    | ~ subset(X0,X1) ),
    inference(resolution,[status(thm)],[d3,c0]) ).

cnf(d5,plain,
    ( member(sK3(sK31,X1),X0)
    | subset(sK31,X1)
    | ~ subset(sK33,X0) ),
    inference(resolution,[status(thm)],[d4,c29]) ).

cnf(d6,plain,
    ( member(sK3(sK31,X0),sK32)
    | ~ member(sK3(sK31,X0),sK31)
    | subset(sK31,sK32)
    | ~ subset(sK33,sK33)
    | subset(sK31,X0) ),
    inference(resolution,[status(thm)],[d5,d2]) ).

cnf(d7,plain,
    ( subset(X0,X0)
    | subset(X0,X0) ),
    inference(resolution,[status(thm)],[c2,c1]) ).

cnf(d8,plain,
    ( member(sK3(sK31,X0),sK32)
    | ~ member(sK3(sK31,X0),sK31)
    | subset(sK31,sK32)
    | subset(sK31,X0) ),
    inference(resolution,[status(thm)],[d7,d6]) ).

cnf(d9,plain,
    ( member(sK3(sK31,X0),sK32)
    | subset(sK31,sK32)
    | subset(sK31,X0)
    | subset(sK31,X0) ),
    inference(resolution,[status(thm)],[c1,d8]) ).

cnf(d10,plain,
    ( subset(sK31,sK32)
    | subset(sK31,sK32)
    | subset(sK31,sK32) ),
    inference(resolution,[status(thm)],[d9,c2]) ).

cnf(d11,plain,
    ~ subset(intersection(sK31,difference(sK33,sK32)),sK32),
    inference(resolution,[status(thm)],[d10,c33]) ).

cnf(d12,plain,
    ( subset(intersection(X0,X1),X2)
    | member(sK3(intersection(X0,X1),X2),X0) ),
    inference(resolution,[status(thm)],[c8,c1]) ).

cnf(d13,plain,
    ( member(sK3(intersection(X0,X1),X2),X3)
    | ~ subset(X0,X3)
    | subset(intersection(X0,X1),X2) ),
    inference(resolution,[status(thm)],[d12,c0]) ).

cnf(d14,plain,
    ( subset(intersection(X0,X2),X1)
    | subset(intersection(X0,X2),X1)
    | ~ subset(X0,X1) ),
    inference(resolution,[status(thm)],[d13,c2]) ).

cnf(d15,plain,
    ~ subset(sK31,sK32),
    inference(resolution,[status(thm)],[d14,d11]) ).

cnf(d16,plain,
    $false,
    inference(resolution,[status(thm)],[d10,d15]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : SET700+4 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.02  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/5.38   % Computer : n016.cluster.edu
% 0.09/5.38   % Model    : x86_64 x86_64
% 0.09/5.38   % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.38   % Memory   : 8046.5625MB
% 0.09/5.38   % OS       : Linux 6.8.0-71-generic
% 0.02/20.23  % CPULimit : 300
% 0.02/20.23  % WCLimit  : 300
% 0.02/20.23  % DateTime : Sat Sep 26 08:07:11 UTC 2026
% 0.02/20.23  % CPUTime  : 
% 0.02/20.23  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 24.20/26.99  % SZS status Theorem for theBenchmark.p
% 24.20/26.99  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------