↑ 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  : LCL068-1 : TPTP v9.3.1. Bugfixed v1.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/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:33 AM UTC 2026

% Result   : Unsatisfiable 3.86s 1.17s
% Output   : Refutation 3.86s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   25
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   68 (  23 unt;   2 def)
%            Number of atoms       :  137 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :  143 (  74   ~;  67   |;   0   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    4 (   3 usr;   3 prp; 0-1 aty)
%            Number of functors    :    3 (   3 usr;   1 con; 0-2 aty)
%            Number of variables   :  119 (   0 sgn 119   !;   0   ?)

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

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

fof(f3,axiom,
    ! [X2,X0,X1] : is_a_theorem(implies(implies(implies(X0,X1),X2),implies(not(X0),X2))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_37) ).

fof(f4,axiom,
    ! [X2,X0,X1] : is_a_theorem(implies(implies(not(X0),X1),implies(implies(X2,X1),implies(implies(X0,X2),X1)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_59) ).

fof(f5,negated_conjecture,
    ~ is_a_theorem(implies(implies(not(a),a),a)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_2) ).

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

fof(f7,plain,
    ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))),
    inference(resolution,[],[f6,f2]) ).

fof(f22,plain,
    ! [X2,X0,X1] :
      ( ~ is_a_theorem(implies(implies(X0,X1),X2))
      | is_a_theorem(implies(not(X0),X2)) ),
    inference(resolution,[],[f3,f1]) ).

fof(f23,plain,
    ! [X2,X0,X1] : is_a_theorem(implies(not(implies(X0,X1)),implies(X1,X2))),
    inference(resolution,[],[f22,f2]) ).

fof(f24,plain,
    ! [X2,X0,X1] : is_a_theorem(implies(not(X0),implies(X1,implies(X0,X2)))),
    inference(resolution,[],[f22,f7]) ).

fof(f117,plain,
    ! [X2,X0,X1] : is_a_theorem(implies(not(not(X0)),implies(implies(X1,X2),implies(implies(X0,X1),X2)))),
    inference(resolution,[],[f4,f22]) ).

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

fof(f134,plain,
    ! [X2,X0,X1] :
      ( is_a_theorem(implies(implies(X1,X2),implies(implies(X0,X1),X2)))
      | ~ is_a_theorem(not(not(X0))) ),
    inference(resolution,[],[f117,f1]) ).

fof(f135,plain,
    ! [X2,X0,X1] :
      ( is_a_theorem(implies(not(X1),implies(implies(X0,X1),X2)))
      | ~ is_a_theorem(not(not(X0))) ),
    inference(resolution,[],[f134,f22]) ).

fof(f137,plain,
    ! [X2,X0,X1] :
      ( is_a_theorem(implies(implies(X0,X1),X2))
      | ~ is_a_theorem(implies(X1,X2))
      | ~ is_a_theorem(not(not(X0))) ),
    inference(resolution,[],[f134,f1]) ).

fof(f168,plain,
    ! [X2,X0,X1] :
      ( is_a_theorem(implies(implies(X0,X2),X1))
      | ~ is_a_theorem(implies(X2,X1))
      | ~ is_a_theorem(implies(not(X0),X1)) ),
    inference(resolution,[],[f119,f1]) ).

fof(f361,plain,
    ( ~ is_a_theorem(implies(a,a))
    | ~ is_a_theorem(implies(not(not(a)),a)) ),
    inference(resolution,[],[f168,f5]) ).

fof(f362,plain,
    ! [X2,X0,X1] :
      ( ~ is_a_theorem(implies(not(X2),X1))
      | ~ is_a_theorem(implies(X0,X1))
      | ~ is_a_theorem(implies(X2,X0))
      | is_a_theorem(X1) ),
    inference(resolution,[],[f168,f1]) ).

fof(f365,plain,
    ! [X2,X3,X0,X1] :
      ( ~ is_a_theorem(implies(implies(X3,X1),X0))
      | ~ is_a_theorem(implies(X0,implies(X1,X2)))
      | is_a_theorem(implies(X1,X2)) ),
    inference(resolution,[],[f362,f23]) ).

fof(f372,plain,
    ! [X2,X0,X1] :
      ( ~ is_a_theorem(implies(X0,implies(X1,not(X2))))
      | ~ is_a_theorem(implies(X2,X0))
      | is_a_theorem(implies(X1,not(X2))) ),
    inference(resolution,[],[f362,f7]) ).

