↑ 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  : ROB004-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 : n015.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 12:36:19 PM UTC 2026

% Result   : Unsatisfiable 1.69s 0.79s
% Output   : Refutation 1.69s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   20
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   70 (  70 unt;   7 def)
%            Number of atoms       :   70 (  69 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    3 (   3   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    9 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   13 (  13 usr;  11 con; 0-2 aty)
%            Number of variables   :   46 (  46   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1] : add(X0,X1) = add(X1,X0),
    file('/export/starexec/sandbox/benchmark/Axioms/ROB001-0.ax',commutativity_of_add) ).

fof(f2,axiom,
    ! [X2,X0,X1] : add(add(X0,X1),X2) = add(X0,add(X1,X2)),
    file('/export/starexec/sandbox/benchmark/Axioms/ROB001-0.ax',associativity_of_add) ).

fof(f3,axiom,
    ! [X0,X1] : negate(add(negate(add(X0,X1)),negate(add(X0,negate(X1))))) = X0,
    file('/export/starexec/sandbox/benchmark/Axioms/ROB001-0.ax',robbins_axiom) ).

fof(f4,axiom,
    negate(d) = c,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',negate_d_is_c) ).

fof(f5,axiom,
    add(c,d) = d,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_plus_d_is_d) ).

fof(f6,plain,
    d = add(c,d),
    inference(reorient_equations,[],[f5]) ).

fof(f7,axiom,
    add(c,c) = c,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_plus_c_is_c) ).

fof(f8,plain,
    c = add(c,c),
    inference(reorient_equations,[],[f7]) ).

fof(f9,negated_conjecture,
    add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))) != b,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_huntingtons_axiom) ).

fof(f10,plain,
    b != add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))),
    inference(reorient_equations,[],[f9]) ).

fof(f11,definition,
    sF0 = negate(b),
    introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).

fof(f12,plain,
    negate(b) = sF0,
    inference(reorient_equations,[],[f11]) ).

fof(f13,definition,
    sF1 = add(a,sF0),
    introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).

fof(f14,plain,
    add(a,sF0) = sF1,
    inference(reorient_equations,[],[f13]) ).

fof(f15,definition,
    sF2 = negate(sF1),
    introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).

fof(f16,plain,
    negate(sF1) = sF2,
    inference(reorient_equations,[],[f15]) ).

fof(f17,definition,
    sF3 = negate(a),
    introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).

fof(f18,plain,
    negate(a) = sF3,
    inference(reorient_equations,[],[f17]) ).

fof(f19,definition,
    sF4 = add(sF3,sF0),
    introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).

fof(f20,plain,
    add(sF3,sF0) = sF4,
    inference(reorient_equations,[],[f19]) ).

fof(f21,definition,
    sF5 = negate(sF4),
    introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).

fof(f22,plain,
    negate(sF4) = sF5,
    inference(reorient_equations,[],[f21]) ).

fof(f23,definition,
    sF6 = add(sF2,sF5),
    introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).

fof(f24,plain,
    add(sF2,sF5) = sF6,
    inference(reorient_equations,[],[f23]) ).

fof(f25,plain,
    b != sF6,
    inference(definition_folding,[],[f10,f24,f22,f20,f12,f18,f16,f14,f12]) ).

fof(f26,plain,
    sF1 = add(sF0,a),
    inference(forward_demodulation,[],[f14,f1]) ).

fof(f27,plain,
    sF4 = add(sF0,sF3),
    inference(forward_demodulation,[],[f20,f1]) ).

fof(f31,plain,
    d = add(d,c),
    inference(superposition,[],[f6,f1]) ).

fof(f35,plain,
    ! [X0] : add(d,add(c,X0)) = add(d,X0),
    inference(superposition,[],[f2,f31]) ).

fof(f36,plain,
    ! [X0] : add(d,X0) = add(c,add(d,X0)),
    inference(superposition,[],[f2,f6]) ).

fof(f37,plain,
    ! [X0] : add(c,X0) = add(c,add(c,X0)),
    inference(superposition,[],[f2,f8]) ).

fof(f44,plain,
    ! [X2,X0,X1] : add(X0,add(X1,X2)) = add(X2,add(X0,X1)),
    inference(superposition,[],[f1,f2]) ).

fof(f49,plain,
    ! [X0] : add(X0,d) = add(c,add(X0,d)),
    inference(superposition,[],[f36,f1]) ).

fof(f52,plain,
    ! [X0] : add(d,add(c,X0)) = add(X0,d),
    inference(forward_demodulation,[],[f49,f44]) ).

fof(f55,plain,
    ! [X0,X1] : negate(add(negate(add(X0,X1)),negate(add(X1,negate(X0))))) = X1,
    inference(superposition,[],[f3,f1]) ).

