TSTP Solution File: NUM429+3 by Vampire-SAT---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : NUM429+3 : TPTP v8.2.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --mode casc_sat -m 16384 --cores 7 -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 : Tue May 21 01:57:47 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
fof(f125,plain,
    $false,
    inference(resolution,[],[f124,f77]) ).

fof(f77,plain,
    aInteger0(sK3),
    inference(cnf_transformation,[],[f63]) ).

fof(f63,plain,
    ( sdteqdtlpzmzozddtrp0(xb,xc,xq)
    & aDivisorOf0(xq,sdtpldt0(xb,smndt0(xc)))
    & sdtpldt0(xb,smndt0(xc)) = sdtasdt0(xq,sK2)
    & aInteger0(sK2)
    & sdteqdtlpzmzozddtrp0(xa,xb,xq)
    & aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
    & sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,sK3)
    & aInteger0(sK3) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f26,f62,f61]) ).

fof(f61,plain,
    ( ? [X0] :
        ( sdtasdt0(xq,X0) = sdtpldt0(xb,smndt0(xc))
        & aInteger0(X0) )
   => ( sdtpldt0(xb,smndt0(xc)) = sdtasdt0(xq,sK2)
      & aInteger0(sK2) ) ),
    introduced(choice_axiom,[]) ).

fof(f62,plain,
    ( ? [X1] :
        ( sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,X1)
        & aInteger0(X1) )
   => ( sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,sK3)
      & aInteger0(sK3) ) ),
    introduced(choice_axiom,[]) ).

fof(f26,plain,
    ( sdteqdtlpzmzozddtrp0(xb,xc,xq)
    & aDivisorOf0(xq,sdtpldt0(xb,smndt0(xc)))
    & ? [X0] :
        ( sdtasdt0(xq,X0) = sdtpldt0(xb,smndt0(xc))
        & aInteger0(X0) )
    & sdteqdtlpzmzozddtrp0(xa,xb,xq)
    & aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
    & ? [X1] :
        ( sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,X1)
        & aInteger0(X1) ) ),
    inference(rectify,[],[f23]) ).

fof(f23,axiom,
    ( sdteqdtlpzmzozddtrp0(xb,xc,xq)
    & aDivisorOf0(xq,sdtpldt0(xb,smndt0(xc)))
    & ? [X0] :
        ( sdtasdt0(xq,X0) = sdtpldt0(xb,smndt0(xc))
        & aInteger0(X0) )
    & sdteqdtlpzmzozddtrp0(xa,xb,xq)
    & aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
    & ? [X0] :
        ( sdtasdt0(xq,X0) = sdtpldt0(xa,smndt0(xb))
        & aInteger0(X0) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__853) ).

fof(f124,plain,
    ~ aInteger0(sK3),
    inference(equality_resolution,[],[f123]) ).

fof(f123,plain,
    ! [X0] :
      ( sdtasdt0(xq,X0) != sdtasdt0(xq,sK3)
      | ~ aInteger0(X0) ),
    inference(backward_demodulation,[],[f71,f78]) ).

fof(f78,plain,
    sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,sK3),
    inference(cnf_transformation,[],[f63]) ).

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

fof(f28,plain,
    ! [X0] :
      ( sdtasdt0(xq,X0) != sdtpldt0(xa,smndt0(xb))
      | ~ aInteger0(X0) ),
    inference(ennf_transformation,[],[f25]) ).

fof(f25,negated_conjecture,
    ~ ? [X0] :
        ( sdtasdt0(xq,X0) = sdtpldt0(xa,smndt0(xb))
        & aInteger0(X0) ),
    inference(negated_conjecture,[],[f24]) ).

fof(f24,conjecture,
    ? [X0] :
      ( sdtasdt0(xq,X0) = sdtpldt0(xa,smndt0(xb))
      & aInteger0(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : NUM429+3 : TPTP v8.2.0. Released v4.0.0.
% 0.11/0.14  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.35  % Computer : n002.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Mon May 20 03:46:53 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.14/0.36  % (7523)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.37  % (7526)WARNING: value z3 for option sas not known
% 0.14/0.37  % (7524)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.14/0.37  % (7525)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.14/0.37  % (7526)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.14/0.38  % (7528)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.14/0.38  % (7527)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.14/0.38  % (7529)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.14/0.38  % (7530)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.14/0.38  TRYING [1]
% 0.14/0.38  % (7529)First to succeed.
% 0.14/0.38  % (7528)Also succeeded, but the first one will report.
% 0.14/0.38  TRYING [1]
% 0.14/0.38  TRYING [2]
% 0.14/0.38  % (7529)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-7523"
% 0.14/0.38  TRYING [2]
% 0.14/0.38  % (7529)Refutation found. Thanks to Tanya!
% 0.14/0.38  % SZS status Theorem for theBenchmark
% 0.14/0.38  % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.38  % (7529)------------------------------
% 0.14/0.38  % (7529)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.14/0.38  % (7529)Termination reason: Refutation
% 0.14/0.38  
% 0.14/0.38  % (7529)Memory used [KB]: 844
% 0.14/0.38  % (7529)Time elapsed: 0.005 s
% 0.14/0.38  % (7529)Instructions burned: 5 (million)
% 0.14/0.38  % (7523)Success in time 0.02 s
%------------------------------------------------------------------------------