↑ 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  : FLD058-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 : n006.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:45 AM UTC 2026

% Result   : Unsatisfiable 0.19s 0.26s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   33 (  14 unt;   2 def)
%            Number of atoms       :   58 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   47 (  22   ~;  23   |;   0   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   3 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   22 (   0 sgn  22   !;   0   ?)

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

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

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

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(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(a,b),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_4) ).

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

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

fof(f49,plain,
    ! [X0,X1] :
      ( ~ less_or_equal(X1,X0)
      | ~ less_or_equal(X0,X1)
      | ~ equalish(X0,X1) ),
    inference(consistent_polarity_flipping,[],[f16]) ).

fof(f53,plain,
    ! [X0,X1] :
      ( ~ equalish(X0,X1)
      | equalish(X1,X0) ),
    inference(consistent_polarity_flipping,[],[f22]) ).

fof(f54,plain,
    ! [X2,X0,X1] :
      ( ~ equalish(X0,X1)
      | equalish(X0,X2)
      | equalish(X2,X1) ),
    inference(consistent_polarity_flipping,[],[f23]) ).

fof(f57,plain,
    ! [X2,X0,X1] :
      ( ~ less_or_equal(X2,X1)
      | less_or_equal(X0,X1)
      | equalish(X2,X0) ),
    inference(consistent_polarity_flipping,[],[f26]) ).

fof(f61,plain,
    equalish(a,additive_identity),
    inference(consistent_polarity_flipping,[],[f32]) ).

fof(f62,plain,
    ~ equalish(b,additive_identity),
    inference(consistent_polarity_flipping,[],[f33]) ).

fof(f70,plain,
    ( ~ less_or_equal(b,a)
    | ~ equalish(b,a) ),
    inference(resolution,[],[f49,f31]) ).

fof(f72,definition,
    ( spl0_1
  <=> equalish(b,a) ),
    introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).

fof(f76,definition,
    ( spl0_2
  <=> less_or_equal(b,a) ),
    introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).

fof(f78,plain,
    ( ~ less_or_equal(b,a)
    | spl0_2 ),
    inference(avatar_component_clause,[],[f76]) ).

fof(f79,plain,
    ( ~ spl0_1
    | ~ spl0_2 ),
    inference(avatar_split_clause,[],[f70,f76,f72]) ).

fof(f81,plain,
    ! [X0] :
      ( equalish(a,X0)
      | equalish(X0,additive_identity) ),
    inference(resolution,[],[f54,f61]) ).

fof(f85,plain,
    ! [X0] :
      ( less_or_equal(X0,a)
      | equalish(additive_identity,X0) ),
    inference(resolution,[],[f57,f30]) ).

fof(f115,plain,
    equalish(a,b),
    inference(resolution,[],[f81,f62]) ).

fof(f119,plain,
    equalish(b,a),
    inference(resolution,[],[f115,f53]) ).

fof(f122,plain,
    spl0_1,
    inference(avatar_split_clause,[],[f119,f72]) ).

fof(f135,plain,
    ( equalish(additive_identity,b)
    | spl0_2 ),
    inference(resolution,[],[f85,f78]) ).

fof(f144,plain,
    ( equalish(b,additive_identity)
    | spl0_2 ),
    inference(resolution,[],[f135,f53]) ).

fof(f145,plain,
    ( $false
    | spl0_2 ),
    inference(forward_subsumption_resolution,[],[f144,f62]) ).

fof(f146,plain,
    spl0_2,
    inference(avatar_contradiction_clause,[],[f145]) ).

cnf(s1,plain,
    ( ~ spl0_1
    | ~ spl0_2 ),
    inference(sat_conversion,[],[f79]) ).

cnf(s3,plain,
    spl0_1,
    inference(sat_conversion,[],[f122]) ).

cnf(s4,plain,
    spl0_2,
    inference(sat_conversion,[],[f146]) ).

cnf(s5,plain,
    $false,
    inference(rat,[],[s1,s4,s3]) ).

fof(f147,plain,
    $false,
    inference(avatar_sat_refutation,[],[s5]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : FLD058-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.20  % Computer : n006.cluster.edu
% 0.09/0.20  % Model    : x86_64 x86_64
% 0.09/0.20  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.20  % Memory   : 8046.5625MB
% 0.09/0.20  % OS       : Linux 6.8.0-71-generic
% 0.09/0.20  % CPULimit : 300
% 0.09/0.20  % WCLimit  : 300
% 0.09/0.20  % DateTime : Tue Sep 29 00:43:10 UTC 2026
% 0.09/0.20  % CPUTime  : 
% 0.09/0.20  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.19/0.26  % (365959)Will run a generic schedule for satisfiability detection.
% 0.19/0.26  % (365965)% WARNING: option uhcvi not known.
% 0.19/0.26  % (365965)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2926436273:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.26  % (365965) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-365959-365965"...
% 0.19/0.26  % (365965)...printing done.
% 0.19/0.26  % (365965)Refutation found. Thanks to Tanya!
% 0.19/0.26  % SZS status Unsatisfiable for theBenchmark
% 0.19/0.26  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.26  % (365965)------------------------------
% 0.19/0.26  % (365965)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.26  % (365965)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.26  % (365965)CaDiCaL version: 2.1.3
% 0.19/0.26  % (365965)Termination reason: Refutation
% 0.19/0.26  % (365965)Time elapsed: 0.002 s
% 0.19/0.26  % (365965)Peak memory usage: 12 MB
% 0.19/0.26  % (365965)Instructions burned: 3 (million)
% 0.19/0.26  % (365959)Success in time 0.031 s
% 0.19/0.26  % Vampire exiting
%------------------------------------------------------------------------------