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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SYN361+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 : n011.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:08 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
fof(f16,plain,
    $false,
    inference(resolution,[],[f15,f10]) ).

fof(f10,plain,
    ! [X6] : big_p(X6,sK1),
    inference(cnf_transformation,[],[f9]) ).

fof(f9,plain,
    ( ! [X0] : big_s(X0)
    & ! [X1,X2] :
        ( ~ big_q(X1,X2)
        | ~ big_p(X1,X2) )
    & ! [X3] :
        ( big_q(sK0(X3),X3)
        | ~ big_s(X3) )
    & ! [X6] : big_p(X6,sK1) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f6,f8,f7]) ).

fof(f7,plain,
    ! [X3] :
      ( ? [X4] : big_q(X4,X3)
     => big_q(sK0(X3),X3) ),
    introduced(choice_axiom,[]) ).

fof(f8,plain,
    ( ? [X5] :
      ! [X6] : big_p(X6,X5)
   => ! [X6] : big_p(X6,sK1) ),
    introduced(choice_axiom,[]) ).

fof(f6,plain,
    ( ! [X0] : big_s(X0)
    & ! [X1,X2] :
        ( ~ big_q(X1,X2)
        | ~ big_p(X1,X2) )
    & ! [X3] :
        ( ? [X4] : big_q(X4,X3)
        | ~ big_s(X3) )
    & ? [X5] :
      ! [X6] : big_p(X6,X5) ),
    inference(rectify,[],[f5]) ).

fof(f5,plain,
    ( ! [X6] : big_s(X6)
    & ! [X0,X1] :
        ( ~ big_q(X0,X1)
        | ~ big_p(X0,X1) )
    & ! [X2] :
        ( ? [X3] : big_q(X3,X2)
        | ~ big_s(X2) )
    & ? [X4] :
      ! [X5] : big_p(X5,X4) ),
    inference(flattening,[],[f4]) ).

fof(f4,plain,
    ( ! [X6] : big_s(X6)
    & ! [X0,X1] :
        ( ~ big_q(X0,X1)
        | ~ big_p(X0,X1) )
    & ! [X2] :
        ( ? [X3] : big_q(X3,X2)
        | ~ big_s(X2) )
    & ? [X4] :
      ! [X5] : big_p(X5,X4) ),
    inference(ennf_transformation,[],[f3]) ).

fof(f3,plain,
    ~ ( ( ! [X0,X1] :
            ( big_p(X0,X1)
           => ~ big_q(X0,X1) )
        & ! [X2] :
            ( big_s(X2)
           => ? [X3] : big_q(X3,X2) )
        & ? [X4] :
          ! [X5] : big_p(X5,X4) )
     => ? [X6] : ~ big_s(X6) ),
    inference(rectify,[],[f2]) ).

fof(f2,negated_conjecture,
    ~ ( ( ! [X1,X2] :
            ( big_p(X1,X2)
           => ~ big_q(X1,X2) )
        & ! [X1] :
            ( big_s(X1)
           => ? [X2] : big_q(X2,X1) )
        & ? [X0] :
          ! [X1] : big_p(X1,X0) )
     => ? [X3] : ~ big_s(X3) ),
    inference(negated_conjecture,[],[f1]) ).

fof(f1,conjecture,
    ( ( ! [X1,X2] :
          ( big_p(X1,X2)
         => ~ big_q(X1,X2) )
      & ! [X1] :
          ( big_s(X1)
         => ? [X2] : big_q(X2,X1) )
      & ? [X0] :
        ! [X1] : big_p(X1,X0) )
   => ? [X3] : ~ big_s(X3) ),
    file('/export/starexec/sandbox2/tmp/tmp.FGmER15LVS/Vampire---4.8_5326',x2112) ).

fof(f15,plain,
    ! [X0] : ~ big_p(sK0(X0),X0),
    inference(resolution,[],[f12,f14]) ).

fof(f14,plain,
    ! [X3] : big_q(sK0(X3),X3),
    inference(subsumption_resolution,[],[f11,f13]) ).

fof(f13,plain,
    ! [X0] : big_s(X0),
    inference(cnf_transformation,[],[f9]) ).

fof(f11,plain,
    ! [X3] :
      ( big_q(sK0(X3),X3)
      | ~ big_s(X3) ),
    inference(cnf_transformation,[],[f9]) ).

fof(f12,plain,
    ! [X2,X1] :
      ( ~ big_q(X1,X2)
      | ~ big_p(X1,X2) ),
    inference(cnf_transformation,[],[f9]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : SYN361+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 : n011.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.37  % DateTime   : Tue Apr 30 17:30:32 EDT 2024
% 0.16/0.37  % CPUTime    : 
% 0.16/0.37  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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.FGmER15LVS/Vampire---4.8_5326
% 0.53/0.75  % (5502)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.53/0.75  % (5509)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.53/0.75  % (5509)First to succeed.
% 0.53/0.75  % (5502)Also succeeded, but the first one will report.
% 0.53/0.75  % (5504)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.53/0.75  % (5503)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.53/0.75  % (5506)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.53/0.75  % (5505)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.53/0.75  % (5507)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.53/0.75  % (5508)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.53/0.75  % (5509)Refutation found. Thanks to Tanya!
% 0.53/0.75  % SZS status Theorem for Vampire---4
% 0.53/0.75  % SZS output start Proof for Vampire---4
% See solution above
% 0.53/0.75  % (5509)------------------------------
% 0.53/0.75  % (5509)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.53/0.75  % (5509)Termination reason: Refutation
% 0.53/0.75  
% 0.53/0.75  % (5509)Memory used [KB]: 958
% 0.53/0.75  % (5509)Time elapsed: 0.002 s
% 0.53/0.75  % (5509)Instructions burned: 2 (million)
% 0.53/0.75  % (5509)------------------------------
% 0.53/0.75  % (5509)------------------------------
% 0.53/0.75  % (5492)Success in time 0.376 s
% 0.59/0.75  % Vampire---4.8 exiting
%------------------------------------------------------------------------------