TSTP Solution File: SEU150+1 by Vampire-SAT---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : SEU150+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s

% Computer : n011.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 : Tue Apr 30 15:22:37 EDT 2024

% Result   : Theorem 0.16s 0.33s
% Output   : Refutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   20 (   9 unt;   0 def)
%            Number of atoms       :   33 (  32 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   25 (  12   ~;   5   |;   4   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   30 (  24   !;   6   ?)

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

fof(f31,plain,
    sK1 != sK1,
    inference(superposition,[],[f12,f26]) ).

fof(f26,plain,
    sK1 = sK2,
    inference(equality_resolution,[],[f25]) ).

fof(f25,plain,
    ! [X0] :
      ( singleton(X0) != singleton(sK1)
      | sK2 = X0 ),
    inference(superposition,[],[f16,f20]) ).

fof(f20,plain,
    unordered_pair(sK1,sK2) = singleton(sK1),
    inference(backward_demodulation,[],[f11,f18]) ).

fof(f18,plain,
    sK0 = sK1,
    inference(equality_resolution,[],[f15]) ).

fof(f15,plain,
    ! [X0] :
      ( singleton(X0) != singleton(sK0)
      | sK1 = X0 ),
    inference(superposition,[],[f14,f11]) ).

fof(f14,plain,
    ! [X2,X0,X1] :
      ( singleton(X0) != unordered_pair(X1,X2)
      | X0 = X1 ),
    inference(cnf_transformation,[],[f8]) ).

fof(f8,plain,
    ! [X0,X1,X2] :
      ( X0 = X1
      | singleton(X0) != unordered_pair(X1,X2) ),
    inference(ennf_transformation,[],[f4]) ).

fof(f4,axiom,
    ! [X0,X1,X2] :
      ( singleton(X0) = unordered_pair(X1,X2)
     => X0 = X1 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t8_zfmisc_1) ).

fof(f11,plain,
    singleton(sK0) = unordered_pair(sK1,sK2),
    inference(cnf_transformation,[],[f10]) ).

fof(f10,plain,
    ( sK1 != sK2
    & singleton(sK0) = unordered_pair(sK1,sK2) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f7,f9]) ).

fof(f9,plain,
    ( ? [X0,X1,X2] :
        ( X1 != X2
        & singleton(X0) = unordered_pair(X1,X2) )
   => ( sK1 != sK2
      & singleton(sK0) = unordered_pair(sK1,sK2) ) ),
    introduced(choice_axiom,[]) ).

fof(f7,plain,
    ? [X0,X1,X2] :
      ( X1 != X2
      & singleton(X0) = unordered_pair(X1,X2) ),
    inference(ennf_transformation,[],[f6]) ).

fof(f6,negated_conjecture,
    ~ ! [X0,X1,X2] :
        ( singleton(X0) = unordered_pair(X1,X2)
       => X1 = X2 ),
    inference(negated_conjecture,[],[f5]) ).

fof(f5,conjecture,
    ! [X0,X1,X2] :
      ( singleton(X0) = unordered_pair(X1,X2)
     => X1 = X2 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t9_zfmisc_1) ).

fof(f16,plain,
    ! [X2,X0,X1] :
      ( unordered_pair(X1,X0) != singleton(X2)
      | X0 = X2 ),
    inference(superposition,[],[f14,f13]) ).

fof(f13,plain,
    ! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
    inference(cnf_transformation,[],[f1]) ).

fof(f1,axiom,
    ! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_tarski) ).

fof(f12,plain,
    sK1 != sK2,
    inference(cnf_transformation,[],[f10]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem    : SEU150+1 : TPTP v8.1.2. Released v3.3.0.
% 0.09/0.11  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.10/0.31  % Computer : n011.cluster.edu
% 0.10/0.31  % Model    : x86_64 x86_64
% 0.10/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31  % Memory   : 8042.1875MB
% 0.10/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.31  % CPULimit   : 300
% 0.16/0.31  % WCLimit    : 300
% 0.16/0.31  % DateTime   : Mon Apr 29 20:37:01 EDT 2024
% 0.16/0.31  % CPUTime    : 
% 0.16/0.32  % (7490)Running in auto input_syntax mode. Trying TPTP
% 0.16/0.33  % (7493)WARNING: value z3 for option sas not known
% 0.16/0.33  % (7491)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.16/0.33  % (7495)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.16/0.33  % (7493)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.16/0.33  % (7496)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.16/0.33  % (7492)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.16/0.33  % (7494)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.16/0.33  % (7497)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.16/0.33  TRYING [1]
% 0.16/0.33  TRYING [2]
% 0.16/0.33  TRYING [1]
% 0.16/0.33  TRYING [2]
% 0.16/0.33  TRYING [3]
% 0.16/0.33  % (7496)First to succeed.
% 0.16/0.33  TRYING [4]
% 0.16/0.33  % (7495)Also succeeded, but the first one will report.
% 0.16/0.33  TRYING [3]
% 0.16/0.33  TRYING [1]
% 0.16/0.33  TRYING [2]
% 0.16/0.33  % (7493)Also succeeded, but the first one will report.
% 0.16/0.33  % (7496)Refutation found. Thanks to Tanya!
% 0.16/0.33  % SZS status Theorem for theBenchmark
% 0.16/0.33  % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.33  % (7496)------------------------------
% 0.16/0.33  % (7496)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.16/0.33  % (7496)Termination reason: Refutation
% 0.16/0.33  
% 0.16/0.33  % (7496)Memory used [KB]: 765
% 0.16/0.33  % (7496)Time elapsed: 0.004 s
% 0.16/0.33  % (7496)Instructions burned: 4 (million)
% 0.16/0.33  % (7496)------------------------------
% 0.16/0.33  % (7496)------------------------------
% 0.16/0.33  % (7490)Success in time 0.017 s
%------------------------------------------------------------------------------