↑ 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  : LCL090-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT

% Computer : n003.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 11:57:37 AM UTC 2026

% Result   : Unsatisfiable 0.23s 0.53s
% Output   : Refutation 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   86 (  22 unt;  10 def)
%            Number of atoms       :  182 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :  173 (  77   ~;  86   |;   0   &)
%                                         (  10 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   5 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :   12 (  11 usr;  11 prp; 0-1 aty)
%            Number of functors    :    2 (   2 usr;   1 con; 0-2 aty)
%            Number of variables   :  209 (   0 sgn 209   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1] :
      ( ~ is_a_theorem(implies(X0,X1))
      | ~ is_a_theorem(X0)
      | is_a_theorem(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).

fof(f2,axiom,
    ! [X2,X3,X0,X1,X4] : is_a_theorem(implies(implies(implies(X0,X1),implies(X2,X3)),implies(implies(X3,X0),implies(X4,implies(X2,X0))))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ic_JLukasiewicz_5) ).

fof(f3,negated_conjecture,
    ~ is_a_theorem(implies(a,a)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_ic_1) ).

fof(f4,plain,
    ! [X2,X3,X0,X1,X4] :
      ( ~ is_a_theorem(implies(implies(X0,X1),implies(X2,X3)))
      | is_a_theorem(implies(implies(X3,X0),implies(X4,implies(X2,X0)))) ),
    inference(resolution,[],[f2,f1]) ).

fof(f5,plain,
    ! [X2,X3,X0,X1,X4,X5] : is_a_theorem(implies(implies(implies(X0,implies(X1,X2)),implies(X2,X3)),implies(X4,implies(implies(X5,X2),implies(X2,X3))))),
    inference(resolution,[],[f4,f2]) ).

fof(f6,plain,
    ! [X2,X3,X0,X1,X6,X4,X5] : is_a_theorem(implies(implies(implies(implies(X0,X1),implies(X1,X2)),implies(X3,implies(X4,X1))),implies(X5,implies(X6,implies(X3,implies(X4,X1)))))),
    inference(resolution,[],[f5,f4]) ).

fof(f7,plain,
    ! [X2,X3,X0,X1,X4,X5] :
      ( ~ is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(X2,X3)))
      | is_a_theorem(implies(X4,implies(implies(X5,X2),implies(X2,X3)))) ),
    inference(resolution,[],[f5,f1]) ).

fof(f8,plain,
    ! [X2,X3,X0,X1,X4] : is_a_theorem(implies(X0,implies(implies(X1,X2),implies(X2,implies(implies(X3,X4),implies(X4,X2)))))),
    inference(resolution,[],[f7,f5]) ).

fof(f9,plain,
    ! [X2,X3,X0,X1,X4] :
      ( ~ is_a_theorem(X0)
      | is_a_theorem(implies(implies(X1,X2),implies(X2,implies(implies(X3,X4),implies(X4,X2))))) ),
    inference(resolution,[],[f8,f1]) ).

fof(f13,definition,
    ( spl0_1
  <=> ! [X2,X1,X3,X4] : is_a_theorem(implies(implies(X1,X2),implies(X2,implies(implies(X3,X4),implies(X4,X2))))) ),
    introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).

fof(f14,plain,
    ( ! [X2,X3,X1,X4] : is_a_theorem(implies(implies(X1,X2),implies(X2,implies(implies(X3,X4),implies(X4,X2)))))
    | ~ spl0_1 ),
    inference(avatar_component_clause,[],[f13]) ).

fof(f16,definition,
    ( spl0_2
  <=> ! [X0] : ~ is_a_theorem(X0) ),
    introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).

fof(f17,plain,
    ( ! [X0] : ~ is_a_theorem(X0)
    | ~ spl0_2 ),
    inference(avatar_component_clause,[],[f16]) ).

fof(f18,plain,
    ( spl0_1
    | spl0_2 ),
    inference(avatar_split_clause,[],[f9,f16,f13]) ).

fof(f20,plain,
    ! [X2,X3,X0,X1,X6,X7,X4,X5] : is_a_theorem(implies(implies(implies(X0,implies(X1,implies(X2,X3))),implies(implies(X4,X3),implies(X3,X5))),implies(X6,implies(X7,implies(implies(X4,X3),implies(X3,X5)))))),
    inference(resolution,[],[f6,f4]) ).

fof(f22,plain,
    ( $false
    | ~ spl0_2 ),
    inference(resolution,[],[f17,f2]) ).

fof(f29,plain,
    ~ spl0_2,
    inference(avatar_contradiction_clause,[],[f22]) ).

