TSTP Solution File: NUM491+3 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : NUM491+3 : TPTP v8.1.2. Released v4.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 : n013.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 08:12:29 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
fof(f291,plain,
    $false,
    inference(trivial_inequality_removal,[],[f290]) ).

fof(f290,plain,
    sdtasdt0(xp,xm) != sdtasdt0(xp,xm),
    inference(resolution,[],[f158,f198]) ).

fof(f198,plain,
    ! [X0] :
      ( ~ aNaturalNumber0(X0)
      | sdtasdt0(xp,X0) != sdtasdt0(xp,xm) ),
    inference(cnf_transformation,[],[f58]) ).

fof(f58,plain,
    ( ~ doDivides0(xp,sdtasdt0(xp,xm))
    & ! [X0] :
        ( sdtasdt0(xp,X0) != sdtasdt0(xp,xm)
        | ~ aNaturalNumber0(X0) ) ),
    inference(ennf_transformation,[],[f49]) ).

fof(f49,negated_conjecture,
    ~ ( doDivides0(xp,sdtasdt0(xp,xm))
      | ? [X0] :
          ( sdtasdt0(xp,X0) = sdtasdt0(xp,xm)
          & aNaturalNumber0(X0) ) ),
    inference(negated_conjecture,[],[f48]) ).

fof(f48,conjecture,
    ( doDivides0(xp,sdtasdt0(xp,xm))
    | ? [X0] :
        ( sdtasdt0(xp,X0) = sdtasdt0(xp,xm)
        & aNaturalNumber0(X0) ) ),
    file('/export/starexec/sandbox/tmp/tmp.DVUY0uGtaU/Vampire---4.8_29636',m__) ).

fof(f158,plain,
    aNaturalNumber0(xm),
    inference(cnf_transformation,[],[f39]) ).

fof(f39,axiom,
    ( aNaturalNumber0(xp)
    & aNaturalNumber0(xm)
    & aNaturalNumber0(xn) ),
    file('/export/starexec/sandbox/tmp/tmp.DVUY0uGtaU/Vampire---4.8_29636',m__1837) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.15  % Problem    : NUM491+3 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.17  % 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.39  % Computer : n013.cluster.edu
% 0.15/0.39  % Model    : x86_64 x86_64
% 0.15/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.39  % Memory   : 8042.1875MB
% 0.15/0.39  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.39  % CPULimit   : 300
% 0.15/0.39  % WCLimit    : 300
% 0.15/0.39  % DateTime   : Fri May  3 14:59:08 EDT 2024
% 0.15/0.40  % CPUTime    : 
% 0.15/0.40  This is a FOF_THM_RFO_SEQ problem
% 0.15/0.40  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.DVUY0uGtaU/Vampire---4.8_29636
% 0.55/0.78  % (29886)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.55/0.78  % (29888)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.55/0.78  % (29889)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.55/0.78  % (29890)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.55/0.78  % (29887)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.55/0.78  % (29891)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.55/0.78  % (29893)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.55/0.78  % (29888)First to succeed.
% 0.55/0.78  % (29888)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-29882"
% 0.55/0.78  % (29886)Also succeeded, but the first one will report.
% 0.55/0.78  % (29888)Refutation found. Thanks to Tanya!
% 0.55/0.78  % SZS status Theorem for Vampire---4
% 0.55/0.78  % SZS output start Proof for Vampire---4
% See solution above
% 0.55/0.78  % (29888)------------------------------
% 0.55/0.78  % (29888)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.78  % (29888)Termination reason: Refutation
% 0.55/0.78  
% 0.55/0.78  % (29888)Memory used [KB]: 1153
% 0.55/0.78  % (29888)Time elapsed: 0.005 s
% 0.55/0.78  % (29888)Instructions burned: 11 (million)
% 0.55/0.78  % (29882)Success in time 0.376 s
% 0.55/0.78  % Vampire---4.8 exiting
%------------------------------------------------------------------------------