↑ 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  : NUM691_8 : TPTP v9.3.1. Released v8.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT

% Computer : n016.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:25:23 PM UTC 2026

% Result   : Theorem 0.17s 0.47s
% Output   : Refutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   58 (   8 unt;   0 typ;   4 def)
%            Number of atoms       :  126 (  24 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :  143 (  75   ~;  49   |;   5   &)
%                                         (   4 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    7 (   5 usr;   5 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   42 (   0 sgn  42   !;   0   ?;  42   :)

% 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,
    u: nat ).

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

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

tff(f1,axiom,
    ( ~ more(x,y)
   => ( x = y ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m) ).

tff(f2,axiom,
    ( ~ more(z,u)
   => ( z = u ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',n) ).

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

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

tff(f6,conjecture,
    ( ~ more(pl(x,z),pl(y,u))
   => ( pl(x,z) = pl(y,u) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz23) ).

tff(f7,negated_conjecture,
    ~ ( ~ more(pl(x,z),pl(y,u))
     => ( pl(x,z) = pl(y,u) ) ),
    inference(negated_conjecture,[status(cth)],[f6]) ).

tff(f10,plain,
    ( ( x = y )
    | more(x,y) ),
    inference(ennf_transformation,[],[f1]) ).

tff(f11,plain,
    ( ( z = u )
    | more(z,u) ),
    inference(ennf_transformation,[],[f2]) ).

tff(f13,plain,
    ! [X0: nat,X1: nat,X2: nat,X3: nat] :
      ( more(pl(X0,X2),pl(X1,X3))
      | ~ more(X2,X3)
      | ( ( X0 != X1 )
        & ~ more(X0,X1) ) ),
    inference(ennf_transformation,[],[f4]) ).

tff(f14,plain,
    ! [X0: nat,X1: nat,X2: nat,X3: nat] :
      ( more(pl(X0,X2),pl(X1,X3))
      | ~ more(X2,X3)
      | ( ( X0 != X1 )
        & ~ more(X0,X1) ) ),
    inference(flattening,[],[f13]) ).

tff(f15,plain,
    ! [X0: nat,X1: nat,X2: nat,X3: nat] :
      ( more(pl(X0,X2),pl(X1,X3))
      | ( ( X2 != X3 )
        & ~ more(X2,X3) )
      | ~ more(X0,X1) ),
    inference(ennf_transformation,[],[f5]) ).

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

tff(f17,plain,
    ( ( pl(x,z) != pl(y,u) )
    & ~ more(pl(x,z),pl(y,u)) ),
    inference(ennf_transformation,[],[f7]) ).

tff(f18,plain,
    ( more(x,y)
    | ( x = y ) ),
    inference(cnf_transformation,[],[f10]) ).

tff(f19,plain,
    ( more(z,u)
    | ( z = u ) ),
    inference(cnf_transformation,[],[f11]) ).

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

tff(f21,plain,
    ! [X2: nat,X3: nat,X0: nat,X1: nat] :
      ( ( X0 != X1 )
      | ~ more(X2,X3)
      | more(pl(X0,X2),pl(X1,X3)) ),
    inference(cnf_transformation,[],[f14]) ).

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

tff(f24,plain,
    ~ more(pl(x,z),pl(y,u)),
    inference(cnf_transformation,[],[f17]) ).

tff(f25,plain,
    pl(x,z) != pl(y,u),
    inference(cnf_transformation,[],[f17]) ).

tff(f26,plain,
    ! [X2: nat,X3: nat,X1: nat] :
      ( more(pl(X1,X2),pl(X1,X3))
      | ~ more(X2,X3) ),
    inference(equality_resolution,[],[f21]) ).

tff(f27,plain,
    ! [X3: nat,X0: nat,X1: nat] :
      ( more(pl(X0,X3),pl(X1,X3))
      | ~ more(X0,X1) ),
    inference(equality_resolution,[],[f23]) ).

tff(f29,definition,
    ( spl0_1
  <=> ( z = u ) ),
    introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).

tff(f31,plain,
    ( ( z = u )
    | ~ spl0_1 ),
    inference(avatar_component_clause,[],[f29]) ).

tff(f33,definition,
    ( spl0_2
  <=> more(z,u) ),
    introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).

tff(f35,plain,
    ( more(z,u)
    | ~ spl0_2 ),
    inference(avatar_component_clause,[],[f33]) ).

tff(f36,plain,
    ( spl0_1
    | spl0_2 ),
    inference(avatar_split_clause,[],[f19,f33,f29]) ).

tff(f38,definition,
    ( spl0_3
  <=> ( x = y ) ),
    introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).

tff(f40,plain,
    ( ( x = y )
    | ~ spl0_3 ),
    inference(avatar_component_clause,[],[f38]) ).

tff(f42,definition,
    ( spl0_4
  <=> more(x,y) ),
    introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).

tff(f44,plain,
    ( more(x,y)
    | ~ spl0_4 ),
    inference(avatar_component_clause,[],[f42]) ).

tff(f45,plain,
    ( spl0_3
    | spl0_4 ),
    inference(avatar_split_clause,[],[f18,f42,f38]) ).

tff(f47,plain,
    ( ~ more(pl(x,z),pl(x,u))
    | ~ spl0_3 ),
    inference(superposition,[],[f24,f40]) ).

tff(f48,plain,
    ( ~ more(z,u)
    | ~ spl0_3 ),
    inference(resolution,[],[f47,f26]) ).

tff(f51,plain,
    ( ~ spl0_2
    | ~ spl0_3 ),
    inference(avatar_split_clause,[],[f48,f38,f33]) ).

tff(f54,plain,
    ( ( pl(x,z) != pl(y,z) )
    | ~ spl0_1 ),
    inference(superposition,[],[f25,f31]) ).

tff(f55,plain,
    ( ~ more(pl(x,z),pl(y,z))
    | ~ spl0_1 ),
    inference(superposition,[],[f24,f31]) ).

tff(f59,plain,
    ( ( pl(x,z) != pl(x,z) )
    | ~ spl0_1
    | ~ spl0_3 ),
    inference(forward_demodulation,[],[f54,f40]) ).

tff(f60,plain,
    ( $false
    | ~ spl0_1
    | ~ spl0_3 ),
    inference(trivial_inequality_removal,[],[f59]) ).

tff(f61,plain,
    ( ~ spl0_1
    | ~ spl0_3 ),
    inference(avatar_contradiction_clause,[],[f60]) ).

tff(f63,plain,
    ( ~ more(x,y)
    | ~ spl0_1 ),
    inference(resolution,[],[f55,f27]) ).

tff(f64,plain,
    ( ~ spl0_4
    | ~ spl0_1 ),
    inference(avatar_split_clause,[],[f63,f29,f42]) ).

tff(f65,plain,
    ( ~ more(z,u)
    | ~ more(x,y) ),
    inference(resolution,[],[f20,f24]) ).

tff(f66,plain,
    ( ~ more(x,y)
    | ~ spl0_2 ),
    inference(forward_subsumption_resolution,[],[f65,f35]) ).

tff(f67,plain,
    ( $false
    | ~ spl0_2
    | ~ spl0_4 ),
    inference(forward_subsumption_resolution,[],[f66,f44]) ).

tff(f68,plain,
    ( ~ spl0_2
    | ~ spl0_4 ),
    inference(avatar_contradiction_clause,[],[f67]) ).

cnf(s1,plain,
    ( spl0_1
    | spl0_2 ),
    inference(sat_conversion,[],[f36]) ).

cnf(s2,plain,
    ( spl0_3
    | spl0_4 ),
    inference(sat_conversion,[],[f45]) ).

cnf(s4,plain,
    ( ~ spl0_2
    | ~ spl0_3 ),
    inference(sat_conversion,[],[f51]) ).

cnf(s6,plain,
    ( ~ spl0_1
    | ~ spl0_3 ),
    inference(sat_conversion,[],[f61]) ).

cnf(s7,plain,
    ( ~ spl0_1
    | ~ spl0_4 ),
    inference(sat_conversion,[],[f64]) ).

cnf(s8,plain,
    ( ~ spl0_2
    | ~ spl0_4 ),
    inference(sat_conversion,[],[f68]) ).

cnf(s9,plain,
    ~ spl0_2,
    inference(rat,[],[s2,s4,s8]) ).

cnf(s10,plain,
    spl0_1,
    inference(rat,[],[s1,s9]) ).

cnf(s11,plain,
    ~ spl0_4,
    inference(rat,[],[s7,s10]) ).

cnf(s12,plain,
    ~ spl0_3,
    inference(rat,[],[s6,s10]) ).

cnf(s13,plain,
    $false,
    inference(rat,[],[s2,s11,s12]) ).

tff(f69,plain,
    $false,
    inference(avatar_sat_refutation,[],[s13]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM691_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.39  % Computer : n016.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:11:32 UTC 2026
% 0.12/0.39  % CPUTime  : 
% 0.12/0.39  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.43  Running first-order model finding
% 0.12/0.43  Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.47  % (2989281)Will run a generic schedule for satisfiability detection.
% 0.17/0.47  % (2989286)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4193108868_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.47  % Detected minimum model sizes of [1,1]
% 0.17/0.47  % Detected maximum model sizes of [max,2]
% 0.17/0.47  % TRYING [1,1]
% 0.17/0.47  % TRYING [1,2]
% 0.17/0.47  % TRYING [2,2]
% 0.17/0.47  % TRYING [3,2]
% 0.17/0.47  % TRYING [4,2]
% 0.17/0.47  % (2989287)% WARNING: option uhcvi not known.
% 0.17/0.47  % TRYING [5,2]
% 0.17/0.47  % (2989287)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2035089065:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.47  % (2989288)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=89093975:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.47  % (2989289)dis+10_1_sil=32000:sp=arity:random_seed=1406624755:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.47  % (2989290)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1389418767:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.47  % (2989291)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=288742795:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.47  % (2989292)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1910795507:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.47  % (2989287) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2989281-2989287"...
% 0.17/0.47  % (2989290) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2989281-2989290"...
% 0.17/0.47  % (2989289) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2989281-2989289"...
% 0.17/0.47  % (2989292) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2989281-2989292"...
% 0.17/0.47  % TRYING [6,2]
% 0.17/0.47  % (2989287)...printing done.
% 0.17/0.47  % (2989290)...printing done.
% 0.17/0.47  % (2989288) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2989281-2989288"...
% 0.17/0.47  % (2989289)...printing done.
% 0.17/0.47  % (2989287)Refutation found. Thanks to Tanya!
% 0.17/0.47  % SZS status Theorem for theBenchmark
% 0.17/0.47  % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.47  % (2989287)------------------------------
% 0.17/0.47  % (2989287)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.47  % (2989287)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.47  % (2989287)CaDiCaL version: 2.1.3
% 0.17/0.47  % (2989287)Termination reason: Refutation
% 0.17/0.47  % (2989287)Time elapsed: 0.003 s
% 0.17/0.47  % (2989287)Peak memory usage: 12 MB
% 0.17/0.47  % (2989287)Instructions burned: 2 (million)
% 0.17/0.47  % (2989281)Success in time 0.037 s
% 0.17/0.47  % Vampire exiting
%------------------------------------------------------------------------------