fof(f37,plain,
    ( ! [X2,X3,X0,X1,X4] : is_a_theorem(implies(implies(implies(implies(X0,X1),implies(X1,X2)),X3),implies(X4,implies(X2,X3))))
    | ~ spl0_1 ),
    inference(resolution,[],[f14,f4]) ).

fof(f48,plain,
    ! [X2,X3,X0,X1,X8,X6,X7,X4,X5] : is_a_theorem(implies(implies(implies(X0,implies(implies(X1,X2),implies(X2,X3))),implies(X4,implies(X5,implies(X6,X2)))),implies(X7,implies(X8,implies(X4,implies(X5,implies(X6,X2))))))),
    inference(resolution,[],[f20,f4]) ).

fof(f50,plain,
    ! [X2,X3,X0,X1,X6,X7,X4,X5] :
      ( ~ is_a_theorem(implies(implies(X0,implies(X1,implies(X2,X3))),implies(implies(X4,X3),implies(X3,X5))))
      | is_a_theorem(implies(X6,implies(X7,implies(implies(X4,X3),implies(X3,X5))))) ),
    inference(resolution,[],[f20,f1]) ).

fof(f52,plain,
    ( ! [X2,X3,X0,X1,X4] : is_a_theorem(implies(X0,implies(implies(X1,X2),implies(X2,implies(X3,implies(X4,X2))))))
    | ~ spl0_1 ),
    inference(resolution,[],[f37,f7]) ).

fof(f59,plain,
    ( ! [X2,X3,X0,X1,X4] :
        ( ~ is_a_theorem(X0)
        | is_a_theorem(implies(implies(X1,X2),implies(X2,implies(X3,implies(X4,X2))))) )
    | ~ spl0_1 ),
    inference(resolution,[],[f52,f1]) ).

fof(f64,definition,
    ( spl0_4
  <=> ! [X2,X1,X3,X4] : is_a_theorem(implies(implies(X1,X2),implies(X2,implies(X3,implies(X4,X2))))) ),
    introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).

fof(f65,plain,
    ( ! [X2,X3,X1,X4] : is_a_theorem(implies(implies(X1,X2),implies(X2,implies(X3,implies(X4,X2)))))
    | ~ spl0_4 ),
    inference(avatar_component_clause,[],[f64]) ).

fof(f66,plain,
    ( spl0_4
    | spl0_2
    | ~ spl0_1 ),
    inference(avatar_split_clause,[],[f59,f13,f16,f64]) ).

fof(f72,plain,
    ( ! [X2,X3,X0,X1,X4] : is_a_theorem(implies(implies(implies(X0,implies(X1,X2)),X3),implies(X4,implies(X2,X3))))
    | ~ spl0_4 ),
    inference(resolution,[],[f65,f4]) ).

fof(f174,plain,
    ! [X2,X3,X0,X1,X8,X6,X7,X4,X5] :
      ( ~ is_a_theorem(implies(implies(X0,implies(implies(X1,X2),implies(X2,X3))),implies(X4,implies(X5,implies(X6,X2)))))
      | is_a_theorem(implies(X7,implies(X8,implies(X4,implies(X5,implies(X6,X2)))))) ),
    inference(resolution,[],[f48,f1]) ).

fof(f478,plain,
    ! [X2,X3,X0,X1,X4,X5] : is_a_theorem(implies(X0,implies(X1,implies(implies(implies(X2,X3),X2),implies(X4,implies(implies(X5,X2),X2)))))),
    inference(resolution,[],[f174,f2]) ).

fof(f588,plain,
    ! [X2,X3,X0,X1,X4,X5] :
      ( ~ is_a_theorem(X0)
      | is_a_theorem(implies(X1,implies(implies(implies(X2,X3),X2),implies(X4,implies(implies(X5,X2),X2))))) ),
    inference(resolution,[],[f478,f1]) ).

fof(f605,definition,
    ( spl0_23
  <=> ! [X3,X4,X5,X2,X1] : is_a_theorem(implies(X1,implies(implies(implies(X2,X3),X2),implies(X4,implies(implies(X5,X2),X2))))) ),
    introduced(definition,[new_symbols(definition,[spl0_23])],[avatar_definition]) ).

fof(f606,plain,
    ( ! [X2,X3,X1,X4,X5] : is_a_theorem(implies(X1,implies(implies(implies(X2,X3),X2),implies(X4,implies(implies(X5,X2),X2)))))
    | ~ spl0_23 ),
    inference(avatar_component_clause,[],[f605]) ).

