TSTP Solution File: SET600+3 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SET600+3 : TPTP v8.2.0. Released v2.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n025.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 May 21 03:12:19 EDT 2024

% Result   : Theorem 0.54s 0.75s
% Output   : Refutation 0.54s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   45 (   3 unt;   0 def)
%            Number of atoms       :  121 (  30 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :  130 (  54   ~;  64   |;   3   &)
%                                         (   8 <=>;   0  =>;   0  <=;   1 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   4 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   29 (  27   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f150,plain,
    $false,
    inference(avatar_sat_refutation,[],[f44,f49,f50,f73,f112,f149]) ).

fof(f149,plain,
    ( ~ spl4_1
    | spl4_3 ),
    inference(avatar_contradiction_clause,[],[f148]) ).

fof(f148,plain,
    ( $false
    | ~ spl4_1
    | spl4_3 ),
    inference(subsumption_resolution,[],[f120,f27]) ).

fof(f27,plain,
    ! [X0] : ~ member(X0,empty_set),
    inference(cnf_transformation,[],[f2]) ).

fof(f2,axiom,
    ! [X0] : ~ member(X0,empty_set),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',empty_set_defn) ).

fof(f120,plain,
    ( member(sK2(empty_set,sK0),empty_set)
    | ~ spl4_1
    | spl4_3 ),
    inference(unit_resulting_resolution,[],[f47,f118,f18]) ).

fof(f18,plain,
    ! [X0,X1] :
      ( member(sK2(X0,X1),X1)
      | member(sK2(X0,X1),X0)
      | X0 = X1 ),
    inference(cnf_transformation,[],[f8]) ).

fof(f8,axiom,
    ! [X0,X1] :
      ( X0 = X1
    <=> ! [X2] :
          ( member(X2,X0)
        <=> member(X2,X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_member_defn) ).

fof(f118,plain,
    ( ! [X0] : ~ member(X0,sK0)
    | ~ spl4_1 ),
    inference(subsumption_resolution,[],[f116,f27]) ).

fof(f116,plain,
    ( ! [X0] :
        ( member(X0,empty_set)
        | ~ member(X0,sK0) )
    | ~ spl4_1 ),
    inference(superposition,[],[f25,f39]) ).

fof(f39,plain,
    ( empty_set = union(sK0,sK1)
    | ~ spl4_1 ),
    inference(avatar_component_clause,[],[f37]) ).

fof(f37,plain,
    ( spl4_1
  <=> empty_set = union(sK0,sK1) ),
    introduced(avatar_definition,[new_symbols(naming,[spl4_1])]) ).

fof(f25,plain,
    ! [X2,X0,X1] :
      ( member(X2,union(X0,X1))
      | ~ member(X2,X0) ),
    inference(cnf_transformation,[],[f1]) ).

fof(f1,axiom,
    ! [X0,X1,X2] :
      ( member(X2,union(X0,X1))
    <=> ( member(X2,X1)
        | member(X2,X0) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',union_defn) ).

fof(f47,plain,
    ( empty_set != sK0
    | spl4_3 ),
    inference(avatar_component_clause,[],[f46]) ).

fof(f46,plain,
    ( spl4_3
  <=> empty_set = sK0 ),
    introduced(avatar_definition,[new_symbols(naming,[spl4_3])]) ).

fof(f112,plain,
    ( ~ spl4_1
    | spl4_2
    | ~ spl4_3 ),
    inference(avatar_contradiction_clause,[],[f111]) ).

fof(f111,plain,
    ( $false
    | ~ spl4_1
    | spl4_2
    | ~ spl4_3 ),
    inference(subsumption_resolution,[],[f81,f27]) ).

fof(f81,plain,
    ( member(sK2(empty_set,sK1),empty_set)
    | ~ spl4_1
    | spl4_2
    | ~ spl4_3 ),
    inference(unit_resulting_resolution,[],[f42,f80,f18]) ).

fof(f80,plain,
    ( ! [X0] : ~ member(X0,sK1)
    | ~ spl4_1
    | ~ spl4_3 ),
    inference(subsumption_resolution,[],[f79,f27]) ).

fof(f79,plain,
    ( ! [X0] :
        ( member(X0,empty_set)
        | ~ member(X0,sK1) )
    | ~ spl4_1
    | ~ spl4_3 ),
    inference(superposition,[],[f26,f74]) ).

fof(f74,plain,
    ( empty_set = union(empty_set,sK1)
    | ~ spl4_1
    | ~ spl4_3 ),
    inference(forward_demodulation,[],[f39,f48]) ).

fof(f48,plain,
    ( empty_set = sK0
    | ~ spl4_3 ),
    inference(avatar_component_clause,[],[f46]) ).

fof(f26,plain,
    ! [X2,X0,X1] :
      ( member(X2,union(X0,X1))
      | ~ member(X2,X1) ),
    inference(cnf_transformation,[],[f1]) ).

fof(f42,plain,
    ( empty_set != sK1
    | spl4_2 ),
    inference(avatar_component_clause,[],[f41]) ).

fof(f41,plain,
    ( spl4_2
  <=> empty_set = sK1 ),
    introduced(avatar_definition,[new_symbols(naming,[spl4_2])]) ).

fof(f73,plain,
    ( spl4_1
    | ~ spl4_2
    | ~ spl4_3 ),
    inference(avatar_contradiction_clause,[],[f72]) ).

fof(f72,plain,
    ( $false
    | spl4_1
    | ~ spl4_2
    | ~ spl4_3 ),
    inference(subsumption_resolution,[],[f66,f27]) ).

fof(f66,plain,
    ( member(sK2(empty_set,union(empty_set,empty_set)),empty_set)
    | spl4_1
    | ~ spl4_2
    | ~ spl4_3 ),
    inference(duplicate_literal_removal,[],[f65]) ).

fof(f65,plain,
    ( member(sK2(empty_set,union(empty_set,empty_set)),empty_set)
    | member(sK2(empty_set,union(empty_set,empty_set)),empty_set)
    | spl4_1
    | ~ spl4_2
    | ~ spl4_3 ),
    inference(resolution,[],[f53,f24]) ).

fof(f24,plain,
    ! [X2,X0,X1] :
      ( ~ member(X2,union(X0,X1))
      | member(X2,X1)
      | member(X2,X0) ),
    inference(cnf_transformation,[],[f1]) ).

fof(f53,plain,
    ( member(sK2(empty_set,union(empty_set,empty_set)),union(empty_set,empty_set))
    | spl4_1
    | ~ spl4_2
    | ~ spl4_3 ),
    inference(unit_resulting_resolution,[],[f27,f52,f18]) ).

fof(f52,plain,
    ( empty_set != union(empty_set,empty_set)
    | spl4_1
    | ~ spl4_2
    | ~ spl4_3 ),
    inference(forward_demodulation,[],[f51,f48]) ).

fof(f51,plain,
    ( empty_set != union(sK0,empty_set)
    | spl4_1
    | ~ spl4_2 ),
    inference(forward_demodulation,[],[f38,f43]) ).

fof(f43,plain,
    ( empty_set = sK1
    | ~ spl4_2 ),
    inference(avatar_component_clause,[],[f41]) ).

fof(f38,plain,
    ( empty_set != union(sK0,sK1)
    | spl4_1 ),
    inference(avatar_component_clause,[],[f37]) ).

fof(f50,plain,
    ( ~ spl4_1
    | ~ spl4_2
    | ~ spl4_3 ),
    inference(avatar_split_clause,[],[f13,f46,f41,f37]) ).

fof(f13,plain,
    ( empty_set != sK0
    | empty_set != sK1
    | empty_set != union(sK0,sK1) ),
    inference(cnf_transformation,[],[f11]) ).

fof(f11,plain,
    ? [X0,X1] :
      ( union(X0,X1) = empty_set
    <~> ( empty_set = X1
        & empty_set = X0 ) ),
    inference(ennf_transformation,[],[f10]) ).

fof(f10,negated_conjecture,
    ~ ! [X0,X1] :
        ( union(X0,X1) = empty_set
      <=> ( empty_set = X1
          & empty_set = X0 ) ),
    inference(negated_conjecture,[],[f9]) ).

fof(f9,conjecture,
    ! [X0,X1] :
      ( union(X0,X1) = empty_set
    <=> ( empty_set = X1
        & empty_set = X0 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th59) ).

fof(f49,plain,
    ( spl4_1
    | spl4_3 ),
    inference(avatar_split_clause,[],[f14,f46,f37]) ).

fof(f14,plain,
    ( empty_set = sK0
    | empty_set = union(sK0,sK1) ),
    inference(cnf_transformation,[],[f11]) ).

fof(f44,plain,
    ( spl4_1
    | spl4_2 ),
    inference(avatar_split_clause,[],[f15,f41,f37]) ).

fof(f15,plain,
    ( empty_set = sK1
    | empty_set = union(sK0,sK1) ),
    inference(cnf_transformation,[],[f11]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : SET600+3 : TPTP v8.2.0. Released v2.2.0.
% 0.07/0.15  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.13/0.36  % Computer : n025.cluster.edu
% 0.13/0.36  % Model    : x86_64 x86_64
% 0.13/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36  % Memory   : 8042.1875MB
% 0.13/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36  % CPULimit   : 300
% 0.13/0.36  % WCLimit    : 300
% 0.13/0.36  % DateTime   : Mon May 20 11:31:37 EDT 2024
% 0.13/0.36  % CPUTime    : 
% 0.13/0.36  This is a FOF_THM_RFO_SEQ problem
% 0.13/0.36  Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.54/0.75  % (26633)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.54/0.75  % (26634)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on theBenchmark for (2996ds/83Mi)
% 0.54/0.75  % (26635)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2996ds/56Mi)
% 0.54/0.75  % (26628)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on theBenchmark for (2996ds/34Mi)
% 0.54/0.75  % (26633)Refutation not found, incomplete strategy% (26633)------------------------------
% 0.54/0.75  % (26633)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.75  % (26633)Termination reason: Refutation not found, incomplete strategy
% 0.54/0.75  
% 0.54/0.75  % (26633)Memory used [KB]: 957
% 0.54/0.75  % (26633)Time elapsed: 0.002 s
% 0.54/0.75  % (26633)Instructions burned: 2 (million)
% 0.54/0.75  % (26629)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on theBenchmark for (2996ds/51Mi)
% 0.54/0.75  % (26633)------------------------------
% 0.54/0.75  % (26633)------------------------------
% 0.54/0.75  % (26635)Refutation not found, incomplete strategy% (26635)------------------------------
% 0.54/0.75  % (26635)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.75  % (26635)Termination reason: Refutation not found, incomplete strategy
% 0.54/0.75  
% 0.54/0.75  % (26635)Memory used [KB]: 980
% 0.54/0.75  % (26635)Time elapsed: 0.003 s
% 0.54/0.75  % (26635)Instructions burned: 2 (million)
% 0.54/0.75  % (26635)------------------------------
% 0.54/0.75  % (26635)------------------------------
% 0.54/0.75  % (26634)First to succeed.
% 0.54/0.75  % (26632)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on theBenchmark for (2996ds/34Mi)
% 0.54/0.75  % (26634)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-26626"
% 0.54/0.75  % (26636)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on theBenchmark for (2996ds/55Mi)
% 0.54/0.75  % (26634)Refutation found. Thanks to Tanya!
% 0.54/0.75  % SZS status Theorem for theBenchmark
% 0.54/0.75  % SZS output start Proof for theBenchmark
% See solution above
% 0.54/0.75  % (26634)------------------------------
% 0.54/0.75  % (26634)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.75  % (26634)Termination reason: Refutation
% 0.54/0.75  
% 0.54/0.75  % (26634)Memory used [KB]: 1071
% 0.54/0.75  % (26634)Time elapsed: 0.005 s
% 0.54/0.75  % (26634)Instructions burned: 6 (million)
% 0.54/0.75  % (26626)Success in time 0.383 s
% 0.54/0.75  % Vampire---4.8 exiting
%------------------------------------------------------------------------------