↑ Up

FindProof---0.1.THM-Prf.s

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

% Computer : n001.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:43:08 PM UTC 2026

% Result   : Theorem 25.67s 8.99s
% Output   : Proof 25.67s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   20 (  12 unt;   0 def)
%            Number of atoms       :   41 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   40 (  19   ~;  12   |;   6   &)
%                                         (   2 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   29 (   3 sgn  20   !;   2   ?)

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

fof(f0_nnf,plain,
    ! [A,B] :
      ( ( ? [X] :
            ( ~ member(X,B)
            & member(X,A) )
        | subset(A,B) )
      & ( ! [X] :
            ( member(X,B)
            | ~ member(X,A) )
        | ~ subset(A,B) ) ),
    inference(nnf_transformation,[status(thm)],[f0]) ).

fof(f0_sk,plain,
    ! [A,B,X] :
      ( ( ( ~ member(sk0(A,B),B)
          & member(sk0(A,B),A) )
        | subset(A,B) )
      & ( member(X,B)
        | ~ member(X,A)
        | ~ subset(A,B) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk0])],[f0_nnf]) ).

cnf(c1,plain,
    ( member(sk0(X0,X1),X0)
    | subset(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

fof(f5,axiom,
    ! [X] : ~ member(X,empty_set),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',empty_set) ).

fof(f5_nnf,plain,
    ! [X] : ~ member(X,empty_set),
    inference(nnf_transformation,[status(thm)],[f5]) ).

fof(f5_sk,plain,
    ! [X] : ~ member(X,empty_set),
    inference(skolemisation,[status(esa)],[f5_nnf]) ).

cnf(c14,plain,
    ~ member(X0,empty_set),
    inference(cnf_transformation,[status(esa)],[f5_sk]) ).

cnf(p31,plain,
    subset(empty_set,X0),
    inference(resolution,[status(thm)],[c1,c14]) ).

fof(f2,axiom,
    ! [X,A] :
      ( member(X,power_set(A))
    <=> subset(X,A) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',power_set) ).

fof(f2_nnf,plain,
    ! [X,A] :
      ( ( ~ subset(X,A)
        | member(X,power_set(A)) )
      & ( subset(X,A)
        | ~ member(X,power_set(A)) ) ),
    inference(nnf_transformation,[status(thm)],[f2]) ).

fof(f2_sk,plain,
    ! [X,A] :
      ( ( ~ subset(X,A)
        | member(X,power_set(A)) )
      & ( subset(X,A)
        | ~ member(X,power_set(A)) ) ),
    inference(skolemisation,[status(esa)],[f2_nnf]) ).

cnf(c7,plain,
    ( ~ subset(X0,X1)
    | member(X0,power_set(X1)) ),
    inference(cnf_transformation,[status(esa)],[f2_sk]) ).

cnf(p34,plain,
    member(empty_set,power_set(X0)),
    inference(resolution,[status(thm)],[p31,c7]) ).

fof(f11,conjecture,
    ! [A] : member(empty_set,power_set(A)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thI47) ).

fof(f11_neg,negated_conjecture,
    ~ ! [A] : member(empty_set,power_set(A)),
    inference(negated_conjecture,[status(cth)],[f11]) ).

fof(f11_nnf,plain,
    ? [A] : ~ member(empty_set,power_set(A)),
    inference(nnf_transformation,[status(thm)],[f11_neg]) ).

fof(f11_sk,plain,
    ~ member(empty_set,power_set(sk3)),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk3])],[f11_nnf]) ).

cnf(c29,plain,
    ~ member(empty_set,power_set(sk3)),
    inference(cnf_transformation,[status(esa)],[f11_sk]) ).

cnf(p35,plain,
    $false,
    inference(resolution,[status(thm)],[p34,c29]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET366+4 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.09/5.59  % Computer : n001.cluster.edu
% 0.09/5.59  % Model    : x86_64 x86_64
% 0.09/5.59  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.59  % Memory   : 8046.5625MB
% 0.09/5.59  % OS       : Linux 6.8.0-71-generic
% 0.09/5.59  % CPULimit : 300
% 0.09/5.59  % WCLimit  : 300
% 0.09/5.59  % DateTime : Thu Sep 24 10:49:58 UTC 2026
% 0.09/5.59  % CPUTime  : 
% 0.09/5.59  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 25.67/8.99  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 25.67/8.99  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------