fof(f61,plain,
    sF0 = negate(add(negate(sF1),negate(add(sF0,negate(a))))),
    inference(superposition,[],[f3,f26]) ).

fof(f65,plain,
    ! [X2,X0,X1] : negate(add(negate(add(X1,add(negate(add(X0,X2)),negate(add(X0,negate(X2)))))),negate(add(X1,X0)))) = X1,
    inference(superposition,[],[f3,f3]) ).

fof(f72,plain,
    ! [X0,X1] : negate(add(negate(add(X1,X0)),negate(add(negate(X0),X1)))) = X1,
    inference(superposition,[],[f3,f1]) ).

fof(f79,plain,
    ! [X2,X0,X1] : negate(add(negate(add(X1,X0)),negate(add(X1,add(negate(add(X0,X2)),negate(add(X0,negate(X2)))))))) = X1,
    inference(forward_demodulation,[],[f65,f1]) ).

fof(f81,plain,
    sF0 = negate(add(negate(sF1),negate(add(sF0,sF3)))),
    inference(forward_demodulation,[],[f61,f18]) ).

fof(f87,plain,
    sF0 = negate(add(negate(sF1),negate(sF4))),
    inference(forward_demodulation,[],[f81,f27]) ).

fof(f91,plain,
    sF0 = negate(add(negate(sF1),sF5)),
    inference(forward_demodulation,[],[f87,f22]) ).

fof(f92,plain,
    sF0 = negate(add(sF5,negate(sF1))),
    inference(forward_demodulation,[],[f91,f1]) ).

fof(f93,plain,
    sF0 = negate(add(sF5,sF2)),
    inference(forward_demodulation,[],[f92,f16]) ).

fof(f94,plain,
    sF0 = negate(add(sF2,sF5)),
    inference(forward_demodulation,[],[f93,f1]) ).

fof(f95,plain,
    sF0 = negate(sF6),
    inference(forward_demodulation,[],[f94,f24]) ).

fof(f109,plain,
    ! [X0] : add(X0,c) = add(c,add(X0,c)),
    inference(superposition,[],[f37,f1]) ).

fof(f174,plain,
    ! [X0] : negate(add(negate(add(d,add(c,X0))),negate(add(X0,negate(d))))) = X0,
    inference(superposition,[],[f3,f52]) ).

fof(f187,plain,
    ! [X0] : negate(add(negate(add(d,add(c,X0))),negate(add(X0,c)))) = X0,
    inference(forward_demodulation,[],[f174,f4]) ).

fof(f194,plain,
    ! [X0] : negate(add(negate(add(d,X0)),negate(add(X0,c)))) = X0,
    inference(forward_demodulation,[],[f187,f35]) ).

fof(f1068,plain,
    ! [X0] : add(c,X0) = negate(add(negate(add(d,X0)),negate(add(add(c,X0),negate(d))))),
    inference(superposition,[],[f55,f35]) ).

fof(f1197,plain,
    ! [X0] : add(c,X0) = negate(add(negate(add(d,X0)),negate(add(c,add(X0,negate(d)))))),
    inference(forward_demodulation,[],[f1068,f2]) ).

fof(f1227,plain,
    ! [X0] : add(c,X0) = negate(add(negate(add(d,X0)),negate(add(c,add(X0,c))))),
    inference(forward_demodulation,[],[f1197,f4]) ).

fof(f1243,plain,
    ! [X0] : add(c,X0) = negate(add(negate(add(d,X0)),negate(add(X0,c)))),
    inference(forward_demodulation,[],[f1227,f109]) ).

fof(f1251,plain,
    ! [X0] : add(c,X0) = X0,
    inference(forward_demodulation,[],[f1243,f194]) ).

fof(f2640,plain,
    ! [X0,X1] : c = negate(add(negate(add(c,X0)),negate(add(negate(add(X0,X1)),negate(add(X0,negate(X1))))))),
    inference(superposition,[],[f79,f1251]) ).

fof(f2671,plain,
    ! [X0] : c = negate(add(negate(add(c,X0)),X0)),
    inference(forward_demodulation,[],[f2640,f3]) ).

fof(f2799,plain,
    ! [X0] : c = negate(add(X0,negate(add(c,X0)))),
    inference(forward_demodulation,[],[f2671,f1]) ).

fof(f2872,plain,
    ! [X0] : c = negate(add(X0,negate(X0))),
    inference(forward_demodulation,[],[f2799,f1251]) ).

fof(f3592,plain,
    ! [X0] : negate(add(c,negate(add(X0,negate(negate(X0)))))) = X0,
    inference(superposition,[],[f3,f2872]) ).

