↑ 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  : FLD055-3 : 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:44 AM UTC 2026

% Result   : Unsatisfiable 0.09s 0.27s
% Output   : Refutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   31 (  11 unt;   2 def)
%            Number of atoms       :   60 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   57 (  28   ~;  27   |;   0   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   3 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   16 (   0 sgn  16   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f3,axiom,
    ! [X0] :
      ( sum(additive_identity,X0,X0)
      | ~ defined(X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',existence_of_identity_addition) ).

fof(f14,axiom,
    defined(additive_identity),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',well_definedness_of_additive_identity) ).

fof(f22,axiom,
    ! [X2,X0,X1] :
      ( ~ less_or_equal(X2,X1)
      | ~ less_or_equal(X0,X2)
      | less_or_equal(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',transitivity_of_order_relation) ).

fof(f23,axiom,
    ! [X0,X1] :
      ( less_or_equal(X1,X0)
      | less_or_equal(X0,X1)
      | ~ defined(X0)
      | ~ defined(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',totality_of_order_relation) ).

fof(f24,axiom,
    ! [X2,X3,X0,X1,X4] :
      ( ~ sum(X3,X4,X1)
      | ~ less_or_equal(X2,X3)
      | ~ sum(X2,X4,X0)
      | less_or_equal(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',compatibility_of_order_relation_and_addition) ).

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

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

fof(f31,negated_conjecture,
    sum(additive_identity,b,c),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sum_5) ).

fof(f32,negated_conjecture,
    ~ less_or_equal(a,c),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_less_or_equal_6) ).

fof(f63,plain,
    ! [X0] :
      ( less_or_equal(X0,X0)
      | ~ defined(X0)
      | ~ defined(X0) ),
    inference(factoring,[],[f23]) ).

fof(f64,plain,
    ! [X0] :
      ( less_or_equal(X0,X0)
      | ~ defined(X0) ),
    inference(duplicate_literal_removal,[],[f63]) ).

fof(f91,plain,
    ! [X0,X1] :
      ( ~ sum(X0,b,X1)
      | ~ less_or_equal(X0,additive_identity)
      | less_or_equal(X1,c) ),
    inference(resolution,[],[f24,f31]) ).

fof(f99,plain,
    ( ~ less_or_equal(additive_identity,additive_identity)
    | less_or_equal(b,c)
    | ~ defined(b) ),
    inference(resolution,[],[f91,f3]) ).

fof(f108,definition,
    ( spl0_5
  <=> less_or_equal(additive_identity,additive_identity) ),
    introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).

fof(f110,plain,
    ( ~ less_or_equal(additive_identity,additive_identity)
    | spl0_5 ),
    inference(avatar_component_clause,[],[f108]) ).

fof(f113,plain,
    ( ~ less_or_equal(additive_identity,additive_identity)
    | less_or_equal(b,c) ),
    inference(forward_subsumption_resolution,[],[f99,f28]) ).

fof(f135,definition,
    ( spl0_10
  <=> less_or_equal(b,c) ),
    introduced(definition,[new_symbols(definition,[spl0_10])],[avatar_definition]) ).

fof(f137,plain,
    ( less_or_equal(b,c)
    | ~ spl0_10 ),
    inference(avatar_component_clause,[],[f135]) ).

fof(f138,plain,
    ( spl0_10
    | ~ spl0_5 ),
    inference(avatar_split_clause,[],[f113,f108,f135]) ).

fof(f240,plain,
    ( ~ defined(additive_identity)
    | spl0_5 ),
    inference(resolution,[],[f64,f110]) ).

fof(f241,plain,
    ( $false
    | spl0_5 ),
    inference(forward_subsumption_resolution,[],[f240,f14]) ).

fof(f242,plain,
    spl0_5,
    inference(avatar_contradiction_clause,[],[f241]) ).

fof(f262,plain,
    ( ! [X0] :
        ( ~ less_or_equal(X0,b)
        | less_or_equal(X0,c) )
    | ~ spl0_10 ),
    inference(resolution,[],[f137,f22]) ).

fof(f346,plain,
    ( less_or_equal(a,c)
    | ~ spl0_10 ),
    inference(resolution,[],[f262,f30]) ).

fof(f348,plain,
    ( $false
    | ~ spl0_10 ),
    inference(forward_subsumption_resolution,[],[f346,f32]) ).

fof(f349,plain,
    ~ spl0_10,
    inference(avatar_contradiction_clause,[],[f348]) ).

cnf(s9,plain,
    ( ~ spl0_5
    | spl0_10 ),
    inference(sat_conversion,[],[f138]) ).

cnf(s15,plain,
    spl0_5,
    inference(sat_conversion,[],[f242]) ).

cnf(s18,plain,
    ~ spl0_10,
    inference(sat_conversion,[],[f349]) ).

cnf(s21,plain,
    $false,
    inference(rat,[],[s9,s18,s15]) ).

fof(f352,plain,
    $false,
    inference(avatar_sat_refutation,[],[s21]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : FLD055-3 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.19  % Computer : n013.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:42:37 UTC 2026
% 0.09/0.19  % CPUTime  : 
% 0.09/0.19  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.22  Running first-order model finding
% 0.09/0.22  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.09/0.27  % (1752367)Will run a generic schedule for satisfiability detection.
% 0.09/0.27  % (1752375)dis+10_1_sil=32000:sp=arity:random_seed=538454218:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.09/0.27  % (1752373)% WARNING: option uhcvi not known.
% 0.09/0.27  % (1752375) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1752367-1752375"...
% 0.09/0.27  % (1752375)...printing done.
% 0.09/0.27  % (1752372)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3232409627_2999 on theBenchmark for (2999ds/0Mi)
% 0.09/0.27  % (1752375)Refutation found. Thanks to Tanya!
% 0.09/0.27  % SZS status Unsatisfiable for theBenchmark
% 0.09/0.27  % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.27  % (1752375)------------------------------
% 0.09/0.27  % (1752375)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.27  % (1752375)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.27  % (1752375)CaDiCaL version: 2.1.3
% 0.09/0.27  % (1752375)Termination reason: Refutation
% 0.09/0.27  % (1752375)Time elapsed: 0.004 s
% 0.09/0.27  % (1752375)Peak memory usage: 12 MB
% 0.09/0.27  % (1752375)Instructions burned: 9 (million)
% 0.09/0.27  % (1752367)Success in time 0.038 s
% 0.09/0.27  % Vampire exiting
%------------------------------------------------------------------------------