↑ Up

LisaST---0.9.THM-CRf.s

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

% Computer : n012.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:36 AM UTC 2026

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

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

fof(d4_tarski,axiom,
    ! [X0,X1] :
      ( X1 = union(X0)
    <=> ! [X2] :
          ( in(X2,X1)
        <=> ? [X3] :
              ( in(X3,X0)
              & in(X2,X3) ) ) ) ).

fof(t95_zfmisc_1,conjecture,
    ! [X0,X1] :
      ( subset(X0,X1)
     => subset(union(X0),union(X1)) ) ).

fof(negated_conjecture,negated_conjecture,
    ~ ! [X0,X1] :
        ( subset(X0,X1)
       => subset(union(X0),union(X1)) ),
    inference(negate_conjecture,[status(cth)],[t95_zfmisc_1]) ).

cnf(c1,plain,
    ( in(X2,X1)
    | ~ in(X2,X0)
    | ~ subset(X0,X1) ),
    inference(clausification,[status(esa)],[d3_tarski]) ).

cnf(c2,plain,
    ( in(sK5(X0,X1),X0)
    | subset(X0,X1) ),
    inference(clausification,[status(esa)],[d3_tarski]) ).

cnf(c3,plain,
    ( ~ in(sK5(X0,X1),X1)
    | subset(X0,X1) ),
    inference(clausification,[status(esa)],[d3_tarski]) ).

cnf(c4,plain,
    ( in(X2,sK10(X0,X2))
    | ~ in(X2,X1)
    | union(X0) != X1 ),
    inference(clausification,[status(esa)],[d4_tarski]) ).

cnf(c5,plain,
    ( in(sK10(X0,X2),X0)
    | ~ in(X2,X1)
    | union(X0) != X1 ),
    inference(clausification,[status(esa)],[d4_tarski]) ).

cnf(c6,plain,
    ( ~ in(X3,X0)
    | ~ in(X2,X3)
    | in(X2,X1)
    | union(X0) != X1 ),
    inference(clausification,[status(esa)],[d4_tarski]) ).

cnf(c15,plain,
    subset(sK19,sK20),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c16,plain,
    ~ subset(union(sK19),union(sK20)),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    ( in(X0,sK10(X1,X0))
    | ~ in(X0,union(X1)) ),
    inference(equality_resolution,[status(thm)],[c4]) ).

cnf(d1,plain,
    ( ~ in(X0,sK19)
    | in(X0,sK20) ),
    inference(resolution,[status(thm)],[c1,c15]) ).

cnf(d2,plain,
    ( in(sK10(X1,X0),X1)
    | ~ in(X0,union(X1)) ),
    inference(equality_resolution,[status(thm)],[c5]) ).

cnf(d3,plain,
    ( in(sK10(sK19,X0),sK20)
    | ~ in(X0,union(sK19)) ),
    inference(resolution,[status(thm)],[d2,d1]) ).

cnf(d4,plain,
    ( ~ in(X2,X0)
    | in(X2,union(X1))
    | ~ in(X0,X1) ),
    inference(equality_resolution,[status(thm)],[c6]) ).

cnf(d5,plain,
    ( ~ in(X1,union(sK19))
    | in(X0,union(sK20))
    | ~ in(X0,sK10(sK19,X1)) ),
    inference(resolution,[status(thm)],[d4,d3]) ).

cnf(d6,plain,
    ( ~ in(X0,union(sK19))
    | in(X0,union(sK20))
    | ~ in(X0,union(sK19)) ),
    inference(resolution,[status(thm)],[d5,d0]) ).

cnf(d7,plain,
    ( subset(union(sK19),X0)
    | in(sK5(union(sK19),X0),union(sK20)) ),
    inference(resolution,[status(thm)],[d6,c2]) ).

cnf(d8,plain,
    ( subset(union(sK19),union(sK20))
    | subset(union(sK19),union(sK20)) ),
    inference(resolution,[status(thm)],[d7,c3]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : SET942+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.02  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.03/0.29  % Computer : n012.cluster.edu
% 0.03/0.29  % Model    : x86_64 x86_64
% 0.03/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.29  % Memory   : 8046.5625MB
% 0.03/0.29  % OS       : Linux 6.8.0-71-generic
% 0.03/0.29  % CPULimit : 300
% 0.03/0.29  % WCLimit  : 300
% 0.03/0.29  % DateTime : Sat Sep 26 08:27:05 UTC 2026
% 0.03/0.29  % CPUTime  : 
% 0.03/0.29  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.23/1.70  % SZS status Theorem for theBenchmark.p
% 8.23/1.70  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------