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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SET633+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 : n009.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:41 EDT 2022

% Result   : Theorem 0.19s 0.48s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   28 (  13 unt;   0 def)
%            Number of atoms       :   60 (   6 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   54 (  22   ~;   9   |;  17   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   51 (  39   !;  12   ?)

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

fof(f44,plain,
    subset(difference(sK2,sK1),sK0),
    inference(cnf_transformation,[],[f27]) ).

fof(f27,plain,
    ( subset(difference(sK2,sK1),sK0)
    & ~ subset(symmetric_difference(sK2,sK1),sK0)
    & subset(difference(sK1,sK2),sK0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f25,f26]) ).

fof(f26,plain,
    ( ? [X0,X1,X2] :
        ( subset(difference(X2,X1),X0)
        & ~ subset(symmetric_difference(X2,X1),X0)
        & subset(difference(X1,X2),X0) )
   => ( subset(difference(sK2,sK1),sK0)
      & ~ subset(symmetric_difference(sK2,sK1),sK0)
      & subset(difference(sK1,sK2),sK0) ) ),
    introduced(choice_axiom,[]) ).

fof(f25,plain,
    ? [X0,X1,X2] :
      ( subset(difference(X2,X1),X0)
      & ~ subset(symmetric_difference(X2,X1),X0)
      & subset(difference(X1,X2),X0) ),
    inference(rectify,[],[f20]) ).

fof(f20,plain,
    ? [X1,X0,X2] :
      ( subset(difference(X2,X0),X1)
      & ~ subset(symmetric_difference(X2,X0),X1)
      & subset(difference(X0,X2),X1) ),
    inference(flattening,[],[f19]) ).

fof(f19,plain,
    ? [X0,X1,X2] :
      ( ~ subset(symmetric_difference(X2,X0),X1)
      & subset(difference(X2,X0),X1)
      & subset(difference(X0,X2),X1) ),
    inference(ennf_transformation,[],[f11]) ).

fof(f11,plain,
    ~ ! [X0,X1,X2] :
        ( ( subset(difference(X2,X0),X1)
          & subset(difference(X0,X2),X1) )
       => subset(symmetric_difference(X2,X0),X1) ),
    inference(rectify,[],[f10]) ).

fof(f10,negated_conjecture,
    ~ ! [X1,X2,X0] :
        ( ( subset(difference(X1,X0),X2)
          & subset(difference(X0,X1),X2) )
       => subset(symmetric_difference(X0,X1),X2) ),
    inference(negated_conjecture,[],[f9]) ).

fof(f9,conjecture,
    ! [X1,X2,X0] :
      ( ( subset(difference(X1,X0),X2)
        & subset(difference(X0,X1),X2) )
     => subset(symmetric_difference(X0,X1),X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_th115) ).

fof(f74,plain,
    ~ subset(difference(sK2,sK1),sK0),
    inference(subsumption_resolution,[],[f71,f42]) ).

fof(f42,plain,
    subset(difference(sK1,sK2),sK0),
    inference(cnf_transformation,[],[f27]) ).

fof(f71,plain,
    ( ~ subset(difference(sK1,sK2),sK0)
    | ~ subset(difference(sK2,sK1),sK0) ),
    inference(resolution,[],[f54,f61]) ).

fof(f61,plain,
    ~ subset(union(difference(sK1,sK2),difference(sK2,sK1)),sK0),
    inference(backward_demodulation,[],[f57,f50]) ).

fof(f50,plain,
    ! [X0,X1] : union(X0,X1) = union(X1,X0),
    inference(cnf_transformation,[],[f32]) ).

fof(f32,plain,
    ! [X0,X1] : union(X0,X1) = union(X1,X0),
    inference(rectify,[],[f5]) ).

fof(f5,axiom,
    ! [X1,X0] : union(X0,X1) = union(X1,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_of_union) ).

fof(f57,plain,
    ~ subset(union(difference(sK2,sK1),difference(sK1,sK2)),sK0),
    inference(definition_unfolding,[],[f43,f56]) ).

fof(f56,plain,
    ! [X0,X1] : symmetric_difference(X1,X0) = union(difference(X1,X0),difference(X0,X1)),
    inference(cnf_transformation,[],[f13]) ).

fof(f13,plain,
    ! [X0,X1] : symmetric_difference(X1,X0) = union(difference(X1,X0),difference(X0,X1)),
    inference(rectify,[],[f1]) ).

fof(f1,axiom,
    ! [X1,X0] : symmetric_difference(X0,X1) = union(difference(X0,X1),difference(X1,X0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetric_difference_defn) ).

fof(f43,plain,
    ~ subset(symmetric_difference(sK2,sK1),sK0),
    inference(cnf_transformation,[],[f27]) ).

fof(f54,plain,
    ! [X2,X0,X1] :
      ( subset(union(X1,X2),X0)
      | ~ subset(X1,X0)
      | ~ subset(X2,X0) ),
    inference(cnf_transformation,[],[f37]) ).

fof(f37,plain,
    ! [X0,X1,X2] :
      ( ~ subset(X2,X0)
      | ~ subset(X1,X0)
      | subset(union(X1,X2),X0) ),
    inference(rectify,[],[f18]) ).

fof(f18,plain,
    ! [X0,X2,X1] :
      ( ~ subset(X1,X0)
      | ~ subset(X2,X0)
      | subset(union(X2,X1),X0) ),
    inference(flattening,[],[f17]) ).

fof(f17,plain,
    ! [X2,X0,X1] :
      ( subset(union(X2,X1),X0)
      | ~ subset(X1,X0)
      | ~ subset(X2,X0) ),
    inference(ennf_transformation,[],[f15]) ).

fof(f15,plain,
    ! [X2,X0,X1] :
      ( ( subset(X1,X0)
        & subset(X2,X0) )
     => subset(union(X2,X1),X0) ),
    inference(rectify,[],[f2]) ).

fof(f2,axiom,
    ! [X1,X2,X0] :
      ( ( subset(X0,X1)
        & subset(X2,X1) )
     => subset(union(X0,X2),X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',union_subset) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SET633+3 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.12  % 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.33  % Computer : n009.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit   : 300
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Tue Aug 30 14:04:20 EDT 2022
% 0.12/0.34  % CPUTime    : 
% 0.19/0.47  % (8870)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 0.19/0.47  % (8876)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.19/0.48  % (8876)First to succeed.
% 0.19/0.48  % (8870)Also succeeded, but the first one will report.
% 0.19/0.48  % (8876)Refutation found. Thanks to Tanya!
% 0.19/0.48  % SZS status Theorem for theBenchmark
% 0.19/0.48  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.48  % (8876)------------------------------
% 0.19/0.48  % (8876)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.48  % (8876)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.48  % (8876)Termination reason: Refutation
% 0.19/0.48  
% 0.19/0.48  % (8876)Memory used [KB]: 5884
% 0.19/0.48  % (8876)Time elapsed: 0.094 s
% 0.19/0.48  % (8876)Instructions burned: 3 (million)
% 0.19/0.48  % (8876)------------------------------
% 0.19/0.48  % (8876)------------------------------
% 0.19/0.48  % (8868)Success in time 0.135 s
%------------------------------------------------------------------------------