fof(f384,plain,
    ! [X2,X0,X1] :
      ( ~ is_a_theorem(implies(implies(X0,X1),implies(X1,X2)))
      | is_a_theorem(implies(X1,X2)) ),
    inference(resolution,[],[f365,f2]) ).

fof(f399,plain,
    ! [X0] : is_a_theorem(implies(X0,X0)),
    inference(resolution,[],[f384,f2]) ).

fof(f414,plain,
    ! [X0,X1] :
      ( ~ is_a_theorem(implies(X0,not(X1)))
      | ~ is_a_theorem(implies(X1,X0))
      | is_a_theorem(not(X1)) ),
    inference(resolution,[],[f399,f362]) ).

fof(f416,plain,
    ! [X0,X1] : is_a_theorem(implies(not(X0),implies(X0,X1))),
    inference(resolution,[],[f399,f22]) ).

fof(f422,plain,
    ~ is_a_theorem(implies(not(not(a)),a)),
    inference(forward_subsumption_resolution,[],[f361,f399]) ).

fof(f425,plain,
    ! [X0,X1] :
      ( is_a_theorem(implies(X0,X1))
      | ~ is_a_theorem(not(X0)) ),
    inference(resolution,[],[f416,f1]) ).

fof(f449,plain,
    ! [X0,X1] :
      ( ~ is_a_theorem(implies(X0,implies(X1,not(X0))))
      | is_a_theorem(implies(X1,not(X0))) ),
    inference(resolution,[],[f372,f399]) ).

fof(f450,plain,
    ! [X0,X1] :
      ( ~ is_a_theorem(implies(X0,not(X1)))
      | is_a_theorem(implies(X1,not(X0))) ),
    inference(resolution,[],[f372,f416]) ).

fof(f459,plain,
    ! [X0] : is_a_theorem(implies(X0,not(not(X0)))),
    inference(resolution,[],[f450,f399]) ).

fof(f463,plain,
    ! [X0] :
      ( is_a_theorem(not(not(X0)))
      | ~ is_a_theorem(X0) ),
    inference(resolution,[],[f459,f1]) ).

fof(f683,plain,
    ! [X0] :
      ( ~ is_a_theorem(implies(not(X0),X0))
      | is_a_theorem(not(not(X0))) ),
    inference(resolution,[],[f414,f459]) ).

fof(f687,plain,
    ! [X0,X1] :
      ( ~ is_a_theorem(not(X1))
      | is_a_theorem(not(X0))
      | ~ is_a_theorem(implies(X0,X1)) ),
    inference(resolution,[],[f414,f425]) ).

fof(f697,plain,
    ! [X0] : is_a_theorem(not(not(implies(X0,X0)))),
    inference(resolution,[],[f683,f23]) ).

fof(f708,plain,
    ! [X0,X1] :
      ( ~ is_a_theorem(implies(X0,not(X1)))
      | is_a_theorem(not(X0))
      | ~ is_a_theorem(X1) ),
    inference(resolution,[],[f687,f463]) ).

fof(f1201,plain,
    ! [X0,X1] :
      ( is_a_theorem(implies(implies(X0,X1),not(not(X1))))
      | ~ is_a_theorem(not(not(X0))) ),
    inference(resolution,[],[f135,f449]) ).

fof(f1210,plain,
    ! [X0,X1] :
      ( ~ is_a_theorem(not(not(X0)))
      | is_a_theorem(implies(not(X1),not(implies(X0,X1)))) ),
    inference(resolution,[],[f1201,f450]) ).

fof(f1216,plain,
    ! [X0,X1] : is_a_theorem(implies(not(X0),not(implies(implies(X1,X1),X0)))),
    inference(resolution,[],[f1210,f697]) ).

fof(f1255,plain,
    ! [X0,X1] :
      ( ~ is_a_theorem(implies(implies(X1,X1),X0))
      | is_a_theorem(not(not(X0))) ),
    inference(resolution,[],[f1216,f708]) ).

fof(f1257,plain,
    ! [X0,X1] : is_a_theorem(implies(implies(implies(X0,X0),X1),not(not(X1)))),
    inference(resolution,[],[f1216,f450]) ).

fof(f1391,plain,
    ! [X0,X1] : is_a_theorem(not(not(implies(X0,implies(X1,X0))))),
    inference(resolution,[],[f1255,f2]) ).

fof(f1941,definition,
    ( spl0_32
  <=> ! [X1] : ~ is_a_theorem(not(not(X1))) ),
    introduced(definition,[new_symbols(definition,[spl0_32])],[avatar_definition]) ).

