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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SYN368+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 : n015.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:09 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
fof(f8,plain,
    $false,
    inference(resolution,[],[f7,f6]) ).

fof(f6,plain,
    ! [X0] : big_p(X0),
    inference(cnf_transformation,[],[f5]) ).

fof(f5,plain,
    ! [X0] :
      ( ~ big_p(sK0(X0))
      & big_p(X0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f3,f4]) ).

fof(f4,plain,
    ! [X0] :
      ( ? [X1] :
          ( ~ big_p(X1)
          & big_p(X0) )
     => ( ~ big_p(sK0(X0))
        & big_p(X0) ) ),
    introduced(choice_axiom,[]) ).

fof(f3,plain,
    ! [X0] :
    ? [X1] :
      ( ~ big_p(X1)
      & big_p(X0) ),
    inference(ennf_transformation,[],[f2]) ).

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

fof(f1,conjecture,
    ? [X0] :
    ! [X1] :
      ( big_p(X0)
     => big_p(X1) ),
    file('/export/starexec/sandbox/tmp/tmp.V7CBznh5v7/Vampire---4.8_17918',x2119) ).

fof(f7,plain,
    ! [X0] : ~ big_p(sK0(X0)),
    inference(cnf_transformation,[],[f5]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09  % Problem    : SYN368+1 : TPTP v8.1.2. Released v2.0.0.
% 0.05/0.11  % 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.10/0.31  % Computer : n015.cluster.edu
% 0.10/0.31  % Model    : x86_64 x86_64
% 0.10/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31  % Memory   : 8042.1875MB
% 0.10/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31  % CPULimit   : 300
% 0.10/0.31  % WCLimit    : 300
% 0.10/0.31  % DateTime   : Tue Apr 30 17:44:33 EDT 2024
% 0.15/0.31  % CPUTime    : 
% 0.15/0.31  This is a FOF_THM_EPR_NEQ problem
% 0.15/0.31  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.V7CBznh5v7/Vampire---4.8_17918
% 0.60/0.79  % (18034)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 (2995ds/34Mi)
% 0.60/0.79  % (18033)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.60/0.79  % (18032)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.60/0.79  % (18030)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 (2995ds/34Mi)
% 0.60/0.79  % (18035)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.60/0.79  % (18031)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 (2995ds/51Mi)
% 0.60/0.79  % (18036)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 (2995ds/83Mi)
% 0.60/0.79  % (18037)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 (2995ds/56Mi)
% 0.60/0.79  % (18035)First to succeed.
% 0.60/0.79  % (18030)Also succeeded, but the first one will report.
% 0.60/0.79  % (18037)Also succeeded, but the first one will report.
% 0.60/0.80  % (18035)Refutation found. Thanks to Tanya!
% 0.60/0.80  % SZS status Theorem for Vampire---4
% 0.60/0.80  % SZS output start Proof for Vampire---4
% See solution above
% 0.60/0.80  % (18035)------------------------------
% 0.60/0.80  % (18035)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.80  % (18035)Termination reason: Refutation
% 0.60/0.80  
% 0.60/0.80  % (18035)Memory used [KB]: 955
% 0.60/0.80  % (18035)Time elapsed: 0.003 s
% 0.60/0.80  % (18035)Instructions burned: 2 (million)
% 0.60/0.80  % (18035)------------------------------
% 0.60/0.80  % (18035)------------------------------
% 0.60/0.80  % (18027)Success in time 0.481 s
% 0.60/0.80  % Vampire---4.8 exiting
%------------------------------------------------------------------------------