fof(f607,plain,
    ( spl0_23
    | spl0_2 ),
    inference(avatar_split_clause,[],[f588,f16,f605]) ).

fof(f848,plain,
    ( ! [X2,X3,X0,X1,X4] :
        ( ~ is_a_theorem(X0)
        | is_a_theorem(implies(implies(implies(X1,X2),X1),implies(X3,implies(implies(X4,X1),X1)))) )
    | ~ spl0_23 ),
    inference(resolution,[],[f606,f1]) ).

fof(f860,definition,
    ( spl0_31
  <=> ! [X4,X3,X2,X1] : is_a_theorem(implies(implies(implies(X1,X2),X1),implies(X3,implies(implies(X4,X1),X1)))) ),
    introduced(definition,[new_symbols(definition,[spl0_31])],[avatar_definition]) ).

fof(f861,plain,
    ( ! [X2,X3,X1,X4] : is_a_theorem(implies(implies(implies(X1,X2),X1),implies(X3,implies(implies(X4,X1),X1))))
    | ~ spl0_31 ),
    inference(avatar_component_clause,[],[f860]) ).

fof(f862,plain,
    ( spl0_31
    | spl0_2
    | ~ spl0_23 ),
    inference(avatar_split_clause,[],[f848,f605,f16,f860]) ).

fof(f892,plain,
    ( ! [X2,X3,X0,X1] :
        ( ~ is_a_theorem(implies(implies(X0,X1),X0))
        | is_a_theorem(implies(X2,implies(implies(X3,X0),X0))) )
    | ~ spl0_31 ),
    inference(resolution,[],[f861,f1]) ).

fof(f898,plain,
    ( ! [X2,X3,X0,X1] : is_a_theorem(implies(X0,implies(implies(X1,implies(X2,implies(X3,X3))),implies(X2,implies(X3,X3)))))
    | ~ spl0_4
    | ~ spl0_31 ),
    inference(resolution,[],[f892,f72]) ).

fof(f1292,plain,
    ( ! [X2,X3,X0,X1] :
        ( ~ is_a_theorem(X0)
        | is_a_theorem(implies(implies(X1,implies(X2,implies(X3,X3))),implies(X2,implies(X3,X3)))) )
    | ~ spl0_4
    | ~ spl0_31 ),
    inference(resolution,[],[f898,f1]) ).

fof(f1311,definition,
    ( spl0_44
  <=> ! [X2,X1,X3] : is_a_theorem(implies(implies(X1,implies(X2,implies(X3,X3))),implies(X2,implies(X3,X3)))) ),
    introduced(definition,[new_symbols(definition,[spl0_44])],[avatar_definition]) ).

fof(f1312,plain,
    ( ! [X2,X3,X1] : is_a_theorem(implies(implies(X1,implies(X2,implies(X3,X3))),implies(X2,implies(X3,X3))))
    | ~ spl0_44 ),
    inference(avatar_component_clause,[],[f1311]) ).

fof(f1313,plain,
    ( spl0_44
    | spl0_2
    | ~ spl0_4
    | ~ spl0_31 ),
    inference(avatar_split_clause,[],[f1292,f860,f64,f16,f1311]) ).

fof(f1316,plain,
    ( ! [X2,X3,X0,X1] : is_a_theorem(implies(implies(implies(X0,X0),X1),implies(X2,implies(X3,X1))))
    | ~ spl0_44 ),
    inference(resolution,[],[f1312,f4]) ).

fof(f1317,plain,
    ( ! [X2,X3,X0,X1] : is_a_theorem(implies(X0,implies(X1,implies(implies(X2,X3),implies(X3,X3)))))
    | ~ spl0_44 ),
    inference(resolution,[],[f1312,f50]) ).

fof(f1459,plain,
    ( ! [X2,X3,X0,X1] :
        ( ~ is_a_theorem(implies(implies(X0,X0),X1))
        | is_a_theorem(implies(X2,implies(X3,X1))) )
    | ~ spl0_44 ),
    inference(resolution,[],[f1316,f1]) ).

fof(f1536,plain,
    ( ! [X2,X3,X0,X1] :
        ( ~ is_a_theorem(X0)
        | is_a_theorem(implies(X1,implies(implies(X2,X3),implies(X3,X3)))) )
    | ~ spl0_44 ),
    inference(resolution,[],[f1317,f1]) ).

fof(f1557,definition,
    ( spl0_53
  <=> ! [X2,X1,X3] : is_a_theorem(implies(X1,implies(implies(X2,X3),implies(X3,X3)))) ),
    introduced(definition,[new_symbols(definition,[spl0_53])],[avatar_definition]) ).

