TSTP Solution File: SET074+1 by SnakeForV---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SET074+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s

% Computer : n005.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed Aug 31 18:18:56 EDT 2022

% Result   : Theorem 0.20s 0.53s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   19 (   6 unt;   0 def)
%            Number of atoms       :   57 (  24 equ)
%            Maximal formula atoms :    8 (   3 avg)
%            Number of connectives :   59 (  21   ~;  18   |;  15   &)
%                                         (   2 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   30 (  26   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f94,plain,
    $false,
    inference(subsumption_resolution,[],[f93,f65]) ).

fof(f65,plain,
    ! [X0] : ~ member(X0,null_class),
    inference(cnf_transformation,[],[f16]) ).

fof(f16,axiom,
    ! [X0] : ~ member(X0,null_class),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',null_class_defn) ).

fof(f93,plain,
    member(sK1,null_class),
    inference(subsumption_resolution,[],[f92,f67]) ).

fof(f67,plain,
    member(sK1,universal_class),
    inference(cnf_transformation,[],[f55]) ).

fof(f55,plain,
    ( member(sK1,universal_class)
    & null_class = unordered_pair(sK0,sK1) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f49,f54]) ).

fof(f54,plain,
    ( ? [X0,X1] :
        ( member(X1,universal_class)
        & unordered_pair(X0,X1) = null_class )
   => ( member(sK1,universal_class)
      & null_class = unordered_pair(sK0,sK1) ) ),
    introduced(choice_axiom,[]) ).

fof(f49,plain,
    ? [X0,X1] :
      ( member(X1,universal_class)
      & unordered_pair(X0,X1) = null_class ),
    inference(ennf_transformation,[],[f45]) ).

fof(f45,negated_conjecture,
    ~ ! [X0,X1] :
        ( member(X1,universal_class)
       => unordered_pair(X0,X1) != null_class ),
    inference(negated_conjecture,[],[f44]) ).

fof(f44,conjecture,
    ! [X0,X1] :
      ( member(X1,universal_class)
     => unordered_pair(X0,X1) != null_class ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',corollary1_2) ).

fof(f92,plain,
    ( ~ member(sK1,universal_class)
    | member(sK1,null_class) ),
    inference(superposition,[],[f76,f66]) ).

fof(f66,plain,
    null_class = unordered_pair(sK0,sK1),
    inference(cnf_transformation,[],[f55]) ).

fof(f76,plain,
    ! [X2,X0] :
      ( ~ member(X2,universal_class)
      | member(X2,unordered_pair(X0,X2)) ),
    inference(equality_resolution,[],[f61]) ).

fof(f61,plain,
    ! [X2,X0,X1] :
      ( member(X2,unordered_pair(X0,X1))
      | X1 != X2
      | ~ member(X2,universal_class) ),
    inference(cnf_transformation,[],[f53]) ).

fof(f53,plain,
    ! [X0,X1,X2] :
      ( ( ( ( X1 = X2
            | X0 = X2 )
          & member(X2,universal_class) )
        | ~ member(X2,unordered_pair(X0,X1)) )
      & ( member(X2,unordered_pair(X0,X1))
        | ( X1 != X2
          & X0 != X2 )
        | ~ member(X2,universal_class) ) ),
    inference(rectify,[],[f52]) ).

fof(f52,plain,
    ! [X0,X2,X1] :
      ( ( ( ( X1 = X2
            | X0 = X1 )
          & member(X1,universal_class) )
        | ~ member(X1,unordered_pair(X0,X2)) )
      & ( member(X1,unordered_pair(X0,X2))
        | ( X1 != X2
          & X0 != X1 )
        | ~ member(X1,universal_class) ) ),
    inference(flattening,[],[f51]) ).

fof(f51,plain,
    ! [X0,X2,X1] :
      ( ( ( ( X1 = X2
            | X0 = X1 )
          & member(X1,universal_class) )
        | ~ member(X1,unordered_pair(X0,X2)) )
      & ( member(X1,unordered_pair(X0,X2))
        | ( X1 != X2
          & X0 != X1 )
        | ~ member(X1,universal_class) ) ),
    inference(nnf_transformation,[],[f47]) ).

fof(f47,plain,
    ! [X0,X2,X1] :
      ( ( ( X1 = X2
          | X0 = X1 )
        & member(X1,universal_class) )
    <=> member(X1,unordered_pair(X0,X2)) ),
    inference(rectify,[],[f4]) ).

fof(f4,axiom,
    ! [X0,X2,X1] :
      ( ( ( X0 = X2
          | X1 = X2 )
        & member(X2,universal_class) )
    <=> member(X2,unordered_pair(X0,X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',unordered_pair_defn) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SET074+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.07/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.35  % Computer : n005.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Tue Aug 30 13:08:48 EDT 2022
% 0.13/0.35  % CPUTime    : 
% 0.20/0.51  % (24104)dis+21_1:1_ep=RS:nwc=10.0:s2a=on:s2at=1.5:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.51  % (24095)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.52  % (24086)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.20/0.52  % (24086)First to succeed.
% 0.20/0.52  % (24095)Instruction limit reached!
% 0.20/0.52  % (24095)------------------------------
% 0.20/0.52  % (24095)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52  % (24095)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52  % (24095)Termination reason: Unknown
% 0.20/0.52  % (24095)Termination phase: Saturation
% 0.20/0.52  
% 0.20/0.52  % (24095)Memory used [KB]: 6140
% 0.20/0.52  % (24095)Time elapsed: 0.009 s
% 0.20/0.52  % (24095)Instructions burned: 7 (million)
% 0.20/0.52  % (24095)------------------------------
% 0.20/0.52  % (24095)------------------------------
% 0.20/0.52  % (24085)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.20/0.52  % (24082)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.53  % (24086)Refutation found. Thanks to Tanya!
% 0.20/0.53  % SZS status Theorem for theBenchmark
% 0.20/0.53  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.53  % (24086)------------------------------
% 0.20/0.53  % (24086)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53  % (24086)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53  % (24086)Termination reason: Refutation
% 0.20/0.53  
% 0.20/0.53  % (24086)Memory used [KB]: 6012
% 0.20/0.53  % (24086)Time elapsed: 0.072 s
% 0.20/0.53  % (24086)Instructions burned: 2 (million)
% 0.20/0.53  % (24086)------------------------------
% 0.20/0.53  % (24086)------------------------------
% 0.20/0.53  % (24075)Success in time 0.17 s
%------------------------------------------------------------------------------