↑ 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  : FLD069-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT

% Computer : n005.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 09:49:48 AM UTC 2026

% Result   : Unsatisfiable 0.20s 0.30s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   36 (  13 unt;   2 def)
%            Number of atoms       :   69 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   66 (  33   ~;  31   |;   0   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   3 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   24 (   0 sgn  24   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f2,axiom,
    ! [X0] :
      ( equalish(add(additive_identity,X0),X0)
      | ~ defined(X0) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',existence_of_identity_addition) ).

fof(f16,axiom,
    ! [X0,X1] :
      ( ~ less_or_equal(X1,X0)
      | ~ less_or_equal(X0,X1)
      | equalish(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',antisymmetry_of_order_relation) ).

fof(f19,axiom,
    ! [X2,X0,X1] :
      ( less_or_equal(add(X0,X1),add(X2,X1))
      | ~ defined(X1)
      | ~ less_or_equal(X0,X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',compatibility_of_order_relation_and_addition) ).

fof(f22,axiom,
    ! [X0,X1] :
      ( ~ equalish(X1,X0)
      | equalish(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',symmetry_of_equality) ).

fof(f23,axiom,
    ! [X2,X0,X1] :
      ( ~ equalish(X2,X1)
      | ~ equalish(X0,X2)
      | equalish(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',transitivity_of_equality) ).

fof(f26,axiom,
    ! [X2,X0,X1] :
      ( ~ less_or_equal(X2,X1)
      | less_or_equal(X0,X1)
      | ~ equalish(X2,X0) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',compatibility_of_equality_and_order_relation) ).

fof(f29,axiom,
    defined(b),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_is_defined) ).

fof(f30,negated_conjecture,
    less_or_equal(additive_identity,a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_3) ).

fof(f31,negated_conjecture,
    less_or_equal(additive_identity,b),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_4) ).

fof(f32,negated_conjecture,
    ~ equalish(b,additive_identity),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_not_equal_to_additive_identity_5) ).

fof(f33,negated_conjecture,
    equalish(add(a,b),additive_identity),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',add_equals_additive_identity_6) ).

fof(f34,plain,
    equalish(additive_identity,add(a,b)),
    inference(resolution,[],[f22,f33]) ).

fof(f63,plain,
    ! [X0] :
      ( ~ equalish(X0,add(a,b))
      | equalish(X0,additive_identity) ),
    inference(resolution,[],[f23,f33]) ).

fof(f69,plain,
    ! [X0] :
      ( ~ equalish(additive_identity,X0)
      | less_or_equal(X0,b) ),
    inference(resolution,[],[f26,f31]) ).

fof(f142,plain,
    ! [X2,X3,X0,X1] :
      ( ~ equalish(add(X1,X0),X3)
      | ~ less_or_equal(X1,X2)
      | less_or_equal(X3,add(X2,X0))
      | ~ defined(X0) ),
    inference(resolution,[],[f19,f26]) ).

fof(f151,plain,
    less_or_equal(add(a,b),b),
    inference(resolution,[],[f69,f34]) ).

fof(f162,plain,
    ( ~ less_or_equal(b,add(a,b))
    | equalish(b,add(a,b)) ),
    inference(resolution,[],[f151,f16]) ).

fof(f164,definition,
    ( spl0_9
  <=> equalish(b,add(a,b)) ),
    introduced(definition,[new_symbols(definition,[spl0_9])],[avatar_definition]) ).

fof(f166,plain,
    ( equalish(b,add(a,b))
    | ~ spl0_9 ),
    inference(avatar_component_clause,[],[f164]) ).

fof(f168,definition,
    ( spl0_10
  <=> less_or_equal(b,add(a,b)) ),
    introduced(definition,[new_symbols(definition,[spl0_10])],[avatar_definition]) ).

fof(f170,plain,
    ( ~ less_or_equal(b,add(a,b))
    | spl0_10 ),
    inference(avatar_component_clause,[],[f168]) ).

fof(f171,plain,
    ( spl0_9
    | ~ spl0_10 ),
    inference(avatar_split_clause,[],[f162,f168,f164]) ).

fof(f615,plain,
    ! [X0,X1] :
      ( ~ less_or_equal(additive_identity,X0)
      | less_or_equal(X1,add(X0,X1))
      | ~ defined(X1)
      | ~ defined(X1) ),
    inference(resolution,[],[f142,f2]) ).

fof(f632,plain,
    ! [X0,X1] :
      ( less_or_equal(X1,add(X0,X1))
      | ~ less_or_equal(additive_identity,X0)
      | ~ defined(X1) ),
    inference(duplicate_literal_removal,[],[f615]) ).

fof(f1702,plain,
    ( ~ less_or_equal(additive_identity,a)
    | ~ defined(b)
    | spl0_10 ),
    inference(resolution,[],[f632,f170]) ).

fof(f1704,plain,
    ( ~ defined(b)
    | spl0_10 ),
    inference(forward_subsumption_resolution,[],[f1702,f30]) ).

fof(f1706,plain,
    ( $false
    | spl0_10 ),
    inference(forward_subsumption_resolution,[],[f1704,f29]) ).

fof(f1707,plain,
    spl0_10,
    inference(avatar_contradiction_clause,[],[f1706]) ).

fof(f1710,plain,
    ( equalish(b,additive_identity)
    | ~ spl0_9 ),
    inference(resolution,[],[f166,f63]) ).

fof(f1722,plain,
    ( $false
    | ~ spl0_9 ),
    inference(forward_subsumption_resolution,[],[f1710,f32]) ).

fof(f1723,plain,
    ~ spl0_9,
    inference(avatar_contradiction_clause,[],[f1722]) ).

cnf(s5,plain,
    ( spl0_9
    | ~ spl0_10 ),
    inference(sat_conversion,[],[f171]) ).

cnf(s61,plain,
    spl0_10,
    inference(sat_conversion,[],[f1707]) ).

cnf(s63,plain,
    ~ spl0_9,
    inference(sat_conversion,[],[f1723]) ).

cnf(s83,plain,
    $false,
    inference(rat,[],[s5,s61,s63]) ).

fof(f1727,plain,
    $false,
    inference(avatar_sat_refutation,[],[s83]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : FLD069-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.18  % Computer : n005.cluster.edu
% 0.09/0.18  % Model    : x86_64 x86_64
% 0.09/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18  % Memory   : 8046.5625MB
% 0.09/0.18  % OS       : Linux 6.8.0-71-generic
% 0.09/0.18  % CPULimit : 300
% 0.09/0.18  % WCLimit  : 300
% 0.09/0.18  % DateTime : Tue Sep 29 00:48:31 UTC 2026
% 0.09/0.19  % CPUTime  : 
% 0.09/0.19  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.22  Running first-order model finding
% 0.09/0.22  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.20/0.30  % (1337801)Will run a generic schedule for satisfiability detection.
% 0.20/0.30  % (1337806)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2473161455_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.30  % TRYING [1]
% 0.20/0.30  % TRYING [2]
% 0.20/0.30  % TRYING [3]
% 0.20/0.30  % (1337807)% WARNING: option uhcvi not known.
% 0.20/0.30  % TRYING [4]
% 0.20/0.30  % (1337809)dis+10_1_sil=32000:sp=arity:random_seed=3366021607:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.30  % (1337807)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=44879483:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.30  % (1337808)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=614347430:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.30  % (1337810)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=351011691:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.30  % (1337811)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2594692311:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.30  % (1337812)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1296101702:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.30  % TRYING [5]
% 0.20/0.30  % (1337809) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1337801-1337809"...
% 0.20/0.30  % (1337809)...printing done.
% 0.20/0.30  % (1337809)Refutation found. Thanks to Tanya!
% 0.20/0.30  % SZS status Unsatisfiable for theBenchmark
% 0.20/0.30  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.30  % (1337809)------------------------------
% 0.20/0.30  % (1337809)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.30  % (1337809)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.30  % (1337809)CaDiCaL version: 2.1.3
% 0.20/0.30  % (1337809)Termination reason: Refutation
% 0.20/0.30  % (1337809)Time elapsed: 0.027 s
% 0.20/0.30  % (1337809)Peak memory usage: 12 MB
% 0.20/0.30  % (1337809)Instructions burned: 38 (million)
% 0.20/0.30  % (1337801)Success in time 0.068 s
% 0.20/0.30  % Vampire exiting
%------------------------------------------------------------------------------