↑ Up

Vampire-SAT---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---5.0.1
% Problem  : NUM925+6 : TPTP v9.3.1. Released v5.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT

% Computer : n017.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue Sep 29 12:26:11 PM UTC 2026

% Result   : Theorem 0.70s 0.58s
% Output   : Refutation 0.70s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   39 (  26 unt;   0 def)
%            Number of atoms       :   56 (  33 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   41 (  24   ~;  14   |;   0   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   17 (  17 usr;   7 con; 0-4 aty)
%            Number of variables   :   32 (  32   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f16,axiom,
    ! [X0,X1] :
      ( number(X1)
     => ti(X1,number_number_of(X1,X0)) = number_number_of(X1,X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',tsy_c_Int_Onumber__class_Onumber__of_res) ).

fof(f46,axiom,
    hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),zero_zero(int)),hAPP(int,int,plus_plus(int,one_one(int)),hAPP(nat,int,semiring_1_of_nat(int),n)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_n1pos) ).

fof(f78,axiom,
    ~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),pls),pls)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_32_rel__simps_I2_J) ).

fof(f119,axiom,
    pls = zero_zero(int),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_73_Pls__def) ).

fof(f165,axiom,
    ! [X0] : number_number_of(int,X0) = X0,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_119_number__of__is__id) ).

fof(f210,axiom,
    ! [X0] :
      ( ring_11004092258visors(X0)
     => ! [X1,X2] :
          ( ti(X0,X2) != zero_zero(X0)
         => hAPP(nat,X0,power_power(X0,X2),X1) != zero_zero(X0) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_164_field__power__not__zero) ).

fof(f554,axiom,
    ring_11004092258visors(int),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',arity_Int_Oint___Rings_Oring__1__no__zero__divisors) ).

fof(f581,axiom,
    number(int),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',arity_Int_Oint___Int_Onumber) ).

fof(f660,conjecture,
    hAPP(nat,int,power_power(int,hAPP(int,int,plus_plus(int,one_one(int)),hAPP(nat,int,semiring_1_of_nat(int),n))),number_number_of(nat,hAPP(int,int,bit0,hAPP(int,int,bit1,pls)))) != zero_zero(int),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).

fof(f661,negated_conjecture,
    ~ ( hAPP(nat,int,power_power(int,hAPP(int,int,plus_plus(int,one_one(int)),hAPP(nat,int,semiring_1_of_nat(int),n))),number_number_of(nat,hAPP(int,int,bit0,hAPP(int,int,bit1,pls)))) != zero_zero(int) ),
    inference(negated_conjecture,[status(cth)],[f660]) ).

fof(f664,plain,
    zero_zero(int) = hAPP(nat,int,power_power(int,hAPP(int,int,plus_plus(int,one_one(int)),hAPP(nat,int,semiring_1_of_nat(int),n))),number_number_of(nat,hAPP(int,int,bit0,hAPP(int,int,bit1,pls)))),
    inference(flattening,[],[f661]) ).

fof(f675,plain,
    ! [X0,X1] :
      ( ti(X1,number_number_of(X1,X0)) = number_number_of(X1,X0)
      | ~ number(X1) ),
    inference(ennf_transformation,[],[f16]) ).

fof(f773,plain,
    ! [X0] :
      ( ! [X1,X2] :
          ( hAPP(nat,X0,power_power(X0,X2),X1) != zero_zero(X0)
          | zero_zero(X0) = ti(X0,X2) )
      | ~ ring_11004092258visors(X0) ),
    inference(ennf_transformation,[],[f210]) ).

fof(f1158,plain,
    ! [X0,X1] :
      ( ~ number(X1)
      | number_number_of(X1,X0) = ti(X1,number_number_of(X1,X0)) ),
    inference(cnf_transformation,[],[f675]) ).

fof(f1189,plain,
    hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),zero_zero(int)),hAPP(int,int,plus_plus(int,one_one(int)),hAPP(nat,int,semiring_1_of_nat(int),n)))),
    inference(cnf_transformation,[],[f46]) ).

fof(f1230,plain,
    ~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),pls),pls)),
    inference(cnf_transformation,[],[f78]) ).

