%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC048+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 : n003.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:04:26 PM UTC 2026
% Result : Theorem 0.10s 0.46s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 15
% Syntax : Number of formulae : 109 ( 20 unt; 10 def)
% Number of atoms : 343 ( 63 equ)
% Maximal formula atoms : 17 ( 3 avg)
% Number of connectives : 399 ( 165 ~; 163 |; 45 &)
% ( 14 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 15 ( 13 usr; 11 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 48 ( 0 sgn 38 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f49,axiom,
! [X0] :
( ssList(X0)
=> rearsegP(X0,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax49) ).
fof(f52,axiom,
! [X0] :
( ssList(X0)
=> ( rearsegP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax52) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ( ( nil != X1
| nil = X0 )
& ( ~ neq(X1,nil)
| ? [X4] :
( ssList(X4)
& neq(X4,nil)
& rearsegP(X1,X4)
& rearsegP(X0,X4) ) ) )
| ( ( nil != X3
| nil != X2 )
& ( ~ neq(X2,nil)
| ~ rearsegP(X3,X2) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ( ( nil != X1
| nil = X0 )
& ( ~ neq(X1,nil)
| ? [X4] :
( ssList(X4)
& neq(X4,nil)
& rearsegP(X1,X4)
& rearsegP(X0,X4) ) ) )
| ( ( nil != X3
| nil != X2 )
& ( ~ neq(X2,nil)
| ~ rearsegP(X3,X2) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f118,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f163,plain,
! [X0] :
( rearsegP(X0,X0)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f49]) ).
fof(f167,plain,
! [X0] :
( ( rearsegP(nil,X0)
<=> nil = X0 )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f52]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ( ( nil = X1
& nil != X0 )
| ( neq(X1,nil)
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ rearsegP(X1,X4)
| ~ rearsegP(X0,X4) ) ) )
& ( ( nil = X3
& nil = X2 )
| ( neq(X2,nil)
& rearsegP(X3,X2) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ( ( nil = X1
& nil != X0 )
| ( neq(X1,nil)
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ rearsegP(X1,X4)
| ~ rearsegP(X0,X4) ) ) )
& ( ( nil = X3
& nil = X2 )
| ( neq(X2,nil)
& rearsegP(X3,X2) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f273,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f118]) ).
fof(f284,plain,
! [X0] :
( ( ( rearsegP(nil,X0)
| nil != X0 )
& ( nil = X0
| ~ rearsegP(nil,X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f167]) ).
fof(f296,plain,
( sK54 = sK56
& sK53 = sK55
& ( ( nil = sK54
& nil != sK53 )
| ( neq(sK54,nil)
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ rearsegP(sK54,X4)
| ~ rearsegP(sK53,X4) ) ) )
& ( ( nil = sK56
& nil = sK55 )
| ( neq(sK55,nil)
& rearsegP(sK56,sK55) ) )
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56]),skolemize(X0,sK53),skolemize(X1,sK54),skolemize(X2,sK55),skolemize(X3,sK56)],[f222]) ).
fof(f386,plain,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f273]) ).
fof(f389,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f433,plain,
! [X0] :
( rearsegP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f163]) ).
fof(f436,plain,
! [X0] :
( ~ rearsegP(nil,X0)
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f284]) ).
fof(f437,plain,
! [X0] :
( rearsegP(nil,X0)
| nil != X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f284]) ).
fof(f496,plain,
ssList(sK53),
inference(cnf_transformation,[],[f296]) ).
fof(f500,plain,
( nil = sK55
| rearsegP(sK56,sK55) ),
inference(cnf_transformation,[],[f296]) ).
fof(f501,plain,
( nil = sK55
| neq(sK55,nil) ),
inference(cnf_transformation,[],[f296]) ).
fof(f502,plain,
( nil = sK56
| rearsegP(sK56,sK55) ),
inference(cnf_transformation,[],[f296]) ).
fof(f503,plain,
( nil = sK56
| neq(sK55,nil) ),
inference(cnf_transformation,[],[f296]) ).
fof(f504,plain,
! [X4] :
( nil != sK53
| ~ ssList(X4)
| ~ neq(X4,nil)
| ~ rearsegP(sK54,X4)
| ~ rearsegP(sK53,X4) ),
inference(cnf_transformation,[],[f296]) ).
fof(f505,plain,
( nil != sK53
| neq(sK54,nil) ),
inference(cnf_transformation,[],[f296]) ).
fof(f506,plain,
! [X4] :
( nil = sK54
| ~ ssList(X4)
| ~ neq(X4,nil)
| ~ rearsegP(sK54,X4)
| ~ rearsegP(sK53,X4) ),
inference(cnf_transformation,[],[f296]) ).
fof(f508,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f296]) ).
fof(f509,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f296]) ).
fof(f511,plain,
! [X4] :
( nil = sK56
| ~ ssList(X4)
| ~ neq(X4,nil)
| ~ rearsegP(sK56,X4)
| ~ rearsegP(sK55,X4) ),
inference(definition_unfolding,[],[f506,f509,f509,f508]) ).
fof(f512,plain,
( nil != sK55
| neq(sK56,nil) ),
inference(definition_unfolding,[],[f505,f508,f509]) ).
fof(f513,plain,
! [X4] :
( nil != sK55
| ~ ssList(X4)
| ~ neq(X4,nil)
| ~ rearsegP(sK56,X4)
| ~ rearsegP(sK55,X4) ),
inference(definition_unfolding,[],[f504,f508,f509,f508]) ).
fof(f515,plain,
ssList(sK55),
inference(definition_unfolding,[],[f496,f508]) ).
fof(f530,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f386]) ).
fof(f534,plain,
( rearsegP(nil,nil)
| ~ ssList(nil) ),
inference(equality_resolution,[],[f437]) ).
fof(f607,plain,
! [X1] :
( neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(consistent_polarity_flipping,[],[f530]) ).
fof(f677,plain,
! [X4] :
( nil = sK56
| ~ ssList(X4)
| neq(X4,nil)
| ~ rearsegP(sK56,X4)
| ~ rearsegP(sK55,X4) ),
inference(consistent_polarity_flipping,[],[f511]) ).
fof(f678,plain,
( nil != sK55
| ~ neq(sK56,nil) ),
inference(consistent_polarity_flipping,[],[f512]) ).
fof(f679,plain,
! [X4] :
( nil != sK55
| ~ ssList(X4)
| neq(X4,nil)
| ~ rearsegP(sK56,X4)
| ~ rearsegP(sK55,X4) ),
inference(consistent_polarity_flipping,[],[f513]) ).
fof(f680,plain,
( nil = sK56
| ~ neq(sK55,nil) ),
inference(consistent_polarity_flipping,[],[f503]) ).
fof(f681,plain,
( nil = sK55
| ~ neq(sK55,nil) ),
inference(consistent_polarity_flipping,[],[f501]) ).
fof(f686,plain,
! [X1] :
( neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f607]) ).
fof(f690,definition,
( spl57_1
<=> rearsegP(sK56,sK55) ),
introduced(definition,[new_symbols(definition,[spl57_1])],[avatar_definition]) ).
fof(f691,plain,
( ~ rearsegP(sK56,sK55)
| spl57_1 ),
inference(avatar_component_clause,[],[f690]) ).
fof(f692,plain,
( rearsegP(sK56,sK55)
| ~ spl57_1 ),
inference(avatar_component_clause,[],[f690]) ).
fof(f694,definition,
( spl57_2
<=> nil = sK55 ),
introduced(definition,[new_symbols(definition,[spl57_2])],[avatar_definition]) ).
fof(f696,plain,
( nil = sK55
| ~ spl57_2 ),
inference(avatar_component_clause,[],[f694]) ).
fof(f697,plain,
( spl57_1
| spl57_2 ),
inference(avatar_split_clause,[],[f500,f694,f690]) ).
fof(f699,definition,
( spl57_3
<=> neq(sK55,nil) ),
introduced(definition,[new_symbols(definition,[spl57_3])],[avatar_definition]) ).
fof(f702,plain,
( ~ spl57_3
| spl57_2 ),
inference(avatar_split_clause,[],[f681,f694,f699]) ).
fof(f704,definition,
( spl57_4
<=> nil = sK56 ),
introduced(definition,[new_symbols(definition,[spl57_4])],[avatar_definition]) ).
fof(f706,plain,
( nil = sK56
| ~ spl57_4 ),
inference(avatar_component_clause,[],[f704]) ).
fof(f707,plain,
( spl57_1
| spl57_4 ),
inference(avatar_split_clause,[],[f502,f704,f690]) ).
fof(f708,plain,
( ~ spl57_3
| spl57_4 ),
inference(avatar_split_clause,[],[f680,f704,f699]) ).
fof(f710,definition,
( spl57_5
<=> ! [X4] :
( ~ ssList(X4)
| ~ rearsegP(sK55,X4)
| ~ rearsegP(sK56,X4)
| neq(X4,nil) ) ),
introduced(definition,[new_symbols(definition,[spl57_5])],[avatar_definition]) ).
fof(f711,plain,
( ! [X4] :
( ~ rearsegP(sK56,X4)
| ~ rearsegP(sK55,X4)
| ~ ssList(X4)
| neq(X4,nil) )
| ~ spl57_5 ),
inference(avatar_component_clause,[],[f710]) ).
fof(f712,plain,
( spl57_5
| ~ spl57_2 ),
inference(avatar_split_clause,[],[f679,f694,f710]) ).
fof(f714,definition,
( spl57_6
<=> neq(sK56,nil) ),
introduced(definition,[new_symbols(definition,[spl57_6])],[avatar_definition]) ).
fof(f716,plain,
( ~ neq(sK56,nil)
| spl57_6 ),
inference(avatar_component_clause,[],[f714]) ).
fof(f717,plain,
( ~ spl57_6
| ~ spl57_2 ),
inference(avatar_split_clause,[],[f678,f694,f714]) ).
fof(f718,plain,
( spl57_5
| spl57_4 ),
inference(avatar_split_clause,[],[f677,f704,f710]) ).
fof(f721,definition,
( spl57_7
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl57_7])],[avatar_definition]) ).
fof(f740,definition,
( spl57_11
<=> rearsegP(nil,nil) ),
introduced(definition,[new_symbols(definition,[spl57_11])],[avatar_definition]) ).
fof(f743,plain,
( ~ spl57_7
| spl57_11 ),
inference(avatar_split_clause,[],[f534,f740,f721]) ).
fof(f749,plain,
spl57_7,
inference(avatar_split_clause,[],[f389,f721]) ).
fof(f750,plain,
( ~ rearsegP(sK56,nil)
| spl57_1
| ~ spl57_2 ),
inference(superposition,[],[f691,f696]) ).
fof(f755,plain,
( ~ neq(nil,nil)
| ~ spl57_4
| spl57_6 ),
inference(superposition,[],[f716,f706]) ).
fof(f756,plain,
( ~ rearsegP(nil,nil)
| spl57_1
| ~ spl57_2
| ~ spl57_4 ),
inference(superposition,[],[f750,f706]) ).
fof(f757,plain,
( ~ spl57_11
| spl57_1
| ~ spl57_2
| ~ spl57_4 ),
inference(avatar_split_clause,[],[f756,f704,f694,f690,f740]) ).
fof(f758,plain,
( rearsegP(nil,sK55)
| ~ spl57_1
| ~ spl57_4 ),
inference(superposition,[],[f692,f706]) ).
fof(f762,plain,
( ~ rearsegP(sK55,sK55)
| ~ ssList(sK55)
| neq(sK55,nil)
| ~ spl57_1
| ~ spl57_5 ),
inference(resolution,[],[f711,f692]) ).
fof(f766,definition,
( spl57_13
<=> ssList(sK55) ),
introduced(definition,[new_symbols(definition,[spl57_13])],[avatar_definition]) ).
fof(f768,plain,
( ~ ssList(sK55)
| spl57_13 ),
inference(avatar_component_clause,[],[f766]) ).
fof(f770,definition,
( spl57_14
<=> rearsegP(sK55,sK55) ),
introduced(definition,[new_symbols(definition,[spl57_14])],[avatar_definition]) ).
fof(f772,plain,
( ~ rearsegP(sK55,sK55)
| spl57_14 ),
inference(avatar_component_clause,[],[f770]) ).
fof(f774,plain,
( $false
| spl57_13 ),
inference(resolution,[],[f768,f515]) ).
fof(f776,plain,
spl57_13,
inference(avatar_contradiction_clause,[],[f774]) ).
fof(f790,plain,
( ~ ssList(nil)
| ~ spl57_4
| spl57_6 ),
inference(resolution,[],[f686,f755]) ).
fof(f791,plain,
( ~ spl57_7
| ~ spl57_4
| spl57_6 ),
inference(avatar_split_clause,[],[f790,f714,f704,f721]) ).
fof(f873,plain,
( nil = sK55
| ~ ssList(sK55)
| ~ spl57_1
| ~ spl57_4 ),
inference(resolution,[],[f436,f758]) ).
fof(f879,plain,
( ~ spl57_13
| spl57_2
| ~ spl57_1
| ~ spl57_4 ),
inference(avatar_split_clause,[],[f873,f704,f690,f694,f766]) ).
fof(f880,plain,
( spl57_3
| ~ spl57_13
| ~ spl57_14
| ~ spl57_1
| ~ spl57_5 ),
inference(avatar_split_clause,[],[f762,f710,f690,f770,f766,f699]) ).
fof(f881,plain,
( ~ ssList(sK55)
| spl57_14 ),
inference(resolution,[],[f772,f433]) ).
fof(f882,plain,
( ~ spl57_13
| spl57_14 ),
inference(avatar_split_clause,[],[f881,f770,f766]) ).
cnf(s1,plain,
( spl57_1
| spl57_2 ),
inference(sat_conversion,[],[f697]) ).
cnf(s2,plain,
( spl57_2
| ~ spl57_3 ),
inference(sat_conversion,[],[f702]) ).
cnf(s3,plain,
( spl57_1
| spl57_4 ),
inference(sat_conversion,[],[f707]) ).
cnf(s4,plain,
( ~ spl57_3
| spl57_4 ),
inference(sat_conversion,[],[f708]) ).
cnf(s5,plain,
( ~ spl57_2
| spl57_5 ),
inference(sat_conversion,[],[f712]) ).
cnf(s6,plain,
( ~ spl57_2
| ~ spl57_6 ),
inference(sat_conversion,[],[f717]) ).
cnf(s7,plain,
( spl57_4
| spl57_5 ),
inference(sat_conversion,[],[f718]) ).
cnf(s14,plain,
( ~ spl57_7
| spl57_11 ),
inference(sat_conversion,[],[f743]) ).
cnf(s16,plain,
spl57_7,
inference(sat_conversion,[],[f749]) ).
cnf(s17,plain,
( spl57_1
| ~ spl57_2
| ~ spl57_4
| ~ spl57_11 ),
inference(sat_conversion,[],[f757]) ).
cnf(s19,plain,
spl57_13,
inference(sat_conversion,[],[f776]) ).
cnf(s23,plain,
( ~ spl57_4
| spl57_6
| ~ spl57_7 ),
inference(sat_conversion,[],[f791]) ).
cnf(s24,plain,
( ~ spl57_1
| spl57_2
| ~ spl57_4
| ~ spl57_13 ),
inference(sat_conversion,[],[f879]) ).
cnf(s25,plain,
( ~ spl57_1
| spl57_3
| ~ spl57_5
| ~ spl57_13
| ~ spl57_14 ),
inference(sat_conversion,[],[f880]) ).
cnf(s26,plain,
( ~ spl57_13
| spl57_14 ),
inference(sat_conversion,[],[f882]) ).
cnf(s27,plain,
spl57_14,
inference(rat,[],[s26,s19]) ).
cnf(s30,plain,
spl57_11,
inference(rat,[],[s14,s16]) ).
cnf(s32,plain,
spl57_1,
inference(rat,[],[s17,s1,s3,s30]) ).
cnf(s33,plain,
spl57_2,
inference(rat,[],[s25,s7,s2,s24,s32,s19,s27]) ).
cnf(s34,plain,
~ spl57_6,
inference(rat,[],[s6,s33]) ).
cnf(s35,plain,
spl57_5,
inference(rat,[],[s5,s33]) ).
cnf(s36,plain,
~ spl57_4,
inference(rat,[],[s23,s16,s34]) ).
cnf(s37,plain,
spl57_3,
inference(rat,[],[s25,s27,s19,s32,s35]) ).
cnf(s38,plain,
$false,
inference(rat,[],[s4,s36,s37]) ).
fof(f883,plain,
$false,
inference(avatar_sat_refutation,[],[s38]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC048+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.35 % Computer : n003.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Mon Sep 28 07:38:27 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.39 Running first-order model finding
% 0.10/0.39 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.10/0.46 % (1410719)Will run a generic schedule for satisfiability detection.
% 0.10/0.46 % (1410730)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3370663400:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.10/0.46 % (1410726)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=450440791:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.10/0.46 % (1410727)dis+10_1_sil=32000:sp=arity:random_seed=1545102981:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.10/0.46 % (1410725)% WARNING: option uhcvi not known.
% 0.10/0.46 % (1410724)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3127393915_2999 on theBenchmark for (2999ds/0Mi)
% 0.10/0.46 % (1410729)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1646380628:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.10/0.46 % (1410730) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1410719-1410730"...
% 0.10/0.46 % (1410728)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1163789768:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.10/0.46 % (1410730)...printing done.
% 0.10/0.46 % (1410725)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=917090304:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.10/0.46 % (1410730)Refutation found. Thanks to Tanya!
% 0.10/0.46 % SZS status Theorem for theBenchmark
% 0.10/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.47 % (1410730)------------------------------
% 0.10/0.47 % (1410730)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.47 % (1410730)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.47 % (1410730)CaDiCaL version: 2.1.3
% 0.10/0.47 % (1410730)Termination reason: Refutation
% 0.10/0.47 % (1410730)Time elapsed: 0.008 s
% 0.10/0.47 % (1410730)Peak memory usage: 12 MB
% 0.10/0.47 % (1410730)Instructions burned: 21 (million)
% 0.10/0.47 % (1410719)Success in time 0.06 s
% 0.10/0.47 % Vampire exiting
%------------------------------------------------------------------------------