↑ 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+1 : 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 : n008.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.14s 0.42s
% Output   : Refutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   41 (  18 unt;   2 def)
%            Number of atoms       :   68 (   9 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   58 (  31   ~;  24   |;   0   &)
%                                         (   2 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   3 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   33 (   0 sgn  33   !;   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(f19,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(f20,axiom,
    ! [X0,X1] :
      ( X0 != X1
      | ~ less(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(goal(130), 0), 1)') ).

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

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

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

fof(f63,plain,
    ~ less(vd328,vd329),
    inference(cnf_transformation,[],[f41]) ).

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

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

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

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

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

fof(f121,plain,
    ! [X1] : ~ less(X1,X1),
    inference(equality_resolution,[],[f86]) ).

fof(f128,plain,
    less(vd328,vd329),
    inference(consistent_polarity_flipping,[],[f63]) ).

fof(f129,plain,
    ~ less(vplus(vd328,vd330),vplus(vd329,vd330)),
    inference(consistent_polarity_flipping,[],[f64]) ).

fof(f132,plain,
    ! [X2,X0,X1] :
      ( ~ greater(vplus(X0,X2),vplus(X1,X2))
      | greater(X0,X1) ),
    inference(consistent_polarity_flipping,[],[f69]) ).

fof(f143,plain,
    ! [X0,X1] :
      ( ~ greater(X0,X1)
      | ~ less(X0,X1)
      | X0 = X1 ),
    inference(consistent_polarity_flipping,[],[f85]) ).

fof(f144,plain,
    ! [X1] : less(X1,X1),
    inference(consistent_polarity_flipping,[],[f121]) ).

fof(f145,plain,
    ! [X0,X1] :
      ( greater(X0,X1)
      | less(X0,X1) ),
    inference(consistent_polarity_flipping,[],[f87]) ).

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

fof(f153,plain,
    ( greater(vd328,vd329)
    | ~ spl4_1 ),
    inference(avatar_component_clause,[],[f152]) ).

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

fof(f163,plain,
    ( vd328 = vd329
    | ~ spl4_3 ),
    inference(avatar_component_clause,[],[f161]) ).

fof(f265,plain,
    ! [X2,X0,X1] :
      ( less(vplus(X0,X2),vplus(X1,X2))
      | greater(X0,X1) ),
    inference(resolution,[],[f132,f145]) ).

fof(f848,plain,
    greater(vd328,vd329),
    inference(resolution,[],[f265,f129]) ).

fof(f875,plain,
    spl4_1,
    inference(avatar_split_clause,[],[f848,f152]) ).

fof(f876,plain,
    ( ~ less(vd328,vd329)
    | vd328 = vd329
    | ~ spl4_1 ),
    inference(resolution,[],[f153,f143]) ).

fof(f880,plain,
    ( vd328 = vd329
    | ~ spl4_1 ),
    inference(forward_subsumption_resolution,[],[f876,f128]) ).

fof(f884,plain,
    ( spl4_3
    | ~ spl4_1 ),
    inference(avatar_split_clause,[],[f880,f152,f161]) ).

fof(f888,plain,
    ( ~ less(vplus(vd328,vd330),vplus(vd328,vd330))
    | ~ spl4_3 ),
    inference(superposition,[],[f129,f163]) ).

fof(f901,plain,
    ( $false
    | ~ spl4_3 ),
    inference(forward_subsumption_resolution,[],[f888,f144]) ).

fof(f902,plain,
    ~ spl4_3,
    inference(avatar_contradiction_clause,[],[f901]) ).

cnf(s8,plain,
    spl4_1,
    inference(sat_conversion,[],[f875]) ).

cnf(s12,plain,
    ( ~ spl4_1
    | spl4_3 ),
    inference(sat_conversion,[],[f884]) ).

cnf(s14,plain,
    ~ spl4_3,
    inference(sat_conversion,[],[f902]) ).

cnf(s15,plain,
    ~ spl4_1,
    inference(rat,[],[s12,s14]) ).

cnf(s16,plain,
    $false,
    inference(rat,[],[s8,s15]) ).

fof(f903,plain,
    $false,
    inference(avatar_sat_refutation,[],[s16]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM840+1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.35  % Computer : n008.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Sun Sep 27 21:30:25 UTC 2026
% 0.09/0.35  % CPUTime  : 
% 0.09/0.35  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.14/0.38  Running first-order model finding
% 0.14/0.38  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.14/0.42  % (1617660)Will run a generic schedule for satisfiability detection.
% 0.14/0.42  % (1617666)% WARNING: option uhcvi not known.
% 0.14/0.42  % (1617666)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1524486630:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.14/0.42  % (1617665)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1701966365_2999 on theBenchmark for (2999ds/0Mi)
% 0.14/0.42  % (1617667)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3702153405:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.14/0.42  % (1617670)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3784227023:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.14/0.42  % (1617669)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2701558898:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.14/0.42  % (1617668)dis+10_1_sil=32000:sp=arity:random_seed=2137645760:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.14/0.42  % (1617671)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2627992186:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.14/0.42  % TRYING [1]
% 0.14/0.42  % TRYING [2]
% 0.14/0.42  % (1617666) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1617660-1617666"...
% 0.14/0.42  % TRYING [3]
% 0.14/0.42  % (1617666)...printing done.
% 0.14/0.42  % (1617666)Refutation found. Thanks to Tanya!
% 0.14/0.42  % SZS status Theorem for theBenchmark
% 0.14/0.42  % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.42  % (1617666)------------------------------
% 0.14/0.42  % (1617666)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.14/0.42  % (1617666)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.14/0.42  % (1617666)CaDiCaL version: 2.1.3
% 0.14/0.42  % (1617666)Termination reason: Refutation
% 0.14/0.42  % (1617666)Time elapsed: 0.012 s
% 0.14/0.42  % (1617666)Peak memory usage: 13 MB
% 0.14/0.42  % (1617666)Instructions burned: 33 (million)
% 0.14/0.42  % (1617660)Success in time 0.027 s
% 0.14/0.42  % Vampire exiting
%------------------------------------------------------------------------------