↑ Up

FindProof---0.1.THM-Prf.s

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

% Computer : n008.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:41:49 PM UTC 2026

% Result   : Theorem 13.05s 12.12s
% Output   : Proof 13.05s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   28 (  16 unt;   0 def)
%            Number of atoms       :   68 (  12 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   77 (  37   ~;  22   |;  15   &)
%                                         (   3 <=>;   0  =>;   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    :   11 (  11 usr;   4 con; 0-4 aty)
%            Number of variables   :   43 (   2 sgn  28   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f15,axiom,
    ! [X] : ~ member(X,null_class),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',null_class_defn) ).

fof(f15_nnf,plain,
    ! [X] : ~ member(X,null_class),
    inference(nnf_transformation,[status(thm)],[f15]) ).

fof(f15_sk,plain,
    ! [X] : ~ member(X,null_class),
    inference(skolemisation,[status(esa)],[f15_nnf]) ).

cnf(c31,plain,
    ~ member(X0,null_class),
    inference(cnf_transformation,[status(esa)],[f15_sk]) ).

cnf(hi87,axiom,
    ifeq(member(X0,null_class),true,false,true) = true,
    inference(equality_encoding,[status(esa)],[c31]) ).

fof(f43,conjecture,
    ? [X] :
    ! [Z] : ~ member(Z,X),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',existence_of_null_class) ).

fof(f43_neg,negated_conjecture,
    ~ ? [X] :
      ! [Z] : ~ member(Z,X),
    inference(negated_conjecture,[status(cth)],[f43]) ).

fof(f43_nnf,plain,
    ! [X] :
    ? [Z] : member(Z,X),
    inference(nnf_transformation,[status(thm)],[f43_neg]) ).

fof(f43_sk,plain,
    ! [X] : member(sk7(X),X),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk7])],[f43_nnf]) ).

cnf(c89,plain,
    member(sk7(X0),X0),
    inference(cnf_transformation,[status(esa)],[f43_sk]) ).

cnf(hi85,negated_conjecture,
    member(sk7(X0),X0) = true,
    inference(equality_encoding,[status(esa)],[c89]) ).

cnf(t0,plain,
    true = false,
    inference(hyper_resolution,[status(thm)],[hi87,hi85]) ).

cnf(t2002,plain,
    false = true,
    inference(orient,[status(thm)],[t0]) ).

fof(f13,axiom,
    ! [X,Z] :
      ( member(Z,complement(X))
    <=> ( ~ member(Z,X)
        & member(Z,universal_class) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',complement) ).

fof(f13_nnf,plain,
    ! [X,Z] :
      ( ( member(Z,X)
        | ~ member(Z,universal_class)
        | member(Z,complement(X)) )
      & ( ( ~ member(Z,X)
          & member(Z,universal_class) )
        | ~ member(Z,complement(X)) ) ),
    inference(nnf_transformation,[status(thm)],[f13]) ).

fof(f13_sk,plain,
    ! [Z,X] :
      ( ( member(Z,X)
        | ~ member(Z,universal_class)
        | member(Z,complement(X)) )
      & ( ( ~ member(Z,X)
          & member(Z,universal_class) )
        | ~ member(Z,complement(X)) ) ),
    inference(skolemisation,[status(esa)],[f13_nnf]) ).

cnf(c28,plain,
    ( ~ member(X1,X0)
    | ~ member(X1,complement(X0)) ),
    inference(cnf_transformation,[status(esa)],[f13_sk]) ).

fof(f16,axiom,
    ! [X,Z] :
      ( member(Z,domain_of(X))
    <=> ( restrict(X,singleton(Z),universal_class) != null_class
        & member(Z,universal_class) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',domain_of) ).

fof(f16_nnf,plain,
    ! [X,Z] :
      ( ( restrict(X,singleton(Z),universal_class) = null_class
        | ~ member(Z,universal_class)
        | member(Z,domain_of(X)) )
      & ( ( restrict(X,singleton(Z),universal_class) != null_class
          & member(Z,universal_class) )
        | ~ member(Z,domain_of(X)) ) ),
    inference(nnf_transformation,[status(thm)],[f16]) ).

fof(f16_sk,plain,
    ! [Z,X] :
      ( ( restrict(X,singleton(Z),universal_class) = null_class
        | ~ member(Z,universal_class)
        | member(Z,domain_of(X)) )
      & ( ( restrict(X,singleton(Z),universal_class) != null_class
          & member(Z,universal_class) )
        | ~ member(Z,domain_of(X)) ) ),
    inference(skolemisation,[status(esa)],[f16_nnf]) ).

cnf(c33,plain,
    ( restrict(X0,singleton(X1),universal_class) != null_class
    | ~ member(X1,domain_of(X0)) ),
    inference(cnf_transformation,[status(esa)],[f16_sk]) ).

fof(f39,axiom,
    ! [X,Y] :
      ( disjoint(X,Y)
    <=> ! [U] :
          ~ ( member(U,Y)
            & member(U,X) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',disjoint_defn) ).

fof(f39_nnf,plain,
    ! [X,Y] :
      ( ( ? [U] :
            ( member(U,Y)
            & member(U,X) )
        | disjoint(X,Y) )
      & ( ! [U] :
            ( ~ member(U,Y)
            | ~ member(U,X) )
        | ~ disjoint(X,Y) ) ),
    inference(nnf_transformation,[status(thm)],[f39]) ).

fof(f39_sk,plain,
    ! [X,Y,U] :
      ( ( ( member(sk4(X,Y),Y)
          & member(sk4(X,Y),X) )
        | disjoint(X,Y) )
      & ( ~ member(U,Y)
        | ~ member(U,X)
        | ~ disjoint(X,Y) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk4])],[f39_nnf]) ).

cnf(c80,plain,
    ( ~ member(X2,X1)
    | ~ member(X2,X0)
    | ~ disjoint(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f39_sk]) ).

cnf(goal_0,negated_conjecture,
    true != false,
    inference(equality_encoding,[status(esa)],[c28,c31,c33,c80]) ).

cnf(g0_0,plain,
    true != true,
    inference(rw,[status(thm)],[goal_0,t2002]) ).

cnf(contradiction_0,plain,
    $false,
    inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET061+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.14/10.40  % Computer : n008.cluster.edu
% 0.14/10.40  % Model    : x86_64 x86_64
% 0.14/10.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/10.40  % Memory   : 8046.5625MB
% 0.14/10.40  % OS       : Linux 6.8.0-71-generic
% 0.14/10.40  % CPULimit : 300
% 0.14/10.40  % WCLimit  : 300
% 0.14/10.40  % DateTime : Thu Sep 24 09:30:05 UTC 2026
% 0.14/10.40  % CPUTime  : 
% 0.14/10.40  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 13.05/12.12  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 13.05/12.12  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------