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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SYN413+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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n017.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:34:21 EDT 2024

% Result   : Theorem 0.57s 0.76s
% Output   : Refutation 0.57s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   16 (   4 unt;   0 def)
%            Number of atoms       :   65 (   0 equ)
%            Maximal formula atoms :   12 (   4 avg)
%            Number of connectives :   79 (  30   ~;  22   |;  20   &)
%                                         (   3 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   6 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   1 con; 0-1 aty)
%            Number of variables   :   48 (  34   !;  14   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f23,plain,
    $false,
    inference(resolution,[],[f22,f13]) ).

fof(f13,plain,
    ! [X1] : f(X1,sK0),
    inference(cnf_transformation,[],[f9]) ).

fof(f9,plain,
    ( ! [X1] : f(X1,sK0)
    & ! [X2,X4] :
        ( ( f(X4,sK1(X2))
          | f(X4,X4)
          | ~ f(X4,X2) )
        & ( ( ~ f(X4,X4)
            & f(X4,X2) )
          | ~ f(X4,sK1(X2)) ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f6,f8,f7]) ).

fof(f7,plain,
    ( ? [X0] :
      ! [X1] : f(X1,X0)
   => ! [X1] : f(X1,sK0) ),
    introduced(choice_axiom,[]) ).

fof(f8,plain,
    ! [X2] :
      ( ? [X3] :
        ! [X4] :
          ( ( f(X4,X3)
            | f(X4,X4)
            | ~ f(X4,X2) )
          & ( ( ~ f(X4,X4)
              & f(X4,X2) )
            | ~ f(X4,X3) ) )
     => ! [X4] :
          ( ( f(X4,sK1(X2))
            | f(X4,X4)
            | ~ f(X4,X2) )
          & ( ( ~ f(X4,X4)
              & f(X4,X2) )
            | ~ f(X4,sK1(X2)) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f6,plain,
    ( ? [X0] :
      ! [X1] : f(X1,X0)
    & ! [X2] :
      ? [X3] :
      ! [X4] :
        ( ( f(X4,X3)
          | f(X4,X4)
          | ~ f(X4,X2) )
        & ( ( ~ f(X4,X4)
            & f(X4,X2) )
          | ~ f(X4,X3) ) ) ),
    inference(rectify,[],[f5]) ).

fof(f5,plain,
    ( ? [X3] :
      ! [X4] : f(X4,X3)
    & ! [X0] :
      ? [X1] :
      ! [X2] :
        ( ( f(X2,X1)
          | f(X2,X2)
          | ~ f(X2,X0) )
        & ( ( ~ f(X2,X2)
            & f(X2,X0) )
          | ~ f(X2,X1) ) ) ),
    inference(flattening,[],[f4]) ).

fof(f4,plain,
    ( ? [X3] :
      ! [X4] : f(X4,X3)
    & ! [X0] :
      ? [X1] :
      ! [X2] :
        ( ( f(X2,X1)
          | f(X2,X2)
          | ~ f(X2,X0) )
        & ( ( ~ f(X2,X2)
            & f(X2,X0) )
          | ~ f(X2,X1) ) ) ),
    inference(nnf_transformation,[],[f3]) ).

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

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

fof(f1,conjecture,
    ( ! [X0] :
      ? [X1] :
      ! [X2] :
        ( f(X2,X1)
      <=> ( ~ f(X2,X2)
          & f(X2,X0) ) )
   => ~ ? [X3] :
        ! [X4] : f(X4,X3) ),
    file('/export/starexec/sandbox/tmp/tmp.4laC68ZNNW/Vampire---4.8_6780',kalish256) ).

fof(f22,plain,
    ! [X0] : ~ f(sK1(X0),X0),
    inference(subsumption_resolution,[],[f21,f15]) ).

fof(f15,plain,
    ! [X0] : ~ f(sK1(X0),sK1(X0)),
    inference(factoring,[],[f11]) ).

fof(f11,plain,
    ! [X2,X4] :
      ( ~ f(X4,X4)
      | ~ f(X4,sK1(X2)) ),
    inference(cnf_transformation,[],[f9]) ).

fof(f21,plain,
    ! [X0] :
      ( f(sK1(X0),sK1(X0))
      | ~ f(sK1(X0),X0) ),
    inference(resolution,[],[f15,f12]) ).

fof(f12,plain,
    ! [X2,X4] :
      ( f(X4,sK1(X2))
      | f(X4,X4)
      | ~ f(X4,X2) ),
    inference(cnf_transformation,[],[f9]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : SYN413+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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.16/0.36  % Computer : n017.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 16:56:49 EDT 2024
% 0.16/0.36  % CPUTime    : 
% 0.16/0.36  This is a FOF_THM_RFO_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.4laC68ZNNW/Vampire---4.8_6780
% 0.57/0.75  % (7041)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.57/0.76  % (7041)First to succeed.
% 0.57/0.76  % (7040)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.57/0.76  % (7034)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.57/0.76  % (7036)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.57/0.76  % (7035)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.57/0.76  % (7037)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.57/0.76  % (7038)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.57/0.76  % (7039)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.57/0.76  % (7041)Refutation found. Thanks to Tanya!
% 0.57/0.76  % SZS status Theorem for Vampire---4
% 0.57/0.76  % SZS output start Proof for Vampire---4
% See solution above
% 0.57/0.76  % (7041)------------------------------
% 0.57/0.76  % (7041)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.57/0.76  % (7041)Termination reason: Refutation
% 0.57/0.76  
% 0.57/0.76  % (7041)Memory used [KB]: 972
% 0.57/0.76  % (7041)Time elapsed: 0.002 s
% 0.57/0.76  % (7041)Instructions burned: 3 (million)
% 0.57/0.76  % (7041)------------------------------
% 0.57/0.76  % (7041)------------------------------
% 0.57/0.76  % (7029)Success in time 0.386 s
% 0.57/0.76  % Vampire---4.8 exiting
%------------------------------------------------------------------------------