TSTP Solution File: SET027+3 by SnakeForV---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SET027+3 : TPTP v8.1.0. Released v2.2.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 : n024.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:32 EDT 2022

% Result   : Theorem 0.21s 0.51s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   26 (   6 unt;   0 def)
%            Number of atoms       :   75 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   82 (  33   ~;  20   |;  22   &)
%                                         (   2 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   51 (  36   !;  15   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f44,plain,
    $false,
    inference(subsumption_resolution,[],[f42,f19]) ).

fof(f19,plain,
    ~ subset(sK3,sK1),
    inference(cnf_transformation,[],[f14]) ).

fof(f14,plain,
    ( subset(sK3,sK2)
    & subset(sK2,sK1)
    & ~ subset(sK3,sK1) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3])],[f12,f13]) ).

fof(f13,plain,
    ( ? [X0,X1,X2] :
        ( subset(X2,X1)
        & subset(X1,X0)
        & ~ subset(X2,X0) )
   => ( subset(sK3,sK2)
      & subset(sK2,sK1)
      & ~ subset(sK3,sK1) ) ),
    introduced(choice_axiom,[]) ).

fof(f12,plain,
    ? [X0,X1,X2] :
      ( subset(X2,X1)
      & subset(X1,X0)
      & ~ subset(X2,X0) ),
    inference(rectify,[],[f7]) ).

fof(f7,plain,
    ? [X2,X1,X0] :
      ( subset(X0,X1)
      & subset(X1,X2)
      & ~ subset(X0,X2) ),
    inference(flattening,[],[f6]) ).

fof(f6,plain,
    ? [X2,X1,X0] :
      ( ~ subset(X0,X2)
      & subset(X1,X2)
      & subset(X0,X1) ),
    inference(ennf_transformation,[],[f4]) ).

fof(f4,negated_conjecture,
    ~ ! [X2,X1,X0] :
        ( ( subset(X1,X2)
          & subset(X0,X1) )
       => subset(X0,X2) ),
    inference(negated_conjecture,[],[f3]) ).

