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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SET575+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 : n002.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:21:28 EDT 2022

% Result   : Theorem 0.20s 0.51s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   23 (   4 unt;   0 def)
%            Number of atoms       :   65 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   72 (  30   ~;  21   |;  15   &)
%                                         (   1 <=>;   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    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   45 (  35   !;  10   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f26,plain,
    $false,
    inference(subsumption_resolution,[],[f25,f20]) ).

fof(f20,plain,
    intersect(sK2,sK1),
    inference(resolution,[],[f19,f14]) ).

fof(f14,plain,
    ! [X0,X1] :
      ( ~ intersect(X1,X0)
      | intersect(X0,X1) ),
    inference(cnf_transformation,[],[f7]) ).

fof(f7,plain,
    ! [X0,X1] :
      ( ~ intersect(X1,X0)
      | intersect(X0,X1) ),
    inference(rectify,[],[f5]) ).

fof(f5,plain,
    ! [X1,X0] :
      ( ~ intersect(X0,X1)
      | intersect(X1,X0) ),
    inference(ennf_transformation,[],[f2]) ).

fof(f2,axiom,
    ! [X0,X1] :
      ( intersect(X0,X1)
     => intersect(X1,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry_of_intersect) ).

fof(f19,plain,
    intersect(sK1,sK2),
    inference(cnf_transformation,[],[f13]) ).

fof(f13,plain,
    ( intersect(sK1,sK2)
    & ! [X2] :
        ( ~ member(X2,sK2)
        | ~ member(X2,sK1) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f6,f12]) ).

fof(f12,plain,
    ( ? [X0,X1] :
        ( intersect(X0,X1)
        & ! [X2] :
            ( ~ member(X2,X1)
            | ~ member(X2,X0) ) )
   => ( intersect(sK1,sK2)
      & ! [X2] :
          ( ~ member(X2,sK2)
          | ~ member(X2,sK1) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f6,plain,
    ? [X0,X1] :
      ( intersect(X0,X1)
      & ! [X2] :
          ( ~ member(X2,X1)
          | ~ member(X2,X0) ) ),
    inference(ennf_transformation,[],[f4]) ).

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

fof(f3,conjecture,
    ! [X1,X0] :
      ( intersect(X0,X1)
     => ? [X2] :
          ( member(X2,X1)
          & member(X2,X0) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_th15) ).

fof(f25,plain,
    ~ intersect(sK2,sK1),
    inference(duplicate_literal_removal,[],[f24]) ).

fof(f24,plain,
    ( ~ intersect(sK2,sK1)
    | ~ intersect(sK2,sK1) ),
    inference(resolution,[],[f22,f16]) ).

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

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

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

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

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

fof(f1,axiom,
    ! [X1,X0] :
      ( intersect(X0,X1)
    <=> ? [X2] :
          ( member(X2,X1)
          & member(X2,X0) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersect_defn) ).

fof(f22,plain,
    ! [X0] :
      ( ~ member(sK0(X0,sK2),sK1)
      | ~ intersect(sK2,X0) ),
    inference(resolution,[],[f18,f15]) ).

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

fof(f18,plain,
    ! [X2] :
      ( ~ member(X2,sK2)
      | ~ member(X2,sK1) ),
    inference(cnf_transformation,[],[f13]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SET575+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.13/0.34  % Computer : n002.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Tue Aug 30 14:12:29 EDT 2022
% 0.13/0.35  % CPUTime    : 
% 0.20/0.49  % (31116)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.20/0.50  % (31125)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.20/0.50  % (31134)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.51  % (31117)dis+1002_1:1_aac=none:bd=off:sac=on:sos=on:spb=units:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.20/0.51  % (31116)First to succeed.
% 0.20/0.51  % (31116)Refutation found. Thanks to Tanya!
% 0.20/0.51  % SZS status Theorem for theBenchmark
% 0.20/0.51  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.51  % (31116)------------------------------
% 0.20/0.51  % (31116)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51  % (31116)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51  % (31116)Termination reason: Refutation
% 0.20/0.51  
% 0.20/0.51  % (31116)Memory used [KB]: 5884
% 0.20/0.51  % (31116)Time elapsed: 0.094 s
% 0.20/0.51  % (31116)Instructions burned: 1 (million)
% 0.20/0.51  % (31116)------------------------------
% 0.20/0.51  % (31116)------------------------------
% 0.20/0.51  % (31109)Success in time 0.154 s
%------------------------------------------------------------------------------