%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC182+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n012.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 01:05:00 PM UTC 2026
% Result : Theorem 0.06s 0.37s
% Output : Refutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 14
% Syntax : Number of formulae : 104 ( 21 unt; 8 def)
% Number of atoms : 301 ( 69 equ)
% Maximal formula atoms : 13 ( 2 avg)
% Number of connectives : 331 ( 134 ~; 125 |; 41 &)
% ( 10 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 9 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 60 ( 0 sgn 46 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f16,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ssList(cons(X1,X0)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(f38,axiom,
! [X0] :
( ssItem(X0)
=> ~ memberP(nil,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax38) ).
fof(f83,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( nil = app(X0,X1)
<=> ( nil = X1
& nil = X0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax83) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( nil != X2
| X1 != X3
| X0 != X2
| ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(app(X5,cons(X4,nil)),X6) != X0
| ( ~ memberP(X5,X4)
& ~ memberP(X6,X4) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( nil != X2
| X1 != X3
| X0 != X2
| ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(app(X5,cons(X4,nil)),X6) != X0
| ( ~ memberP(X5,X4)
& ~ memberP(X6,X4) ) ) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f119,plain,
! [X0] :
( ! [X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f132,plain,
! [X0] :
( ! [X1] :
( ssList(app(X0,X1))
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f148,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f38]) ).
fof(f200,plain,
! [X0] :
( ! [X1] :
( ( nil = app(X0,X1)
<=> ( nil = X1
& nil = X0 ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f83]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( nil = X2
& X1 = X3
& X0 = X2
& ? [X4] :
( ? [X5] :
( ? [X6] :
( app(app(X5,cons(X4,nil)),X6) = X0
& ( memberP(X5,X4)
| memberP(X6,X4) )
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( nil = X2
& X1 = X3
& X0 = X2
& ? [X4] :
( ? [X5] :
( ? [X6] :
( app(app(X5,cons(X4,nil)),X6) = X0
& ( memberP(X5,X4)
| memberP(X6,X4) )
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f292,plain,
! [X0] :
( ! [X1] :
( ( ( nil = app(X0,X1)
| nil != X1
| nil != X0 )
& ( ( nil = X1
& nil = X0 )
| nil != app(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f200]) ).
fof(f293,plain,
! [X0] :
( ! [X1] :
( ( ( nil = app(X0,X1)
| nil != X1
| nil != X0 )
& ( ( nil = X1
& nil = X0 )
| nil != app(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(flattening,[],[f292]) ).
fof(f296,plain,
( nil = sK55
& sK54 = sK56
& sK53 = sK55
& sK53 = app(app(sK58,cons(sK57,nil)),sK59)
& ( memberP(sK58,sK57)
| memberP(sK59,sK57) )
& ssList(sK59)
& ssList(sK58)
& ssItem(sK57)
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56,sK57,sK58,sK59]),skolemize(X0,sK53),skolemize(X1,sK54),skolemize(X2,sK55),skolemize(X3,sK56),skolemize(X4,sK57),skolemize(X5,sK58),skolemize(X6,sK59)],[f222]) ).
fof(f388,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f119]) ).
fof(f389,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f401,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f132]) ).
fof(f419,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f148]) ).
fof(f479,plain,
! [X0,X1] :
( nil = X0
| nil != app(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f293]) ).
fof(f480,plain,
! [X0,X1] :
( nil = X1
| nil != app(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f293]) ).
fof(f500,plain,
ssItem(sK57),
inference(cnf_transformation,[],[f296]) ).
fof(f501,plain,
ssList(sK58),
inference(cnf_transformation,[],[f296]) ).
fof(f502,plain,
ssList(sK59),
inference(cnf_transformation,[],[f296]) ).
fof(f503,plain,
( memberP(sK58,sK57)
| memberP(sK59,sK57) ),
inference(cnf_transformation,[],[f296]) ).
fof(f504,plain,
sK53 = app(app(sK58,cons(sK57,nil)),sK59),
inference(cnf_transformation,[],[f296]) ).
fof(f505,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f296]) ).
fof(f507,plain,
nil = sK55,
inference(cnf_transformation,[],[f296]) ).
fof(f510,plain,
ssList(sK55),
inference(definition_unfolding,[],[f389,f507]) ).
fof(f518,plain,
! [X0] :
( ~ memberP(sK55,X0)
| ~ ssItem(X0) ),
inference(definition_unfolding,[],[f419,f507]) ).
fof(f561,plain,
! [X0,X1] :
( app(X0,X1) != sK55
| sK55 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f480,f507,f507]) ).
fof(f562,plain,
! [X0,X1] :
( app(X0,X1) != sK55
| sK55 = X0
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f479,f507,f507]) ).
fof(f566,plain,
sK55 = app(app(sK58,cons(sK57,sK55)),sK59),
inference(definition_unfolding,[],[f504,f505,f507]) ).
fof(f604,definition,
( spl60_1
<=> memberP(sK59,sK57) ),
introduced(definition,[new_symbols(definition,[spl60_1])],[avatar_definition]) ).
fof(f606,plain,
( memberP(sK59,sK57)
| ~ spl60_1 ),
inference(avatar_component_clause,[],[f604]) ).
fof(f608,definition,
( spl60_2
<=> memberP(sK58,sK57) ),
introduced(definition,[new_symbols(definition,[spl60_2])],[avatar_definition]) ).
fof(f610,plain,
( memberP(sK58,sK57)
| ~ spl60_2 ),
inference(avatar_component_clause,[],[f608]) ).
fof(f611,plain,
( spl60_1
| spl60_2 ),
inference(avatar_split_clause,[],[f503,f608,f604]) ).
fof(f613,definition,
( spl60_3
<=> ssList(sK55) ),
introduced(definition,[new_symbols(definition,[spl60_3])],[avatar_definition]) ).
fof(f614,plain,
( ssList(sK55)
| ~ spl60_3 ),
inference(avatar_component_clause,[],[f613]) ).
fof(f646,plain,
spl60_3,
inference(avatar_split_clause,[],[f510,f613]) ).
fof(f682,definition,
( spl60_11
<=> sK55 = sK59 ),
introduced(definition,[new_symbols(definition,[spl60_11])],[avatar_definition]) ).
fof(f684,plain,
( sK55 = sK59
| ~ spl60_11 ),
inference(avatar_component_clause,[],[f682]) ).
fof(f691,definition,
( spl60_13
<=> sK55 = sK58 ),
introduced(definition,[new_symbols(definition,[spl60_13])],[avatar_definition]) ).
fof(f692,plain,
( sK55 != sK58
| spl60_13 ),
inference(avatar_component_clause,[],[f691]) ).
fof(f693,plain,
( sK55 = sK58
| ~ spl60_13 ),
inference(avatar_component_clause,[],[f691]) ).
fof(f733,plain,
( memberP(sK55,sK57)
| ~ spl60_2
| ~ spl60_13 ),
inference(superposition,[],[f610,f693]) ).
fof(f758,plain,
( ~ ssItem(sK57)
| ~ spl60_2
| ~ spl60_13 ),
inference(resolution,[],[f733,f518]) ).
fof(f759,plain,
( $false
| ~ spl60_2
| ~ spl60_13 ),
inference(forward_subsumption_resolution,[],[f758,f500]) ).
fof(f760,plain,
( ~ spl60_2
| ~ spl60_13 ),
inference(avatar_contradiction_clause,[],[f759]) ).
fof(f771,plain,
( memberP(sK55,sK57)
| ~ spl60_1
| ~ spl60_11 ),
inference(forward_demodulation,[],[f606,f684]) ).
fof(f772,plain,
( ~ ssItem(sK57)
| ~ spl60_1
| ~ spl60_11 ),
inference(resolution,[],[f771,f518]) ).
fof(f773,plain,
( $false
| ~ spl60_1
| ~ spl60_11 ),
inference(forward_subsumption_resolution,[],[f772,f500]) ).
fof(f774,plain,
( ~ spl60_1
| ~ spl60_11 ),
inference(avatar_contradiction_clause,[],[f773]) ).
fof(f776,plain,
( sK55 != sK55
| sK55 = sK59
| ~ ssList(sK59)
| ~ ssList(app(sK58,cons(sK57,sK55))) ),
inference(superposition,[],[f561,f566]) ).
fof(f780,plain,
( sK55 = sK59
| ~ ssList(sK59)
| ~ ssList(app(sK58,cons(sK57,sK55))) ),
inference(trivial_inequality_removal,[],[f776]) ).
fof(f781,plain,
( sK55 != sK55
| sK55 = app(sK58,cons(sK57,sK55))
| ~ ssList(sK59)
| ~ ssList(app(sK58,cons(sK57,sK55))) ),
inference(superposition,[],[f562,f566]) ).
fof(f785,plain,
( sK55 = app(sK58,cons(sK57,sK55))
| ~ ssList(sK59)
| ~ ssList(app(sK58,cons(sK57,sK55))) ),
inference(trivial_inequality_removal,[],[f781]) ).
fof(f786,plain,
( sK55 = app(sK58,cons(sK57,sK55))
| ~ ssList(app(sK58,cons(sK57,sK55))) ),
inference(forward_subsumption_resolution,[],[f785,f502]) ).
fof(f788,definition,
( spl60_22
<=> ssList(app(sK58,cons(sK57,sK55))) ),
introduced(definition,[new_symbols(definition,[spl60_22])],[avatar_definition]) ).
fof(f789,plain,
( ssList(app(sK58,cons(sK57,sK55)))
| ~ spl60_22 ),
inference(avatar_component_clause,[],[f788]) ).
fof(f790,plain,
( ~ ssList(app(sK58,cons(sK57,sK55)))
| spl60_22 ),
inference(avatar_component_clause,[],[f788]) ).
fof(f792,definition,
( spl60_23
<=> sK55 = app(sK58,cons(sK57,sK55)) ),
introduced(definition,[new_symbols(definition,[spl60_23])],[avatar_definition]) ).
fof(f794,plain,
( sK55 = app(sK58,cons(sK57,sK55))
| ~ spl60_23 ),
inference(avatar_component_clause,[],[f792]) ).
fof(f795,plain,
( ~ spl60_22
| spl60_23 ),
inference(avatar_split_clause,[],[f786,f792,f788]) ).
fof(f1398,plain,
( ~ ssList(cons(sK57,sK55))
| ~ ssList(sK58)
| spl60_22 ),
inference(resolution,[],[f401,f790]) ).
fof(f1422,plain,
( ~ ssList(cons(sK57,sK55))
| spl60_22 ),
inference(forward_subsumption_resolution,[],[f1398,f501]) ).
fof(f1423,plain,
( ~ ssItem(sK57)
| ~ ssList(sK55)
| spl60_22 ),
inference(resolution,[],[f1422,f388]) ).
fof(f1424,plain,
( ~ ssList(sK55)
| spl60_22 ),
inference(forward_subsumption_resolution,[],[f1423,f500]) ).
fof(f1425,plain,
( $false
| ~ spl60_3
| spl60_22 ),
inference(forward_subsumption_resolution,[],[f1424,f614]) ).
fof(f1426,plain,
( ~ spl60_3
| spl60_22 ),
inference(avatar_contradiction_clause,[],[f1425]) ).
fof(f1542,plain,
( sK55 = sK59
| ~ ssList(app(sK58,cons(sK57,sK55))) ),
inference(forward_subsumption_resolution,[],[f780,f502]) ).
fof(f1552,plain,
( sK55 = sK59
| ~ spl60_22 ),
inference(forward_subsumption_resolution,[],[f1542,f789]) ).
fof(f1553,plain,
( spl60_11
| ~ spl60_22 ),
inference(avatar_split_clause,[],[f1552,f788,f682]) ).
fof(f2598,plain,
( sK55 != sK55
| sK55 = sK58
| ~ ssList(cons(sK57,sK55))
| ~ ssList(sK58)
| ~ spl60_23 ),
inference(superposition,[],[f562,f794]) ).
fof(f2601,plain,
( sK55 = sK58
| ~ ssList(cons(sK57,sK55))
| ~ ssList(sK58)
| ~ spl60_23 ),
inference(trivial_inequality_removal,[],[f2598]) ).
fof(f2605,plain,
( ~ ssList(cons(sK57,sK55))
| ~ ssList(sK58)
| spl60_13
| ~ spl60_23 ),
inference(forward_subsumption_resolution,[],[f2601,f692]) ).
fof(f2629,definition,
( spl60_102
<=> ssList(cons(sK57,sK55)) ),
introduced(definition,[new_symbols(definition,[spl60_102])],[avatar_definition]) ).
fof(f2631,plain,
( ~ ssList(cons(sK57,sK55))
| spl60_102 ),
inference(avatar_component_clause,[],[f2629]) ).
fof(f2642,plain,
( ~ ssList(cons(sK57,sK55))
| spl60_13
| ~ spl60_23 ),
inference(forward_subsumption_resolution,[],[f2605,f501]) ).
fof(f2668,plain,
( ~ spl60_102
| spl60_13
| ~ spl60_23 ),
inference(avatar_split_clause,[],[f2642,f792,f691,f2629]) ).
fof(f2686,plain,
( ~ ssItem(sK57)
| ~ ssList(sK55)
| spl60_102 ),
inference(resolution,[],[f2631,f388]) ).
fof(f2687,plain,
( ~ ssList(sK55)
| spl60_102 ),
inference(forward_subsumption_resolution,[],[f2686,f500]) ).
fof(f2688,plain,
( $false
| ~ spl60_3
| spl60_102 ),
inference(forward_subsumption_resolution,[],[f2687,f614]) ).
fof(f2689,plain,
( ~ spl60_3
| spl60_102 ),
inference(avatar_contradiction_clause,[],[f2688]) ).
cnf(s1,plain,
( spl60_1
| spl60_2 ),
inference(sat_conversion,[],[f611]) ).
cnf(s10,plain,
spl60_3,
inference(sat_conversion,[],[f646]) ).
cnf(s20,plain,
( ~ spl60_2
| ~ spl60_13 ),
inference(sat_conversion,[],[f760]) ).
cnf(s23,plain,
( ~ spl60_1
| ~ spl60_11 ),
inference(sat_conversion,[],[f774]) ).
cnf(s24,plain,
( ~ spl60_22
| spl60_23 ),
inference(sat_conversion,[],[f795]) ).
cnf(s56,plain,
( ~ spl60_3
| spl60_22 ),
inference(sat_conversion,[],[f1426]) ).
cnf(s68,plain,
( spl60_11
| ~ spl60_22 ),
inference(sat_conversion,[],[f1553]) ).
cnf(s130,plain,
( spl60_13
| ~ spl60_23
| ~ spl60_102 ),
inference(sat_conversion,[],[f2668]) ).
cnf(s133,plain,
( ~ spl60_3
| spl60_102 ),
inference(sat_conversion,[],[f2689]) ).
cnf(s134,plain,
spl60_102,
inference(rat,[],[s133,s10]) ).
cnf(s135,plain,
spl60_22,
inference(rat,[],[s56,s10]) ).
cnf(s136,plain,
spl60_11,
inference(rat,[],[s68,s135]) ).
cnf(s137,plain,
spl60_23,
inference(rat,[],[s24,s135]) ).
cnf(s144,plain,
~ spl60_1,
inference(rat,[],[s23,s136]) ).
cnf(s147,plain,
spl60_13,
inference(rat,[],[s130,s134,s137]) ).
cnf(s161,plain,
~ spl60_2,
inference(rat,[],[s20,s147]) ).
cnf(s166,plain,
$false,
inference(rat,[],[s1,s161,s144]) ).
fof(f2690,plain,
$false,
inference(avatar_sat_refutation,[],[s166]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SWC182+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.02 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.04/0.30 % Computer : n012.cluster.edu
% 0.04/0.30 % Model : x86_64 x86_64
% 0.04/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.30 % Memory : 8046.5625MB
% 0.04/0.30 % OS : Linux 6.8.0-71-generic
% 0.04/0.30 % CPULimit : 300
% 0.04/0.30 % WCLimit : 300
% 0.04/0.30 % DateTime : Mon Sep 28 08:20:42 UTC 2026
% 0.04/0.30 % CPUTime :
% 0.04/0.30 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.04/0.32 Running first-order model finding
% 0.04/0.32 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
% 0.06/0.37 % (3231451)Will run a generic schedule for satisfiability detection.
% 0.06/0.37 % (3231457)% WARNING: option uhcvi not known.
% 0.06/0.37 % (3231456)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3788986428_2999 on theBenchmark for (2999ds/0Mi)
% 0.06/0.37 % (3231462)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1407409472:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.06/0.37 % (3231458)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3956646470:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.06/0.37 % (3231457)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1715511731:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.06/0.37 % (3231459)dis+10_1_sil=32000:sp=arity:random_seed=1846988395:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.06/0.37 % (3231460)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2633451176:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.06/0.37 % (3231461)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2097919820:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.06/0.37 % TRYING [1]
% 0.06/0.37 % TRYING [2]
% 0.06/0.37 % TRYING [3]
% 0.06/0.37 % TRYING [4]
% 0.06/0.37 % (3231459) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3231451-3231459"...
% 0.06/0.37 % (3231457) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3231451-3231457"...
% 0.06/0.37 % (3231459)...printing done.
% 0.06/0.37 % (3231457)...printing done.
% 0.06/0.37 % (3231459)Refutation found. Thanks to Tanya!
% 0.06/0.37 % SZS status Theorem for theBenchmark
% 0.06/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.06/0.38 % (3231459)------------------------------
% 0.06/0.38 % (3231459)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.06/0.38 % (3231459)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.06/0.38 % (3231459)CaDiCaL version: 2.1.3
% 0.06/0.38 % (3231459)Termination reason: Refutation
% 0.06/0.38 % (3231459)Time elapsed: 0.026 s
% 0.06/0.38 % (3231459)Peak memory usage: 13 MB
% 0.06/0.38 % (3231459)Instructions burned: 77 (million)
% 0.06/0.38 % (3231451)Success in time 0.052 s
% 0.06/0.38 % Vampire exiting
%------------------------------------------------------------------------------