fof(f1942,plain,
    ( ! [X1] : ~ is_a_theorem(not(not(X1)))
    | ~ spl0_32 ),
    inference(avatar_component_clause,[],[f1941]) ).

fof(f2685,plain,
    ! [X0,X1] :
      ( is_a_theorem(not(not(implies(implies(X0,X1),X1))))
      | ~ is_a_theorem(not(not(X0))) ),
    inference(resolution,[],[f134,f1255]) ).

fof(f6099,plain,
    ! [X2,X0,X1] :
      ( ~ is_a_theorem(implies(X0,implies(X0,X1)))
      | ~ is_a_theorem(not(not(X2)))
      | is_a_theorem(implies(X0,X1)) ),
    inference(resolution,[],[f137,f384]) ).

fof(f6139,definition,
    ( spl0_89
  <=> ! [X0,X1] :
        ( ~ is_a_theorem(implies(X0,implies(X0,X1)))
        | is_a_theorem(implies(X0,X1)) ) ),
    introduced(definition,[new_symbols(definition,[spl0_89])],[avatar_definition]) ).

fof(f6140,plain,
    ( ! [X0,X1] :
        ( ~ is_a_theorem(implies(X0,implies(X0,X1)))
        | is_a_theorem(implies(X0,X1)) )
    | ~ spl0_89 ),
    inference(avatar_component_clause,[],[f6139]) ).

fof(f6141,plain,
    ( spl0_32
    | spl0_89 ),
    inference(avatar_split_clause,[],[f6099,f6139,f1941]) ).

fof(f6143,plain,
    ( $false
    | ~ spl0_32 ),
    inference(resolution,[],[f1942,f697]) ).

fof(f6251,plain,
    ~ spl0_32,
    inference(avatar_contradiction_clause,[],[f6143]) ).

fof(f6414,plain,
    ( ! [X0] :
        ( is_a_theorem(implies(implies(X0,X0),X0))
        | ~ is_a_theorem(not(not(X0))) )
    | ~ spl0_89 ),
    inference(resolution,[],[f6140,f134]) ).

fof(f6423,plain,
    ( ! [X0] :
        ( ~ is_a_theorem(not(not(X0)))
        | ~ is_a_theorem(implies(X0,X0))
        | is_a_theorem(X0) )
    | ~ spl0_89 ),
    inference(resolution,[],[f6414,f1]) ).

fof(f6458,plain,
    ( ! [X0] :
        ( ~ is_a_theorem(not(not(X0)))
        | is_a_theorem(X0) )
    | ~ spl0_89 ),
    inference(forward_subsumption_resolution,[],[f6423,f399]) ).

fof(f7419,plain,
    ( ! [X0,X1] :
        ( is_a_theorem(implies(implies(X0,X1),X1))
        | ~ is_a_theorem(not(not(X0))) )
    | ~ spl0_89 ),
    inference(resolution,[],[f2685,f6458]) ).

fof(f7437,plain,
    ( ! [X0,X1] :
        ( ~ is_a_theorem(not(not(X0)))
        | ~ is_a_theorem(implies(X0,X1))
        | is_a_theorem(X1) )
    | ~ spl0_89 ),
    inference(resolution,[],[f7419,f1]) ).

fof(f7476,plain,
    ( ! [X0,X1] :
        ( ~ is_a_theorem(implies(implies(X0,X0),X1))
        | is_a_theorem(X1) )
    | ~ spl0_89 ),
    inference(resolution,[],[f7437,f697]) ).

fof(f7479,plain,
    ( ! [X2,X0,X1] :
        ( ~ is_a_theorem(implies(implies(X0,implies(X1,X0)),X2))
        | is_a_theorem(X2) )
    | ~ spl0_89 ),
    inference(resolution,[],[f7437,f1391]) ).

fof(f7554,plain,
    ( ! [X0,X1] :
        ( is_a_theorem(implies(implies(X0,X1),X1))
        | ~ is_a_theorem(implies(not(X0),X1)) )
    | ~ spl0_89 ),
    inference(resolution,[],[f7476,f119]) ).

fof(f13426,plain,
    ( ! [X0,X1] :
        ( ~ is_a_theorem(implies(not(X0),implies(X1,X0)))
        | is_a_theorem(implies(X1,X0)) )
    | ~ spl0_89 ),
    inference(resolution,[],[f7554,f7479]) ).

