↑ 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  : NUM926+1 : 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 : n001.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.17s 0.48s
% Output   : Refutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   19 (  10 unt;   0 def)
%            Number of atoms       :   30 (  17 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   22 (  11   ~;   7   |;   1   &)
%                                         (   1 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    7 (   3 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   15 (  15 usr;   8 con; 0-2 aty)
%            Number of variables   :   20 (   8   !;  12   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ord_less_eq_int(one_one_int,t),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_tpos) ).

fof(f2,axiom,
    ( t = one_one_int
   => ? [X0,X1] : plus_plus_int(power_power_int(X0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X1,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_1__096t_A_061_A1_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06) ).

fof(f3,axiom,
    ( ord_less_int(one_one_int,t)
   => ? [X0,X1] : plus_plus_int(power_power_int(X0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X1,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_2__0961_A_060_At_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06) ).

fof(f29,axiom,
    ! [X0,X1] :
      ( ord_less_int(X0,X1)
    <=> ( ord_less_eq_int(X0,X1)
        & X0 != X1 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_28_zless__le) ).

fof(f124,conjecture,
    ? [X0,X1] : plus_plus_int(power_power_int(X0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X1,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).

fof(f125,negated_conjecture,
    ~ ? [X0,X1] : plus_plus_int(power_power_int(X0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X1,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),
    inference(negated_conjecture,[status(cth)],[f124]) ).

fof(f128,plain,
    ( ? [X0,X1] : plus_plus_int(power_power_int(X0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X1,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int)
    | one_one_int != t ),
    inference(ennf_transformation,[],[f2]) ).

fof(f129,plain,
    ( ? [X0,X1] : plus_plus_int(power_power_int(X0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X1,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int)
    | ~ ord_less_int(one_one_int,t) ),
    inference(ennf_transformation,[],[f3]) ).

fof(f143,plain,
    ! [X0,X1] : plus_plus_int(power_power_int(X0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X1,number_number_of_nat(bit0(bit1(pls))))) != plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),
    inference(ennf_transformation,[],[f125]) ).

fof(f144,plain,
    ord_less_eq_int(one_one_int,t),
    inference(cnf_transformation,[],[f1]) ).

fof(f145,plain,
    ( one_one_int != t
    | plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) = plus_plus_int(power_power_int(sK0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(sK1,number_number_of_nat(bit0(bit1(pls))))) ),
    inference(cnf_transformation,[],[f128]) ).

fof(f146,plain,
    ( ~ ord_less_int(one_one_int,t)
    | plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) = plus_plus_int(power_power_int(sK2,number_number_of_nat(bit0(bit1(pls)))),power_power_int(sK3,number_number_of_nat(bit0(bit1(pls))))) ),
    inference(cnf_transformation,[],[f129]) ).

fof(f173,plain,
    ! [X0,X1] :
      ( ~ ord_less_eq_int(X0,X1)
      | X0 = X1
      | ord_less_int(X0,X1) ),
    inference(cnf_transformation,[],[f29]) ).

fof(f300,plain,
    ! [X0,X1] : plus_plus_int(power_power_int(X0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X1,number_number_of_nat(bit0(bit1(pls))))) != plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),
    inference(cnf_transformation,[],[f143]) ).

fof(f347,plain,
    ~ ord_less_int(one_one_int,t),
    inference(forward_subsumption_resolution,[],[f146,f300]) ).

fof(f348,plain,
    one_one_int != t,
    inference(forward_subsumption_resolution,[],[f145,f300]) ).

fof(f655,plain,
    ( one_one_int = t
    | ord_less_int(one_one_int,t) ),
    inference(resolution,[],[f173,f144]) ).

fof(f667,plain,
    ord_less_int(one_one_int,t),
    inference(forward_subsumption_resolution,[],[f655,f348]) ).

fof(f668,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f667,f347]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM926+1 : TPTP v9.3.1. Released v5.3.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.39  % Computer : n001.cluster.edu
% 0.11/0.39  % Model    : x86_64 x86_64
% 0.11/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.39  % Memory   : 8046.5625MB
% 0.11/0.39  % OS       : Linux 6.8.0-71-generic
% 0.11/0.39  % CPULimit : 300
% 0.11/0.39  % WCLimit  : 300
% 0.11/0.39  % DateTime : Sun Sep 27 21:48:02 UTC 2026
% 0.11/0.39  % CPUTime  : 
% 0.11/0.39  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.42  Running first-order model finding
% 0.11/0.42  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.17/0.48  % (3989009)Will run a generic schedule for satisfiability detection.
% 0.17/0.48  % (3989018)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1940382375:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.48  % (3989015)% WARNING: option uhcvi not known.
% 0.17/0.48  % (3989014)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4125345505_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.48  % (3989016)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3932610669:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.48  % (3989015)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3213621306:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.48  % (3989017)dis+10_1_sil=32000:sp=arity:random_seed=3813204241:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.48  % (3989019)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2031890849:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.48  % (3989020)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=443018934:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.48  % (3989018) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3989009-3989018"...
% 0.17/0.48  % (3989018)...printing done.
% 0.17/0.48  % (3989018)Refutation found. Thanks to Tanya!
% 0.17/0.48  % SZS status Theorem for theBenchmark
% 0.17/0.48  % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.48  % (3989018)------------------------------
% 0.17/0.48  % (3989018)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.48  % (3989018)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.48  % (3989018)CaDiCaL version: 2.1.3
% 0.17/0.48  % (3989018)Termination reason: Refutation
% 0.17/0.48  % (3989018)Time elapsed: 0.008 s
% 0.17/0.48  % (3989018)Peak memory usage: 12 MB
% 0.17/0.48  % (3989018)Instructions burned: 22 (million)
% 0.17/0.48  % (3989009)Success in time 0.043 s
% 0.17/0.48  % Vampire exiting
%------------------------------------------------------------------------------