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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SYN064+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 : n002.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:33:08 EDT 2024

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

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

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

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

fof(f4,plain,
    ( ? [X2,X3] : ~ big_p(X2,X3)
   => ~ big_p(sK0,sK1) ),
    introduced(choice_axiom,[]) ).

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

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

fof(f1,conjecture,
    ? [X0,X1] :
      ( big_p(X0,X1)
     => ! [X2,X3] : big_p(X2,X3) ),
    file('/export/starexec/sandbox2/tmp/tmp.l28btdBXRB/Vampire---4.8_19513',pel35) ).

fof(f7,plain,
    ~ big_p(sK0,sK1),
    inference(cnf_transformation,[],[f5]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem    : SYN064+1 : TPTP v8.1.2. Released v2.0.0.
% 0.15/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.15/0.36  % Computer : n002.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit   : 300
% 0.15/0.36  % WCLimit    : 300
% 0.15/0.36  % DateTime   : Tue Apr 30 17:44:55 EDT 2024
% 0.15/0.36  % CPUTime    : 
% 0.15/0.36  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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.l28btdBXRB/Vampire---4.8_19513
% 0.62/0.76  % (19694)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.62/0.76  % (19700)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.62/0.76  % (19694)First to succeed.
% 0.62/0.76  % (19701)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.62/0.76  % (19700)Also succeeded, but the first one will report.
% 0.62/0.76  % (19694)Refutation found. Thanks to Tanya!
% 0.62/0.76  % SZS status Theorem for Vampire---4
% 0.62/0.76  % SZS output start Proof for Vampire---4
% See solution above
% 0.62/0.76  % (19694)------------------------------
% 0.62/0.76  % (19694)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.62/0.76  % (19694)Termination reason: Refutation
% 0.62/0.76  
% 0.62/0.76  % (19694)Memory used [KB]: 952
% 0.62/0.76  % (19694)Time elapsed: 0.003 s
% 0.62/0.76  % (19694)Instructions burned: 2 (million)
% 0.62/0.76  % (19694)------------------------------
% 0.62/0.76  % (19694)------------------------------
% 0.62/0.76  % (19673)Success in time 0.391 s
% 0.62/0.76  % Vampire---4.8 exiting
%------------------------------------------------------------------------------