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

% Computer : n010.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 2.92s 1.00s
% Output   : Refutation 2.92s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   72 (  39 unt;   8 def)
%            Number of atoms       :  112 (  10 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   88 (  48   ~;  37   |;   0   &)
%                                         (   3 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    6 (   4 usr;   4 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   8 con; 0-2 aty)
%            Number of variables   :   51 (   0 sgn  51   !;   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(a,b),implies(implies(b,c),implies(a,c)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_1) ).

fof(f6,definition,
    sF0 = implies(a,b),
    introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).

fof(f7,plain,
    implies(a,b) = sF0,
    inference(reorient_equations,[],[f6]) ).

fof(f8,definition,
    sF1 = implies(b,c),
    introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).

fof(f9,plain,
    implies(b,c) = sF1,
    inference(reorient_equations,[],[f8]) ).

fof(f10,definition,
    sF2 = implies(a,c),
    introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).

fof(f11,plain,
    implies(a,c) = sF2,
    inference(reorient_equations,[],[f10]) ).

fof(f12,definition,
    sF3 = implies(sF1,sF2),
    introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).

fof(f13,plain,
    implies(sF1,sF2) = sF3,
    inference(reorient_equations,[],[f12]) ).

fof(f14,definition,
    sF4 = implies(sF0,sF3),
    introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).

fof(f15,plain,
    implies(sF0,sF3) = sF4,
    inference(reorient_equations,[],[f14]) ).

fof(f16,plain,
    ~ is_a_theorem(sF4),
    inference(definition_folding,[],[f5,f15,f13,f11,f9,f7]) ).

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

fof(f56,plain,
    ! [X0] : is_a_theorem(implies(implies(sF2,X0),implies(c,X0))),
    inference(superposition,[],[f2,f11]) ).

fof(f59,plain,
    ! [X0] : is_a_theorem(implies(implies(sF3,X0),implies(sF2,X0))),
    inference(superposition,[],[f2,f13]) ).

fof(f63,plain,
    ! [X0] : is_a_theorem(implies(implies(implies(X0,sF0),sF3),sF4)),
    inference(superposition,[],[f2,f15]) ).

fof(f64,plain,
    ! [X0] : is_a_theorem(implies(implies(implies(X0,sF1),sF2),sF3)),
    inference(superposition,[],[f2,f13]) ).

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

fof(f67,plain,
    ! [X0] : is_a_theorem(implies(implies(sF2,X0),implies(not(a),X0))),
    inference(superposition,[],[f3,f11]) ).

fof(f71,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(f77,plain,
    ! [X0] : is_a_theorem(implies(implies(not(a),X0),implies(implies(b,X0),implies(sF0,X0)))),
    inference(superposition,[],[f4,f7]) ).

fof(f79,plain,
    ! [X0] : is_a_theorem(implies(implies(not(b),X0),implies(implies(c,X0),implies(sF1,X0)))),
    inference(superposition,[],[f4,f9]) ).

fof(f85,plain,
    ! [X0] :
      ( ~ is_a_theorem(implies(sF2,X0))
      | is_a_theorem(implies(c,X0)) ),
    inference(resolution,[],[f56,f1]) ).

fof(f92,plain,
    ! [X0] :
      ( ~ is_a_theorem(implies(sF3,X0))
      | is_a_theorem(implies(sF2,X0)) ),
    inference(resolution,[],[f59,f1]) ).

fof(f119,plain,
    ! [X0] :
      ( is_a_theorem(implies(not(a),X0))
      | ~ is_a_theorem(implies(sF2,X0)) ),
    inference(resolution,[],[f67,f1]) ).

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

fof(f144,plain,
    is_a_theorem(implies(sF2,sF3)),
    inference(resolution,[],[f54,f64]) ).

fof(f145,plain,
    is_a_theorem(implies(sF3,sF4)),
    inference(resolution,[],[f54,f63]) ).

fof(f210,plain,
    is_a_theorem(implies(implies(not(a),sF3),implies(implies(b,sF3),sF4))),
    inference(superposition,[],[f77,f15]) ).

fof(f212,plain,
    ! [X2,X0,X1] : is_a_theorem(implies(not(X0),implies(X1,implies(X0,X2)))),
    inference(resolution,[],[f127,f65]) ).

fof(f232,plain,
    ! [X0] :
      ( is_a_theorem(implies(implies(c,X0),implies(sF1,X0)))
      | ~ is_a_theorem(implies(not(b),X0)) ),
    inference(resolution,[],[f79,f1]) ).

fof(f257,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,[],[f71,f1]) ).

fof(f401,plain,
    is_a_theorem(implies(sF2,sF4)),
    inference(resolution,[],[f92,f145]) ).

fof(f402,plain,
    is_a_theorem(implies(c,sF4)),
    inference(resolution,[],[f401,f85]) ).

fof(f525,plain,
    ( ~ is_a_theorem(implies(not(a),sF3))
    | is_a_theorem(implies(implies(b,sF3),sF4)) ),
    inference(resolution,[],[f210,f1]) ).

fof(f527,definition,
    ( spl5_25
  <=> is_a_theorem(implies(implies(b,sF3),sF4)) ),
    introduced(definition,[new_symbols(definition,[spl5_25])],[avatar_definition]) ).

fof(f529,plain,
    ( is_a_theorem(implies(implies(b,sF3),sF4))
    | ~ spl5_25 ),
    inference(avatar_component_clause,[],[f527]) ).

fof(f531,definition,
    ( spl5_26
  <=> is_a_theorem(implies(not(a),sF3)) ),
    introduced(definition,[new_symbols(definition,[spl5_26])],[avatar_definition]) ).

fof(f533,plain,
    ( ~ is_a_theorem(implies(not(a),sF3))
    | spl5_26 ),
    inference(avatar_component_clause,[],[f531]) ).

fof(f534,plain,
    ( spl5_25
    | ~ spl5_26 ),
    inference(avatar_split_clause,[],[f525,f531,f527]) ).

fof(f548,plain,
    ( ~ is_a_theorem(implies(sF2,sF3))
    | spl5_26 ),
    inference(resolution,[],[f533,f119]) ).

fof(f552,plain,
    ( $false
    | spl5_26 ),
    inference(forward_subsumption_resolution,[],[f548,f144]) ).

fof(f553,plain,
    spl5_26,
    inference(avatar_contradiction_clause,[],[f552]) ).

fof(f579,plain,
    ( is_a_theorem(implies(not(b),sF4))
    | ~ spl5_25 ),
    inference(resolution,[],[f529,f65]) ).

fof(f664,plain,
    ! [X0] :
      ( ~ is_a_theorem(implies(not(b),X0))
      | ~ is_a_theorem(implies(c,X0))
      | is_a_theorem(implies(sF1,X0)) ),
    inference(resolution,[],[f232,f1]) ).

fof(f705,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,[],[f257,f1]) ).

fof(f746,plain,
    ! [X0] : is_a_theorem(implies(not(sF1),implies(X0,sF3))),
    inference(superposition,[],[f212,f13]) ).

fof(f764,plain,
    is_a_theorem(implies(not(sF1),sF4)),
    inference(superposition,[],[f746,f15]) ).

fof(f1675,plain,
    ( ~ is_a_theorem(implies(c,sF4))
    | is_a_theorem(implies(sF1,sF4))
    | ~ spl5_25 ),
    inference(resolution,[],[f664,f579]) ).

fof(f1676,plain,
    ( is_a_theorem(implies(sF1,sF4))
    | ~ spl5_25 ),
    inference(forward_subsumption_resolution,[],[f1675,f402]) ).

fof(f2118,plain,
    ! [X0] :
      ( ~ is_a_theorem(implies(X0,sF4))
      | ~ is_a_theorem(implies(sF1,X0))
      | is_a_theorem(sF4) ),
    inference(resolution,[],[f705,f764]) ).

fof(f2119,plain,
    ! [X0] :
      ( ~ is_a_theorem(implies(sF1,X0))
      | ~ is_a_theorem(implies(X0,sF4)) ),
    inference(forward_subsumption_resolution,[],[f2118,f16]) ).

fof(f2242,definition,
    ( spl5_136
  <=> ! [X0] : ~ is_a_theorem(implies(not(X0),sF4)) ),
    introduced(definition,[new_symbols(definition,[spl5_136])],[avatar_definition]) ).

fof(f2243,plain,
    ( ! [X0] : ~ is_a_theorem(implies(not(X0),sF4))
    | ~ spl5_136 ),
    inference(avatar_component_clause,[],[f2242]) ).

fof(f2442,plain,
    ! [X0] : ~ is_a_theorem(implies(implies(X0,sF1),sF4)),
    inference(resolution,[],[f2119,f127]) ).

fof(f2488,plain,
    ! [X0] :
      ( ~ is_a_theorem(implies(sF1,sF4))
      | ~ is_a_theorem(implies(not(X0),sF4)) ),
    inference(resolution,[],[f2442,f257]) ).

fof(f2489,plain,
    ( ! [X0] : ~ is_a_theorem(implies(not(X0),sF4))
    | ~ spl5_25 ),
    inference(forward_subsumption_resolution,[],[f2488,f1676]) ).

fof(f2490,plain,
    ( spl5_136
    | ~ spl5_25 ),
    inference(avatar_split_clause,[],[f2489,f527,f2242]) ).

fof(f2498,plain,
    ( ~ is_a_theorem(implies(sF2,sF4))
    | ~ spl5_136 ),
    inference(resolution,[],[f2243,f119]) ).

fof(f2511,plain,
    ( $false
    | ~ spl5_136 ),
    inference(forward_subsumption_resolution,[],[f2498,f401]) ).

fof(f2512,plain,
    ~ spl5_136,
    inference(avatar_contradiction_clause,[],[f2511]) ).

cnf(s19,plain,
    ( spl5_25
    | ~ spl5_26 ),
    inference(sat_conversion,[],[f534]) ).

cnf(s21,plain,
    spl5_26,
    inference(sat_conversion,[],[f553]) ).

cnf(s281,plain,
    ( ~ spl5_25
    | spl5_136 ),
    inference(sat_conversion,[],[f2490]) ).

cnf(s287,plain,
    ~ spl5_136,
    inference(sat_conversion,[],[f2512]) ).

cnf(s288,plain,
    ~ spl5_25,
    inference(rat,[],[s281,s287]) ).

cnf(s294,plain,
    $false,
    inference(rat,[],[s19,s21,s288]) ).

fof(f2513,plain,
    $false,
    inference(avatar_sat_refutation,[],[s294]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL067-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.36  % Computer : n010.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Sun Sep 27 15:21:01 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.37  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.40  Running first-order model finding
% 0.09/0.40  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
% 2.92/1.00  % (1082712)Will run a generic schedule for satisfiability detection.
% 2.92/1.00  % (1082723)% WARNING: option uhcvi not known.
% 2.92/1.00  % (1082723)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2584016673:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 2.92/1.00  % (1082725)dis+10_1_sil=32000:sp=arity:random_seed=854961386:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 2.92/1.00  % (1082722)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=738138440_2999 on theBenchmark for (2999ds/0Mi)
% 2.92/1.00  % (1082724)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=957055718:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 2.92/1.00  % (1082726)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2247207097:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 2.92/1.00  % (1082727)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=740883356:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 2.92/1.00  % TRYING [1]
% 2.92/1.00  % TRYING [2]
% 2.92/1.00  % TRYING [3]
% 2.92/1.00  % (1082728)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=438504330:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 2.92/1.00  % TRYING [4]
% 2.92/1.00  % (1082725)Instruction limit reached! 
% 2.92/1.00  % (1082725)------------------------------
% 2.92/1.00  % (1082725)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.92/1.00  % (1082725)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.92/1.00  % (1082725)CaDiCaL version: 2.1.3
% 2.92/1.00  % (1082725)Termination reason: Instruction limit
% 2.92/1.00  % (1082725)Termination phase: Saturation
% 2.92/1.00  % (1082725)Time elapsed: 0.067 s
% 2.92/1.00  % (1082725)Peak memory usage: 11 MB
% 2.92/1.00  % (1082725)Instructions burned: 104 (million)
% 2.92/1.00  % (1082726)Instruction limit reached! 
% 2.92/1.00  % (1082726)------------------------------
% 2.92/1.00  % (1082726)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.92/1.00  % (1082726)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.92/1.00  % (1082726)CaDiCaL version: 2.1.3
% 2.92/1.00  % (1082726)Termination reason: Instruction limit
% 2.92/1.00  % (1082726)Termination phase: Saturation
% 2.92/1.00  % (1082726)Time elapsed: 0.072 s
% 2.92/1.00  % (1082726)Peak memory usage: 11 MB
% 2.92/1.00  % (1082726)Instructions burned: 118 (million)
% 2.92/1.00  % (1082727)Instruction limit reached! 
% 2.92/1.00  % (1082727)------------------------------
% 2.92/1.00  % (1082727)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.92/1.00  % (1082727)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.92/1.00  % (1082727)CaDiCaL version: 2.1.3
% 2.92/1.00  % (1082727)Termination reason: Instruction limit
% 2.92/1.00  % (1082727)Termination phase: Saturation
% 2.92/1.00  % (1082727)Time elapsed: 0.083 s
% 2.92/1.00  % (1082727)Peak memory usage: 13 MB
% 2.92/1.00  % (1082727)Instructions burned: 132 (million)
% 2.92/1.00  % (1082761)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=4044091253:i=714:nm=2_2998 on theBenchmark for (2998ds/714Mi)
% 2.92/1.00  % TRYING [1]
% 2.92/1.00  % TRYING [2]
% 2.92/1.00  % TRYING [3]
% 2.92/1.00  % (1082765)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=9224196:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 2.92/1.00  % TRYING [4]
% 2.92/1.00  % (1082770)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=2449008315:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 2.92/1.00  % (1082728)Instruction limit reached! 
% 2.92/1.00  % (1082728)------------------------------
% 2.92/1.00  % (1082728)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.92/1.00  % (1082728)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.92/1.00  % (1082728)CaDiCaL version: 2.1.3
% 2.92/1.00  % (1082728)Termination reason: Instruction limit
% 2.92/1.00  % (1082728)Termination phase: Saturation
% 2.92/1.00  % (1082728)Time elapsed: 0.102 s
% 2.92/1.00  % (1082728)Peak memory usage: 13 MB
% 2.92/1.00  % (1082728)Instructions burned: 160 (million)
% 2.92/1.00  % (1082785)ott-21_1_sil=16000:fs=off:random_seed=2327738926:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 2.92/1.00  % TRYING [5]
% 2.92/1.00  % (1082765)Instruction limit reached! 
% 2.92/1.00  % (1082765)------------------------------
% 2.92/1.00  % (1082765)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.92/1.00  % (1082765)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.92/1.00  % (1082765)CaDiCaL version: 2.1.3
% 2.92/1.00  % (1082765)Termination reason: Instruction limit
% 2.92/1.00  % (1082765)Termination phase: Saturation
% 2.92/1.00  % (1082765)Time elapsed: 0.078 s
% 2.92/1.00  % (1082765)Peak memory usage: 12 MB
% 2.92/1.00  % (1082765)Instructions burned: 131 (million)
% 2.92/1.00  % (1082805)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=1047634068:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 2.92/1.00  % (1082785)Instruction limit reached! 
% 2.92/1.00  % (1082785)------------------------------
% 2.92/1.00  % (1082785)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.92/1.00  % (1082785)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.92/1.00  % (1082785)CaDiCaL version: 2.1.3
% 2.92/1.00  % (1082785)Termination reason: Instruction limit
% 2.92/1.00  % (1082785)Termination phase: Saturation
% 2.92/1.00  % (1082785)Time elapsed: 0.101 s
% 2.92/1.00  % (1082785)Peak memory usage: 12 MB
% 2.92/1.00  % (1082785)Instructions burned: 180 (million)
% 2.92/1.00  % (1082823)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=3397496187:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 2.92/1.00  % TRYING [1]
% 2.92/1.00  % TRYING [2]
% 2.92/1.00  % TRYING [3]
% 2.92/1.00  % TRYING [5]
% 2.92/1.00  % TRYING [4]
% 2.92/1.00  % TRYING [5]
% 2.92/1.00  % (1082805)Instruction limit reached! 
% 2.92/1.00  % (1082805)------------------------------
% 2.92/1.00  % (1082805)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.92/1.00  % (1082805)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.92/1.00  % (1082805)CaDiCaL version: 2.1.3
% 2.92/1.00  % (1082805)Termination reason: Instruction limit
% 2.92/1.00  % (1082805)Termination phase: Saturation
% 2.92/1.00  % (1082805)Time elapsed: 0.295 s
% 2.92/1.00  % (1082805)Peak memory usage: 13 MB
% 2.92/1.00  % (1082805)Instructions burned: 478 (million)
% 2.92/1.00  % (1082844)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=3441399248:i=1179_2994 on theBenchmark for (2994ds/1179Mi)
% 2.92/1.00  % (1082770)Instruction limit reached! 
% 2.92/1.00  % (1082770)------------------------------
% 2.92/1.00  % (1082770)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.92/1.00  % (1082770)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.92/1.00  % (1082770)CaDiCaL version: 2.1.3
% 2.92/1.00  % (1082770)Termination reason: Instruction limit
% 2.92/1.00  % (1082770)Termination phase: Saturation
% 2.92/1.00  % (1082770)Time elapsed: 0.418 s
% 2.92/1.00  % (1082770)Peak memory usage: 17 MB
% 2.92/1.00  % (1082770)Instructions burned: 685 (million)
% 2.92/1.00  % (1082761)Instruction limit reached! 
% 2.92/1.00  % (1082761)------------------------------
% 2.92/1.00  % (1082761)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.92/1.00  % (1082761)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.92/1.00  % (1082761)CaDiCaL version: 2.1.3
% 2.92/1.00  % (1082761)Termination reason: Instruction limit
% 2.92/1.00  % (1082761)Termination phase: Finite model building SAT solving
% 2.92/1.00  % (1082761)Time elapsed: 0.453 s
% 2.92/1.00  % (1082761)Peak memory usage: 16 MB
% 2.92/1.00  % (1082761)Instructions burned: 714 (million)
% 2.92/1.00  % (1082846)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=3921288503:i=889:ins=1_2994 on theBenchmark for (2994ds/889Mi)
% 2.92/1.00  % (1082844) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1082712-1082844"...
% 2.92/1.00  % (1082844)...printing done.
% 2.92/1.00  % (1082844)Refutation found. Thanks to Tanya!
% 2.92/1.00  % SZS status Unsatisfiable for theBenchmark
% 2.92/1.00  % SZS output start Proof for theBenchmark
% See solution above
% 2.92/1.01  % (1082844)------------------------------
% 2.92/1.01  % (1082844)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.92/1.01  % (1082844)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.92/1.01  % (1082844)CaDiCaL version: 2.1.3
% 2.92/1.01  % (1082844)Termination reason: Refutation
% 2.92/1.01  % (1082844)Time elapsed: 0.043 s
% 2.92/1.01  % (1082844)Peak memory usage: 13 MB
% 2.92/1.01  % (1082844)Instructions burned: 66 (million)
% 2.92/1.01  % (1082712)Success in time 0.594 s
% 2.92/1.01  % Vampire exiting
%------------------------------------------------------------------------------