fof(f3599,plain,
    ! [X0] : negate(negate(X0)) = negate(add(negate(add(negate(negate(X0)),X0)),c)),
    inference(superposition,[],[f72,f2872]) ).

fof(f3616,plain,
    ! [X0] : negate(negate(X0)) = negate(add(c,negate(add(negate(negate(X0)),X0)))),
    inference(forward_demodulation,[],[f3599,f1]) ).

fof(f3623,plain,
    ! [X0] : negate(negate(add(X0,negate(negate(X0))))) = X0,
    inference(forward_demodulation,[],[f3592,f1251]) ).

fof(f3674,plain,
    ! [X0] : negate(negate(X0)) = negate(negate(add(negate(negate(X0)),X0))),
    inference(forward_demodulation,[],[f3616,f1251]) ).

fof(f3713,plain,
    ! [X0] : negate(negate(X0)) = negate(negate(add(X0,negate(negate(X0))))),
    inference(forward_demodulation,[],[f3674,f1]) ).

fof(f3729,plain,
    ! [X0] : negate(negate(X0)) = X0,
    inference(forward_demodulation,[],[f3713,f3623]) ).

fof(f3815,plain,
    b = negate(sF0),
    inference(superposition,[],[f3729,f12]) ).

fof(f3818,plain,
    sF6 = negate(sF0),
    inference(superposition,[],[f3729,f95]) ).

fof(f5268,plain,
    b = sF6,
    inference(superposition,[],[f3815,f3818]) ).