fof(f1296,plain,
    pls = zero_zero(int),
    inference(cnf_transformation,[],[f119]) ).

fof(f1353,plain,
    ! [X0] : number_number_of(int,X0) = X0,
    inference(cnf_transformation,[],[f165]) ).

fof(f1423,plain,
    ! [X2,X0,X1] :
      ( ~ ring_11004092258visors(X0)
      | zero_zero(X0) = ti(X0,X2)
      | zero_zero(X0) != hAPP(nat,X0,power_power(X0,X2),X1) ),
    inference(cnf_transformation,[],[f773]) ).

fof(f1902,plain,
    ring_11004092258visors(int),
    inference(cnf_transformation,[],[f554]) ).

fof(f1929,plain,
    number(int),
    inference(cnf_transformation,[],[f581]) ).

fof(f2008,plain,
    zero_zero(int) = hAPP(nat,int,power_power(int,hAPP(int,int,plus_plus(int,one_one(int)),hAPP(nat,int,semiring_1_of_nat(int),n))),number_number_of(nat,hAPP(int,int,bit0,hAPP(int,int,bit1,pls)))),
    inference(cnf_transformation,[],[f664]) ).

fof(f2063,plain,
    ! [X0,X1] :
      ( number(X1)
      | number_number_of(X1,X0) = ti(X1,number_number_of(X1,X0)) ),
    inference(consistent_polarity_flipping,[],[f1158]) ).

fof(f2077,plain,
    ~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),zero_zero(int)),hAPP(int,int,plus_plus(int,one_one(int)),hAPP(nat,int,semiring_1_of_nat(int),n)))),
    inference(consistent_polarity_flipping,[],[f1189]) ).

fof(f2101,plain,
    hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),pls),pls)),
    inference(consistent_polarity_flipping,[],[f1230]) ).

fof(f2232,plain,
    ! [X2,X0,X1] :
      ( ring_11004092258visors(X0)
      | zero_zero(X0) = ti(X0,X2)
      | zero_zero(X0) != hAPP(nat,X0,power_power(X0,X2),X1) ),
    inference(consistent_polarity_flipping,[],[f1423]) ).

fof(f2681,plain,
    ~ ring_11004092258visors(int),
    inference(consistent_polarity_flipping,[],[f1902]) ).

fof(f2693,plain,
    ~ number(int),
    inference(consistent_polarity_flipping,[],[f1929]) ).

fof(f2851,plain,
    ! [X0] : number_number_of(int,X0) = ti(int,number_number_of(int,X0)),
    inference(resolution,[],[f2063,f2693]) ).

fof(f2854,plain,
    ! [X0] : ti(int,X0) = X0,
    inference(forward_demodulation,[],[f2851,f1353]) ).

fof(f3298,plain,
    ! [X0,X1] :
      ( ti(int,X0) = zero_zero(int)
      | zero_zero(int) != hAPP(nat,int,power_power(int,X0),X1) ),
    inference(resolution,[],[f2232,f2681]) ).

fof(f3300,plain,
    ! [X0,X1] :
      ( pls = ti(int,X0)
      | zero_zero(int) != hAPP(nat,int,power_power(int,X0),X1) ),
    inference(forward_demodulation,[],[f3298,f1296]) ).

fof(f3301,plain,
    ! [X0,X1] :
      ( pls = X0
      | zero_zero(int) != hAPP(nat,int,power_power(int,X0),X1) ),
    inference(forward_demodulation,[],[f3300,f2854]) ).

fof(f3302,plain,
    ! [X0,X1] :
      ( pls != hAPP(nat,int,power_power(int,X0),X1)
      | pls = X0 ),
    inference(forward_demodulation,[],[f3301,f1296]) ).

fof(f3999,plain,
    ~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),pls),hAPP(int,int,plus_plus(int,one_one(int)),hAPP(nat,int,semiring_1_of_nat(int),n)))),
    inference(forward_demodulation,[],[f2077,f1296]) ).

