TSTP Solution File: SYN411+1 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SYN411+1 : TPTP v8.2.0. Released v2.0.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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n019.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 08:22:18 EDT 2024

% Result   : Theorem 0.58s 0.74s
% Output   : Refutation 0.58s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   38 (   1 unt;   0 def)
%            Number of atoms       :   79 (   0 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   77 (  36   ~;  30   |;   0   &)
%                                         (  10 <=>;   0  =>;   0  <=;   1 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   10 (   9 usr;   7 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   6 con; 0-0 aty)
%            Number of variables   :   58 (  52   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f58,plain,
    $false,
    inference(avatar_sat_refutation,[],[f19,f23,f32,f43,f50,f55,f57]) ).

fof(f57,plain,
    ( ~ spl9_2
    | spl9_5 ),
    inference(avatar_contradiction_clause,[],[f56]) ).

fof(f56,plain,
    ( $false
    | ~ spl9_2
    | spl9_5 ),
    inference(subsumption_resolution,[],[f31,f18]) ).

fof(f18,plain,
    ( ! [X3,X4,X5] : f(X3,X4,X5)
    | ~ spl9_2 ),
    inference(avatar_component_clause,[],[f17]) ).

fof(f17,plain,
    ( spl9_2
  <=> ! [X4,X5,X3] : f(X3,X4,X5) ),
    introduced(avatar_definition,[new_symbols(naming,[spl9_2])]) ).

fof(f31,plain,
    ( ~ f(sK3,sK4,sK5)
    | spl9_5 ),
    inference(avatar_component_clause,[],[f29]) ).

fof(f29,plain,
    ( spl9_5
  <=> f(sK3,sK4,sK5) ),
    introduced(avatar_definition,[new_symbols(naming,[spl9_5])]) ).

fof(f55,plain,
    ( ~ spl9_3
    | spl9_4 ),
    inference(avatar_contradiction_clause,[],[f54]) ).

fof(f54,plain,
    ( $false
    | ~ spl9_3
    | spl9_4 ),
    inference(subsumption_resolution,[],[f48,f33]) ).

fof(f33,plain,
    ( ! [X0,X1] : ~ sP6(X0,X1)
    | ~ spl9_3 ),
    inference(unit_resulting_resolution,[],[f22,f8]) ).

fof(f8,plain,
    ! [X0,X1] :
      ( ~ sP6(X0,X1)
      | sP7(X1) ),
    inference(cnf_transformation,[],[f8_D]) ).

fof(f8_D,plain,
    ! [X1] :
      ( ! [X0] : ~ sP6(X0,X1)
    <=> ~ sP7(X1) ),
    introduced(general_splitting_component_introduction,[new_symbols(naming,[sP7])]) ).

fof(f22,plain,
    ( ! [X1] : ~ sP7(X1)
    | ~ spl9_3 ),
    inference(avatar_component_clause,[],[f21]) ).

fof(f21,plain,
    ( spl9_3
  <=> ! [X1] : ~ sP7(X1) ),
    introduced(avatar_definition,[new_symbols(naming,[spl9_3])]) ).

fof(f48,plain,
    ( sP6(sK0,sK1)
    | spl9_4 ),
    inference(resolution,[],[f27,f6]) ).

fof(f6,plain,
    ! [X2,X0,X1] :
      ( f(X0,X1,X2)
      | sP6(X0,X1) ),
    inference(cnf_transformation,[],[f6_D]) ).

fof(f6_D,plain,
    ! [X1,X0] :
      ( ! [X2] : f(X0,X1,X2)
    <=> ~ sP6(X0,X1) ),
    introduced(general_splitting_component_introduction,[new_symbols(naming,[sP6])]) ).

fof(f27,plain,
    ( ~ f(sK0,sK1,sK2)
    | spl9_4 ),
    inference(avatar_component_clause,[],[f25]) ).

fof(f25,plain,
    ( spl9_4
  <=> f(sK0,sK1,sK2) ),
    introduced(avatar_definition,[new_symbols(naming,[spl9_4])]) ).

fof(f50,plain,
    ( ~ spl9_2
    | spl9_4 ),
    inference(avatar_contradiction_clause,[],[f44]) ).

fof(f44,plain,
    ( $false
    | ~ spl9_2
    | spl9_4 ),
    inference(unit_resulting_resolution,[],[f18,f27]) ).

fof(f43,plain,
    ( ~ spl9_3
    | spl9_5 ),
    inference(avatar_contradiction_clause,[],[f42]) ).

fof(f42,plain,
    ( $false
    | ~ spl9_3
    | spl9_5 ),
    inference(subsumption_resolution,[],[f37,f33]) ).

fof(f37,plain,
    ( sP6(sK3,sK4)
    | spl9_5 ),
    inference(resolution,[],[f6,f31]) ).

fof(f32,plain,
    ( ~ spl9_4
    | ~ spl9_5 ),
    inference(avatar_split_clause,[],[f5,f29,f25]) ).

fof(f5,plain,
    ( ~ f(sK3,sK4,sK5)
    | ~ f(sK0,sK1,sK2) ),
    inference(cnf_transformation,[],[f3]) ).

fof(f3,plain,
    ( ! [X0,X1,X2] : f(X0,X1,X2)
  <~> ! [X3,X4,X5] : f(X3,X4,X5) ),
    inference(ennf_transformation,[],[f2]) ).

fof(f2,negated_conjecture,
    ~ ( ! [X0,X1,X2] : f(X0,X1,X2)
    <=> ~ ? [X3,X4,X5] : ~ f(X3,X4,X5) ),
    inference(negated_conjecture,[],[f1]) ).

fof(f1,conjecture,
    ( ! [X0,X1,X2] : f(X0,X1,X2)
  <=> ~ ? [X3,X4,X5] : ~ f(X3,X4,X5) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',kalish250) ).

fof(f23,plain,
    ( spl9_1
    | spl9_3 ),
    inference(avatar_split_clause,[],[f10,f21,f13]) ).

fof(f13,plain,
    ( spl9_1
  <=> sP8 ),
    introduced(avatar_definition,[new_symbols(naming,[spl9_1])]) ).

fof(f10,plain,
    ! [X1] :
      ( ~ sP7(X1)
      | sP8 ),
    inference(cnf_transformation,[],[f10_D]) ).

fof(f10_D,plain,
    ( ! [X1] : ~ sP7(X1)
  <=> ~ sP8 ),
    introduced(general_splitting_component_introduction,[new_symbols(naming,[sP8])]) ).

fof(f19,plain,
    ( ~ spl9_1
    | spl9_2 ),
    inference(avatar_split_clause,[],[f11,f17,f13]) ).

fof(f11,plain,
    ! [X3,X4,X5] :
      ( f(X3,X4,X5)
      | ~ sP8 ),
    inference(general_splitting,[],[f9,f10_D]) ).

fof(f9,plain,
    ! [X3,X1,X4,X5] :
      ( f(X3,X4,X5)
      | ~ sP7(X1) ),
    inference(general_splitting,[],[f7,f8_D]) ).

fof(f7,plain,
    ! [X3,X0,X1,X4,X5] :
      ( f(X3,X4,X5)
      | ~ sP6(X0,X1) ),
    inference(general_splitting,[],[f4,f6_D]) ).

fof(f4,plain,
    ! [X2,X3,X0,X1,X4,X5] :
      ( f(X3,X4,X5)
      | f(X0,X1,X2) ),
    inference(cnf_transformation,[],[f3]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem    : SYN411+1 : TPTP v8.2.0. Released v2.0.0.
% 0.12/0.14  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.35  % Computer : n019.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Mon May 20 14:48:53 EDT 2024
% 0.14/0.36  % CPUTime    : 
% 0.14/0.36  This is a FOF_THM_EPR_NEQ problem
% 0.14/0.36  Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.58/0.74  % (14570)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.58/0.74  % (14564)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.58/0.74  % (14565)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.58/0.74  % (14567)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.58/0.74  % (14566)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.58/0.74  % (14570)First to succeed.
% 0.58/0.74  % (14568)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.58/0.74  % (14569)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.58/0.74  % (14570)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-14533"
% 0.58/0.74  % (14566)Also succeeded, but the first one will report.
% 0.58/0.74  % (14564)Also succeeded, but the first one will report.
% 0.58/0.74  % (14567)Also succeeded, but the first one will report.
% 0.58/0.74  % (14570)Refutation found. Thanks to Tanya!
% 0.58/0.74  % SZS status Theorem for theBenchmark
% 0.58/0.74  % SZS output start Proof for theBenchmark
% See solution above
% 0.58/0.74  % (14570)------------------------------
% 0.58/0.74  % (14570)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.74  % (14570)Termination reason: Refutation
% 0.58/0.74  
% 0.58/0.74  % (14570)Memory used [KB]: 982
% 0.58/0.74  % (14570)Time elapsed: 0.002 s
% 0.58/0.74  % (14570)Instructions burned: 3 (million)
% 0.58/0.74  % (14533)Success in time 0.376 s
% 0.58/0.74  % Vampire---4.8 exiting
%------------------------------------------------------------------------------