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

% Result   : Unsatisfiable 0.19s 0.28s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   38 (  12 unt;   2 def)
%            Number of atoms       :   80 (   0 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   80 (  38   ~;  40   |;   0   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    6 (   5 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] :
      ( ~ less_or_equal(X1,X0)
      | ~ less_or_equal(X0,X1)
      | equalish(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',antisymmetry_of_order_relation) ).

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

fof(f22,axiom,
    ! [X0,X1] :
      ( ~ equalish(X1,X0)
      | equalish(X0,X1) ),
    file('/export/starexec/sandbox/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/sandbox/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/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,axiom,
    defined(c),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_is_defined) ).

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

fof(f32,negated_conjecture,
    equalish(b,c),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_equals_c_5) ).

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

fof(f34,plain,
    equalish(c,b),
    inference(resolution,[],[f22,f32]) ).

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

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

fof(f47,plain,
    ( equalish(b,a)
    | ~ spl0_1 ),
    inference(avatar_component_clause,[],[f45]) ).

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

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

fof(f52,plain,
    ( spl0_1
    | ~ spl0_2 ),
    inference(avatar_split_clause,[],[f43,f49,f45]) ).

fof(f72,plain,
    ! [X2,X0,X1] :
      ( ~ equalish(X0,X2)
      | ~ defined(X1)
      | ~ defined(X0)
      | less_or_equal(X2,X1)
      | less_or_equal(X1,X0) ),
    inference(resolution,[],[f18,f26]) ).

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

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

fof(f165,plain,
    ! [X0,X1] :
      ( ~ equalish(X0,X1)
      | less_or_equal(X1,X0)
      | ~ defined(X0) ),
    inference(resolution,[],[f83,f26]) ).

fof(f419,plain,
    ! [X0] :
      ( ~ defined(X0)
      | ~ defined(c)
      | less_or_equal(b,X0)
      | less_or_equal(X0,c) ),
    inference(resolution,[],[f72,f34]) ).

fof(f425,plain,
    ! [X0] :
      ( less_or_equal(b,X0)
      | less_or_equal(X0,c)
      | ~ defined(X0) ),
    inference(forward_subsumption_resolution,[],[f419,f30]) ).

fof(f910,plain,
    ( less_or_equal(a,c)
    | ~ defined(a)
    | spl0_2 ),
    inference(resolution,[],[f425,f51]) ).

fof(f923,plain,
    ( ~ defined(a)
    | spl0_2 ),
    inference(forward_subsumption_resolution,[],[f910,f33]) ).

fof(f925,plain,
    ( $false
    | spl0_2 ),
    inference(forward_subsumption_resolution,[],[f923,f28]) ).

fof(f926,plain,
    spl0_2,
    inference(avatar_contradiction_clause,[],[f925]) ).

fof(f929,plain,
    ( ! [X0] :
        ( ~ equalish(X0,b)
        | equalish(X0,a) )
    | ~ spl0_1 ),
    inference(resolution,[],[f47,f23]) ).

fof(f960,plain,
    ( equalish(c,a)
    | ~ spl0_1 ),
    inference(resolution,[],[f929,f34]) ).

fof(f1348,plain,
    ( less_or_equal(a,c)
    | ~ defined(c)
    | ~ spl0_1 ),
    inference(resolution,[],[f165,f960]) ).

fof(f1358,plain,
    ( ~ defined(c)
    | ~ spl0_1 ),
    inference(forward_subsumption_resolution,[],[f1348,f33]) ).

fof(f1389,plain,
    ( $false
    | ~ spl0_1 ),
    inference(forward_subsumption_resolution,[],[f1358,f30]) ).

fof(f1390,plain,
    ~ spl0_1,
    inference(avatar_contradiction_clause,[],[f1389]) ).

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

cnf(s39,plain,
    spl0_2,
    inference(sat_conversion,[],[f926]) ).

cnf(s70,plain,
    ~ spl0_1,
    inference(sat_conversion,[],[f1390]) ).

cnf(s82,plain,
    $false,
    inference(rat,[],[s1,s39,s70]) ).

fof(f1391,plain,
    $false,
    inference(avatar_sat_refutation,[],[s82]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : FLD055-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.06  % 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:22 UTC 2026
% 0.09/0.20  % CPUTime  : 
% 0.09/0.20  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.23  Running first-order model finding
% 0.09/0.23  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.19/0.28  % (1751948)Will run a generic schedule for satisfiability detection.
% 0.19/0.28  % (1751956)dis+10_1_sil=32000:sp=arity:random_seed=852425428:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.28  % (1751954)% WARNING: option uhcvi not known.
% 0.19/0.28  % (1751953)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1209251546_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.28  % (1751958)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3981295822:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.28  % (1751954)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4243580663:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.28  % (1751955)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4242066946:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.28  % (1751957)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2914092248:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.28  % (1751959)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3486698819:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.19/0.28  % TRYING [1]
% 0.19/0.28  % TRYING [2]
% 0.19/0.28  % (1751956) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1751948-1751956"...
% 0.19/0.28  % TRYING [3]
% 0.19/0.28  % (1751956)...printing done.
% 0.19/0.28  % (1751956)Refutation found. Thanks to Tanya!
% 0.19/0.28  % SZS status Unsatisfiable for theBenchmark
% 0.19/0.28  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.28  % (1751956)------------------------------
% 0.19/0.28  % (1751956)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.28  % (1751956)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.28  % (1751956)CaDiCaL version: 2.1.3
% 0.19/0.28  % (1751956)Termination reason: Refutation
% 0.19/0.28  % (1751956)Time elapsed: 0.011 s
% 0.19/0.28  % (1751956)Peak memory usage: 12 MB
% 0.19/0.28  % (1751956)Instructions burned: 29 (million)
% 0.19/0.28  % (1751948)Success in time 0.042 s
% 0.19/0.28  % Vampire exiting
%------------------------------------------------------------------------------