fof(f1558,plain,
    ( ! [X2,X3,X1] : is_a_theorem(implies(X1,implies(implies(X2,X3),implies(X3,X3))))
    | ~ spl0_53 ),
    inference(avatar_component_clause,[],[f1557]) ).

fof(f1559,plain,
    ( spl0_53
    | spl0_2
    | ~ spl0_44 ),
    inference(avatar_split_clause,[],[f1536,f1311,f16,f1557]) ).

fof(f1565,plain,
    ( ! [X2,X0,X1] :
        ( ~ is_a_theorem(X0)
        | is_a_theorem(implies(implies(X1,X2),implies(X2,X2))) )
    | ~ spl0_53 ),
    inference(resolution,[],[f1558,f1]) ).

fof(f1581,definition,
    ( spl0_54
  <=> ! [X2,X1] : is_a_theorem(implies(implies(X1,X2),implies(X2,X2))) ),
    introduced(definition,[new_symbols(definition,[spl0_54])],[avatar_definition]) ).

fof(f1582,plain,
    ( ! [X2,X1] : is_a_theorem(implies(implies(X1,X2),implies(X2,X2)))
    | ~ spl0_54 ),
    inference(avatar_component_clause,[],[f1581]) ).

fof(f1583,plain,
    ( spl0_54
    | spl0_2
    | ~ spl0_53 ),
    inference(avatar_split_clause,[],[f1565,f1557,f16,f1581]) ).

fof(f1836,plain,
    ( ! [X2,X0,X1] : is_a_theorem(implies(X0,implies(X1,implies(X2,X2))))
    | ~ spl0_44
    | ~ spl0_54 ),
    inference(resolution,[],[f1459,f1582]) ).

fof(f1949,plain,
    ( ! [X2,X0,X1] :
        ( ~ is_a_theorem(X0)
        | is_a_theorem(implies(X1,implies(X2,X2))) )
    | ~ spl0_44
    | ~ spl0_54 ),
    inference(resolution,[],[f1836,f1]) ).

fof(f1971,definition,
    ( spl0_64
  <=> ! [X2,X1] : is_a_theorem(implies(X1,implies(X2,X2))) ),
    introduced(definition,[new_symbols(definition,[spl0_64])],[avatar_definition]) ).

fof(f1972,plain,
    ( ! [X2,X1] : is_a_theorem(implies(X1,implies(X2,X2)))
    | ~ spl0_64 ),
    inference(avatar_component_clause,[],[f1971]) ).

fof(f1973,plain,
    ( spl0_64
    | spl0_2
    | ~ spl0_44
    | ~ spl0_54 ),
    inference(avatar_split_clause,[],[f1949,f1581,f1311,f16,f1971]) ).

fof(f1980,plain,
    ( ! [X0,X1] :
        ( ~ is_a_theorem(X0)
        | is_a_theorem(implies(X1,X1)) )
    | ~ spl0_64 ),
    inference(resolution,[],[f1972,f1]) ).

fof(f1997,definition,
    ( spl0_65
  <=> ! [X1] : is_a_theorem(implies(X1,X1)) ),
    introduced(definition,[new_symbols(definition,[spl0_65])],[avatar_definition]) ).

fof(f1998,plain,
    ( ! [X1] : is_a_theorem(implies(X1,X1))
    | ~ spl0_65 ),
    inference(avatar_component_clause,[],[f1997]) ).

fof(f1999,plain,
    ( spl0_65
    | spl0_2
    | ~ spl0_64 ),
    inference(avatar_split_clause,[],[f1980,f1971,f16,f1997]) ).

fof(f2000,plain,
    ( $false
    | ~ spl0_65 ),
    inference(resolution,[],[f1998,f3]) ).

fof(f2020,plain,
    ~ spl0_65,
    inference(avatar_contradiction_clause,[],[f2000]) ).

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

cnf(s5,plain,
    ~ spl0_2,
    inference(sat_conversion,[],[f29]) ).

cnf(s7,plain,
    ( ~ spl0_1
    | spl0_2
    | spl0_4 ),
    inference(sat_conversion,[],[f66]) ).

cnf(s61,plain,
    ( spl0_2
    | spl0_23 ),
    inference(sat_conversion,[],[f607]) ).

cnf(s99,plain,
    ( spl0_2
    | ~ spl0_23
    | spl0_31 ),
    inference(sat_conversion,[],[f862]) ).