fof(f4682,plain,
    ( pls != zero_zero(int)
    | pls = hAPP(int,int,plus_plus(int,one_one(int)),hAPP(nat,int,semiring_1_of_nat(int),n)) ),
    inference(superposition,[],[f3302,f2008]) ).

fof(f4685,plain,
    pls = hAPP(int,int,plus_plus(int,one_one(int)),hAPP(nat,int,semiring_1_of_nat(int),n)),
    inference(forward_subsumption_resolution,[],[f4682,f1296]) ).

fof(f4739,plain,
    ~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),pls),pls)),
    inference(superposition,[],[f3999,f4685]) ).

fof(f4756,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f4739,f2101]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM925+6 : TPTP v9.3.1. Released v5.3.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.39  % Computer : n017.cluster.edu
% 0.12/0.39  % Model    : x86_64 x86_64
% 0.12/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39  % Memory   : 8046.5625MB
% 0.12/0.39  % OS       : Linux 6.8.0-71-generic
% 0.12/0.39  % CPULimit : 300
% 0.12/0.39  % WCLimit  : 300
% 0.12/0.39  % DateTime : Sun Sep 27 21:38:32 UTC 2026
% 0.12/0.39  % CPUTime  : 
% 0.12/0.39  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.43  Running first-order model finding
% 0.12/0.43  Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.70/0.58  % (2961388)Will run a generic schedule for satisfiability detection.
% 0.70/0.58  % (2961414)% WARNING: option uhcvi not known.
% 0.70/0.58  % (2961414)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3632994954:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.70/0.58  % (2961413)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=929577761_2999 on theBenchmark for (2999ds/0Mi)
% 0.70/0.58  % (2961415)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=993246559:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.70/0.58  % (2961416)dis+10_1_sil=32000:sp=arity:random_seed=1154360976:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.70/0.58  % (2961417)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2454957664:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.70/0.58  % (2961418)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2406896453:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.70/0.58  % (2961419)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2901833536:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.70/0.58  % (2961416)Instruction limit reached! 
% 0.70/0.58  % (2961416)------------------------------
% 0.70/0.58  % (2961416)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.70/0.58  % (2961416)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.70/0.58  % (2961416)CaDiCaL version: 2.1.3
% 0.70/0.58  % (2961416)Termination reason: Instruction limit
% 0.70/0.58  % (2961416)Termination phase: Saturation
% 0.70/0.58  % (2961416)Time elapsed: 0.049 s
% 0.70/0.58  % (2961416)Peak memory usage: 13 MB
% 0.70/0.58  % (2961416)Instructions burned: 103 (million)
% 0.70/0.58  % (2961417)Instruction limit reached! 
% 0.70/0.58  % (2961417)------------------------------
% 0.70/0.58  % (2961417)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.70/0.58  % (2961417)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.70/0.58  % (2961417)CaDiCaL version: 2.1.3
% 0.70/0.58  % (2961417)Termination reason: Instruction limit
% 0.70/0.58  % (2961417)Termination phase: Saturation
% 0.70/0.58  % (2961417)Time elapsed: 0.052 s
% 0.70/0.58  % (2961417)Peak memory usage: 12 MB
% 0.70/0.58  % (2961417)Instructions burned: 116 (million)
% 0.70/0.58  % (2961414) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2961388-2961414"...
% 0.70/0.58  % (2961414)...printing done.
% 0.70/0.58  % (2961414)Refutation found. Thanks to Tanya!
% 0.70/0.58  % SZS status Theorem for theBenchmark
% 0.70/0.58  % SZS output start Proof for theBenchmark
% See solution above
% 0.70/0.58  % (2961414)------------------------------
% 0.70/0.58  % (2961414)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.70/0.58  % (2961414)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.70/0.58  % (2961414)CaDiCaL version: 2.1.3
% 0.70/0.58  % (2961414)Termination reason: Refutation
% 0.70/0.58  % (2961414)Time elapsed: 0.073 s
% 0.70/0.58  % (2961414)Peak memory usage: 14 MB
% 0.70/0.58  % (2961414)Instructions burned: 200 (million)
% 0.70/0.58  % (2961388)Success in time 0.143 s
% 0.70/0.58  % Vampire exiting
%------------------------------------------------------------------------------