↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : NUM681_8 : TPTP v9.3.1. Released v8.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n015.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:16:26 PM UTC 2026

% Result   : Theorem 4.93s 1.63s
% Output   : Refutation 4.93s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   31 (  11 unt;   0 typ;   0 def)
%            Number of atoms       :   74 (  24 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   82 (  39   ~;  25   |;   4   &)
%                                         (   0 <=>;  14  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of FOOLs       :    1 (   1 fml;   0 var)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            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   :   51 (  51   !;   0   ?;  51   :)

% Comments : 
%------------------------------------------------------------------------------
tff(type_def_5,type,
    nat: $tType ).

tff(func_def_0,type,
    x: nat ).

tff(func_def_1,type,
    y: nat ).

tff(func_def_2,type,
    z: nat ).

tff(func_def_3,type,
    pl: ( nat * nat ) > nat ).

tff(pred_def_1,type,
    less: ( nat * nat ) > $o ).

tff(pred_def_2,type,
    more: ( nat * nat ) > $o ).

tff(f1,axiom,
    pl(x,z) = pl(y,z),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',i) ).

tff(f3,axiom,
    ! [X0: nat,X1: nat] :
      ~ ( ( ( X0 = X1 )
         => ~ more(X0,X1) )
       => ~ ~ ( ( more(X0,X1)
               => ~ less(X0,X1) )
             => ~ ( less(X0,X1)
                 => ( X0 != X1 ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz10b) ).

tff(f4,axiom,
    ! [X0: nat,X1: nat,X2: nat] :
      ( less(X0,X1)
     => less(pl(X0,X2),pl(X1,X2)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz19c) ).

tff(f5,axiom,
    ! [X0: nat,X1: nat] :
      ( ( X0 != X1 )
     => ( ~ more(X0,X1)
       => less(X0,X1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz10a) ).

tff(f6,axiom,
    ! [X0: nat,X1: nat,X2: nat] :
      ( more(X0,X1)
     => more(pl(X0,X2),pl(X1,X2)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz19a) ).

tff(f7,conjecture,
    x = y,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz20b) ).

tff(f8,negated_conjecture,
    ( ( ~ x ) = y ),
    inference(negated_conjecture,[status(cth)],[f7]) ).

tff(f12,plain,
    ! [X0: nat,X1: nat] :
      ~ ( ( ( X0 = X1 )
         => ~ more(X0,X1) )
       => ( ( more(X0,X1)
           => ~ less(X0,X1) )
         => ~ ( less(X0,X1)
             => ( X0 != X1 ) ) ) ),
    inference(flattening,[],[f3]) ).

tff(f13,plain,
    x != y,
    inference(flattening,[],[f8]) ).

tff(f15,plain,
    ! [X0: nat,X1: nat] :
      ( ( ( X0 != X1 )
        | ~ less(X0,X1) )
      & ( ~ less(X0,X1)
        | ~ more(X0,X1) )
      & ( ~ more(X0,X1)
        | ( X0 != X1 ) ) ),
    inference(ennf_transformation,[],[f12]) ).

tff(f16,plain,
    ! [X0: nat,X1: nat] :
      ( ( ( X0 != X1 )
        | ~ less(X0,X1) )
      & ( ~ less(X0,X1)
        | ~ more(X0,X1) )
      & ( ~ more(X0,X1)
        | ( X0 != X1 ) ) ),
    inference(flattening,[],[f15]) ).

tff(f17,plain,
    ! [X0: nat,X1: nat,X2: nat] :
      ( less(pl(X0,X2),pl(X1,X2))
      | ~ less(X0,X1) ),
    inference(ennf_transformation,[],[f4]) ).

tff(f18,plain,
    ! [X0: nat,X1: nat] :
      ( less(X0,X1)
      | more(X0,X1)
      | ( X0 = X1 ) ),
    inference(ennf_transformation,[],[f5]) ).

tff(f19,plain,
    ! [X0: nat,X1: nat] :
      ( less(X0,X1)
      | more(X0,X1)
      | ( X0 = X1 ) ),
    inference(flattening,[],[f18]) ).

tff(f20,plain,
    ! [X0: nat,X1: nat,X2: nat] :
      ( more(pl(X0,X2),pl(X1,X2))
      | ~ more(X0,X1) ),
    inference(ennf_transformation,[],[f6]) ).

tff(f21,plain,
    pl(x,z) = pl(y,z),
    inference(cnf_transformation,[],[f1]) ).

tff(f23,plain,
    ! [X0: nat,X1: nat] :
      ( ~ more(X0,X1)
      | ( X0 != X1 ) ),
    inference(cnf_transformation,[],[f16]) ).

tff(f25,plain,
    ! [X0: nat,X1: nat] :
      ( ( X0 != X1 )
      | ~ less(X0,X1) ),
    inference(cnf_transformation,[],[f16]) ).

tff(f26,plain,
    ! [X2: nat,X0: nat,X1: nat] :
      ( ~ less(X0,X1)
      | less(pl(X0,X2),pl(X1,X2)) ),
    inference(cnf_transformation,[],[f17]) ).

tff(f27,plain,
    ! [X0: nat,X1: nat] :
      ( less(X0,X1)
      | more(X0,X1)
      | ( X0 = X1 ) ),
    inference(cnf_transformation,[],[f19]) ).

tff(f28,plain,
    ! [X2: nat,X0: nat,X1: nat] :
      ( ~ more(X0,X1)
      | more(pl(X0,X2),pl(X1,X2)) ),
    inference(cnf_transformation,[],[f20]) ).

tff(f29,plain,
    x != y,
    inference(cnf_transformation,[],[f13]) ).

tff(f33,plain,
    ! [X1: nat] : ~ less(X1,X1),
    inference(equality_resolution,[],[f25]) ).

tff(f34,plain,
    ! [X1: nat] : ~ more(X1,X1),
    inference(equality_resolution,[],[f23]) ).

tff(f44,plain,
    ! [X2: nat,X0: nat,X1: nat] :
      ( more(X0,X2)
      | less(pl(X0,X1),pl(X2,X1))
      | ( X0 = X2 ) ),
    inference(resolution,[],[f26,f27]) ).

tff(f49,plain,
    ! [X2: nat,X3: nat,X0: nat,X1: nat] :
      ( less(pl(X0,X1),pl(X2,X1))
      | ( X0 = X2 )
      | more(pl(X0,X3),pl(X2,X3)) ),
    inference(resolution,[],[f44,f28]) ).

tff(f90,plain,
    ! [X0: nat,X1: nat] :
      ( less(pl(x,z),pl(X0,z))
      | ( y = X0 )
      | more(pl(y,X1),pl(X0,X1)) ),
    inference(superposition,[],[f49,f21]) ).

tff(f104,plain,
    ! [X0: nat] :
      ( ( x = y )
      | more(pl(y,X0),pl(x,X0)) ),
    inference(resolution,[],[f90,f33]) ).

tff(f106,plain,
    ! [X0: nat] : more(pl(y,X0),pl(x,X0)),
    inference(forward_subsumption_resolution,[],[f104,f29]) ).

tff(f109,plain,
    more(pl(x,z),pl(x,z)),
    inference(superposition,[],[f106,f21]) ).

tff(f110,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f109,f34]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM681_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.39  % Computer : n015.cluster.edu
% 0.13/0.39  % Model    : x86_64 x86_64
% 0.13/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.39  % Memory   : 8046.5625MB
% 0.13/0.39  % OS       : Linux 6.8.0-71-generic
% 0.13/0.39  % CPULimit : 300
% 0.13/0.39  % WCLimit  : 300
% 0.13/0.39  % DateTime : Sun Sep 27 21:07:01 UTC 2026
% 0.13/0.39  % CPUTime  : 
% 0.13/0.39  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.43  Running first-order theorem proving
% 0.13/0.43  Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.93/1.63  % (2004797)Detected formulas, will run a generic FOF schedule.
% 4.93/1.63  % (2004822)dis-21_1_sil=8000:lcm=predicate:random_seed=3604719071:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 4.93/1.63  % (2004821)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=203355464:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 4.93/1.63  % (2004821)First to succeed.
% 4.93/1.63  % (2004821)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2004797"
% 4.93/1.63  % (2004822)Instruction limit reached! 
% 4.93/1.63  % (2004822)------------------------------
% 4.93/1.63  % (2004822)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.93/1.63  % (2004822)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.93/1.63  % (2004822)CaDiCaL version: 2.1.3
% 4.93/1.63  % (2004822)Termination reason: Instruction limit
% 4.93/1.63  % (2004822)Termination phase: Saturation
% 4.93/1.63  % (2004822)Time elapsed: 0.052 s
% 4.93/1.63  % (2004822)Peak memory usage: 89 MB
% 4.93/1.63  % (2004822)Instructions burned: 131 (million)
% 4.93/1.63  % (2004812)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=3471244539:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 4.93/1.63  % (2004817)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2300721387:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 4.93/1.63  % (2004813)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=2581239622:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 4.93/1.63  % (2004814)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1337533876:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 4.93/1.63  % (2004811)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=1166797241:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 4.93/1.63  % (2004817)Refutation not found, incomplete strategy
% 4.93/1.63  % (2004817)------------------------------
% 4.93/1.63  % (2004817)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.93/1.63  % (2004817)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.93/1.63  % (2004817)CaDiCaL version: 2.1.3
% 4.93/1.63  % (2004817)Termination reason: Refutation not found, incomplete strategy
% 4.93/1.63  % (2004817)Time elapsed: 0.001 s
% 4.93/1.63  % (2004814)Refutation not found, incomplete strategy
% 4.93/1.63  % (2004814)------------------------------
% 4.93/1.63  % (2004814)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.93/1.63  % (2004817)Peak memory usage: 87 MB
% 4.93/1.63  % (2004814)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.93/1.63  % (2004814)CaDiCaL version: 2.1.3
% 4.93/1.63  % (2004814)Termination reason: Refutation not found, incomplete strategy
% 4.93/1.63  % (2004814)Time elapsed: 0.001 s
% 4.93/1.63  % (2004814)Peak memory usage: 88 MB
% 4.93/1.63  % (2004829)lrs+10_1_sil=8000:sp=occurrence:random_seed=1331666066:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 4.93/1.63  % (2004829)Also succeeded, but the first one will report.
% 4.93/1.63  % (2004821)Refutation found. Thanks to Tanya!
% 4.93/1.63  % SZS status Theorem for theBenchmark
% 4.93/1.63  % SZS output start Proof for theBenchmark
% See solution above
% 4.93/1.63  % (2004821)------------------------------
% 4.93/1.63  % (2004821)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.93/1.63  % (2004821)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.93/1.63  % (2004821)CaDiCaL version: 2.1.3
% 4.93/1.63  % (2004821)Termination reason: Refutation
% 4.93/1.63  % (2004821)Time elapsed: 0.008 s
% 4.93/1.63  % (2004821)Peak memory usage: 89 MB
% 4.93/1.63  % (2004821)Instructions burned: 5 (million)
% 4.93/1.63  % (2004821)------------------------------
% 4.93/1.63  % (2004821)------------------------------
% 4.93/1.63  % (2004797)Success in time 0.615 s
% 4.93/1.63  % Vampire exiting
%------------------------------------------------------------------------------