↑ 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  : FLD070-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 : 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 09:49:49 AM UTC 2026

% Result   : Unsatisfiable 0.09s 0.25s
% Output   : Refutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   23 (   9 unt;   0 def)
%            Number of atoms       :   48 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   45 (  20   ~;  25   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   27 (  27   !;   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(f17,axiom,
    ! [X2,X0,X1] :
      ( less_or_equal(X0,X1)
      | ~ less_or_equal(X0,X2)
      | ~ less_or_equal(X2,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',transitivity_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(f26,axiom,
    ! [X2,X0,X1] :
      ( less_or_equal(X0,X1)
      | ~ less_or_equal(X2,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,
    ~ less_or_equal(additive_identity,add(a,b)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_less_or_equal_5) ).

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

fof(f44,plain,
    ! [X2,X0,X1] :
      ( ~ less_or_equal(X0,X1)
      | less_or_equal(X0,X2)
      | less_or_equal(X2,X1) ),
    inference(consistent_polarity_flipping,[],[f17]) ).

fof(f46,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(f53,plain,
    ! [X2,X0,X1] :
      ( ~ less_or_equal(X0,X1)
      | less_or_equal(X2,X1)
      | equalish(X2,X0) ),
    inference(consistent_polarity_flipping,[],[f26]) ).

fof(f55,plain,
    ~ less_or_equal(additive_identity,a),
    inference(consistent_polarity_flipping,[],[f30]) ).

fof(f56,plain,
    ~ less_or_equal(additive_identity,b),
    inference(consistent_polarity_flipping,[],[f31]) ).

fof(f57,plain,
    less_or_equal(additive_identity,add(a,b)),
    inference(consistent_polarity_flipping,[],[f32]) ).

fof(f74,plain,
    ! [X0] :
      ( less_or_equal(X0,add(a,b))
      | less_or_equal(additive_identity,X0) ),
    inference(resolution,[],[f44,f57]) ).

fof(f81,plain,
    ! [X0,X1] :
      ( less_or_equal(X0,add(a,b))
      | equalish(X0,X1)
      | less_or_equal(additive_identity,X1) ),
    inference(resolution,[],[f53,f74]) ).

fof(f170,plain,
    ! [X0,X1] :
      ( equalish(add(X0,b),X1)
      | less_or_equal(additive_identity,X1)
      | ~ defined(b)
      | less_or_equal(X0,a) ),
    inference(resolution,[],[f81,f46]) ).

fof(f192,plain,
    ! [X0,X1] :
      ( equalish(add(X0,b),X1)
      | less_or_equal(additive_identity,X1)
      | less_or_equal(X0,a) ),
    inference(forward_subsumption_resolution,[],[f170,f29]) ).

fof(f470,plain,
    ( less_or_equal(additive_identity,b)
    | less_or_equal(additive_identity,a)
    | ~ defined(b) ),
    inference(resolution,[],[f192,f34]) ).

fof(f485,plain,
    ( less_or_equal(additive_identity,a)
    | ~ defined(b) ),
    inference(forward_subsumption_resolution,[],[f470,f56]) ).

fof(f486,plain,
    ~ defined(b),
    inference(forward_subsumption_resolution,[],[f485,f55]) ).

fof(f487,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f486,f29]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : FLD070-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.19  % Computer : n018.cluster.edu
% 0.09/0.19  % Model    : x86_64 x86_64
% 0.09/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19  % Memory   : 8046.5625MB
% 0.09/0.19  % OS       : Linux 6.8.0-71-generic
% 0.09/0.19  % CPULimit : 300
% 0.09/0.19  % WCLimit  : 300
% 0.09/0.19  % DateTime : Tue Sep 29 00:51:26 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.09/0.25  % (3948203)Will run a generic schedule for satisfiability detection.
% 0.09/0.25  % (3948209)% WARNING: option uhcvi not known.
% 0.09/0.25  % (3948209)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1760709492:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.09/0.25  % (3948209) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3948203-3948209"...
% 0.09/0.25  % (3948209)...printing done.
% 0.09/0.25  % (3948209)Refutation found. Thanks to Tanya!
% 0.09/0.25  % SZS status Unsatisfiable for theBenchmark
% 0.09/0.25  % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.25  % (3948209)------------------------------
% 0.09/0.25  % (3948209)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.25  % (3948209)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.25  % (3948209)CaDiCaL version: 2.1.3
% 0.09/0.25  % (3948209)Termination reason: Refutation
% 0.09/0.25  % (3948209)Time elapsed: 0.005 s
% 0.09/0.25  % (3948209)Peak memory usage: 11 MB
% 0.09/0.25  % (3948209)Instructions burned: 12 (million)
% 0.09/0.25  % (3948203)Success in time 0.028 s
% 0.09/0.25  % Vampire exiting
%------------------------------------------------------------------------------