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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SYN926+1 : TPTP v8.1.2. Released v3.1.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 : n007.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 May  1 04:45:01 EDT 2024

% Result   : Theorem 0.55s 0.75s
% Output   : Refutation 0.55s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   22 (   5 unt;   0 def)
%            Number of atoms       :   47 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   47 (  22   ~;  10   |;   8   &)
%                                         (   4 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    7 (   6 usr;   5 prp; 0-1 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :   21 (  11   !;  10   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f30,plain,
    $false,
    inference(avatar_sat_refutation,[],[f17,f21,f25,f29]) ).

fof(f29,plain,
    ~ spl2_2,
    inference(avatar_contradiction_clause,[],[f26]) ).

fof(f26,plain,
    ( $false
    | ~ spl2_2 ),
    inference(unit_resulting_resolution,[],[f6,f16]) ).

fof(f16,plain,
    ( ! [X1] : ~ q(X1)
    | ~ spl2_2 ),
    inference(avatar_component_clause,[],[f15]) ).

fof(f15,plain,
    ( spl2_2
  <=> ! [X1] : ~ q(X1) ),
    introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).

fof(f6,plain,
    q(sK0),
    inference(cnf_transformation,[],[f4]) ).

fof(f4,plain,
    ( ( ! [X1] : ~ q(X1)
      | ! [X2] : ~ p(X2) )
    & ? [X0] :
        ( q(X0)
        & p(X0) ) ),
    inference(ennf_transformation,[],[f3]) ).

fof(f3,plain,
    ~ ( ? [X0] :
          ( q(X0)
          & p(X0) )
     => ( ? [X1] : q(X1)
        & ? [X2] : p(X2) ) ),
    inference(rectify,[],[f2]) ).

fof(f2,negated_conjecture,
    ~ ( ? [X0] :
          ( q(X0)
          & p(X0) )
     => ( ? [X0] : q(X0)
        & ? [X0] : p(X0) ) ),
    inference(negated_conjecture,[],[f1]) ).

fof(f1,conjecture,
    ( ? [X0] :
        ( q(X0)
        & p(X0) )
   => ( ? [X0] : q(X0)
      & ? [X0] : p(X0) ) ),
    file('/export/starexec/sandbox/tmp/tmp.pcbDRZ5t7P/Vampire---4.8_5852',prove_this) ).

fof(f25,plain,
    ~ spl2_3,
    inference(avatar_contradiction_clause,[],[f22]) ).

fof(f22,plain,
    ( $false
    | ~ spl2_3 ),
    inference(unit_resulting_resolution,[],[f5,f20]) ).

fof(f20,plain,
    ( ! [X2] : ~ p(X2)
    | ~ spl2_3 ),
    inference(avatar_component_clause,[],[f19]) ).

fof(f19,plain,
    ( spl2_3
  <=> ! [X2] : ~ p(X2) ),
    introduced(avatar_definition,[new_symbols(naming,[spl2_3])]) ).

fof(f5,plain,
    p(sK0),
    inference(cnf_transformation,[],[f4]) ).

fof(f21,plain,
    ( spl2_1
    | spl2_3 ),
    inference(avatar_split_clause,[],[f8,f19,f11]) ).

fof(f11,plain,
    ( spl2_1
  <=> sP1 ),
    introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).

fof(f8,plain,
    ! [X2] :
      ( ~ p(X2)
      | sP1 ),
    inference(cnf_transformation,[],[f8_D]) ).

fof(f8_D,plain,
    ( ! [X2] : ~ p(X2)
  <=> ~ sP1 ),
    introduced(general_splitting_component_introduction,[new_symbols(naming,[sP1])]) ).

fof(f17,plain,
    ( ~ spl2_1
    | spl2_2 ),
    inference(avatar_split_clause,[],[f9,f15,f11]) ).

fof(f9,plain,
    ! [X1] :
      ( ~ q(X1)
      | ~ sP1 ),
    inference(general_splitting,[],[f7,f8_D]) ).

fof(f7,plain,
    ! [X2,X1] :
      ( ~ p(X2)
      | ~ q(X1) ),
    inference(cnf_transformation,[],[f4]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem    : SYN926+1 : TPTP v8.1.2. Released v3.1.0.
% 0.12/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.16/0.36  % Computer : n007.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   : Tue Apr 30 17:17:03 EDT 2024
% 0.16/0.37  % CPUTime    : 
% 0.16/0.37  This is a FOF_THM_EPR_NEQ problem
% 0.16/0.37  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/tmp/tmp.pcbDRZ5t7P/Vampire---4.8_5852
% 0.55/0.75  % (6108)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.55/0.75  % (6108)First to succeed.
% 0.55/0.75  % (6102)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.55/0.75  % (6103)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.55/0.75  % (6107)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.55/0.75  % (6105)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.55/0.75  % (6109)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.55/0.75  % (6102)Also succeeded, but the first one will report.
% 0.55/0.75  % (6106)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.55/0.75  % (6108)Refutation found. Thanks to Tanya!
% 0.55/0.75  % SZS status Theorem for Vampire---4
% 0.55/0.75  % SZS output start Proof for Vampire---4
% See solution above
% 0.55/0.75  % (6108)------------------------------
% 0.55/0.75  % (6108)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.55/0.75  % (6108)Termination reason: Refutation
% 0.55/0.75  
% 0.55/0.75  % (6108)Memory used [KB]: 967
% 0.55/0.75  % (6108)Time elapsed: 0.002 s
% 0.55/0.75  % (6108)Instructions burned: 2 (million)
% 0.55/0.75  % (6108)------------------------------
% 0.55/0.75  % (6108)------------------------------
% 0.55/0.75  % (6098)Success in time 0.377 s
% 0.55/0.75  % Vampire---4.8 exiting
%------------------------------------------------------------------------------