TSTP Solution File: SET877+1 by SnakeForV---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SET877+1 : TPTP v8.1.0. Released v3.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 : n006.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:22:38 EDT 2022

% Result   : Theorem 0.19s 0.49s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   24 (   6 unt;   0 def)
%            Number of atoms       :   76 (  52 equ)
%            Maximal formula atoms :   10 (   3 avg)
%            Number of connectives :   85 (  33   ~;  30   |;  15   &)
%                                         (   2 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   48 (  41   !;   7   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f86,plain,
    $false,
    inference(unit_resulting_resolution,[],[f30,f31,f58]) ).

fof(f58,plain,
    ! [X2,X1] :
      ( set_intersection2(singleton(X2),singleton(X1)) != singleton(X2)
      | X1 = X2 ),
    inference(superposition,[],[f44,f36]) ).

fof(f36,plain,
    ! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
    inference(cnf_transformation,[],[f12]) ).

fof(f12,plain,
    ! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
    inference(rectify,[],[f2]) ).

fof(f2,axiom,
    ! [X1,X0] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).

fof(f44,plain,
    ! [X0,X1] :
      ( singleton(X0) != set_intersection2(singleton(X1),singleton(X0))
      | X0 = X1 ),
    inference(resolution,[],[f29,f40]) ).

fof(f40,plain,
    ! [X3,X1] :
      ( ~ in(X3,singleton(X1))
      | X1 = X3 ),
    inference(equality_resolution,[],[f33]) ).

fof(f33,plain,
    ! [X3,X0,X1] :
      ( X1 = X3
      | ~ in(X3,X0)
      | singleton(X1) != X0 ),
    inference(cnf_transformation,[],[f23]) ).

fof(f23,plain,
    ! [X0,X1] :
      ( ( singleton(X1) = X0
        | ( ( ~ in(sK2(X0,X1),X0)
            | sK2(X0,X1) != X1 )
          & ( in(sK2(X0,X1),X0)
            | sK2(X0,X1) = X1 ) ) )
      & ( ! [X3] :
            ( ( X1 = X3
              | ~ in(X3,X0) )
            & ( in(X3,X0)
              | X1 != X3 ) )
        | singleton(X1) != X0 ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f21,f22]) ).

fof(f22,plain,
    ! [X0,X1] :
      ( ? [X2] :
          ( ( ~ in(X2,X0)
            | X1 != X2 )
          & ( in(X2,X0)
            | X1 = X2 ) )
     => ( ( ~ in(sK2(X0,X1),X0)
          | sK2(X0,X1) != X1 )
        & ( in(sK2(X0,X1),X0)
          | sK2(X0,X1) = X1 ) ) ),
    introduced(choice_axiom,[]) ).

fof(f21,plain,
    ! [X0,X1] :
      ( ( singleton(X1) = X0
        | ? [X2] :
            ( ( ~ in(X2,X0)
              | X1 != X2 )
            & ( in(X2,X0)
              | X1 = X2 ) ) )
      & ( ! [X3] :
            ( ( X1 = X3
              | ~ in(X3,X0) )
            & ( in(X3,X0)
              | X1 != X3 ) )
        | singleton(X1) != X0 ) ),
    inference(rectify,[],[f20]) ).

fof(f20,plain,
    ! [X1,X0] :
      ( ( singleton(X0) = X1
        | ? [X2] :
            ( ( ~ in(X2,X1)
              | X0 != X2 )
            & ( in(X2,X1)
              | X0 = X2 ) ) )
      & ( ! [X2] :
            ( ( X0 = X2
              | ~ in(X2,X1) )
            & ( in(X2,X1)
              | X0 != X2 ) )
        | singleton(X0) != X1 ) ),
    inference(nnf_transformation,[],[f3]) ).

fof(f3,axiom,
    ! [X1,X0] :
      ( singleton(X0) = X1
    <=> ! [X2] :
          ( X0 = X2
        <=> in(X2,X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_tarski) ).

fof(f29,plain,
    ! [X0,X1] :
      ( in(X0,X1)
      | singleton(X0) != set_intersection2(X1,singleton(X0)) ),
    inference(cnf_transformation,[],[f17]) ).

fof(f17,plain,
    ! [X0,X1] :
      ( in(X0,X1)
      | singleton(X0) != set_intersection2(X1,singleton(X0)) ),
    inference(rectify,[],[f13]) ).

fof(f13,plain,
    ! [X1,X0] :
      ( in(X1,X0)
      | singleton(X1) != set_intersection2(X0,singleton(X1)) ),
    inference(ennf_transformation,[],[f5]) ).

fof(f5,axiom,
    ! [X1,X0] :
      ( singleton(X1) = set_intersection2(X0,singleton(X1))
     => in(X1,X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l30_zfmisc_1) ).

fof(f31,plain,
    singleton(sK0) = set_intersection2(singleton(sK0),singleton(sK1)),
    inference(cnf_transformation,[],[f19]) ).

fof(f19,plain,
    ( singleton(sK0) = set_intersection2(singleton(sK0),singleton(sK1))
    & sK1 != sK0 ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f15,f18]) ).

fof(f18,plain,
    ( ? [X0,X1] :
        ( singleton(X0) = set_intersection2(singleton(X0),singleton(X1))
        & X0 != X1 )
   => ( singleton(sK0) = set_intersection2(singleton(sK0),singleton(sK1))
      & sK1 != sK0 ) ),
    introduced(choice_axiom,[]) ).

fof(f15,plain,
    ? [X0,X1] :
      ( singleton(X0) = set_intersection2(singleton(X0),singleton(X1))
      & X0 != X1 ),
    inference(ennf_transformation,[],[f9]) ).

fof(f9,negated_conjecture,
    ~ ! [X0,X1] :
        ( singleton(X0) = set_intersection2(singleton(X0),singleton(X1))
       => X0 = X1 ),
    inference(negated_conjecture,[],[f8]) ).

fof(f8,conjecture,
    ! [X0,X1] :
      ( singleton(X0) = set_intersection2(singleton(X0),singleton(X1))
     => X0 = X1 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t18_zfmisc_1) ).

fof(f30,plain,
    sK1 != sK0,
    inference(cnf_transformation,[],[f19]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SET877+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/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 : n006.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:26:40 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.19/0.45  % (27481)dis+21_1:1_av=off:sos=on:sp=frequency:ss=included:to=lpo:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.19/0.47  % (27481)Refutation not found, incomplete strategy% (27481)------------------------------
% 0.19/0.47  % (27481)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.48  % (27503)dis+21_1:1_aac=none:abs=on:er=known:fde=none:fsr=off:nwc=5.0:s2a=on:s2at=4.0:sp=const_frequency:to=lpo:urr=ec_only:i=25:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/25Mi)
% 0.19/0.48  % (27495)dis-10_3:2_amm=sco:ep=RS:fsr=off:nm=10:sd=2:sos=on:ss=axioms:st=3.0:i=11:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/11Mi)
% 0.19/0.48  % (27481)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.48  % (27481)Termination reason: Refutation not found, incomplete strategy
% 0.19/0.48  
% 0.19/0.48  % (27481)Memory used [KB]: 1407
% 0.19/0.48  % (27481)Time elapsed: 0.093 s
% 0.19/0.48  % (27481)Instructions burned: 2 (million)
% 0.19/0.48  % (27481)------------------------------
% 0.19/0.48  % (27481)------------------------------
% 0.19/0.48  % (27495)Refutation not found, incomplete strategy% (27495)------------------------------
% 0.19/0.48  % (27495)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.48  % (27495)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.48  % (27495)Termination reason: Refutation not found, incomplete strategy
% 0.19/0.48  
% 0.19/0.48  % (27495)Memory used [KB]: 5884
% 0.19/0.48  % (27495)Time elapsed: 0.105 s
% 0.19/0.48  % (27495)Instructions burned: 1 (million)
% 0.19/0.48  % (27495)------------------------------
% 0.19/0.48  % (27495)------------------------------
% 0.19/0.48  % (27488)lrs+10_1:4_av=off:bs=unit_only:bsr=unit_only:ep=RS:s2a=on:sos=on:sp=frequency:to=lpo:i=16:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 0.19/0.48  % (27488)Refutation not found, incomplete strategy% (27488)------------------------------
% 0.19/0.48  % (27488)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.48  % (27488)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.48  % (27488)Termination reason: Refutation not found, incomplete strategy
% 0.19/0.48  
% 0.19/0.48  % (27488)Memory used [KB]: 1407
% 0.19/0.48  % (27488)Time elapsed: 0.102 s
% 0.19/0.48  % (27488)Instructions burned: 1 (million)
% 0.19/0.48  % (27488)------------------------------
% 0.19/0.48  % (27488)------------------------------
% 0.19/0.49  % (27503)First to succeed.
% 0.19/0.49  % (27503)Refutation found. Thanks to Tanya!
% 0.19/0.49  % SZS status Theorem for theBenchmark
% 0.19/0.49  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.49  % (27503)------------------------------
% 0.19/0.49  % (27503)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.49  % (27503)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.49  % (27503)Termination reason: Refutation
% 0.19/0.49  
% 0.19/0.49  % (27503)Memory used [KB]: 6012
% 0.19/0.49  % (27503)Time elapsed: 0.114 s
% 0.19/0.49  % (27503)Instructions burned: 4 (million)
% 0.19/0.49  % (27503)------------------------------
% 0.19/0.49  % (27503)------------------------------
% 0.19/0.49  % (27475)Success in time 0.143 s
%------------------------------------------------------------------------------