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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SYN927+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 : n026.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 12:07:52 EDT 2024

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

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

fof(f4,plain,
    ! [X1] : p(X1),
    inference(cnf_transformation,[],[f3]) ).

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

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

fof(f1,conjecture,
    ! [X0] :
      ( ! [X1] : p(X1)
     => p(X0) ),
    file('/export/starexec/sandbox/tmp/tmp.Npu07Xu0wG/Vampire---4.8_16071',prove_this) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.13  % Problem    : SYN927+1 : TPTP v8.1.2. Released v3.1.0.
% 0.09/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.15/0.37  % Computer : n026.cluster.edu
% 0.15/0.37  % Model    : x86_64 x86_64
% 0.15/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37  % Memory   : 8042.1875MB
% 0.15/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37  % CPULimit   : 300
% 0.15/0.37  % WCLimit    : 300
% 0.15/0.37  % DateTime   : Fri May  3 17:10:08 EDT 2024
% 0.15/0.37  % CPUTime    : 
% 0.15/0.37  This is a FOF_THM_EPR_NEQ problem
% 0.15/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.Npu07Xu0wG/Vampire---4.8_16071
% 0.63/0.81  % (16330)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.63/0.81  % (16330)First to succeed.
% 0.63/0.81  % (16330)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-16320"
% 0.63/0.81  % (16324)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.63/0.81  % (16325)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.63/0.81  % (16327)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.63/0.81  % (16326)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.63/0.81  % (16329)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.63/0.82  % (16330)Refutation found. Thanks to Tanya!
% 0.63/0.82  % SZS status Theorem for Vampire---4
% 0.63/0.82  % SZS output start Proof for Vampire---4
% See solution above
% 0.63/0.82  % (16330)------------------------------
% 0.63/0.82  % (16330)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.63/0.82  % (16330)Termination reason: Refutation
% 0.63/0.82  
% 0.63/0.82  % (16330)Memory used [KB]: 954
% 0.63/0.82  % (16330)Time elapsed: 0.002 s
% 0.63/0.82  % (16330)Instructions burned: 2 (million)
% 0.63/0.82  % (16320)Success in time 0.438 s
% 0.63/0.82  % Vampire---4.8 exiting
%------------------------------------------------------------------------------