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

% Computer : n013.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:47 AM UTC 2026

% Result   : Unsatisfiable 0.18s 0.28s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   17 (   6 unt;   0 def)
%            Number of atoms       :   36 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   34 (  15   ~;  19   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   21 (  21   !;   0   ?)

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

fof(f12,axiom,
    ! [X0] :
      ( defined(additive_inverse(X0))
      | ~ defined(X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',well_definedness_of_additive_inverse) ).

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/sandbox/benchmark/Axioms/FLD001-0.ax',compatibility_of_order_relation_and_addition) ).

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

fof(f28,axiom,
    defined(a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_is_defined) ).

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

fof(f31,negated_conjecture,
    ~ less_or_equal(additive_identity,add(b,additive_inverse(a))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_less_or_equal_4) ).

fof(f34,plain,
    ! [X0] :
      ( equalish(add(X0,additive_inverse(X0)),additive_identity)
      | defined(X0) ),
    inference(consistent_polarity_flipping,[],[f3]) ).

fof(f43,plain,
    ! [X0] :
      ( ~ defined(additive_inverse(X0))
      | defined(X0) ),
    inference(consistent_polarity_flipping,[],[f12]) ).

fof(f48,plain,
    ! [X2,X0,X1] :
      ( less_or_equal(add(X0,X1),add(X2,X1))
      | defined(X1)
      | ~ less_or_equal(X0,X2) ),
    inference(consistent_polarity_flipping,[],[f19]) ).

fof(f52,plain,
    ~ defined(a),
    inference(consistent_polarity_flipping,[],[f28]) ).

fof(f94,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,[],[f48,f26]) ).

fof(f445,plain,
    ! [X0,X1] :
      ( ~ less_or_equal(X0,X1)
      | less_or_equal(additive_identity,add(X1,additive_inverse(X0)))
      | defined(additive_inverse(X0))
      | defined(X0) ),
    inference(resolution,[],[f94,f34]) ).

fof(f453,plain,
    ! [X0,X1] :
      ( less_or_equal(additive_identity,add(X1,additive_inverse(X0)))
      | ~ less_or_equal(X0,X1)
      | defined(X0) ),
    inference(forward_subsumption_resolution,[],[f445,f43]) ).

fof(f1198,plain,
    ( ~ less_or_equal(a,b)
    | defined(a) ),
    inference(resolution,[],[f453,f31]) ).

fof(f1209,plain,
    defined(a),
    inference(forward_subsumption_resolution,[],[f1198,f30]) ).

fof(f1210,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f1209,f52]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : FLD067-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.18  % Computer : n013.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 : Tue Sep 29 00:47:51 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.18/0.28  % (1756085)Will run a generic schedule for satisfiability detection.
% 0.18/0.28  % (1756092)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2143861064:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.18/0.28  % (1756091)% WARNING: option uhcvi not known.
% 0.18/0.28  % (1756090)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3344194797_2999 on theBenchmark for (2999ds/0Mi)
% 0.18/0.28  % (1756095)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=123807173:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.18/0.28  % (1756091)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2715249839:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.18/0.28  % (1756093)dis+10_1_sil=32000:sp=arity:random_seed=2491778617:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.28  % (1756094)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=175435315:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.28  % (1756096)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=966657783:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.18/0.28  % TRYING [1]
% 0.18/0.28  % TRYING [2]
% 0.18/0.28  % TRYING [3]
% 0.18/0.28  % TRYING [4]
% 0.18/0.28  % (1756091) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1756085-1756091"...
% 0.18/0.28  % (1756091)...printing done.
% 0.18/0.28  % (1756091)Refutation found. Thanks to Tanya!
% 0.18/0.28  % SZS status Unsatisfiable for theBenchmark
% 0.18/0.28  % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.28  % (1756091)------------------------------
% 0.18/0.28  % (1756091)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.28  % (1756091)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.28  % (1756091)CaDiCaL version: 2.1.3
% 0.18/0.28  % (1756091)Termination reason: Refutation
% 0.18/0.28  % (1756091)Time elapsed: 0.021 s
% 0.18/0.28  % (1756091)Peak memory usage: 12 MB
% 0.18/0.28  % (1756091)Instructions burned: 29 (million)
% 0.18/0.28  % (1756085)Success in time 0.06 s
% 0.18/0.28  % Vampire exiting
%------------------------------------------------------------------------------