↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Computer : n020.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 01:07:53 PM UTC 2026

% Result   : Unsatisfiable 2.12s 0.77s
% Output   : Refutation 2.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   15
% Syntax   : Number of formulae    :   55 (  16 unt;   7 def)
%            Number of atoms       :  116 (   0 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :  114 (  53   ~;  54   |;   0   &)
%                                         (   7 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :   10 (   9 usr;   8 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   6 con; 0-1 aty)
%            Number of variables   :    8 (   0 sgn   8   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
    ! [X0,X1] :
      ( less(X1,X0)
      | less_or_equal(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).

fof(f3,negated_conjecture,
    less_or_equal(m,p),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).

fof(f4,negated_conjecture,
    less_or_equal(p,q),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_4) ).

fof(f5,negated_conjecture,
    less_or_equal(q,n),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_5) ).

fof(f6,negated_conjecture,
    ! [X0,X1] :
      ( less_or_equal(a(X0),a(X1))
      | ~ less(X0,i)
      | ~ less(j,X1)
      | ~ less_or_equal(X1,n)
      | ~ less_or_equal(m,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).

fof(f7,negated_conjecture,
    ! [X0,X1] :
      ( less_or_equal(a(X0),a(X1))
      | ~ less_or_equal(X0,X1)
      | ~ less_or_equal(X1,j)
      | ~ less_or_equal(m,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_7) ).

fof(f8,negated_conjecture,
    ! [X0,X1] :
      ( less_or_equal(a(X0),a(X1))
      | ~ less_or_equal(X0,X1)
      | ~ less_or_equal(X1,n)
      | ~ less_or_equal(i,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_8) ).

fof(f9,negated_conjecture,
    ~ less_or_equal(a(p),a(q)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_9) ).

fof(f10,plain,
    ( ~ less_or_equal(p,q)
    | ~ less_or_equal(q,j)
    | ~ less_or_equal(m,p) ),
    inference(resolution,[],[f7,f9]) ).

fof(f12,definition,
    ( spl0_1
  <=> less_or_equal(m,p) ),
    introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).

fof(f13,plain,
    ( ~ less_or_equal(m,p)
    | spl0_1 ),
    inference(avatar_component_clause,[],[f12]) ).

fof(f15,definition,
    ( spl0_2
  <=> less_or_equal(q,j) ),
    introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).

fof(f16,plain,
    ( ~ less_or_equal(q,j)
    | spl0_2 ),
    inference(avatar_component_clause,[],[f15]) ).

fof(f18,definition,
    ( spl0_3
  <=> less_or_equal(p,q) ),
    introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).

fof(f19,plain,
    ( ~ less_or_equal(p,q)
    | spl0_3 ),
    inference(avatar_component_clause,[],[f18]) ).

fof(f20,plain,
    ( ~ spl0_1
    | ~ spl0_2
    | ~ spl0_3 ),
    inference(avatar_split_clause,[],[f10,f18,f15,f12]) ).

fof(f21,plain,
    ( $false
    | spl0_1 ),
    inference(resolution,[],[f13,f3]) ).

fof(f22,plain,
    spl0_1,
    inference(avatar_contradiction_clause,[],[f21]) ).

fof(f23,plain,
    ( ~ less_or_equal(p,q)
    | ~ less_or_equal(q,n)
    | ~ less_or_equal(i,p) ),
    inference(resolution,[],[f8,f9]) ).

fof(f25,definition,
    ( spl0_4
  <=> less_or_equal(i,p) ),
    introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).

fof(f26,plain,
    ( ~ less_or_equal(i,p)
    | spl0_4 ),
    inference(avatar_component_clause,[],[f25]) ).

fof(f28,definition,
    ( spl0_5
  <=> less_or_equal(q,n) ),
    introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).

fof(f29,plain,
    ( ~ less_or_equal(q,n)
    | spl0_5 ),
    inference(avatar_component_clause,[],[f28]) ).

fof(f30,plain,
    ( ~ spl0_4
    | ~ spl0_5
    | ~ spl0_3 ),
    inference(avatar_split_clause,[],[f23,f18,f28,f25]) ).

fof(f31,plain,
    ( $false
    | spl0_3 ),
    inference(resolution,[],[f19,f4]) ).

fof(f32,plain,
    spl0_3,
    inference(avatar_contradiction_clause,[],[f31]) ).

fof(f33,plain,
    ( ~ less(p,i)
    | ~ less(j,q)
    | ~ less_or_equal(q,n)
    | ~ less_or_equal(m,p) ),
    inference(resolution,[],[f6,f9]) ).

fof(f35,definition,
    ( spl0_6
  <=> less(j,q) ),
    introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).

fof(f36,plain,
    ( ~ less(j,q)
    | spl0_6 ),
    inference(avatar_component_clause,[],[f35]) ).

fof(f38,definition,
    ( spl0_7
  <=> less(p,i) ),
    introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).

fof(f39,plain,
    ( ~ less(p,i)
    | spl0_7 ),
    inference(avatar_component_clause,[],[f38]) ).

fof(f40,plain,
    ( ~ spl0_1
    | ~ spl0_5
    | ~ spl0_6
    | ~ spl0_7 ),
    inference(avatar_split_clause,[],[f33,f38,f35,f28,f12]) ).

fof(f41,plain,
    ( $false
    | spl0_5 ),
    inference(resolution,[],[f29,f5]) ).

fof(f42,plain,
    spl0_5,
    inference(avatar_contradiction_clause,[],[f41]) ).

fof(f43,plain,
    ( less_or_equal(q,j)
    | spl0_6 ),
    inference(resolution,[],[f36,f1]) ).

fof(f44,plain,
    ( $false
    | spl0_2
    | spl0_6 ),
    inference(resolution,[],[f43,f16]) ).

fof(f45,plain,
    ( spl0_2
    | spl0_6 ),
    inference(avatar_contradiction_clause,[],[f44]) ).

fof(f46,plain,
    ( less_or_equal(i,p)
    | spl0_7 ),
    inference(resolution,[],[f39,f1]) ).

fof(f47,plain,
    ( $false
    | spl0_4
    | spl0_7 ),
    inference(resolution,[],[f46,f26]) ).

fof(f48,plain,
    ( spl0_4
    | spl0_7 ),
    inference(avatar_contradiction_clause,[],[f47]) ).

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

cnf(s2,plain,
    spl0_1,
    inference(sat_conversion,[],[f22]) ).

cnf(s3,plain,
    ( ~ spl0_3
    | ~ spl0_4
    | ~ spl0_5 ),
    inference(sat_conversion,[],[f30]) ).

cnf(s4,plain,
    spl0_3,
    inference(sat_conversion,[],[f32]) ).

cnf(s5,plain,
    ( ~ spl0_1
    | ~ spl0_5
    | ~ spl0_6
    | ~ spl0_7 ),
    inference(sat_conversion,[],[f40]) ).

cnf(s6,plain,
    spl0_5,
    inference(sat_conversion,[],[f42]) ).

cnf(s7,plain,
    ( spl0_2
    | spl0_6 ),
    inference(sat_conversion,[],[f45]) ).

cnf(s8,plain,
    ( spl0_4
    | spl0_7 ),
    inference(sat_conversion,[],[f48]) ).

cnf(s9,plain,
    ( ~ spl0_1
    | ~ spl0_6
    | ~ spl0_7 ),
    inference(rat,[],[s5,s6]) ).

cnf(s10,plain,
    ~ spl0_4,
    inference(rat,[],[s3,s6,s4]) ).

cnf(s11,plain,
    spl0_7,
    inference(rat,[],[s8,s10]) ).

cnf(s12,plain,
    ~ spl0_6,
    inference(rat,[],[s9,s11,s2]) ).

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

cnf(s14,plain,
    $false,
    inference(rat,[],[s1,s4,s13,s2]) ).

fof(f49,plain,
    $false,
    inference(avatar_sat_refutation,[],[s14]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWV009-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.19  % Computer : n020.cluster.edu
% 0.09/0.19  % Model    : x86_64 x86_64
% 0.09/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19  % Memory   : 8046.5625MB
% 0.09/0.19  % OS       : Linux 6.8.0-71-generic
% 0.09/0.19  % CPULimit : 300
% 0.09/0.19  % WCLimit  : 300
% 0.09/0.19  % DateTime : Mon Sep 28 09:43:25 UTC 2026
% 0.09/0.19  % CPUTime  : 
% 0.09/0.19  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.22  Running first-order theorem proving
% 0.09/0.23  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
% 2.12/0.77  % (62376)Input is clausal, will run a generic CNF schedule.
% 2.12/0.77  % (62414)dis-21_1_sil=8000:lcm=predicate:random_seed=1385858669:st=5:avsq=on:i=117:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_3000 on theBenchmark for (3000ds/117Mi)
% 2.12/0.77  % (62414)First to succeed.
% 2.12/0.77  % (62414)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-62376"
% 2.12/0.77  % (62412)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3157582015:s2a=on:i=180:gtg=position_3000 on theBenchmark for (3000ds/180Mi)
% 2.12/0.77  % (62409)lrs+10_1_sil=8000:sp=occurrence:random_seed=3579041273:i=107:sd=3:ss=axioms:sgt=8_3000 on theBenchmark for (3000ds/107Mi)
% 2.12/0.77  % (62411)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=752334215:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_3000 on theBenchmark for (3000ds/114Mi)
% 2.12/0.77  % (62408)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=3563972965:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_3000 on theBenchmark for (3000ds/137899Mi)
% 2.12/0.77  % (62404)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=1004263656:i=140167_3000 on theBenchmark for (3000ds/140167Mi)
% 2.12/0.77  % (62409)Also succeeded, but the first one will report.
% 2.12/0.77  % (62411)Also succeeded, but the first one will report.
% 2.12/0.77  % (62412)Also succeeded, but the first one will report.
% 2.12/0.77  % (62406)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=1436955266:i=132376:av=off_3000 on theBenchmark for (3000ds/132376Mi)
% 2.12/0.77  % (62414)Refutation found. Thanks to Tanya!
% 2.12/0.77  % SZS status Unsatisfiable for theBenchmark
% 2.12/0.77  % SZS output start Proof for theBenchmark
% See solution above
% 2.12/0.77  % (62414)------------------------------
% 2.12/0.77  % (62414)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.12/0.77  % (62414)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.12/0.77  % (62414)CaDiCaL version: 2.1.3
% 2.12/0.77  % (62414)Termination reason: Refutation
% 2.12/0.77  % (62414)Time elapsed: 0.001 s
% 2.12/0.77  % (62414)Peak memory usage: 89 MB
% 2.12/0.77  % (62414)Instructions burned: 1 (million)
% 2.12/0.77  % (62414)------------------------------
% 2.12/0.77  % (62414)------------------------------
% 2.12/0.77  % (62376)Success in time 0.255 s
% 2.12/0.77  % Vampire exiting
%------------------------------------------------------------------------------