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

View Problem - Process Solution

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

% Computer : n003.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 : Sun May  5 09:19:36 EDT 2024

% Result   : Theorem 0.15s 0.38s
% Output   : Refutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   22 (  13 unt;   0 def)
%            Number of atoms       :   33 (  20 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   23 (  12   ~;   3   |;   4   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   1 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(f42,plain,
    $false,
    inference(trivial_inequality_removal,[],[f41]) ).

fof(f41,plain,
    singleton(sK0) != singleton(sK0),
    inference(superposition,[],[f38,f20]) ).

fof(f20,plain,
    ! [X0] : unordered_pair(X0,X0) = singleton(X0),
    inference(cnf_transformation,[],[f8]) ).

fof(f8,axiom,
    ! [X0] : unordered_pair(X0,X0) = singleton(X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t69_enumset1) ).

fof(f38,plain,
    singleton(sK0) != unordered_pair(sK0,sK0),
    inference(backward_demodulation,[],[f31,f34]) ).

fof(f34,plain,
    sK0 = sK1,
    inference(resolution,[],[f28,f30]) ).

fof(f30,plain,
    subset(unordered_pair(sK0,sK1),singleton(sK0)),
    inference(backward_demodulation,[],[f18,f26]) ).

fof(f26,plain,
    sK0 = sK2,
    inference(resolution,[],[f23,f18]) ).

fof(f23,plain,
    ! [X2,X0,X1] :
      ( ~ subset(unordered_pair(X0,X1),singleton(X2))
      | X0 = X2 ),
    inference(cnf_transformation,[],[f11]) ).

fof(f11,plain,
    ! [X0,X1,X2] :
      ( X0 = X2
      | ~ subset(unordered_pair(X0,X1),singleton(X2)) ),
    inference(ennf_transformation,[],[f5]) ).

fof(f5,axiom,
    ! [X0,X1,X2] :
      ( subset(unordered_pair(X0,X1),singleton(X2))
     => X0 = X2 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t26_zfmisc_1) ).

fof(f18,plain,
    subset(unordered_pair(sK0,sK1),singleton(sK2)),
    inference(cnf_transformation,[],[f13]) ).

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

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

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

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

fof(f6,conjecture,
    ! [X0,X1,X2] :
      ( subset(unordered_pair(X0,X1),singleton(X2))
     => unordered_pair(X0,X1) = singleton(X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t27_zfmisc_1) ).

fof(f28,plain,
    ! [X2,X0,X1] :
      ( ~ subset(unordered_pair(X1,X0),singleton(X2))
      | X0 = X2 ),
    inference(superposition,[],[f23,f22]) ).

fof(f22,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/sandbox/benchmark/theBenchmark.p',commutativity_k2_tarski) ).

fof(f31,plain,
    unordered_pair(sK0,sK1) != singleton(sK0),
    inference(backward_demodulation,[],[f19,f26]) ).

fof(f19,plain,
    unordered_pair(sK0,sK1) != singleton(sK2),
    inference(cnf_transformation,[],[f13]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SET886+1 : TPTP v8.1.2. Released v3.2.0.
% 0.12/0.14  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.35  % Computer : n003.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit   : 300
% 0.15/0.35  % WCLimit    : 300
% 0.15/0.36  % DateTime   : Fri May  3 17:03:23 EDT 2024
% 0.15/0.36  % CPUTime    : 
% 0.15/0.36  % (5454)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.37  % (5457)WARNING: value z3 for option sas not known
% 0.15/0.38  % (5455)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.15/0.38  % (5458)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.15/0.38  % (5456)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.15/0.38  % (5457)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.15/0.38  % (5460)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.15/0.38  % (5459)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.15/0.38  % (5461)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.15/0.38  TRYING [1]
% 0.15/0.38  TRYING [2]
% 0.15/0.38  TRYING [3]
% 0.15/0.38  TRYING [1]
% 0.15/0.38  TRYING [2]
% 0.15/0.38  % (5460)First to succeed.
% 0.15/0.38  TRYING [4]
% 0.15/0.38  % (5459)Also succeeded, but the first one will report.
% 0.15/0.38  % (5461)Also succeeded, but the first one will report.
% 0.15/0.38  % (5460)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-5454"
% 0.15/0.38  % (5457)Also succeeded, but the first one will report.
% 0.15/0.38  TRYING [1]
% 0.15/0.38  TRYING [2]
% 0.15/0.38  TRYING [3]
% 0.15/0.38  TRYING [3]
% 0.15/0.38  % (5460)Refutation found. Thanks to Tanya!
% 0.15/0.38  % SZS status Theorem for theBenchmark
% 0.15/0.38  % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.38  % (5460)------------------------------
% 0.15/0.38  % (5460)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.15/0.38  % (5460)Termination reason: Refutation
% 0.15/0.38  
% 0.15/0.38  % (5460)Memory used [KB]: 766
% 0.15/0.38  % (5460)Time elapsed: 0.004 s
% 0.15/0.38  % (5460)Instructions burned: 4 (million)
% 0.15/0.38  % (5454)Success in time 0.02 s
%------------------------------------------------------------------------------