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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : NUM423+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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n006.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 03:31:00 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
fof(f107,plain,
    $false,
    inference(subsumption_resolution,[],[f106,f55]) ).

fof(f55,plain,
    aInteger0(xq),
    inference(cnf_transformation,[],[f20]) ).

fof(f20,axiom,
    ( sz00 != xq
    & aInteger0(xq)
    & aInteger0(xa) ),
    file('/export/starexec/sandbox2/tmp/tmp.eQC4ErwtOo/Vampire---4.8_2019',m__671) ).

fof(f106,plain,
    ~ aInteger0(xq),
    inference(subsumption_resolution,[],[f105,f65]) ).

fof(f65,plain,
    aInteger0(sz00),
    inference(cnf_transformation,[],[f2]) ).

fof(f2,axiom,
    aInteger0(sz00),
    file('/export/starexec/sandbox2/tmp/tmp.eQC4ErwtOo/Vampire---4.8_2019',mIntZero) ).

fof(f105,plain,
    ( ~ aInteger0(sz00)
    | ~ aInteger0(xq) ),
    inference(trivial_inequality_removal,[],[f99]) ).

fof(f99,plain,
    ( sz00 != sz00
    | ~ aInteger0(sz00)
    | ~ aInteger0(xq) ),
    inference(superposition,[],[f98,f61]) ).

fof(f61,plain,
    ! [X0] :
      ( sz00 = sdtasdt0(X0,sz00)
      | ~ aInteger0(X0) ),
    inference(cnf_transformation,[],[f27]) ).

fof(f27,plain,
    ! [X0] :
      ( ( sz00 = sdtasdt0(sz00,X0)
        & sz00 = sdtasdt0(X0,sz00) )
      | ~ aInteger0(X0) ),
    inference(ennf_transformation,[],[f15]) ).

fof(f15,axiom,
    ! [X0] :
      ( aInteger0(X0)
     => ( sz00 = sdtasdt0(sz00,X0)
        & sz00 = sdtasdt0(X0,sz00) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.eQC4ErwtOo/Vampire---4.8_2019',mMulZero) ).

fof(f98,plain,
    ! [X0] :
      ( sz00 != sdtasdt0(xq,X0)
      | ~ aInteger0(X0) ),
    inference(subsumption_resolution,[],[f93,f54]) ).

fof(f54,plain,
    aInteger0(xa),
    inference(cnf_transformation,[],[f20]) ).

fof(f93,plain,
    ! [X0] :
      ( sz00 != sdtasdt0(xq,X0)
      | ~ aInteger0(X0)
      | ~ aInteger0(xa) ),
    inference(superposition,[],[f57,f71]) ).

fof(f71,plain,
    ! [X0] :
      ( sz00 = sdtpldt0(X0,smndt0(X0))
      | ~ aInteger0(X0) ),
    inference(cnf_transformation,[],[f30]) ).

fof(f30,plain,
    ! [X0] :
      ( ( sz00 = sdtpldt0(smndt0(X0),X0)
        & sz00 = sdtpldt0(X0,smndt0(X0)) )
      | ~ aInteger0(X0) ),
    inference(ennf_transformation,[],[f10]) ).

fof(f10,axiom,
    ! [X0] :
      ( aInteger0(X0)
     => ( sz00 = sdtpldt0(smndt0(X0),X0)
        & sz00 = sdtpldt0(X0,smndt0(X0)) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.eQC4ErwtOo/Vampire---4.8_2019',mAddNeg) ).

fof(f57,plain,
    ! [X0] :
      ( sdtasdt0(xq,X0) != sdtpldt0(xa,smndt0(xa))
      | ~ aInteger0(X0) ),
    inference(cnf_transformation,[],[f24]) ).

fof(f24,plain,
    ( ~ sdteqdtlpzmzozddtrp0(xa,xa,xq)
    & ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xa)))
    & ! [X0] :
        ( sdtasdt0(xq,X0) != sdtpldt0(xa,smndt0(xa))
        | ~ aInteger0(X0) ) ),
    inference(ennf_transformation,[],[f22]) ).

fof(f22,negated_conjecture,
    ~ ( sdteqdtlpzmzozddtrp0(xa,xa,xq)
      | aDivisorOf0(xq,sdtpldt0(xa,smndt0(xa)))
      | ? [X0] :
          ( sdtasdt0(xq,X0) = sdtpldt0(xa,smndt0(xa))
          & aInteger0(X0) ) ),
    inference(negated_conjecture,[],[f21]) ).

fof(f21,conjecture,
    ( sdteqdtlpzmzozddtrp0(xa,xa,xq)
    | aDivisorOf0(xq,sdtpldt0(xa,smndt0(xa)))
    | ? [X0] :
        ( sdtasdt0(xq,X0) = sdtpldt0(xa,smndt0(xa))
        & aInteger0(X0) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.eQC4ErwtOo/Vampire---4.8_2019',m__) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem    : NUM423+3 : TPTP v8.1.2. Released v4.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 : n006.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 16:44:35 EDT 2024
% 0.15/0.36  % CPUTime    : 
% 0.15/0.36  This is a FOF_THM_RFO_SEQ problem
% 0.15/0.36  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.eQC4ErwtOo/Vampire---4.8_2019
% 0.62/0.78  % (2365)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.62/0.78  % (2357)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.62/0.78  % (2360)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.62/0.78  % (2361)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.62/0.78  % (2359)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.62/0.78  % (2362)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.62/0.78  % (2365)Refutation not found, incomplete strategy% (2365)------------------------------
% 0.62/0.78  % (2365)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.62/0.78  % (2365)Termination reason: Refutation not found, incomplete strategy
% 0.62/0.78  
% 0.62/0.78  % (2365)Memory used [KB]: 1042
% 0.62/0.78  % (2365)Time elapsed: 0.002 s
% 0.62/0.78  % (2363)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.62/0.78  % (2365)Instructions burned: 3 (million)
% 0.62/0.78  % (2365)------------------------------
% 0.62/0.78  % (2365)------------------------------
% 0.62/0.78  % (2364)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.62/0.79  % (2363)First to succeed.
% 0.62/0.79  % (2362)Refutation not found, incomplete strategy% (2362)------------------------------
% 0.62/0.79  % (2362)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.62/0.79  % (2362)Termination reason: Refutation not found, incomplete strategy
% 0.62/0.79  
% 0.62/0.79  % (2362)Memory used [KB]: 1051
% 0.62/0.79  % (2362)Time elapsed: 0.004 s
% 0.62/0.79  % (2362)Instructions burned: 4 (million)
% 0.62/0.79  % (2362)------------------------------
% 0.62/0.79  % (2362)------------------------------
% 0.62/0.79  % (2359)Also succeeded, but the first one will report.
% 0.62/0.79  % (2363)Refutation found. Thanks to Tanya!
% 0.62/0.79  % SZS status Theorem for Vampire---4
% 0.62/0.79  % SZS output start Proof for Vampire---4
% See solution above
% 0.62/0.79  % (2363)------------------------------
% 0.62/0.79  % (2363)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.62/0.79  % (2363)Termination reason: Refutation
% 0.62/0.79  
% 0.62/0.79  % (2363)Memory used [KB]: 1051
% 0.62/0.79  % (2363)Time elapsed: 0.004 s
% 0.62/0.79  % (2363)Instructions burned: 4 (million)
% 0.62/0.79  % (2363)------------------------------
% 0.62/0.79  % (2363)------------------------------
% 0.62/0.79  % (2219)Success in time 0.414 s
% 0.62/0.79  % Vampire---4.8 exiting
%------------------------------------------------------------------------------