fof(f5286,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f5268,f25]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : ROB004-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.37  % Computer : n015.cluster.edu
% 0.13/0.37  % Model    : x86_64 x86_64
% 0.13/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.37  % Memory   : 8046.5625MB
% 0.13/0.37  % OS       : Linux 6.8.0-71-generic
% 0.13/0.37  % CPULimit : 300
% 0.13/0.37  % WCLimit  : 300
% 0.13/0.37  % DateTime : Sun Sep 27 23:28:31 UTC 2026
% 0.13/0.37  % CPUTime  : 
% 0.13/0.37  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.41  Running first-order model finding
% 0.13/0.41  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
% 1.69/0.79  % (2127586)Will run a generic schedule for satisfiability detection.
% 1.69/0.79  % (2127601)dis+10_1_sil=32000:sp=arity:random_seed=413693921:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.69/0.79  % (2127599)% WARNING: option uhcvi not known.
% 1.69/0.79  % (2127599)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=375513455:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.69/0.79  % (2127598)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3251838945_2999 on theBenchmark for (2999ds/0Mi)
% 1.69/0.79  % (2127600)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2190064898:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.69/0.79  % (2127602)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=614251416:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.69/0.79  % (2127604)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2623050221:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.69/0.79  % (2127605)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2452658507:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.69/0.79  % TRYING [1]
% 1.69/0.79  % TRYING [2]
% 1.69/0.79  % TRYING [3]
% 1.69/0.79  % TRYING [4]
% 1.69/0.79  % TRYING [5]
% 1.69/0.79  % (2127601)Instruction limit reached! 
% 1.69/0.79  % (2127601)------------------------------
% 1.69/0.79  % (2127601)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.69/0.79  % (2127601)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.69/0.79  % (2127601)CaDiCaL version: 2.1.3
% 1.69/0.79  % (2127601)Termination reason: Instruction limit
% 1.69/0.79  % (2127601)Termination phase: Saturation
% 1.69/0.79  % (2127601)Time elapsed: 0.031 s
% 1.69/0.79  % (2127601)Peak memory usage: 12 MB
% 1.69/0.79  % (2127601)Instructions burned: 107 (million)
% 1.69/0.79  % (2127627)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1942838111:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 1.69/0.79  % TRYING [1]
% 1.69/0.79  % TRYING [2]
% 1.69/0.79  % TRYING [3]
% 1.69/0.79  % TRYING [4]
% 1.69/0.79  % TRYING [5]
% 1.69/0.79  % (2127602)Instruction limit reached! 
% 1.69/0.79  % (2127602)------------------------------
% 1.69/0.79  % (2127602)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.69/0.79  % (2127602)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.69/0.79  % (2127602)CaDiCaL version: 2.1.3
% 1.69/0.79  % (2127602)Termination reason: Instruction limit
% 1.69/0.79  % (2127602)Termination phase: Saturation
% 1.69/0.79  % (2127602)Time elapsed: 0.066 s
% 1.69/0.79  % (2127602)Peak memory usage: 12 MB
% 1.69/0.79  % (2127602)Instructions burned: 117 (million)
% 1.69/0.79  % (2127604)Instruction limit reached! 
% 1.69/0.79  % (2127604)------------------------------
% 1.69/0.79  % (2127604)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.69/0.79  % (2127604)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.69/0.79  % (2127604)CaDiCaL version: 2.1.3
% 1.69/0.79  % (2127604)Termination reason: Instruction limit
% 1.69/0.79  % (2127604)Termination phase: Saturation
% 1.69/0.79  % (2127604)Time elapsed: 0.077 s
% 1.69/0.79  % (2127604)Peak memory usage: 12 MB
% 1.69/0.79  % (2127604)Instructions burned: 135 (million)
% 1.69/0.79  % (2127642)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3026615249:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 1.69/0.79  % (2127605)Instruction limit reached! 
% 1.69/0.79  % (2127605)------------------------------
% 1.69/0.79  % (2127605)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.69/0.79  % (2127605)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.69/0.79  % (2127605)CaDiCaL version: 2.1.3
% 1.69/0.79  % (2127605)Termination reason: Instruction limit
% 1.69/0.79  % (2127605)Termination phase: Saturation
% 1.69/0.79  % (2127605)Time elapsed: 0.088 s
% 1.69/0.79  % (2127605)Peak memory usage: 12 MB
% 1.69/0.79  % (2127605)Instructions burned: 160 (million)
% 1.69/0.79  % (2127643)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=2226079596:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 1.69/0.79  % TRYING [6]
% 1.69/0.79  % (2127646)ott-21_1_sil=16000:fs=off:random_seed=841551958:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.69/0.79  % TRYING [6]
% 1.69/0.79  % (2127642)Instruction limit reached! 
% 1.69/0.79  % (2127642)------------------------------
% 1.69/0.79  % (2127642)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.69/0.79  % (2127642)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.69/0.79  % (2127642)CaDiCaL version: 2.1.3
% 1.69/0.79  % (2127642)Termination reason: Instruction limit
% 1.69/0.79  % (2127642)Termination phase: Saturation
% 1.69/0.79  % (2127642)Time elapsed: 0.078 s
% 1.69/0.79  % (2127642)Peak memory usage: 12 MB
% 1.69/0.79  % (2127642)Instructions burned: 132 (million)
% 1.69/0.79  % (2127652)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=2705171169:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 1.69/0.79  % (2127646)Instruction limit reached! 
% 1.69/0.79  % (2127646)------------------------------
% 1.69/0.79  % (2127646)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.69/0.79  % (2127646)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.69/0.79  % (2127646)CaDiCaL version: 2.1.3
% 1.69/0.79  % (2127646)Termination reason: Instruction limit
% 1.69/0.79  % (2127646)Termination phase: Saturation
% 1.69/0.79  % (2127646)Time elapsed: 0.079 s
% 1.69/0.79  % (2127646)Peak memory usage: 12 MB
% 1.69/0.79  % (2127646)Instructions burned: 182 (million)
% 1.69/0.79  % (2127654)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=1917723286:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 1.69/0.79  % TRYING [1]
% 1.69/0.79  % TRYING [2]
% 1.69/0.79  % TRYING [3]
% 1.69/0.79  % TRYING [4]
% 1.69/0.79  % TRYING [5]
% 1.69/0.79  % (2127627)Instruction limit reached! 
% 1.69/0.79  % (2127627)------------------------------
% 1.69/0.79  % (2127627)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.69/0.79  % (2127627)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.69/0.79  % (2127627)CaDiCaL version: 2.1.3
% 1.69/0.79  % (2127627)Termination reason: Instruction limit
% 1.69/0.79  % (2127627)Termination phase: Finite model building SAT solving
% 1.69/0.79  % (2127627)Time elapsed: 0.221 s
% 1.69/0.79  % (2127627)Peak memory usage: 18 MB
% 1.69/0.79  % (2127627)Instructions burned: 715 (million)
% 1.69/0.79  % (2127656)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=2020004642:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 1.69/0.79  % TRYING [6]
% 1.69/0.79  % (2127656) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2127586-2127656"...
% 1.69/0.79  % (2127656)...printing done.
% 1.69/0.79  % (2127656)Refutation found. Thanks to Tanya!
% 1.69/0.79  % SZS status Unsatisfiable for theBenchmark
% 1.69/0.79  % SZS output start Proof for theBenchmark
% See solution above
% 1.69/0.79  % (2127656)------------------------------
% 1.69/0.79  % (2127656)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.69/0.79  % (2127656)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.69/0.79  % (2127656)CaDiCaL version: 2.1.3
% 1.69/0.79  % (2127656)Termination reason: Refutation
% 1.69/0.79  % (2127656)Time elapsed: 0.063 s
% 1.69/0.79  % (2127656)Peak memory usage: 14 MB
% 1.69/0.79  % (2127656)Instructions burned: 215 (million)
% 1.69/0.79  % (2127586)Success in time 0.374 s
% 1.69/0.79  % Vampire exiting
%------------------------------------------------------------------------------