↑ Up

FindProof---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : SEU169+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300

% Computer : n017.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 : Fri Sep 25 02:51:12 PM UTC 2026

% Result   : Theorem 22.40s 3.45s
% Output   : Proof 22.40s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   30 (  10 unt;   0 def)
%            Number of atoms       :  103 (   6 equ)
%            Maximal formula atoms :   10 (   3 avg)
%            Number of connectives :  115 (  42   ~;  38   |;  23   &)
%                                         (   5 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   50 (   1 sgn  33   !;   5   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f3,axiom,
    ! [A,B] :
      ( subset(A,B)
    <=> ! [C] :
          ( in(C,A)
         => in(C,B) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).

fof(f3_nnf,plain,
    ! [A,B] :
      ( ( ? [C] :
            ( ~ in(C,B)
            & in(C,A) )
        | subset(A,B) )
      & ( ! [C] :
            ( in(C,B)
            | ~ in(C,A) )
        | ~ subset(A,B) ) ),
    inference(nnf_transformation,[status(thm)],[f3]) ).

fof(f3_sk,plain,
    ! [A,B,C] :
      ( ( ( ~ in(sk1(A,B),B)
          & in(sk1(A,B),A) )
        | subset(A,B) )
      & ( in(C,B)
        | ~ in(C,A)
        | ~ subset(A,B) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk1])],[f3_nnf]) ).

cnf(c11,plain,
    ( in(X2,X1)
    | ~ in(X2,X0)
    | ~ subset(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f3_sk]) ).

fof(f2,axiom,
    ! [A,B] :
      ( ( empty(A)
       => ( element(B,A)
        <=> empty(B) ) )
      & ( ~ empty(A)
       => ( element(B,A)
        <=> in(B,A) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_subset_1) ).

fof(f2_nnf,plain,
    ! [A,B] :
      ( ( ( ( ~ empty(B)
            | element(B,A) )
          & ( empty(B)
            | ~ element(B,A) ) )
        | ~ empty(A) )
      & ( ( ( ~ in(B,A)
            | element(B,A) )
          & ( in(B,A)
            | ~ element(B,A) ) )
        | empty(A) ) ),
    inference(nnf_transformation,[status(thm)],[f2]) ).

fof(f2_sk,plain,
    ! [A,B] :
      ( ( ( ( ~ empty(B)
            | element(B,A) )
          & ( empty(B)
            | ~ element(B,A) ) )
        | ~ empty(A) )
      & ( ( ( ~ in(B,A)
            | element(B,A) )
          & ( in(B,A)
            | ~ element(B,A) ) )
        | empty(A) ) ),
    inference(skolemisation,[status(esa)],[f2_nnf]) ).

cnf(c7,plain,
    ( in(X1,X0)
    | ~ element(X1,X0)
    | empty(X0) ),
    inference(cnf_transformation,[status(esa)],[f2_sk]) ).

fof(f10,conjecture,
    ! [A,B] :
      ( element(B,powerset(A))
     => ! [C] :
          ( in(C,B)
         => in(C,A) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l3_subset_1) ).

fof(f10_neg,negated_conjecture,
    ~ ! [A,B] :
        ( element(B,powerset(A))
       => ! [C] :
            ( in(C,B)
           => in(C,A) ) ),
    inference(negated_conjecture,[status(cth)],[f10]) ).

fof(f10_nnf,plain,
    ? [A,B] :
      ( ? [C] :
          ( ~ in(C,A)
          & in(C,B) )
      & element(B,powerset(A)) ),
    inference(nnf_transformation,[status(thm)],[f10_neg]) ).

fof(f10_sk,plain,
    ( ~ in(sk5,sk3)
    & in(sk5,sk4)
    & element(sk4,powerset(sk3)) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk3,sk4,sk5])],[f10_nnf]) ).

cnf(c20,plain,
    element(sk4,powerset(sk3)),
    inference(cnf_transformation,[status(esa)],[f10_sk]) ).

cnf(p49,plain,
    ( in(sk4,powerset(sk3))
    | empty(powerset(sk3)) ),
    inference(resolution,[status(thm)],[c7,c20]) ).

fof(f1,axiom,
    ! [A,B] :
      ( B = powerset(A)
    <=> ! [C] :
          ( in(C,B)
        <=> subset(C,A) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_zfmisc_1) ).

fof(f1_nnf,plain,
    ! [A,B] :
      ( ( ? [C] :
            ( ( subset(C,A)
              & ~ in(C,B) )
            | ( ~ subset(C,A)
              & in(C,B) ) )
        | B = powerset(A) )
      & ( ! [C] :
            ( ( ~ subset(C,A)
              | in(C,B) )
            & ( subset(C,A)
              | ~ in(C,B) ) )
        | B != powerset(A) ) ),
    inference(nnf_transformation,[status(thm)],[f1]) ).

fof(f1_sk,plain,
    ! [B,A,C] :
      ( ( ( subset(sk0(A,B),A)
          & ~ in(sk0(A,B),B) )
        | ( ~ subset(sk0(A,B),A)
          & in(sk0(A,B),B) )
        | B = powerset(A) )
      & ( ( ( ~ subset(C,A)
            | in(C,B) )
          & ( subset(C,A)
            | ~ in(C,B) ) )
        | B != powerset(A) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk0])],[f1_nnf]) ).

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

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

cnf(p53,plain,
    ( subset(sk4,sk3)
    | empty(powerset(sk3)) ),
    inference(resolution,[status(thm)],[p49,p33]) ).

fof(f8,axiom,
    ! [A] : ~ empty(powerset(A)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc1_subset_1) ).

fof(f8_nnf,plain,
    ! [A] : ~ empty(powerset(A)),
    inference(nnf_transformation,[status(thm)],[f8]) ).

fof(f8_sk,plain,
    ! [A] : ~ empty(powerset(A)),
    inference(skolemisation,[status(esa)],[f8_nnf]) ).

cnf(c18,plain,
    ~ empty(powerset(X0)),
    inference(cnf_transformation,[status(esa)],[f8_sk]) ).

cnf(p54,plain,
    subset(sk4,sk3),
    inference(resolution,[status(thm)],[p53,c18]) ).

cnf(p63,plain,
    ( in(X0,sk3)
    | ~ in(X0,sk4) ),
    inference(resolution,[status(thm)],[c11,p54]) ).

cnf(c21,plain,
    in(sk5,sk4),
    inference(cnf_transformation,[status(esa)],[f10_sk]) ).

cnf(p64,plain,
    in(sk5,sk3),
    inference(resolution,[status(thm)],[p63,c21]) ).

cnf(c22,plain,
    ~ in(sk5,sk3),
    inference(cnf_transformation,[status(esa)],[f10_sk]) ).

cnf(p67,plain,
    $false,
    inference(resolution,[status(thm)],[p64,c22]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU169+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.11/0.57  % Computer : n017.cluster.edu
% 0.11/0.57  % Model    : x86_64 x86_64
% 0.11/0.57  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.57  % Memory   : 8046.5625MB
% 0.11/0.57  % OS       : Linux 6.8.0-71-generic
% 0.11/0.58  % CPULimit : 300
% 0.11/0.58  % WCLimit  : 300
% 0.11/0.58  % DateTime : Thu Sep 24 12:57:17 UTC 2026
% 0.11/0.58  % CPUTime  : 
% 0.11/0.58  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 22.40/3.45  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 22.40/3.45  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------