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

% Computer : n002.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:58:02 AM UTC 2026

% Result   : Unsatisfiable 3.84s 1.13s
% Output   : Refutation 3.84s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   17
% Syntax   : Number of formulae    :   64 (  52 unt;   8 def)
%            Number of atoms       :   78 (  17 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   32 (  18   ~;  14   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   2 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   13 (  13 usr;  10 con; 0-2 aty)
%            Number of variables   :   59 (  59   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0] : axiom(implies(or(X0,X0),X0)),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_2) ).

fof(f2,axiom,
    ! [X0,X1] : axiom(implies(X0,or(X1,X0))),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).

fof(f3,axiom,
    ! [X0,X1] : axiom(implies(or(X0,X1),or(X1,X0))),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_4) ).

fof(f4,axiom,
    ! [X2,X0,X1] : axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_5) ).

fof(f5,axiom,
    ! [X2,X0,X1] : axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_6) ).

fof(f6,axiom,
    ! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',implies_definition) ).

fof(f7,axiom,
    ! [X0] :
      ( ~ axiom(X0)
      | theorem(X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_1) ).

fof(f8,axiom,
    ! [X0,X1] :
      ( theorem(X0)
      | ~ theorem(implies(X1,X0))
      | ~ theorem(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_2) ).

fof(f9,negated_conjecture,
    ~ theorem(implies(implies(p,q),implies(implies(p,not(q)),not(p)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

fof(f10,plain,
    ! [X0] : axiom(or(not(or(X0,X0)),X0)),
    inference(definition_unfolding,[],[f1,f6]) ).

fof(f11,plain,
    ! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
    inference(definition_unfolding,[],[f2,f6]) ).

fof(f12,plain,
    ! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
    inference(definition_unfolding,[],[f3,f6]) ).

fof(f13,plain,
    ! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
    inference(definition_unfolding,[],[f4,f6]) ).

fof(f14,plain,
    ! [X2,X0,X1] : axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
    inference(definition_unfolding,[],[f5,f6,f6,f6]) ).

fof(f15,plain,
    ! [X0,X1] :
      ( ~ theorem(or(not(X1),X0))
      | theorem(X0)
      | ~ theorem(X1) ),
    inference(definition_unfolding,[],[f8,f6]) ).

fof(f16,plain,
    ~ theorem(or(not(or(not(p),q)),or(not(or(not(p),not(q))),not(p)))),
    inference(definition_unfolding,[],[f9,f6,f6,f6,f6]) ).

fof(f17,definition,
    sF0 = not(p),
    introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).

fof(f18,plain,
    not(p) = sF0,
    inference(reorient_equations,[],[f17]) ).

fof(f19,definition,
    sF1 = or(sF0,q),
    introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).

fof(f20,plain,
    or(sF0,q) = sF1,
    inference(reorient_equations,[],[f19]) ).

fof(f21,definition,
    sF2 = not(sF1),
    introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).

fof(f22,plain,
    not(sF1) = sF2,
    inference(reorient_equations,[],[f21]) ).

fof(f23,definition,
    sF3 = not(q),
    introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).

fof(f24,plain,
    not(q) = sF3,
    inference(reorient_equations,[],[f23]) ).

fof(f25,definition,
    sF4 = or(sF0,sF3),
    introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).

fof(f26,plain,
    or(sF0,sF3) = sF4,
    inference(reorient_equations,[],[f25]) ).

fof(f27,definition,
    sF5 = not(sF4),
    introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).

fof(f28,plain,
    not(sF4) = sF5,
    inference(reorient_equations,[],[f27]) ).

fof(f29,definition,
    sF6 = or(sF5,sF0),
    introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).

fof(f30,plain,
    or(sF5,sF0) = sF6,
    inference(reorient_equations,[],[f29]) ).

fof(f31,definition,
    sF7 = or(sF2,sF6),
    introduced(definition,[new_symbols(definition,[sF7])],[function_definition]) ).

fof(f32,plain,
    or(sF2,sF6) = sF7,
    inference(reorient_equations,[],[f31]) ).

fof(f33,plain,
    ~ theorem(sF7),
    inference(definition_folding,[],[f16,f32,f30,f18,f28,f26,f24,f18,f22,f20,f18]) ).

fof(f34,plain,
    ~ theorem(or(sF2,sF6)),
    inference(superposition,[],[f33,f32]) ).

fof(f35,plain,
    ! [X0] : theorem(or(not(or(X0,X0)),X0)),
    inference(resolution,[],[f10,f7]) ).

fof(f36,plain,
    ! [X0,X1] : theorem(or(not(X0),or(X1,X0))),
    inference(resolution,[],[f11,f7]) ).

fof(f45,plain,
    ! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0))),
    inference(resolution,[],[f12,f7]) ).

fof(f47,plain,
    axiom(or(not(sF4),or(sF3,sF0))),
    inference(superposition,[],[f12,f26]) ).

fof(f52,plain,
    axiom(or(sF5,or(sF3,sF0))),
    inference(forward_demodulation,[],[f47,f28]) ).

fof(f91,plain,
    ! [X2,X0,X1] : theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
    inference(resolution,[],[f13,f7]) ).

fof(f97,plain,
    ! [X0] : axiom(or(not(or(sF5,or(X0,sF0))),or(X0,sF6))),
    inference(superposition,[],[f13,f30]) ).

fof(f103,plain,
    ! [X0] : axiom(or(not(or(not(q),X0)),or(not(sF1),or(sF0,X0)))),
    inference(superposition,[],[f14,f20]) ).

fof(f110,plain,
    ! [X0] : axiom(or(not(or(not(q),X0)),or(sF2,or(sF0,X0)))),
    inference(forward_demodulation,[],[f103,f22]) ).

fof(f111,plain,
    ! [X0] : axiom(or(not(or(sF3,X0)),or(sF2,or(sF0,X0)))),
    inference(forward_demodulation,[],[f110,f24]) ).

fof(f131,plain,
    theorem(or(sF5,or(sF3,sF0))),
    inference(resolution,[],[f52,f7]) ).

fof(f133,plain,
    ! [X0] :
      ( ~ theorem(or(X0,X0))
      | theorem(X0) ),
    inference(resolution,[],[f35,f15]) ).

fof(f134,plain,
    ! [X0,X1] :
      ( theorem(or(X0,X1))
      | ~ theorem(X1) ),
    inference(resolution,[],[f36,f15]) ).

fof(f148,plain,
    ! [X0,X1] :
      ( ~ theorem(or(X1,X0))
      | theorem(or(X0,X1)) ),
    inference(resolution,[],[f45,f15]) ).

fof(f178,plain,
    ! [X0] : theorem(or(not(or(sF5,or(X0,sF0))),or(X0,sF6))),
    inference(resolution,[],[f97,f7]) ).

fof(f182,plain,
    ! [X0] : theorem(or(not(or(sF3,X0)),or(sF2,or(sF0,X0)))),
    inference(resolution,[],[f111,f7]) ).

fof(f191,plain,
    ! [X2,X0,X1] :
      ( ~ theorem(or(X1,or(X0,X2)))
      | theorem(or(X0,or(X1,X2))) ),
    inference(resolution,[],[f91,f15]) ).

fof(f395,plain,
    ! [X0] :
      ( ~ theorem(or(sF5,or(X0,sF0)))
      | theorem(or(X0,sF6)) ),
    inference(resolution,[],[f178,f15]) ).

fof(f407,plain,
    ! [X0] :
      ( ~ theorem(or(sF3,X0))
      | theorem(or(sF2,or(sF0,X0))) ),
    inference(resolution,[],[f182,f15]) ).

fof(f440,plain,
    ! [X2,X0,X1] :
      ( theorem(or(X0,or(X1,X2)))
      | ~ theorem(or(X0,X2)) ),
    inference(resolution,[],[f191,f134]) ).

fof(f464,plain,
    theorem(or(sF3,or(sF5,sF0))),
    inference(resolution,[],[f191,f131]) ).

fof(f468,plain,
    theorem(or(sF3,sF6)),
    inference(forward_demodulation,[],[f464,f30]) ).

fof(f755,plain,
    ! [X0] :
      ( ~ theorem(or(X0,sF0))
      | theorem(or(X0,sF6)) ),
    inference(resolution,[],[f395,f134]) ).

fof(f761,plain,
    theorem(or(sF2,or(sF0,sF6))),
    inference(resolution,[],[f407,f468]) ).

fof(f773,plain,
    theorem(or(sF0,or(sF2,sF6))),
    inference(resolution,[],[f761,f191]) ).

fof(f776,plain,
    ! [X0,X1] :
      ( ~ theorem(or(or(X0,X1),X1))
      | theorem(or(X0,X1)) ),
    inference(resolution,[],[f440,f133]) ).

fof(f790,plain,
    theorem(or(or(sF2,sF6),sF0)),
    inference(resolution,[],[f773,f148]) ).

fof(f1224,plain,
    theorem(or(or(sF2,sF6),sF6)),
    inference(resolution,[],[f755,f790]) ).

fof(f1889,plain,
    theorem(or(sF2,sF6)),
    inference(resolution,[],[f776,f1224]) ).

fof(f1915,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f1889,f34]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : LCL217-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.08  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.19/0.46  % Computer : n002.cluster.edu
% 0.19/0.46  % Model    : x86_64 x86_64
% 0.19/0.46  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.46  % Memory   : 8046.5625MB
% 0.19/0.46  % OS       : Linux 6.8.0-71-generic
% 0.19/0.46  % CPULimit : 300
% 0.19/0.46  % WCLimit  : 300
% 0.19/0.46  % DateTime : Sun Sep 27 15:29:51 UTC 2026
% 0.19/0.46  % CPUTime  : 
% 0.19/0.47  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.24/0.52  Running first-order model finding
% 0.24/0.52  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.84/1.13  % (3677710)Will run a generic schedule for satisfiability detection.
% 3.84/1.13  % (3677719)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3577127372:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 3.84/1.13  % (3677716)% WARNING: option uhcvi not known.
% 3.84/1.13  % (3677715)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3268058931_2999 on theBenchmark for (2999ds/0Mi)
% 3.84/1.13  % (3677718)dis+10_1_sil=32000:sp=arity:random_seed=3406701013:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 3.84/1.13  % (3677717)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1359837419:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 3.84/1.13  % (3677720)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1614517780:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 3.84/1.13  % (3677721)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1940774498:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 3.84/1.13  % (3677716)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1149256556:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 3.84/1.13  % TRYING [1]
% 3.84/1.13  % TRYING [2]
% 3.84/1.13  % TRYING [3]
% 3.84/1.13  % (3677719)Instruction limit reached! 
% 3.84/1.13  % (3677719)------------------------------
% 3.84/1.13  % (3677719)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.84/1.13  % (3677719)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.84/1.13  % (3677719)CaDiCaL version: 2.1.3
% 3.84/1.13  % (3677719)Termination reason: Instruction limit
% 3.84/1.13  % (3677719)Termination phase: Saturation
% 3.84/1.13  % (3677719)Time elapsed: 0.045 s
% 3.84/1.13  % (3677719)Peak memory usage: 11 MB
% 3.84/1.13  % (3677719)Instructions burned: 116 (million)
% 3.84/1.13  % TRYING [4]
% 3.84/1.13  % (3677729)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3716426718:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 3.84/1.13  % TRYING [1]
% 3.84/1.13  % TRYING [2]
% 3.84/1.13  % TRYING [3]
% 3.84/1.13  % (3677718)Instruction limit reached! 
% 3.84/1.13  % (3677718)------------------------------
% 3.84/1.13  % (3677718)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.84/1.13  % (3677718)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.84/1.13  % (3677718)CaDiCaL version: 2.1.3
% 3.84/1.13  % (3677718)Termination reason: Instruction limit
% 3.84/1.13  % (3677718)Termination phase: Saturation
% 3.84/1.13  % (3677718)Time elapsed: 0.103 s
% 3.84/1.13  % (3677718)Peak memory usage: 12 MB
% 3.84/1.13  % (3677718)Instructions burned: 104 (million)
% 3.84/1.13  % TRYING [4]
% 3.84/1.13  % (3677720)Instruction limit reached! 
% 3.84/1.13  % (3677720)------------------------------
% 3.84/1.13  % (3677720)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.84/1.13  % (3677720)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.84/1.13  % (3677720)CaDiCaL version: 2.1.3
% 3.84/1.13  % (3677720)Termination reason: Instruction limit
% 3.84/1.13  % (3677720)Termination phase: Saturation
% 3.84/1.13  % (3677720)Time elapsed: 0.127 s
% 3.84/1.13  % (3677720)Peak memory usage: 13 MB
% 3.84/1.13  % (3677720)Instructions burned: 131 (million)
% 3.84/1.13  % (3677731)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3254112403:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 3.84/1.13  % (3677721)Instruction limit reached! 
% 3.84/1.13  % (3677721)------------------------------
% 3.84/1.13  % (3677721)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.84/1.13  % (3677721)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.84/1.13  % (3677721)CaDiCaL version: 2.1.3
% 3.84/1.13  % (3677721)Termination reason: Instruction limit
% 3.84/1.13  % (3677721)Termination phase: Saturation
% 3.84/1.13  % (3677721)Time elapsed: 0.167 s
% 3.84/1.13  % (3677721)Peak memory usage: 13 MB
% 3.84/1.13  % (3677721)Instructions burned: 160 (million)
% 3.84/1.13  % (3677732)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=4157889484:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 3.84/1.13  % (3677734)ott-21_1_sil=16000:fs=off:random_seed=4073531195:i=180:av=off:fsr=off_2997 on theBenchmark for (2997ds/180Mi)
% 3.84/1.13  % TRYING [5]
% 3.84/1.13  % (3677731)Instruction limit reached! 
% 3.84/1.13  % (3677731)------------------------------
% 3.84/1.13  % (3677731)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.84/1.13  % (3677731)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.84/1.13  % (3677731)CaDiCaL version: 2.1.3
% 3.84/1.13  % (3677731)Termination reason: Instruction limit
% 3.84/1.13  % (3677731)Termination phase: Saturation
% 3.84/1.13  % (3677731)Time elapsed: 0.124 s
% 3.84/1.13  % (3677731)Peak memory usage: 12 MB
% 3.84/1.13  % (3677731)Instructions burned: 132 (million)
% 3.84/1.13  % TRYING [5]
% 3.84/1.13  % (3677737)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=1958793133:i=477:bd=all_2996 on theBenchmark for (2996ds/477Mi)
% 3.84/1.13  % (3677734)Instruction limit reached! 
% 3.84/1.13  % (3677734)------------------------------
% 3.84/1.13  % (3677734)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.84/1.13  % (3677734)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.84/1.13  % (3677734)CaDiCaL version: 2.1.3
% 3.84/1.13  % (3677734)Termination reason: Instruction limit
% 3.84/1.13  % (3677734)Termination phase: Saturation
% 3.84/1.13  % (3677734)Time elapsed: 0.151 s
% 3.84/1.13  % (3677734)Peak memory usage: 12 MB
% 3.84/1.13  % (3677734)Instructions burned: 181 (million)
% 3.84/1.13  % (3677739)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=829390894:fmbsr=1.3:i=865:ins=25_2995 on theBenchmark for (2995ds/865Mi)
% 3.84/1.13  % TRYING [1]
% 3.84/1.13  % TRYING [2]
% 3.84/1.13  % TRYING [3]
% 3.84/1.13  % TRYING [4]
% 3.84/1.13  % (3677729)Instruction limit reached! 
% 3.84/1.13  % (3677729)------------------------------
% 3.84/1.13  % (3677729)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.84/1.13  % (3677729)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.84/1.13  % (3677729)CaDiCaL version: 2.1.3
% 3.84/1.13  % (3677729)Termination reason: Instruction limit
% 3.84/1.13  % (3677729)Termination phase: Finite model building SAT solving
% 3.84/1.13  % (3677729)Time elapsed: 0.360 s
% 3.84/1.13  % (3677729)Peak memory usage: 16 MB
% 3.84/1.13  % (3677729)Instructions burned: 716 (million)
% 3.84/1.13  % (3677741)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=1731825509:i=1179_2995 on theBenchmark for (2995ds/1179Mi)
% 3.84/1.13  % TRYING [5]
% 3.84/1.13  % (3677741) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3677710-3677741"...
% 3.84/1.13  % (3677741)...printing done.
% 3.84/1.13  % (3677741)Refutation found. Thanks to Tanya!
% 3.84/1.13  % SZS status Unsatisfiable for theBenchmark
% 3.84/1.13  % SZS output start Proof for theBenchmark
% See solution above
% 3.84/1.13  % (3677741)------------------------------
% 3.84/1.13  % (3677741)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.84/1.13  % (3677741)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.84/1.13  % (3677741)CaDiCaL version: 2.1.3
% 3.84/1.13  % (3677741)Termination reason: Refutation
% 3.84/1.13  % (3677741)Time elapsed: 0.041 s
% 3.84/1.13  % (3677741)Peak memory usage: 12 MB
% 3.84/1.13  % (3677741)Instructions burned: 76 (million)
% 3.84/1.13  % (3677710)Success in time 0.595 s
% 3.84/1.13  % Vampire exiting
%------------------------------------------------------------------------------