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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SYN411+1 : TPTP v8.1.2. 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 : Sun May  5 11:57:18 EDT 2024

% Result   : Theorem 0.59s 0.74s
% Output   : Refutation 0.59s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   23 (   1 unt;   0 def)
%            Number of atoms       :   53 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   56 (  26   ~;  19   |;   3   &)
%                                         (   5 <=>;   2  =>;   0  <=;   1 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   4 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   6 con; 0-0 aty)
%            Number of variables   :   66 (  42   !;  24   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f28,plain,
    $false,
    inference(avatar_sat_refutation,[],[f19,f23,f25,f27]) ).

fof(f27,plain,
    ( spl6_2
    | ~ spl6_3 ),
    inference(avatar_contradiction_clause,[],[f26]) ).

fof(f26,plain,
    ( $false
    | spl6_2
    | ~ spl6_3 ),
    inference(subsumption_resolution,[],[f18,f22]) ).

fof(f22,plain,
    ( ! [X10,X11,X9] : f(X9,X10,X11)
    | ~ spl6_3 ),
    inference(avatar_component_clause,[],[f21]) ).

fof(f21,plain,
    ( spl6_3
  <=> ! [X9,X11,X10] : f(X9,X10,X11) ),
    introduced(avatar_definition,[new_symbols(naming,[spl6_3])]) ).

fof(f18,plain,
    ( ~ f(sK0,sK1,sK2)
    | spl6_2 ),
    inference(avatar_component_clause,[],[f16]) ).

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

fof(f25,plain,
    ( spl6_1
    | ~ spl6_3 ),
    inference(avatar_contradiction_clause,[],[f24]) ).

fof(f24,plain,
    ( $false
    | spl6_1
    | ~ spl6_3 ),
    inference(subsumption_resolution,[],[f14,f22]) ).

fof(f14,plain,
    ( ~ f(sK3,sK4,sK5)
    | spl6_1 ),
    inference(avatar_component_clause,[],[f12]) ).

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

fof(f23,plain,
    ( spl6_3
    | spl6_3 ),
    inference(avatar_split_clause,[],[f9,f21,f21]) ).

fof(f9,plain,
    ! [X10,X11,X8,X6,X9,X7] :
      ( f(X6,X7,X8)
      | f(X9,X10,X11) ),
    inference(cnf_transformation,[],[f8]) ).

fof(f8,plain,
    ( ( ~ f(sK0,sK1,sK2)
      | ~ f(sK3,sK4,sK5) )
    & ( ! [X6,X7,X8] : f(X6,X7,X8)
      | ! [X9,X10,X11] : f(X9,X10,X11) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5])],[f5,f7,f6]) ).

fof(f6,plain,
    ( ? [X0,X1,X2] : ~ f(X0,X1,X2)
   => ~ f(sK0,sK1,sK2) ),
    introduced(choice_axiom,[]) ).

fof(f7,plain,
    ( ? [X3,X4,X5] : ~ f(X3,X4,X5)
   => ~ f(sK3,sK4,sK5) ),
    introduced(choice_axiom,[]) ).

fof(f5,plain,
    ( ( ? [X0,X1,X2] : ~ f(X0,X1,X2)
      | ? [X3,X4,X5] : ~ f(X3,X4,X5) )
    & ( ! [X6,X7,X8] : f(X6,X7,X8)
      | ! [X9,X10,X11] : f(X9,X10,X11) ) ),
    inference(rectify,[],[f4]) ).

fof(f4,plain,
    ( ( ? [X3,X4,X5] : ~ f(X3,X4,X5)
      | ? [X0,X1,X2] : ~ f(X0,X1,X2) )
    & ( ! [X3,X4,X5] : f(X3,X4,X5)
      | ! [X0,X1,X2] : f(X0,X1,X2) ) ),
    inference(nnf_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/tmp/tmp.ngg8Kn9DqD/Vampire---4.8_3280',kalish250) ).

fof(f19,plain,
    ( ~ spl6_1
    | ~ spl6_2 ),
    inference(avatar_split_clause,[],[f10,f16,f12]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : SYN411+1 : TPTP v8.1.2. Released v2.0.0.
% 0.07/0.15  % 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.16/0.36  % Computer : n019.cluster.edu
% 0.16/0.36  % Model    : x86_64 x86_64
% 0.16/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36  % Memory   : 8042.1875MB
% 0.16/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36  % CPULimit   : 300
% 0.16/0.36  % WCLimit    : 300
% 0.16/0.36  % DateTime   : Fri May  3 17:24:23 EDT 2024
% 0.16/0.36  % CPUTime    : 
% 0.16/0.36  This is a FOF_THM_EPR_NEQ problem
% 0.16/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/tmp/tmp.ngg8Kn9DqD/Vampire---4.8_3280
% 0.59/0.74  % (3627)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2996ds/56Mi)
% 0.59/0.74  % (3627)First to succeed.
% 0.59/0.74  % (3620)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 Vampire---4 for (2996ds/34Mi)
% 0.59/0.74  % (3627)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3544"
% 0.59/0.74  % (3623)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.59/0.74  % (3624)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 Vampire---4 for (2996ds/34Mi)
% 0.59/0.74  % (3625)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.59/0.74  % (3621)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 Vampire---4 for (2996ds/51Mi)
% 0.59/0.74  % (3626)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 Vampire---4 for (2996ds/83Mi)
% 0.59/0.74  % (3622)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.59/0.74  % (3627)Refutation found. Thanks to Tanya!
% 0.59/0.74  % SZS status Theorem for Vampire---4
% 0.59/0.74  % SZS output start Proof for Vampire---4
% See solution above
% 0.59/0.74  % (3627)------------------------------
% 0.59/0.74  % (3627)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.74  % (3627)Termination reason: Refutation
% 0.59/0.74  
% 0.59/0.74  % (3627)Memory used [KB]: 964
% 0.59/0.74  % (3627)Time elapsed: 0.002 s
% 0.59/0.74  % (3627)Instructions burned: 2 (million)
% 0.59/0.74  % (3544)Success in time 0.377 s
% 0.59/0.75  % Vampire---4.8 exiting
%------------------------------------------------------------------------------