TSTP Solution File: SET002+3 by SnakeForV-SAT---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SET002+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_sat --cores 0 -t %d %s

% Computer : n028.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:23:00 EDT 2022

% Result   : Theorem 0.20s 0.52s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   15 (  10 unt;   0 def)
%            Number of atoms       :   20 (  13 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   15 (  10   ~;   3   |;   0   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   1 con; 0-2 aty)
%            Number of variables   :   15 (  13   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f58,plain,
    $false,
    inference(trivial_inequality_removal,[],[f57]) ).

fof(f57,plain,
    sK2 != sK2,
    inference(superposition,[],[f43,f54]) ).

fof(f54,plain,
    ! [X0] : union(X0,X0) = X0,
    inference(resolution,[],[f42,f33]) ).

fof(f33,plain,
    ! [X0] : subset(X0,X0),
    inference(cnf_transformation,[],[f6]) ).

fof(f6,axiom,
    ! [X0] : subset(X0,X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_of_subset) ).

fof(f42,plain,
    ! [X0,X1] :
      ( ~ subset(X1,X0)
      | union(X1,X0) = X0 ),
    inference(cnf_transformation,[],[f25]) ).

fof(f25,plain,
    ! [X0,X1] :
      ( union(X1,X0) = X0
      | ~ subset(X1,X0) ),
    inference(rectify,[],[f16]) ).

fof(f16,plain,
    ! [X1,X0] :
      ( union(X0,X1) = X1
      | ~ subset(X0,X1) ),
    inference(ennf_transformation,[],[f1]) ).

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

fof(f43,plain,
    union(sK2,sK2) != sK2,
    inference(cnf_transformation,[],[f27]) ).

fof(f27,plain,
    union(sK2,sK2) != sK2,
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f14,f26]) ).

fof(f26,plain,
    ( ? [X0] : union(X0,X0) != X0
   => union(sK2,sK2) != sK2 ),
    introduced(choice_axiom,[]) ).

fof(f14,plain,
    ? [X0] : union(X0,X0) != X0,
    inference(ennf_transformation,[],[f9]) ).

fof(f9,negated_conjecture,
    ~ ! [X0] : union(X0,X0) = X0,
    inference(negated_conjecture,[],[f8]) ).

fof(f8,conjecture,
    ! [X0] : union(X0,X0) = X0,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_idempotency_of_union) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SET002+3 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.13/0.35  % Computer : n028.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 12:59:03 EDT 2022
% 0.13/0.35  % CPUTime    : 
% 0.20/0.51  % (27450)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/101Mi)
% 0.20/0.52  % (27460)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/498Mi)
% 0.20/0.52  % (27438)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/191324Mi)
% 0.20/0.52  % (27452)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/68Mi)
% 0.20/0.52  % (27460)First to succeed.
% 0.20/0.52  % (27448)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/50Mi)
% 0.20/0.52  % (27445)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/7Mi)
% 0.20/0.52  % (27445)Also succeeded, but the first one will report.
% 0.20/0.52  % (27460)Refutation found. Thanks to Tanya!
% 0.20/0.52  % SZS status Theorem for theBenchmark
% 0.20/0.52  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.52  % (27460)------------------------------
% 0.20/0.52  % (27460)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52  % (27460)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52  % (27460)Termination reason: Refutation
% 0.20/0.52  
% 0.20/0.52  % (27460)Memory used [KB]: 895
% 0.20/0.52  % (27460)Time elapsed: 0.069 s
% 0.20/0.52  % (27460)Instructions burned: 2 (million)
% 0.20/0.52  % (27460)------------------------------
% 0.20/0.52  % (27460)------------------------------
% 0.20/0.52  % (27437)Success in time 0.163 s
%------------------------------------------------------------------------------