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

% Computer : n017.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:52 PM UTC 2026

% Result   : Theorem 0.19s 0.48s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   41 (  14 unt;   3 def)
%            Number of atoms       :   71 (   8 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   60 (  30   ~;  26   |;   0   &)
%                                         (   3 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   4 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   22 (   0 sgn  22   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    less(vd328,vd329),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','holds(conseq(conjunct2(conjunct2(204))), 336, 0)') ).

fof(f2,negated_conjecture,
    ~ less(vd328,vd329),
    inference(negated_conjecture,[status(cth)],[f1]) ).

fof(f3,axiom,
    less(vplus(vd328,vd330),vplus(vd329,vd330)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','holds(antec(conjunct2(conjunct2(204))), 335, 0)') ).

fof(f8,axiom,
    ! [X0,X1,X2] :
      ( greater(X0,X1)
     => greater(vplus(X0,X2),vplus(X1,X2)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(goal(193), 0), 2)') ).

fof(f11,axiom,
    ! [X0,X1] :
      ( X0 = X1
      | greater(X0,X1)
      | less(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(goal(130), 0), 0)') ).

fof(f12,axiom,
    ! [X0,X1] :
      ( X0 != X1
      | ~ less(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(goal(130), 0), 1)') ).

fof(f13,axiom,
    ! [X0,X1] :
      ( ~ greater(X0,X1)
      | ~ less(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(goal(130), 0), 2)') ).

fof(f28,plain,
    ~ less(vd328,vd329),
    inference(flattening,[],[f2]) ).

fof(f33,plain,
    ! [X0,X1,X2] :
      ( greater(vplus(X0,X2),vplus(X1,X2))
      | ~ greater(X0,X1) ),
    inference(ennf_transformation,[],[f8]) ).

fof(f47,plain,
    ~ less(vd328,vd329),
    inference(cnf_transformation,[],[f28]) ).

fof(f48,plain,
    less(vplus(vd328,vd330),vplus(vd329,vd330)),
    inference(cnf_transformation,[],[f3]) ).

fof(f53,plain,
    ! [X2,X0,X1] :
      ( greater(vplus(X0,X2),vplus(X1,X2))
      | ~ greater(X0,X1) ),
    inference(cnf_transformation,[],[f33]) ).

fof(f56,plain,
    ! [X0,X1] :
      ( greater(X0,X1)
      | X0 = X1
      | less(X0,X1) ),
    inference(cnf_transformation,[],[f11]) ).

fof(f57,plain,
    ! [X0,X1] :
      ( X0 != X1
      | ~ less(X0,X1) ),
    inference(cnf_transformation,[],[f12]) ).

fof(f58,plain,
    ! [X0,X1] :
      ( ~ greater(X0,X1)
      | ~ less(X0,X1) ),
    inference(cnf_transformation,[],[f13]) ).

fof(f80,plain,
    ! [X1] : ~ less(X1,X1),
    inference(equality_resolution,[],[f57]) ).

fof(f88,definition,
    ( spl4_1
  <=> greater(vplus(vd328,vd330),vplus(vd329,vd330)) ),
    introduced(definition,[new_symbols(definition,[spl4_1])],[avatar_definition]) ).

fof(f89,plain,
    ( greater(vplus(vd328,vd330),vplus(vd329,vd330))
    | ~ spl4_1 ),
    inference(avatar_component_clause,[],[f88]) ).

fof(f90,plain,
    ( ~ greater(vplus(vd328,vd330),vplus(vd329,vd330))
    | spl4_1 ),
    inference(avatar_component_clause,[],[f88]) ).

fof(f92,definition,
    ( spl4_2
  <=> greater(vd328,vd329) ),
    introduced(definition,[new_symbols(definition,[spl4_2])],[avatar_definition]) ).

fof(f93,plain,
    ( ~ greater(vd328,vd329)
    | spl4_2 ),
    inference(avatar_component_clause,[],[f92]) ).

fof(f101,definition,
    ( spl4_4
  <=> vd328 = vd329 ),
    introduced(definition,[new_symbols(definition,[spl4_4])],[avatar_definition]) ).

fof(f103,plain,
    ( vd328 = vd329
    | ~ spl4_4 ),
    inference(avatar_component_clause,[],[f101]) ).

fof(f143,plain,
    ( ~ greater(vd328,vd329)
    | spl4_1 ),
    inference(resolution,[],[f53,f90]) ).

fof(f151,plain,
    ( ~ spl4_2
    | spl4_1 ),
    inference(avatar_split_clause,[],[f143,f88,f92]) ).

fof(f152,plain,
    ( vd328 = vd329
    | less(vd328,vd329)
    | spl4_2 ),
    inference(resolution,[],[f93,f56]) ).

fof(f153,plain,
    ( vd328 = vd329
    | spl4_2 ),
    inference(forward_subsumption_resolution,[],[f152,f47]) ).

fof(f154,plain,
    ( spl4_4
    | spl4_2 ),
    inference(avatar_split_clause,[],[f153,f92,f101]) ).

fof(f158,plain,
    ( less(vplus(vd328,vd330),vplus(vd328,vd330))
    | ~ spl4_4 ),
    inference(superposition,[],[f48,f103]) ).

fof(f162,plain,
    ( $false
    | ~ spl4_4 ),
    inference(forward_subsumption_resolution,[],[f158,f80]) ).

fof(f163,plain,
    ~ spl4_4,
    inference(avatar_contradiction_clause,[],[f162]) ).

fof(f167,plain,
    ( ~ less(vplus(vd328,vd330),vplus(vd329,vd330))
    | ~ spl4_1 ),
    inference(resolution,[],[f89,f58]) ).

fof(f169,plain,
    ( $false
    | ~ spl4_1 ),
    inference(forward_subsumption_resolution,[],[f167,f48]) ).

fof(f170,plain,
    ~ spl4_1,
    inference(avatar_contradiction_clause,[],[f169]) ).

cnf(s3,plain,
    ( spl4_1
    | ~ spl4_2 ),
    inference(sat_conversion,[],[f151]) ).

cnf(s4,plain,
    ( spl4_2
    | spl4_4 ),
    inference(sat_conversion,[],[f154]) ).

cnf(s6,plain,
    ~ spl4_4,
    inference(sat_conversion,[],[f163]) ).

cnf(s7,plain,
    ~ spl4_1,
    inference(sat_conversion,[],[f170]) ).

cnf(s8,plain,
    spl4_2,
    inference(rat,[],[s4,s6]) ).

cnf(s9,plain,
    $false,
    inference(rat,[],[s3,s8,s7]) ).

fof(f171,plain,
    $false,
    inference(avatar_sat_refutation,[],[s9]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM840+2 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.39  % Computer : n017.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:25:05 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.42  Running first-order model finding
% 0.12/0.42  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.19/0.48  % (2953182)Will run a generic schedule for satisfiability detection.
% 0.19/0.48  % (2953187)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4224986052_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.48  % TRYING [1]
% 0.19/0.48  % TRYING [2]
% 0.19/0.48  % TRYING [3]
% 0.19/0.48  % TRYING [4]
% 0.19/0.48  % (2953188)% WARNING: option uhcvi not known.
% 0.19/0.48  % (2953189)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1202055066:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.48  % (2953191)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2050166917:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.48  % TRYING [5]
% 0.19/0.48  % (2953188)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3183439904:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.48  % (2953190)dis+10_1_sil=32000:sp=arity:random_seed=2325074138:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.48  % (2953192)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4019854301:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.48  % (2953193)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3076726205:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.19/0.48  % (2953190) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2953182-2953190"...
% 0.19/0.48  % (2953191) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2953182-2953191"...
% 0.19/0.48  % (2953190)...printing done.
% 0.19/0.48  % (2953193) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2953182-2953193"...
% 0.19/0.48  % (2953191)...printing done.
% 0.19/0.48  % (2953189) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2953182-2953189"...
% 0.19/0.48  % (2953190)Refutation found. Thanks to Tanya!
% 0.19/0.48  % SZS status Theorem for theBenchmark
% 0.19/0.48  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.48  % (2953190)------------------------------
% 0.19/0.48  % (2953190)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.48  % (2953190)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.48  % (2953190)CaDiCaL version: 2.1.3
% 0.19/0.48  % (2953190)Termination reason: Refutation
% 0.19/0.48  % (2953190)Time elapsed: 0.004 s
% 0.19/0.48  % (2953190)Peak memory usage: 12 MB
% 0.19/0.48  % (2953190)Instructions burned: 4 (million)
% 0.19/0.48  % (2953182)Success in time 0.046 s
% 0.19/0.48  % Vampire exiting
%------------------------------------------------------------------------------