fof(f3,conjecture,
    ! [X2,X1,X0] :
      ( ( subset(X1,X2)
        & subset(X0,X1) )
     => subset(X0,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_transitivity_of_subset) ).

fof(f42,plain,
    subset(sK3,sK1),
    inference(resolution,[],[f40,f16]) ).

fof(f16,plain,
    ! [X0,X1] :
      ( member(sK0(X0,X1),X1)
      | subset(X1,X0) ),
    inference(cnf_transformation,[],[f11]) ).

fof(f11,plain,
    ! [X0,X1] :
      ( ( ! [X2] :
            ( ~ member(X2,X1)
            | member(X2,X0) )
        | ~ subset(X1,X0) )
      & ( subset(X1,X0)
        | ( member(sK0(X0,X1),X1)
          & ~ member(sK0(X0,X1),X0) ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f9,f10]) ).

fof(f10,plain,
    ! [X0,X1] :
      ( ? [X3] :
          ( member(X3,X1)
          & ~ member(X3,X0) )
     => ( member(sK0(X0,X1),X1)
        & ~ member(sK0(X0,X1),X0) ) ),
    introduced(choice_axiom,[]) ).

fof(f9,plain,
    ! [X0,X1] :
      ( ( ! [X2] :
            ( ~ member(X2,X1)
            | member(X2,X0) )
        | ~ subset(X1,X0) )
      & ( subset(X1,X0)
        | ? [X3] :
            ( member(X3,X1)
            & ~ member(X3,X0) ) ) ),
    inference(rectify,[],[f8]) ).

fof(f8,plain,
    ! [X1,X0] :
      ( ( ! [X2] :
            ( ~ member(X2,X0)
            | member(X2,X1) )
        | ~ subset(X0,X1) )
      & ( subset(X0,X1)
        | ? [X2] :
            ( member(X2,X0)
            & ~ member(X2,X1) ) ) ),
    inference(nnf_transformation,[],[f5]) ).

fof(f5,plain,
    ! [X1,X0] :
      ( ! [X2] :
          ( ~ member(X2,X0)
          | member(X2,X1) )
    <=> subset(X0,X1) ),
    inference(ennf_transformation,[],[f1]) ).

fof(f1,axiom,
    ! [X0,X1] :
      ( subset(X0,X1)
    <=> ! [X2] :
          ( member(X2,X0)
         => member(X2,X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_defn) ).

fof(f40,plain,
    ~ member(sK0(sK1,sK3),sK3),
    inference(subsumption_resolution,[],[f29,f20]) ).

fof(f20,plain,
    subset(sK2,sK1),
    inference(cnf_transformation,[],[f14]) ).

fof(f29,plain,
    ( ~ member(sK0(sK1,sK3),sK3)
    | ~ subset(sK2,sK1) ),
    inference(resolution,[],[f27,f21]) ).

fof(f21,plain,
    subset(sK3,sK2),
    inference(cnf_transformation,[],[f14]) ).

fof(f27,plain,
    ! [X0,X1] :
      ( ~ subset(X1,X0)
      | ~ member(sK0(sK1,sK3),X1)
      | ~ subset(X0,sK1) ),
    inference(resolution,[],[f25,f17]) ).

fof(f17,plain,
    ! [X2,X0,X1] :
      ( member(X2,X0)
      | ~ subset(X1,X0)
      | ~ member(X2,X1) ),
    inference(cnf_transformation,[],[f11]) ).

fof(f25,plain,
    ! [X0] :
      ( ~ member(sK0(sK1,sK3),X0)
      | ~ subset(X0,sK1) ),
    inference(resolution,[],[f24,f19]) ).

fof(f24,plain,
    ! [X2,X0,X1] :
      ( subset(X2,X1)
      | ~ subset(X0,X1)
      | ~ member(sK0(X1,X2),X0) ),
    inference(resolution,[],[f17,f15]) ).

fof(f15,plain,
    ! [X0,X1] :
      ( ~ member(sK0(X0,X1),X0)
      | subset(X1,X0) ),
    inference(cnf_transformation,[],[f11]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem    : SET027+3 : TPTP v8.1.0. Released v2.2.0.
% 0.12/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.12/0.34  % Computer : n024.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit   : 300
% 0.12/0.34  % WCLimit    : 300
% 0.12/0.34  % DateTime   : Tue Aug 30 12:59:34 EDT 2022
% 0.12/0.34  % CPUTime    : 
% 0.21/0.50  % (3244)lrs+10_1:1_gsp=on:sd=1:sgt=32:sos=on:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.21/0.50  % (3244)Refutation not found, incomplete strategy% (3244)------------------------------
% 0.21/0.50  % (3244)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.50  % (3253)lrs+10_1:1_br=off:sos=on:ss=axioms:st=2.0:urr=on:i=33:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/33Mi)
% 0.21/0.50  % (3244)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.51  % (3244)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.51  
% 0.21/0.51  % (3244)Memory used [KB]: 5884
% 0.21/0.51  % (3244)Time elapsed: 0.092 s
% 0.21/0.51  % (3244)Instructions burned: 1 (million)
% 0.21/0.51  % (3244)------------------------------
% 0.21/0.51  % (3244)------------------------------
% 0.21/0.51  % (3253)Refutation not found, incomplete strategy% (3253)------------------------------
% 0.21/0.51  % (3253)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.51  % (3253)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.51  % (3253)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.51  
% 0.21/0.51  % (3253)Memory used [KB]: 5884
% 0.21/0.51  % (3253)Time elapsed: 0.101 s
% 0.21/0.51  % (3253)Instructions burned: 1 (million)
% 0.21/0.51  % (3253)------------------------------
% 0.21/0.51  % (3253)------------------------------
% 0.21/0.51  % (3257)lrs+10_1:32_br=off:nm=16:sd=2:ss=axioms:st=2.0:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.21/0.51  % (3274)lrs-11_1:1_nm=0:sac=on:sd=4:ss=axioms:st=3.0:i=24:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/24Mi)
% 0.21/0.51  % (3257)Refutation not found, incomplete strategy% (3257)------------------------------
% 0.21/0.51  % (3257)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.51  % (3254)lrs+10_1:1_ep=R:lcm=predicate:lma=on:sos=all:spb=goal:ss=included:i=12:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/12Mi)
% 0.21/0.51  % (3256)lrs+10_1:4_av=off:bs=unit_only:bsr=unit_only:ep=RS:s2a=on:sos=on:sp=frequency:to=lpo:i=16:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 0.21/0.51  % (3257)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.51  % (3257)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.51  
% 0.21/0.51  % (3257)Memory used [KB]: 5884
% 0.21/0.51  % (3257)Time elapsed: 0.106 s
% 0.21/0.51  % (3257)Instructions burned: 1 (million)
% 0.21/0.51  % (3257)------------------------------
% 0.21/0.51  % (3257)------------------------------
% 0.21/0.51  % (3256)Refutation not found, incomplete strategy% (3256)------------------------------
% 0.21/0.51  % (3256)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.51  % (3256)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.51  % (3256)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.51  
% 0.21/0.51  % (3256)Memory used [KB]: 1407
% 0.21/0.51  % (3256)Time elapsed: 0.106 s
% 0.21/0.51  % (3256)Instructions burned: 2 (million)
% 0.21/0.51  % (3256)------------------------------
% 0.21/0.51  % (3256)------------------------------
% 0.21/0.51  % (3274)First to succeed.
% 0.21/0.51  % (3255)lrs+10_1:2_br=off:nm=4:ss=included:urr=on:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.21/0.51  % (3255)Also succeeded, but the first one will report.
% 0.21/0.51  % (3274)Refutation found. Thanks to Tanya!
% 0.21/0.51  % SZS status Theorem for theBenchmark
% 0.21/0.51  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.51  % (3274)------------------------------
% 0.21/0.51  % (3274)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.51  % (3274)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.51  % (3274)Termination reason: Refutation
% 0.21/0.51  
% 0.21/0.51  % (3274)Memory used [KB]: 5884
% 0.21/0.51  % (3274)Time elapsed: 0.105 s
% 0.21/0.51  % (3274)Instructions burned: 2 (million)
% 0.21/0.51  % (3274)------------------------------
% 0.21/0.51  % (3274)------------------------------
% 0.21/0.51  % (3239)Success in time 0.162 s
%------------------------------------------------------------------------------