fof(f14729,plain,
    ! [X0,X1] :
      ( ~ is_a_theorem(implies(not(not(X0)),implies(X0,X1)))
      | is_a_theorem(implies(X0,X1)) ),
    inference(resolution,[],[f365,f1257]) ).

fof(f14825,plain,
    ! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1))),
    inference(resolution,[],[f14729,f24]) ).

fof(f14882,plain,
    ( ! [X0] : is_a_theorem(implies(not(not(X0)),X0))
    | ~ spl0_89 ),
    inference(resolution,[],[f14825,f13426]) ).

fof(f14958,plain,
    ( $false
    | ~ spl0_89 ),
    inference(resolution,[],[f14882,f422]) ).

fof(f14959,plain,
    ~ spl0_89,
    inference(avatar_contradiction_clause,[],[f14958]) ).

cnf(s155,plain,
    ( spl0_32
    | spl0_89 ),
    inference(sat_conversion,[],[f6141]) ).

cnf(s196,plain,
    ~ spl0_32,
    inference(sat_conversion,[],[f6251]) ).

cnf(s376,plain,
    ~ spl0_89,
    inference(sat_conversion,[],[f14959]) ).

cnf(s379,plain,
    $false,
    inference(rat,[],[s155,s376,s196]) ).

fof(f14960,plain,
    $false,
    inference(avatar_sat_refutation,[],[s379]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : LCL068-1 : TPTP v9.3.1. Bugfixed v1.2.0.
% 0.00/0.09  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.18/0.46  % Computer : n003.cluster.edu
% 0.18/0.46  % Model    : x86_64 x86_64
% 0.18/0.46  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.46  % Memory   : 8046.5625MB
% 0.18/0.46  % OS       : Linux 6.8.0-71-generic
% 0.18/0.46  % CPULimit : 300
% 0.18/0.46  % WCLimit  : 300
% 0.18/0.46  % DateTime : Sun Sep 27 15:22:26 UTC 2026
% 0.18/0.46  % CPUTime  : 
% 0.18/0.46  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.23/0.51  Running first-order model finding
% 0.23/0.51  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
% 3.86/1.16  % (692192)Will run a generic schedule for satisfiability detection.
% 3.86/1.16  % (692197)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3786442461_2999 on theBenchmark for (2999ds/0Mi)
% 3.86/1.16  % TRYING [1]
% 3.86/1.16  % TRYING [2]
% 3.86/1.16  % TRYING [3]
% 3.86/1.16  % TRYING [4]
% 3.86/1.16  % (692199)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4132738152:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 3.86/1.16  % (692200)dis+10_1_sil=32000:sp=arity:random_seed=3835922649:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 3.86/1.16  % (692201)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4078270380:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 3.86/1.16  % (692202)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=794453069:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 3.86/1.16  % (692203)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=143361523:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 3.86/1.16  % TRYING [5]
% 3.86/1.16  % (692198)% WARNING: option uhcvi not known.
% 3.86/1.16  % (692198)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=372326513:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 3.86/1.16  % (692200)Instruction limit reached! 
% 3.86/1.16  % (692200)------------------------------
% 3.86/1.16  % (692200)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.86/1.16  % (692200)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.86/1.16  % (692200)CaDiCaL version: 2.1.3
% 3.86/1.16  % (692200)Termination reason: Instruction limit
% 3.86/1.16  % (692200)Termination phase: Saturation
% 3.86/1.16  % (692200)Time elapsed: 0.096 s
% 3.86/1.16  % (692200)Peak memory usage: 11 MB
% 3.86/1.16  % (692200)Instructions burned: 103 (million)
% 3.86/1.16  % (692201)Instruction limit reached! 
% 3.86/1.16  % (692201)------------------------------
% 3.86/1.16  % (692201)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.86/1.16  % (692201)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.86/1.16  % (692201)CaDiCaL version: 2.1.3
% 3.86/1.16  % (692201)Termination reason: Instruction limit
% 3.86/1.16  % (692201)Termination phase: Saturation
% 3.86/1.16  % (692201)Time elapsed: 0.115 s
% 3.86/1.16  % (692201)Peak memory usage: 11 MB
% 3.86/1.16  % (692201)Instructions burned: 116 (million)
% 3.86/1.16  % (692202)Instruction limit reached! 
% 3.86/1.16  % (692202)------------------------------
% 3.86/1.16  % (692202)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.86/1.16  % (692202)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.86/1.16  % (692202)CaDiCaL version: 2.1.3
% 3.86/1.16  % (692202)Termination reason: Instruction limit
% 3.86/1.16  % (692202)Termination phase: Saturation
% 3.86/1.16  % (692202)Time elapsed: 0.132 s
% 3.86/1.16  % (692202)Peak memory usage: 13 MB
% 3.86/1.16  % (692202)Instructions burned: 132 (million)
% 3.86/1.16  % (692220)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=61789833:i=714:nm=2_2998 on theBenchmark for (2998ds/714Mi)
% 3.86/1.16  % (692203)Instruction limit reached! 
% 3.86/1.16  % (692203)------------------------------
% 3.86/1.16  % (692203)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.86/1.16  % (692203)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.86/1.16  % (692203)CaDiCaL version: 2.1.3
% 3.86/1.16  % (692203)Termination reason: Instruction limit
% 3.86/1.16  % (692203)Termination phase: Saturation
% 3.86/1.16  % (692203)Time elapsed: 0.164 s
% 3.86/1.16  % (692203)Peak memory usage: 12 MB
% 3.86/1.16  % (692203)Instructions burned: 159 (million)
% 3.86/1.16  % TRYING [1]
% 3.86/1.16  % TRYING [2]
% 3.86/1.16  % TRYING [3]
% 3.86/1.16  % (692222)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=3889171021:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 3.86/1.16  % (692221)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3202067554:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 3.86/1.16  % TRYING [4]
% 3.86/1.16  % TRYING [6]
% 3.86/1.16  % (692224)ott-21_1_sil=16000:fs=off:random_seed=4165448682:i=180:av=off:fsr=off_2997 on theBenchmark for (2997ds/180Mi)
% 3.86/1.16  % TRYING [5]
% 3.86/1.16  % (692221)Instruction limit reached! 
% 3.86/1.16  % (692221)------------------------------
% 3.86/1.16  % (692221)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.86/1.16  % (692221)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.86/1.17  % (692221)CaDiCaL version: 2.1.3
% 3.86/1.17  % (692221)Termination reason: Instruction limit
% 3.86/1.17  % (692221)Termination phase: Saturation
% 3.86/1.17  % (692221)Time elapsed: 0.145 s
% 3.86/1.17  % (692221)Peak memory usage: 12 MB
% 3.86/1.17  % (692221)Instructions burned: 131 (million)
% 3.86/1.17  % (692236)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=2621152046:i=477:bd=all_2996 on theBenchmark for (2996ds/477Mi)
% 3.86/1.17  % (692224)Instruction limit reached! 
% 3.86/1.17  % (692224)------------------------------
% 3.86/1.17  % (692224)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.86/1.17  % (692224)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.86/1.17  % (692224)CaDiCaL version: 2.1.3
% 3.86/1.17  % (692224)Termination reason: Instruction limit
% 3.86/1.17  % (692224)Termination phase: Saturation
% 3.86/1.17  % (692224)Time elapsed: 0.160 s
% 3.86/1.17  % (692224)Peak memory usage: 12 MB
% 3.86/1.17  % (692224)Instructions burned: 180 (million)
% 3.86/1.17  % (692238)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=2512057281:fmbsr=1.3:i=865:ins=25_2995 on theBenchmark for (2995ds/865Mi)
% 3.86/1.17  % TRYING [1]
% 3.86/1.17  % TRYING [2]
% 3.86/1.17  % TRYING [3]
% 3.86/1.17  % TRYING [4]
% 3.86/1.17  % TRYING [5]
% 3.86/1.17  % TRYING [6]
% 3.86/1.17  % (692222) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-692192-692222"...
% 3.86/1.17  % (692222)...printing done.
% 3.86/1.17  % (692222)Refutation found. Thanks to Tanya!
% 3.86/1.17  % SZS status Unsatisfiable for theBenchmark
% 3.86/1.17  % SZS output start Proof for theBenchmark
% See solution above
% 3.86/1.17  % (692222)------------------------------
% 3.86/1.17  % (692222)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.86/1.17  % (692222)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.86/1.17  % (692222)CaDiCaL version: 2.1.3
% 3.86/1.17  % (692222)Termination reason: Refutation
% 3.86/1.17  % (692222)Time elapsed: 0.400 s
% 3.86/1.17  % (692222)Peak memory usage: 15 MB
% 3.86/1.17  % (692222)Instructions burned: 394 (million)
% 3.86/1.17  % (692192)Success in time 0.635 s
% 3.86/1.17  % Vampire exiting
%------------------------------------------------------------------------------