↑ Up

Vampire-SAT---5.0.1.UNS-Ref.s

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

% Computer : n018.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:19:57 PM UTC 2026

% Result   : Unsatisfiable 0.07s 0.26s
% Output   : Refutation 0.07s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   33 (  12 unt;   2 def)
%            Number of atoms       :   66 (   0 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   71 (  38   ~;  31   |;   0   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   3 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/sandbox/benchmark/theBenchmark.p',clause_1) ).

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

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

fof(f5,negated_conjecture,
    less_or_equal(q,n),
    file('/export/starexec/sandbox/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/sandbox/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/sandbox/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/sandbox/benchmark/theBenchmark.p',clause_8) ).

fof(f9,negated_conjecture,
    ~ less_or_equal(a(p),a(q)),
    file('/export/starexec/sandbox/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(f11,plain,
    ( ~ less_or_equal(q,j)
    | ~ less_or_equal(m,p) ),
    inference(forward_subsumption_resolution,[],[f10,f4]) ).

fof(f12,plain,
    ~ less_or_equal(q,j),
    inference(forward_subsumption_resolution,[],[f11,f3]) ).

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

fof(f14,plain,
    ( ~ less_or_equal(q,n)
    | ~ less_or_equal(i,p) ),
    inference(forward_subsumption_resolution,[],[f13,f4]) ).

fof(f15,plain,
    ~ less_or_equal(i,p),
    inference(forward_subsumption_resolution,[],[f14,f5]) ).

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

fof(f17,plain,
    ( ~ less(p,i)
    | ~ less(j,q)
    | ~ less_or_equal(m,p) ),
    inference(forward_subsumption_resolution,[],[f16,f5]) ).

fof(f18,plain,
    ( ~ less(p,i)
    | ~ less(j,q) ),
    inference(forward_subsumption_resolution,[],[f17,f3]) ).

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

fof(f22,plain,
    ( ~ less(j,q)
    | spl0_1 ),
    inference(avatar_component_clause,[],[f20]) ).

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

fof(f26,plain,
    ( ~ less(p,i)
    | spl0_2 ),
    inference(avatar_component_clause,[],[f24]) ).

fof(f27,plain,
    ( ~ spl0_1
    | ~ spl0_2 ),
    inference(avatar_split_clause,[],[f18,f24,f20]) ).

fof(f28,plain,
    ( less_or_equal(q,j)
    | spl0_1 ),
    inference(resolution,[],[f22,f1]) ).

fof(f29,plain,
    ( $false
    | spl0_1 ),
    inference(forward_subsumption_resolution,[],[f28,f12]) ).

fof(f30,plain,
    spl0_1,
    inference(avatar_contradiction_clause,[],[f29]) ).

fof(f31,plain,
    ( less_or_equal(i,p)
    | spl0_2 ),
    inference(resolution,[],[f26,f1]) ).

fof(f32,plain,
    ( $false
    | spl0_2 ),
    inference(forward_subsumption_resolution,[],[f31,f15]) ).

fof(f33,plain,
    spl0_2,
    inference(avatar_contradiction_clause,[],[f32]) ).

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

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

cnf(s3,plain,
    spl0_2,
    inference(sat_conversion,[],[f33]) ).

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

fof(f34,plain,
    $false,
    inference(avatar_sat_refutation,[],[s4]) ).

%------------------------------------------------------------------------------
%----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/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.18  % Computer : n018.cluster.edu
% 0.07/0.18  % Model    : x86_64 x86_64
% 0.07/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18  % Memory   : 8046.5625MB
% 0.07/0.18  % OS       : Linux 6.8.0-71-generic
% 0.07/0.18  % CPULimit : 300
% 0.07/0.18  % WCLimit  : 300
% 0.07/0.18  % DateTime : Mon Sep 28 09:44:45 UTC 2026
% 0.07/0.18  % CPUTime  : 
% 0.07/0.18  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.21  Running first-order model finding
% 0.07/0.21  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.07/0.26  % (3264758)Will run a generic schedule for satisfiability detection.
% 0.07/0.26  % (3264764)% WARNING: option uhcvi not known.
% 0.07/0.26  % (3264766)dis+10_1_sil=32000:sp=arity:random_seed=2072375681:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.07/0.26  % (3264763)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3404544402_2999 on theBenchmark for (2999ds/0Mi)
% 0.07/0.26  % (3264767)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2438405016:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.07/0.26  % (3264765)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4155561094:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.07/0.26  % (3264764)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4254033425:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.07/0.26  % TRYING [1]
% 0.07/0.26  % (3264766) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3264758-3264766"...
% 0.07/0.26  % (3264764) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3264758-3264764"...
% 0.07/0.26  % (3264767) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3264758-3264767"...
% 0.07/0.26  % TRYING [2]
% 0.07/0.26  % TRYING [3]
% 0.07/0.26  % (3264765) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3264758-3264765"...
% 0.07/0.26  % (3264764)...printing done.
% 0.07/0.26  % (3264766)...printing done.
% 0.07/0.26  % (3264767)...printing done.
% 0.07/0.26  % (3264769)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=22146466:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.07/0.26  % (3264765)...printing done.
% 0.07/0.26  % (3264766)Refutation found. Thanks to Tanya!
% 0.07/0.26  % SZS status Unsatisfiable for theBenchmark
% 0.07/0.26  % SZS output start Proof for theBenchmark
% See solution above
% 0.07/0.26  % (3264766)------------------------------
% 0.07/0.26  % (3264766)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.07/0.26  % (3264766)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.07/0.26  % (3264766)CaDiCaL version: 2.1.3
% 0.07/0.26  % (3264766)Termination reason: Refutation
% 0.07/0.26  % (3264766)Time elapsed: 0.002 s
% 0.07/0.26  % (3264766)Peak memory usage: 11 MB
% 0.07/0.26  % (3264766)Instructions burned: 1 (million)
% 0.07/0.26  % (3264758)Success in time 0.044 s
% 0.07/0.26  % Vampire exiting
%------------------------------------------------------------------------------