↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Computer : n006.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 02:33:19 PM UTC 2026

% Result   : Unsatisfiable 3.59s 1.34s
% Output   : Refutation 3.59s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   73 (  11 unt;   0 typ;   8 def)
%            Number of atoms       :  155 (   6 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :  150 (  68   ~;  59   |;   7   &)
%                                         (   8 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number arithmetic     :   53 (  22 atm;   0 fun;  22 num;   9 var)
%            Number of types       :    2 (   0 usr;   1 ari;   0 dat;   0 cdt)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :   16 (  11 usr;  10 prp; 0-2 aty)
%            Number of functors    :    3 (   2 usr;   3 con; 0-0 aty)
%            Number of variables   :    9 (   0 sgn   9   !;   0   ?;   9   :)

% Comments : 
%------------------------------------------------------------------------------
tff(func_def_0,type,
    npa: $int ).

tff(func_def_1,type,
    npb: $int ).

tff(pred_def_1,type,
    p: $int > $o ).

tff(pred_def_2,type,
    q: $int > $o ).

tff(pred_def_3,type,
    r: $int > $o ).

tff(f1,axiom,
    ( ( p(npa)
      & $greatereq(npa,0) )
   => $false ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax1) ).

tff(f2,axiom,
    ( $greatereq(npb,0)
   => p(npb) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax2) ).

tff(f3,axiom,
    ( ( $less(npa,0)
      & q(npa) )
   => $false ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax3) ).

tff(f4,axiom,
    ( $less(npb,0)
   => q(npb) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax4) ).

tff(f5,axiom,
    ! [X0: $int] :
      ( ( ( npa != npb )
        & r(X0) )
     => $false ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax5) ).

tff(f6,axiom,
    ! [X0: $int] :
      ( $true
     => r(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax6) ).

tff(f7,plain,
    ( ~ $less(npb,0)
   => p(npb) ),
    inference(theory_normalization,[],[f2]) ).

tff(f8,plain,
    ( ( p(npa)
      & ~ $less(npa,0) )
   => $false ),
    inference(theory_normalization,[],[f1]) ).

tff(f21,plain,
    ~ ( p(npa)
      & ~ $less(npa,0) ),
    inference(true_and_false_elimination,[],[f8]) ).

tff(f22,plain,
    ! [X0: $int] :
      ~ ( ( npa != npb )
        & r(X0) ),
    inference(true_and_false_elimination,[],[f5]) ).

tff(f23,plain,
    ! [X0: $int] : r(X0),
    inference(true_and_false_elimination,[],[f6]) ).

tff(f24,plain,
    ~ ( $less(npa,0)
      & q(npa) ),
    inference(true_and_false_elimination,[],[f3]) ).

tff(f25,plain,
    ( p(npb)
    | $less(npb,0) ),
    inference(ennf_transformation,[],[f7]) ).

tff(f26,plain,
    ( ~ $less(npa,0)
    | ~ q(npa) ),
    inference(ennf_transformation,[],[f24]) ).

tff(f27,plain,
    ( ~ $less(npb,0)
    | q(npb) ),
    inference(ennf_transformation,[],[f4]) ).

tff(f28,plain,
    ! [X0: $int] :
      ( ~ r(X0)
      | ( npa = npb ) ),
    inference(ennf_transformation,[],[f22]) ).

tff(f29,plain,
    ( ~ p(npa)
    | $less(npa,0) ),
    inference(ennf_transformation,[],[f21]) ).

tff(f30,plain,
    ! [X0: $int] : r(X0),
    inference(cnf_transformation,[],[f23]) ).

tff(f31,plain,
    ! [X0: $int] :
      ( ( npa = npb )
      | ~ r(X0) ),
    inference(cnf_transformation,[],[f28]) ).

tff(f32,plain,
    ( $less(npb,0)
    | p(npb) ),
    inference(cnf_transformation,[],[f25]) ).

tff(f33,plain,
    ( q(npb)
    | ~ $less(npb,0) ),
    inference(cnf_transformation,[],[f27]) ).

tff(f34,plain,
    ( ~ p(npa)
    | $less(npa,0) ),
    inference(cnf_transformation,[],[f29]) ).

tff(f35,plain,
    ( ~ q(npa)
    | ~ $less(npa,0) ),
    inference(cnf_transformation,[],[f26]) ).

tff(f37,definition,
    ( spl0_1
  <=> q(npa) ),
    introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).

tff(f39,plain,
    ( ~ q(npa)
    | spl0_1 ),
    inference(avatar_component_clause,[],[f37]) ).

tff(f41,definition,
    ( spl0_2
  <=> $less(npa,0) ),
    introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).

tff(f44,plain,
    ( ~ spl0_1
    | ~ spl0_2 ),
    inference(avatar_split_clause,[],[f35,f41,f37]) ).

tff(f46,definition,
    ( spl0_3
  <=> p(npb) ),
    introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).

tff(f48,plain,
    ( p(npb)
    | ~ spl0_3 ),
    inference(avatar_component_clause,[],[f46]) ).

tff(f50,definition,
    ( spl0_4
  <=> $less(npb,0) ),
    introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).

tff(f51,plain,
    ( ~ $less(npb,0)
    | spl0_4 ),
    inference(avatar_component_clause,[],[f50]) ).

tff(f52,plain,
    ( $less(npb,0)
    | ~ spl0_4 ),
    inference(avatar_component_clause,[],[f50]) ).

tff(f53,plain,
    ( spl0_3
    | spl0_4 ),
    inference(avatar_split_clause,[],[f32,f50,f46]) ).

tff(f55,definition,
    ( spl0_5
  <=> p(npa) ),
    introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).

tff(f57,plain,
    ( ~ p(npa)
    | spl0_5 ),
    inference(avatar_component_clause,[],[f55]) ).

tff(f58,plain,
    ( spl0_2
    | ~ spl0_5 ),
    inference(avatar_split_clause,[],[f34,f55,f41]) ).

tff(f60,definition,
    ( spl0_6
  <=> ( npa = npb ) ),
    introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).

tff(f62,plain,
    ( ( npa = npb )
    | ~ spl0_6 ),
    inference(avatar_component_clause,[],[f60]) ).

tff(f64,definition,
    ( spl0_7
  <=> ! [X0: $int] : ~ r(X0) ),
    introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).

tff(f65,plain,
    ( ! [X0: $int] : ~ r(X0)
    | ~ spl0_7 ),
    inference(avatar_component_clause,[],[f64]) ).

tff(f66,plain,
    ( spl0_6
    | spl0_7 ),
    inference(avatar_split_clause,[],[f31,f64,f60]) ).

tff(f68,definition,
    ( spl0_8
  <=> q(npb) ),
    introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).

tff(f70,plain,
    ( q(npb)
    | ~ spl0_8 ),
    inference(avatar_component_clause,[],[f68]) ).

tff(f71,plain,
    ( spl0_8
    | ~ spl0_4 ),
    inference(avatar_split_clause,[],[f33,f50,f68]) ).

tff(f72,plain,
    ( ~ $less(npa,0)
    | spl0_4
    | ~ spl0_6 ),
    inference(constrained_superposition,[],[f51,f62]) ).

tff(f73,plain,
    ( p(npa)
    | ~ spl0_3
    | ~ spl0_6 ),
    inference(constrained_superposition,[],[f48,f62]) ).

tff(f74,plain,
    ( $false
    | ~ spl0_3
    | spl0_5
    | ~ spl0_6 ),
    inference(forward_subsumption_resolution,[],[f73,f57]) ).

tff(f75,plain,
    ( ~ spl0_3
    | spl0_5
    | ~ spl0_6 ),
    inference(avatar_contradiction_clause,[],[f74]) ).

tff(f76,plain,
    ( ~ spl0_2
    | spl0_4
    | ~ spl0_6 ),
    inference(avatar_split_clause,[],[f72,f60,f50,f41]) ).

tff(f77,plain,
    ( $false
    | ~ spl0_7 ),
    inference(forward_subsumption_resolution,[],[f65,f30]) ).

tff(f78,plain,
    ~ spl0_7,
    inference(avatar_contradiction_clause,[],[f77]) ).

tff(f79,plain,
    ( $less(npa,0)
    | ~ spl0_4
    | ~ spl0_6 ),
    inference(constrained_superposition,[],[f52,f62]) ).

tff(f80,plain,
    ( q(npa)
    | ~ spl0_6
    | ~ spl0_8 ),
    inference(constrained_superposition,[],[f70,f62]) ).

tff(f82,plain,
    ( $false
    | spl0_1
    | ~ spl0_6
    | ~ spl0_8 ),
    inference(forward_subsumption_resolution,[],[f80,f39]) ).

tff(f83,plain,
    ( spl0_1
    | ~ spl0_6
    | ~ spl0_8 ),
    inference(avatar_contradiction_clause,[],[f82]) ).

tff(f84,plain,
    ( spl0_2
    | ~ spl0_4
    | ~ spl0_6 ),
    inference(avatar_split_clause,[],[f79,f60,f50,f41]) ).

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

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

cnf(s3,plain,
    ( spl0_2
    | ~ spl0_5 ),
    inference(sat_conversion,[],[f58]) ).

cnf(s4,plain,
    ( spl0_6
    | spl0_7 ),
    inference(sat_conversion,[],[f66]) ).

cnf(s5,plain,
    ( ~ spl0_4
    | spl0_8 ),
    inference(sat_conversion,[],[f71]) ).

cnf(s6,plain,
    ( ~ spl0_3
    | spl0_5
    | ~ spl0_6 ),
    inference(sat_conversion,[],[f75]) ).

cnf(s7,plain,
    ( ~ spl0_2
    | spl0_4
    | ~ spl0_6 ),
    inference(sat_conversion,[],[f76]) ).

cnf(s8,plain,
    ~ spl0_7,
    inference(sat_conversion,[],[f78]) ).

cnf(s9,plain,
    ( spl0_1
    | ~ spl0_6
    | ~ spl0_8 ),
    inference(sat_conversion,[],[f83]) ).

cnf(s10,plain,
    ( spl0_2
    | ~ spl0_4
    | ~ spl0_6 ),
    inference(sat_conversion,[],[f84]) ).

cnf(s11,plain,
    spl0_6,
    inference(rat,[],[s4,s8]) ).

cnf(s12,plain,
    spl0_4,
    inference(rat,[],[s6,s3,s2,s7,s11]) ).

cnf(s13,plain,
    spl0_2,
    inference(rat,[],[s10,s11,s12]) ).

cnf(s14,plain,
    spl0_8,
    inference(rat,[],[s5,s12]) ).

cnf(s15,plain,
    ~ spl0_1,
    inference(rat,[],[s1,s13]) ).

cnf(s16,plain,
    $false,
    inference(rat,[],[s9,s11,s14,s15]) ).

tff(f85,plain,
    $false,
    inference(avatar_sat_refutation,[],[s16]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYP116_1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.21  % Computer : n006.cluster.edu
% 0.07/0.21  % Model    : x86_64 x86_64
% 0.07/0.21  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.21  % Memory   : 8046.5625MB
% 0.07/0.21  % OS       : Linux 6.8.0-71-generic
% 0.07/0.21  % CPULimit : 300
% 0.07/0.21  % WCLimit  : 300
% 0.07/0.21  % DateTime : Mon Sep 28 18:46:55 UTC 2026
% 0.07/0.22  % CPUTime  : 
% 0.07/0.22  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.27  Running first-order theorem proving
% 0.07/0.27  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
% 3.59/1.34  % (47856)Detected arithmetic, will pick strategies from an ALASCA-aware ARI schedule.
% 3.59/1.34  % (47900)dis+21_64_to=kbo:sil=128000:si=on:sp=weighted_frequency:uwa=alasca_can_abstract:random_seed=33975868:i=4:rtra=on_2999 on theBenchmark for (2999ds/4Mi)
% 3.59/1.34  % (47900)First to succeed.
% 3.59/1.34  % (47900)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-47856"
% 3.59/1.34  % (47897)dis+1002_1_to=kbo:sil=128000:tgt=ground:sas=z3:si=on:spb=units:tha=off:random_seed=363233084:i=307:kws=precedence:nm=0:rtra=on_2999 on theBenchmark for (2999ds/307Mi)
% 3.59/1.34  % (47897)Also succeeded, but the first one will report.
% 3.59/1.34  % (47898)dis+10_3_slsqr=1,4:to=lpo:sil=128000:thi=strong:si=on:uwa=off:s2agt=20:slsqc=1:slsq=on:random_seed=4200053658:i=201:slsql=off:asg=cautious:rtra=on:gtg=all:ss=axioms:sgt=16_2999 on theBenchmark for (2999ds/201Mi)
% 3.59/1.34  % (47896)dis+1002_16:1_to=lpo:sil=64000:sas=z3:si=on:norm_ineq=on:gve=force:uwa=one_side_constant:random_seed=2178181451:i=12:doe=on:rtra=on:gtg=exists_top:ss=axioms_2999 on theBenchmark for (2999ds/12Mi)
% 3.59/1.34  % (47899)lrs+1002_4:1_to=lpo:sil=64000:si=on:br=off:random_seed=2730336663:s2a=on:i=7:rtra=on:inst=on_2999 on theBenchmark for (2999ds/7Mi)
% 3.59/1.34  % (47902)lrs+10_1_to=lpo:sas=z3:si=on:tha=off:random_seed=2862123903:i=46:rtra=on_2999 on theBenchmark for (2999ds/46Mi)
% 3.59/1.34  % (47903)lrs+10_1_tgt=ground:sas=z3:si=on:random_seed=562502044:i=33:rtra=on_2999 on theBenchmark for (2999ds/33Mi)
% 3.59/1.34  % (47899)Also succeeded, but the first one will report.
% 3.59/1.34  % (47898)Refutation not found, incomplete strategy
% 3.59/1.34  % (47898)------------------------------
% 3.59/1.34  % (47898)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.59/1.34  % (47898)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.59/1.34  % (47898)CaDiCaL version: 2.1.3
% 3.59/1.34  % (47898)Termination reason: Refutation not found, incomplete strategy
% 3.59/1.34  % (47898)Time elapsed: 0.035 s
% 3.59/1.34  % (47898)Peak memory usage: 111 MB
% 3.59/1.34  % (47898)Instructions burned: 5 (million)
% 3.59/1.34  % (47896)Refutation not found, incomplete strategy
% 3.59/1.34  % (47896)------------------------------
% 3.59/1.34  % (47896)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.59/1.34  % (47896)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.59/1.34  % (47896)CaDiCaL version: 2.1.3
% 3.59/1.34  % (47896)Termination reason: Refutation not found, incomplete strategy
% 3.59/1.34  % (47896)Time elapsed: 0.034 s
% 3.59/1.34  % (47896)Peak memory usage: 111 MB
% 3.59/1.34  % (47896)Instructions burned: 5 (million)
% 3.59/1.34  % (47902)Also succeeded, but the first one will report.
% 3.59/1.34  % (47903)Also succeeded, but the first one will report.
% 3.59/1.34  % (47900)Refutation found. Thanks to Tanya!
% 3.59/1.34  % SZS status Unsatisfiable for theBenchmark
% 3.59/1.34  % SZS output start Proof for theBenchmark
% See solution above
% 3.59/1.34  % (47900)------------------------------
% 3.59/1.34  % (47900)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.59/1.34  % (47900)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.59/1.34  % (47900)CaDiCaL version: 2.1.3
% 3.59/1.34  % (47900)Termination reason: Refutation
% 3.59/1.34  % (47900)Time elapsed: 0.003 s
% 3.59/1.34  % (47900)Peak memory usage: 90 MB
% 3.59/1.34  % (47900)Instructions burned: 2 (million)
% 3.59/1.34  % (47900)------------------------------
% 3.59/1.34  % (47900)------------------------------
% 3.59/1.34  % (47856)Success in time 0.401 s
% 3.59/1.34  % Vampire exiting
%------------------------------------------------------------------------------