↑ Up

LisaST---0.9.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : SET932+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 : n014.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 13.13s 3.61s
% Output   : CNFRefutation 13.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   20 (   4 unt;   0 def)
%            Number of atoms       :   44 (   3 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   39 (  15   ~;  16   |;   1   &)
%                                         (   3 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   39 (   0 sgn  13   !;   0   ?)

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

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

fof(t1_xboole_1,axiom,
    ! [X0,X1,X2] :
      ( ( subset(X1,X2)
        & subset(X0,X1) )
     => subset(X0,X2) ) ).

fof(t79_zfmisc_1,conjecture,
    ! [X0,X1] :
      ( subset(X0,X1)
     => subset(powerset(X0),powerset(X1)) ) ).

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

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

cnf(c2,plain,
    ( ~ subset(X2,X1)
    | in(X2,X0)
    | X0 != powerset(X1) ),
    inference(clausification,[status(esa)],[d1_zfmisc_1]) ).

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

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

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

cnf(c14,plain,
    subset(sK17,sK18),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c15,plain,
    ~ subset(powerset(sK17),powerset(sK18)),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    ( ~ subset(X0,X1)
    | in(X0,powerset(X1)) ),
    inference(equality_resolution,[status(thm)],[c2]) ).

cnf(d1,plain,
    ( subset(X0,powerset(X1))
    | ~ subset(sK9(X0,powerset(X1)),X1) ),
    inference(resolution,[status(thm)],[d0,c9]) ).

cnf(d2,plain,
    ( subset(X0,X1)
    | ~ in(X0,powerset(X1)) ),
    inference(equality_resolution,[status(thm)],[c1]) ).

cnf(d3,plain,
    ( subset(sK9(powerset(X0),X1),X0)
    | subset(powerset(X0),X1) ),
    inference(resolution,[status(thm)],[c8,d2]) ).

cnf(d4,plain,
    ( subset(sK9(powerset(X0),X1),X2)
    | ~ subset(X0,X2)
    | subset(powerset(X0),X1) ),
    inference(resolution,[status(thm)],[d3,c13]) ).

cnf(d5,plain,
    ( subset(powerset(X0),powerset(X1))
    | subset(powerset(X0),powerset(X1))
    | ~ subset(X0,X1) ),
    inference(resolution,[status(thm)],[d4,d1]) ).

cnf(d6,plain,
    ~ subset(sK17,sK18),
    inference(resolution,[status(thm)],[d5,c15]) ).

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

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