%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL262-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n006.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:14 AM UTC 2026
% Result : Unsatisfiable 4.92s 1.29s
% Output : Refutation 4.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 13
% Syntax : Number of formulae : 65 ( 40 unt; 2 def)
% Number of atoms : 96 ( 4 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 63 ( 32 ~; 29 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 100 ( 0 sgn 100 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : axiom(implies(or(X0,X0),X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_2) ).
fof(f2,axiom,
! [X0,X1] : axiom(implies(X0,or(X1,X0))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).
fof(f3,axiom,
! [X0,X1] : axiom(implies(or(X0,X1),or(X1,X0))),
file('/export/starexec/sandbox2/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/sandbox2/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/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_6) ).
fof(f6,axiom,
! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',implies_definition) ).
fof(f7,axiom,
! [X0] :
( ~ axiom(X0)
| theorem(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_1) ).
fof(f8,axiom,
! [X0,X1] :
( theorem(X0)
| ~ theorem(implies(X1,X0))
| ~ theorem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_2) ).
fof(f9,axiom,
! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-1.ax',and_defn) ).
fof(f10,axiom,
! [X0,X1] : equivalent(X0,X1) = and(implies(X0,X1),implies(X1,X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-2.ax',equivalent_defn) ).
fof(f11,negated_conjecture,
~ theorem(equivalent(implies(p,q),implies(not(q),not(p)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f12,plain,
! [X0,X1] : equivalent(X0,X1) = not(or(not(or(not(X0),X1)),not(or(not(X1),X0)))),
inference(definition_unfolding,[],[f10,f9,f6,f6]) ).
fof(f13,plain,
! [X0] : axiom(or(not(or(X0,X0)),X0)),
inference(definition_unfolding,[],[f1,f6]) ).
fof(f14,plain,
! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
inference(definition_unfolding,[],[f2,f6]) ).
fof(f15,plain,
! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(definition_unfolding,[],[f3,f6]) ).
fof(f16,plain,
! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(definition_unfolding,[],[f4,f6]) ).
fof(f17,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(f18,plain,
! [X0,X1] :
( ~ theorem(or(not(X1),X0))
| theorem(X0)
| ~ theorem(X1) ),
inference(definition_unfolding,[],[f8,f6]) ).
fof(f19,plain,
~ theorem(not(or(not(or(not(or(not(p),q)),or(not(not(q)),not(p)))),not(or(not(or(not(not(q)),not(p))),or(not(p),q)))))),
inference(definition_unfolding,[],[f11,f12,f6,f6]) ).
fof(f20,plain,
! [X0] : theorem(or(not(or(X0,X0)),X0)),
inference(resolution,[],[f13,f7]) ).
fof(f21,plain,
! [X0,X1] : theorem(or(not(X0),or(X1,X0))),
inference(resolution,[],[f14,f7]) ).
fof(f22,plain,
! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(resolution,[],[f15,f7]) ).
fof(f23,plain,
! [X0] :
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(resolution,[],[f18,f20]) ).
fof(f27,plain,
! [X0,X1] :
( ~ theorem(or(X1,X0))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f22,f18]) ).
fof(f66,plain,
! [X2,X0,X1] : theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(resolution,[],[f16,f7]) ).
fof(f67,plain,
! [X2,X0,X1] :
( ~ theorem(or(X1,or(X0,X2)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f66,f18]) ).
fof(f71,plain,
! [X0,X1] : theorem(or(X0,or(not(X1),X1))),
inference(resolution,[],[f67,f21]) ).
fof(f72,plain,
! [X0,X1] : theorem(or(X0,or(not(or(X1,X0)),X1))),
inference(resolution,[],[f67,f22]) ).
fof(f76,plain,
! [X0] : theorem(or(not(X0),X0)),
inference(resolution,[],[f71,f23]) ).
fof(f121,plain,
! [X0] : theorem(or(X0,not(X0))),
inference(resolution,[],[f27,f76]) ).
fof(f137,plain,
! [X0,X1] :
( theorem(or(not(or(X0,not(X1))),X0))
| ~ theorem(X1) ),
inference(resolution,[],[f72,f18]) ).
fof(f145,plain,
! [X0,X1] :
( ~ theorem(or(X1,not(X0)))
| theorem(X1)
| ~ theorem(X0) ),
inference(resolution,[],[f137,f18]) ).
fof(f152,plain,
! [X0,X1] :
( theorem(not(or(not(X0),not(X1))))
| ~ theorem(X0)
| ~ theorem(X1) ),
inference(resolution,[],[f145,f137]) ).
fof(f203,plain,
! [X2,X0,X1] : theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(resolution,[],[f17,f7]) ).
fof(f262,plain,
( ~ theorem(or(not(or(not(p),q)),or(not(not(q)),not(p))))
| ~ theorem(or(not(or(not(not(q)),not(p))),or(not(p),q))) ),
inference(resolution,[],[f152,f19]) ).
fof(f265,definition,
( spl0_5
<=> theorem(or(not(or(not(not(q)),not(p))),or(not(p),q))) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f267,plain,
( ~ theorem(or(not(or(not(not(q)),not(p))),or(not(p),q)))
| spl0_5 ),
inference(avatar_component_clause,[],[f265]) ).
fof(f269,definition,
( spl0_6
<=> theorem(or(not(or(not(p),q)),or(not(not(q)),not(p)))) ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
fof(f271,plain,
( ~ theorem(or(not(or(not(p),q)),or(not(not(q)),not(p))))
| spl0_6 ),
inference(avatar_component_clause,[],[f269]) ).
fof(f272,plain,
( ~ spl0_5
| ~ spl0_6 ),
inference(avatar_split_clause,[],[f262,f269,f265]) ).
fof(f296,plain,
! [X2,X0,X1] :
( theorem(or(not(or(X0,X1)),or(X0,X2)))
| ~ theorem(or(not(X1),X2)) ),
inference(resolution,[],[f203,f18]) ).
fof(f297,plain,
! [X2,X0,X1] : theorem(or(or(not(or(X0,X1)),or(X0,X2)),not(or(not(X1),X2)))),
inference(resolution,[],[f203,f27]) ).
fof(f329,plain,
! [X2,X0,X1] : theorem(or(not(or(X0,X1)),or(not(or(not(X1),X2)),or(X0,X2)))),
inference(resolution,[],[f67,f203]) ).
fof(f722,plain,
! [X2,X0,X1] :
( ~ theorem(or(not(X0),X1))
| theorem(or(X2,X1))
| ~ theorem(or(X2,X0)) ),
inference(resolution,[],[f296,f18]) ).
fof(f1627,plain,
! [X2,X0,X1] :
( ~ theorem(or(X0,or(X2,X1)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f722,f22]) ).
fof(f1682,plain,
! [X0,X1] :
( theorem(or(X0,not(not(X1))))
| ~ theorem(or(X0,X1)) ),
inference(resolution,[],[f722,f121]) ).
fof(f1775,plain,
! [X0,X1] :
( ~ theorem(not(X1))
| theorem(X0)
| ~ theorem(or(X0,X1)) ),
inference(resolution,[],[f1682,f145]) ).
fof(f1778,plain,
! [X0] :
( ~ theorem(or(not(not(X0)),X0))
| theorem(not(not(X0))) ),
inference(resolution,[],[f1682,f23]) ).
fof(f2067,plain,
! [X2,X0,X1] : theorem(or(or(not(or(not(X0),X1)),or(X2,X1)),not(or(X2,X0)))),
inference(resolution,[],[f329,f27]) ).
fof(f2123,plain,
! [X0,X1] : theorem(or(X0,or(X1,not(X1)))),
inference(resolution,[],[f1627,f71]) ).
fof(f2242,plain,
! [X0] : theorem(not(not(or(X0,not(X0))))),
inference(resolution,[],[f2123,f1778]) ).
fof(f2309,plain,
! [X0,X1] :
( ~ theorem(or(X0,not(or(X1,not(X1)))))
| theorem(X0) ),
inference(resolution,[],[f2242,f1775]) ).
fof(f2984,plain,
! [X0,X1] : theorem(or(not(or(X0,X1)),or(X0,not(not(X1))))),
inference(resolution,[],[f2309,f297]) ).
fof(f7714,plain,
! [X0,X1] : theorem(or(not(or(X0,X1)),or(not(not(X1)),X0))),
inference(resolution,[],[f2984,f1627]) ).
fof(f8768,plain,
! [X0,X1] : theorem(or(not(or(not(not(X0)),X1)),or(X0,X1))),
inference(resolution,[],[f2067,f2309]) ).
fof(f9146,plain,
! [X0,X1] : theorem(or(not(or(not(not(X0)),X1)),or(X1,X0))),
inference(resolution,[],[f8768,f1627]) ).
fof(f22042,plain,
( $false
| spl0_5 ),
inference(resolution,[],[f9146,f267]) ).
fof(f22063,plain,
spl0_5,
inference(avatar_contradiction_clause,[],[f22042]) ).
fof(f22064,plain,
( $false
| spl0_6 ),
inference(forward_subsumption_resolution,[],[f271,f7714]) ).
fof(f22065,plain,
spl0_6,
inference(avatar_contradiction_clause,[],[f22064]) ).
cnf(s13,plain,
( ~ spl0_5
| ~ spl0_6 ),
inference(sat_conversion,[],[f272]) ).
cnf(s276,plain,
spl0_5,
inference(sat_conversion,[],[f22063]) ).
cnf(s277,plain,
spl0_6,
inference(sat_conversion,[],[f22065]) ).
cnf(s278,plain,
$false,
inference(rat,[],[s13,s277,s276]) ).
fof(f22066,plain,
$false,
inference(avatar_sat_refutation,[],[s278]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL262-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.09 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.19/0.45 % Computer : n006.cluster.edu
% 0.19/0.45 % Model : x86_64 x86_64
% 0.19/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.45 % Memory : 8046.5625MB
% 0.19/0.45 % OS : Linux 6.8.0-71-generic
% 0.19/0.45 % CPULimit : 300
% 0.19/0.45 % WCLimit : 300
% 0.19/0.45 % DateTime : Sun Sep 27 15:31:25 UTC 2026
% 0.19/0.46 % CPUTime :
% 0.19/0.46 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.25/0.51 Running first-order model finding
% 0.25/0.51 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
% 4.92/1.29 % (3106808)Will run a generic schedule for satisfiability detection.
% 4.92/1.29 % (3106815)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3690862734:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 4.92/1.29 % (3106814)% WARNING: option uhcvi not known.
% 4.92/1.29 % (3106814)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=700034505:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 4.92/1.29 % (3106816)dis+10_1_sil=32000:sp=arity:random_seed=3408197187:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 4.92/1.29 % (3106818)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3518353159:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 4.92/1.29 % (3106813)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3237445548_2999 on theBenchmark for (2999ds/0Mi)
% 4.92/1.29 % (3106817)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=285110733:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 4.92/1.29 % (3106819)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=249635230:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 4.92/1.29 % TRYING [1]
% 4.92/1.29 % TRYING [2]
% 4.92/1.29 % TRYING [3]
% 4.92/1.29 % TRYING [4]
% 4.92/1.29 % (3106817)Instruction limit reached!
% 4.92/1.29 % (3106817)------------------------------
% 4.92/1.29 % (3106817)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.92/1.29 % (3106817)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.92/1.29 % (3106817)CaDiCaL version: 2.1.3
% 4.92/1.29 % (3106817)Termination reason: Instruction limit
% 4.92/1.29 % (3106817)Termination phase: Saturation
% 4.92/1.29 % (3106817)Time elapsed: 0.090 s
% 4.92/1.29 % (3106817)Peak memory usage: 11 MB
% 4.92/1.29 % (3106817)Instructions burned: 117 (million)
% 4.92/1.29 % (3106816)Instruction limit reached!
% 4.92/1.29 % (3106816)------------------------------
% 4.92/1.29 % (3106816)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.92/1.29 % (3106816)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.92/1.29 % (3106816)CaDiCaL version: 2.1.3
% 4.92/1.29 % (3106816)Termination reason: Instruction limit
% 4.92/1.29 % (3106816)Termination phase: Saturation
% 4.92/1.29 % (3106816)Time elapsed: 0.098 s
% 4.92/1.29 % (3106816)Peak memory usage: 12 MB
% 4.92/1.29 % (3106816)Instructions burned: 103 (million)
% 4.92/1.29 % (3106818)Instruction limit reached!
% 4.92/1.29 % (3106818)------------------------------
% 4.92/1.29 % (3106818)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.92/1.29 % (3106818)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.92/1.29 % (3106818)CaDiCaL version: 2.1.3
% 4.92/1.29 % (3106818)Termination reason: Instruction limit
% 4.92/1.29 % (3106818)Termination phase: Saturation
% 4.92/1.29 % (3106818)Time elapsed: 0.130 s
% 4.92/1.29 % (3106818)Peak memory usage: 13 MB
% 4.92/1.29 % (3106818)Instructions burned: 131 (million)
% 4.92/1.29 % (3106827)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2007354645:i=714:nm=2_2998 on theBenchmark for (2998ds/714Mi)
% 4.92/1.29 % TRYING [1]
% 4.92/1.29 % TRYING [2]
% 4.92/1.29 % TRYING [3]
% 4.92/1.29 % (3106828)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=264094869:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 4.92/1.29 % (3106819)Instruction limit reached!
% 4.92/1.29 % (3106819)------------------------------
% 4.92/1.29 % (3106819)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.92/1.29 % (3106819)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.92/1.29 % (3106819)CaDiCaL version: 2.1.3
% 4.92/1.29 % (3106819)Termination reason: Instruction limit
% 4.92/1.29 % (3106819)Termination phase: Saturation
% 4.92/1.29 % (3106819)Time elapsed: 0.163 s
% 4.92/1.29 % (3106819)Peak memory usage: 13 MB
% 4.92/1.29 % (3106819)Instructions burned: 159 (million)
% 4.92/1.29 % TRYING [4]
% 4.92/1.29 % (3106829)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=3289750458:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 4.92/1.29 % (3106832)ott-21_1_sil=16000:fs=off:random_seed=1321786858:i=180:av=off:fsr=off_2997 on theBenchmark for (2997ds/180Mi)
% 4.92/1.29 % (3106828)Instruction limit reached!
% 4.92/1.29 % (3106828)------------------------------
% 4.92/1.29 % (3106828)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.92/1.29 % (3106828)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.92/1.29 % (3106828)CaDiCaL version: 2.1.3
% 4.92/1.29 % (3106828)Termination reason: Instruction limit
% 4.92/1.29 % (3106828)Termination phase: Saturation
% 4.92/1.29 % (3106828)Time elapsed: 0.124 s
% 4.92/1.29 % (3106828)Peak memory usage: 12 MB
% 4.92/1.29 % (3106828)Instructions burned: 132 (million)
% 4.92/1.29 % (3106835)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=2293905143:i=477:bd=all_2996 on theBenchmark for (2996ds/477Mi)
% 4.92/1.29 % TRYING [5]
% 4.92/1.29 % (3106832)Instruction limit reached!
% 4.92/1.29 % (3106832)------------------------------
% 4.92/1.29 % (3106832)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.92/1.29 % (3106832)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.92/1.29 % (3106832)CaDiCaL version: 2.1.3
% 4.92/1.29 % (3106832)Termination reason: Instruction limit
% 4.92/1.29 % (3106832)Termination phase: Saturation
% 4.92/1.29 % (3106832)Time elapsed: 0.158 s
% 4.92/1.29 % (3106832)Peak memory usage: 12 MB
% 4.92/1.29 % (3106832)Instructions burned: 180 (million)
% 4.92/1.29 % (3106845)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=174782963:fmbsr=1.3:i=865:ins=25_2995 on theBenchmark for (2995ds/865Mi)
% 4.92/1.29 % TRYING [1]
% 4.92/1.29 % TRYING [2]
% 4.92/1.29 % TRYING [3]
% 4.92/1.29 % TRYING [4]
% 4.92/1.29 % TRYING [5]
% 4.92/1.29 % TRYING [5]
% 4.92/1.29 % (3106829) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3106808-3106829"...
% 4.92/1.29 % (3106829)...printing done.
% 4.92/1.29 % (3106829)Refutation found. Thanks to Tanya!
% 4.92/1.29 % SZS status Unsatisfiable for theBenchmark
% 4.92/1.29 % SZS output start Proof for theBenchmark
% See solution above
% 4.92/1.29 % (3106829)------------------------------
% 4.92/1.29 % (3106829)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.92/1.29 % (3106829)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.92/1.29 % (3106829)CaDiCaL version: 2.1.3
% 4.92/1.29 % (3106829)Termination reason: Refutation
% 4.92/1.29 % (3106829)Time elapsed: 0.534 s
% 4.92/1.29 % (3106829)Peak memory usage: 16 MB
% 4.92/1.29 % (3106829)Instructions burned: 576 (million)
% 4.92/1.29 % (3106808)Success in time 0.763 s
% 4.92/1.29 % Vampire exiting
%------------------------------------------------------------------------------