cnf(s161,plain,
    ( spl0_2
    | ~ spl0_4
    | ~ spl0_31
    | spl0_44 ),
    inference(sat_conversion,[],[f1313]) ).

cnf(s213,plain,
    ( spl0_2
    | ~ spl0_44
    | spl0_53 ),
    inference(sat_conversion,[],[f1559]) ).

cnf(s215,plain,
    ( spl0_2
    | ~ spl0_53
    | spl0_54 ),
    inference(sat_conversion,[],[f1583]) ).

cnf(s284,plain,
    ( spl0_2
    | ~ spl0_44
    | ~ spl0_54
    | spl0_64 ),
    inference(sat_conversion,[],[f1973]) ).

cnf(s286,plain,
    ( spl0_2
    | ~ spl0_64
    | spl0_65 ),
    inference(sat_conversion,[],[f1999]) ).

cnf(s287,plain,
    ~ spl0_65,
    inference(sat_conversion,[],[f2020]) ).

cnf(s289,plain,
    ( spl0_2
    | ~ spl0_64 ),
    inference(rat,[],[s286,s287]) ).

cnf(s290,plain,
    ~ spl0_64,
    inference(rat,[],[s289,s5]) ).

cnf(s294,plain,
    spl0_23,
    inference(rat,[],[s61,s5]) ).

cnf(s297,plain,
    spl0_31,
    inference(rat,[],[s99,s5,s294]) ).

cnf(s303,plain,
    spl0_1,
    inference(rat,[],[s1,s5]) ).

cnf(s307,plain,
    spl0_4,
    inference(rat,[],[s7,s5,s303]) ).

cnf(s308,plain,
    spl0_44,
    inference(rat,[],[s161,s297,s5,s307]) ).

cnf(s319,plain,
    ~ spl0_54,
    inference(rat,[],[s284,s290,s5,s308]) ).

cnf(s322,plain,
    spl0_53,
    inference(rat,[],[s213,s5,s308]) ).

cnf(s329,plain,
    $false,
    inference(rat,[],[s215,s5,s319,s322]) ).

fof(f2022,plain,
    $false,
    inference(avatar_sat_refutation,[],[s329]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL090-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.16/0.41  % Computer : n003.cluster.edu
% 0.16/0.41  % Model    : x86_64 x86_64
% 0.16/0.41  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.41  % Memory   : 8046.5625MB
% 0.16/0.41  % OS       : Linux 6.8.0-71-generic
% 0.16/0.41  % CPULimit : 300
% 0.16/0.41  % WCLimit  : 300
% 0.16/0.41  % DateTime : Sun Sep 27 15:23:12 UTC 2026
% 0.16/0.41  % CPUTime  : 
% 0.16/0.41  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.16/0.45  Running first-order model finding
% 0.16/0.45  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.23/0.53  % (694696)Will run a generic schedule for satisfiability detection.
% 0.23/0.53  % (694704)dis+10_1_sil=32000:sp=arity:random_seed=1974459619:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.23/0.53  % (694707)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2357721065:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.23/0.53  % (694702)% WARNING: option uhcvi not known.
% 0.23/0.53  % (694702)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3945660392:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.23/0.53  % (694701)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1425695105_2999 on theBenchmark for (2999ds/0Mi)
% 0.23/0.53  % (694703)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1431651361:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.23/0.53  % (694705)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1272272107:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.23/0.53  % (694706)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3580094209:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.23/0.53  % TRYING [1]
% 0.23/0.53  % TRYING [2]
% 0.23/0.53  % TRYING [3]
% 0.23/0.53  % TRYING [4]
% 0.23/0.53  % (694704) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-694696-694704"...
% 0.23/0.53  % (694704)...printing done.
% 0.23/0.53  % (694704)Refutation found. Thanks to Tanya!
% 0.23/0.53  % SZS status Unsatisfiable for theBenchmark
% 0.23/0.53  % SZS output start Proof for theBenchmark
% See solution above
% 0.23/0.53  % (694704)------------------------------
% 0.23/0.53  % (694704)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.23/0.53  % (694704)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.23/0.53  % (694704)CaDiCaL version: 2.1.3
% 0.23/0.53  % (694704)Termination reason: Refutation
% 0.23/0.53  % (694704)Time elapsed: 0.038 s
% 0.23/0.53  % (694704)Peak memory usage: 12 MB
% 0.23/0.53  % (694704)Instructions burned: 69 (million)
% 0.23/0.53  % (694696)Success in time 0.062 s
% 0.23/0.53  % Vampire exiting
%------------------------------------------------------------------------------