%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC071+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 : 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 01:04:32 PM UTC 2026
% Result : Theorem 0.39s 0.52s
% Output : Refutation 0.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 14
% Syntax : Number of formulae : 87 ( 13 unt; 8 def)
% Number of atoms : 352 ( 68 equ)
% Maximal formula atoms : 25 ( 4 avg)
% Number of connectives : 444 ( 179 ~; 183 |; 48 &)
% ( 10 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 16 ( 14 usr; 9 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 89 ( 0 sgn 69 !; 20 ?)
% 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(f18,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> cons(X1,X0) != X0 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax18) ).
fof(f55,axiom,
! [X0] :
( ssList(X0)
=> segmentP(X0,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax55) ).
fof(f56,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( segmentP(X0,X1)
=> segmentP(app(app(X2,X0),X3),X1) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax56) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ? [X4] :
( ssList(X4)
& neq(X4,nil)
& segmentP(X1,X4)
& segmentP(X0,X4) )
| ( nil = X1
& nil = X0 )
| ( ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ! [X7] :
( ssList(X7)
=> ( cons(X5,nil) != X2
| app(app(X6,X2),X7) != X3
| ? [X8] :
( ssItem(X8)
& memberP(X6,X8)
& lt(X5,X8) )
| ? [X9] :
( ssItem(X9)
& memberP(X7,X9)
& lt(X9,X5) ) ) ) ) )
& ( nil != X3
| nil != 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
| ? [X4] :
( ssList(X4)
& neq(X4,nil)
& segmentP(X1,X4)
& segmentP(X0,X4) )
| ( nil = X1
& nil = X0 )
| ( ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ! [X7] :
( ssList(X7)
=> ( cons(X5,nil) != X2
| app(app(X6,X2),X7) != X3
| ? [X8] :
( ssItem(X8)
& memberP(X6,X8)
& lt(X5,X8) )
| ? [X9] :
( ssItem(X9)
& memberP(X7,X9)
& lt(X9,X5) ) ) ) ) )
& ( nil != X3
| nil != 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(f120,plain,
! [X0] :
( ! [X1] :
( cons(X1,X0) != X0
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f18]) ).
fof(f172,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f55]) ).
fof(f173,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ! [X3] :
( segmentP(app(app(X2,X0),X3),X1)
| ~ segmentP(X0,X1)
| ~ ssList(X3) )
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f56]) ).
fof(f174,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ! [X3] :
( segmentP(app(app(X2,X0),X3),X1)
| ~ segmentP(X0,X1)
| ~ ssList(X3) )
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(flattening,[],[f173]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(X1,X4)
| ~ segmentP(X0,X4) )
& ( nil != X1
| nil != X0 )
& ( ? [X5] :
( ? [X6] :
( ? [X7] :
( cons(X5,nil) = X2
& app(app(X6,X2),X7) = X3
& ! [X8] :
( ~ ssItem(X8)
| ~ memberP(X6,X8)
| ~ lt(X5,X8) )
& ! [X9] :
( ~ ssItem(X9)
| ~ memberP(X7,X9)
| ~ lt(X9,X5) )
& ssList(X7) )
& ssList(X6) )
& ssItem(X5) )
| ( nil = X3
& nil = X2 ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(X1,X4)
| ~ segmentP(X0,X4) )
& ( nil != X1
| nil != X0 )
& ( ? [X5] :
( ? [X6] :
( ? [X7] :
( cons(X5,nil) = X2
& app(app(X6,X2),X7) = X3
& ! [X8] :
( ~ ssItem(X8)
| ~ memberP(X6,X8)
| ~ lt(X5,X8) )
& ! [X9] :
( ~ ssItem(X9)
| ~ memberP(X7,X9)
| ~ lt(X9,X5) )
& ssList(X7) )
& ssList(X6) )
& ssItem(X5) )
| ( nil = X3
& nil = X2 ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f303,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| neq(X0,X1) ),
inference(cnf_transformation,[],[f118]) ).
fof(f306,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f307,plain,
! [X0,X1] :
( cons(X1,X0) != X0
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f120]) ).
fof(f357,plain,
! [X0] :
( ~ ssList(X0)
| segmentP(X0,X0) ),
inference(cnf_transformation,[],[f172]) ).
fof(f358,plain,
! [X2,X3,X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ segmentP(X0,X1)
| segmentP(app(app(X2,X0),X3),X1) ),
inference(cnf_transformation,[],[f174]) ).
fof(f417,plain,
( nil = sK50
| sK49 = cons(sK51,nil) ),
inference(cnf_transformation,[],[f222]) ).
fof(f418,plain,
( nil = sK49
| ssList(sK53) ),
inference(cnf_transformation,[],[f222]) ).
fof(f419,plain,
( nil = sK49
| sK50 = app(app(sK52,sK49),sK53) ),
inference(cnf_transformation,[],[f222]) ).
fof(f421,plain,
( nil = sK49
| ssList(sK52) ),
inference(cnf_transformation,[],[f222]) ).
fof(f423,plain,
( nil = sK50
| ssItem(sK51) ),
inference(cnf_transformation,[],[f222]) ).
fof(f425,plain,
! [X4] :
( ~ segmentP(sK47,X4)
| ~ segmentP(sK48,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f222]) ).
fof(f426,plain,
( nil != sK47
| nil != sK48 ),
inference(cnf_transformation,[],[f222]) ).
fof(f428,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f222]) ).
fof(f429,plain,
sK48 = sK50,
inference(cnf_transformation,[],[f222]) ).
fof(f430,plain,
ssList(sK49),
inference(cnf_transformation,[],[f222]) ).
fof(f435,plain,
( nil != sK49
| nil != sK50 ),
inference(definition_unfolding,[],[f426,f428,f429]) ).
fof(f436,plain,
! [X4] :
( ~ segmentP(sK49,X4)
| ~ segmentP(sK50,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(definition_unfolding,[],[f425,f428,f429]) ).
fof(f492,plain,
! [X0,X1] :
( ~ neq(X0,X1)
| ~ ssList(X1)
| X0 = X1
| ~ ssList(X0) ),
inference(consistent_polarity_flipping,[],[f303]) ).
fof(f511,plain,
! [X0] :
( ~ segmentP(X0,X0)
| ~ ssList(X0) ),
inference(consistent_polarity_flipping,[],[f357]) ).
fof(f512,plain,
! [X2,X3,X0,X1] :
( ~ segmentP(app(app(X2,X0),X3),X1)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| segmentP(X0,X1)
| ~ ssList(X0) ),
inference(consistent_polarity_flipping,[],[f358]) ).
fof(f533,plain,
! [X4] :
( neq(X4,nil)
| segmentP(sK50,X4)
| segmentP(sK49,X4)
| ~ ssList(X4) ),
inference(consistent_polarity_flipping,[],[f436]) ).
fof(f549,definition,
( spl54_2
<=> nil = sK49 ),
introduced(definition,[new_symbols(definition,[spl54_2])],[avatar_definition]) ).
fof(f554,definition,
( spl54_3
<=> nil = sK50 ),
introduced(definition,[new_symbols(definition,[spl54_3])],[avatar_definition]) ).
fof(f564,definition,
( spl54_5
<=> ssList(sK53) ),
introduced(definition,[new_symbols(definition,[spl54_5])],[avatar_definition]) ).
fof(f566,plain,
( ssList(sK53)
| ~ spl54_5 ),
inference(avatar_component_clause,[],[f564]) ).
fof(f569,definition,
( spl54_6
<=> sK50 = app(app(sK52,sK49),sK53) ),
introduced(definition,[new_symbols(definition,[spl54_6])],[avatar_definition]) ).
fof(f571,plain,
( sK50 = app(app(sK52,sK49),sK53)
| ~ spl54_6 ),
inference(avatar_component_clause,[],[f569]) ).
fof(f574,definition,
( spl54_7
<=> sK49 = cons(sK51,nil) ),
introduced(definition,[new_symbols(definition,[spl54_7])],[avatar_definition]) ).
fof(f576,plain,
( sK49 = cons(sK51,nil)
| ~ spl54_7 ),
inference(avatar_component_clause,[],[f574]) ).
fof(f577,plain,
( spl54_7
| spl54_3 ),
inference(avatar_split_clause,[],[f417,f554,f574]) ).
fof(f578,plain,
( spl54_5
| spl54_2 ),
inference(avatar_split_clause,[],[f418,f549,f564]) ).
fof(f579,plain,
( spl54_6
| spl54_2 ),
inference(avatar_split_clause,[],[f419,f549,f569]) ).
fof(f582,definition,
( spl54_8
<=> ssList(sK52) ),
introduced(definition,[new_symbols(definition,[spl54_8])],[avatar_definition]) ).
fof(f584,plain,
( ssList(sK52)
| ~ spl54_8 ),
inference(avatar_component_clause,[],[f582]) ).
fof(f585,plain,
( spl54_8
| spl54_2 ),
inference(avatar_split_clause,[],[f421,f549,f582]) ).
fof(f588,definition,
( spl54_9
<=> ssItem(sK51) ),
introduced(definition,[new_symbols(definition,[spl54_9])],[avatar_definition]) ).
fof(f590,plain,
( ssItem(sK51)
| ~ spl54_9 ),
inference(avatar_component_clause,[],[f588]) ).
fof(f591,plain,
( spl54_9
| spl54_3 ),
inference(avatar_split_clause,[],[f423,f554,f588]) ).
fof(f593,plain,
( ~ spl54_3
| ~ spl54_2 ),
inference(avatar_split_clause,[],[f435,f549,f554]) ).
fof(f599,definition,
( spl54_11
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl54_11])],[avatar_definition]) ).
fof(f600,plain,
( ssList(nil)
| ~ spl54_11 ),
inference(avatar_component_clause,[],[f599]) ).
fof(f628,plain,
spl54_11,
inference(avatar_split_clause,[],[f306,f599]) ).
fof(f728,plain,
( nil != sK49
| ~ ssItem(sK51)
| ~ ssList(nil)
| ~ spl54_7 ),
inference(superposition,[],[f307,f576]) ).
fof(f1455,plain,
! [X0] :
( segmentP(sK50,X0)
| segmentP(sK49,X0)
| ~ ssList(X0)
| ~ ssList(nil)
| nil = X0
| ~ ssList(X0) ),
inference(resolution,[],[f533,f492]) ).
fof(f1457,plain,
! [X0] :
( segmentP(sK50,X0)
| segmentP(sK49,X0)
| ~ ssList(X0)
| ~ ssList(nil)
| nil = X0 ),
inference(duplicate_literal_removal,[],[f1455]) ).
fof(f1466,plain,
( ! [X0] :
( segmentP(sK50,X0)
| segmentP(sK49,X0)
| ~ ssList(X0)
| nil = X0 )
| ~ spl54_11 ),
inference(forward_subsumption_resolution,[],[f1457,f600]) ).
fof(f2214,plain,
( ! [X0] :
( ~ segmentP(sK50,X0)
| ~ ssList(X0)
| ~ ssList(sK52)
| ~ ssList(sK53)
| segmentP(sK49,X0)
| ~ ssList(sK49) )
| ~ spl54_6 ),
inference(superposition,[],[f512,f571]) ).
fof(f2217,plain,
( ! [X0] :
( ~ segmentP(sK50,X0)
| ~ ssList(X0)
| ~ ssList(sK53)
| segmentP(sK49,X0)
| ~ ssList(sK49) )
| ~ spl54_6
| ~ spl54_8 ),
inference(forward_subsumption_resolution,[],[f2214,f584]) ).
fof(f2228,plain,
( ! [X0] :
( ~ segmentP(sK50,X0)
| ~ ssList(X0)
| segmentP(sK49,X0)
| ~ ssList(sK49) )
| ~ spl54_5
| ~ spl54_6
| ~ spl54_8 ),
inference(forward_subsumption_resolution,[],[f2217,f566]) ).
fof(f2238,plain,
( ! [X0] :
( ~ segmentP(sK50,X0)
| ~ ssList(X0)
| segmentP(sK49,X0) )
| ~ spl54_5
| ~ spl54_6
| ~ spl54_8 ),
inference(forward_subsumption_resolution,[],[f2228,f430]) ).
fof(f4164,plain,
( ! [X0] :
( segmentP(sK49,X0)
| ~ ssList(X0)
| nil = X0 )
| ~ spl54_5
| ~ spl54_6
| ~ spl54_8
| ~ spl54_11 ),
inference(forward_subsumption_resolution,[],[f1466,f2238]) ).
fof(f4221,plain,
( ~ ssList(sK49)
| nil = sK49
| ~ ssList(sK49)
| ~ spl54_5
| ~ spl54_6
| ~ spl54_8
| ~ spl54_11 ),
inference(resolution,[],[f4164,f511]) ).
fof(f4225,plain,
( ~ ssList(sK49)
| nil = sK49
| ~ spl54_5
| ~ spl54_6
| ~ spl54_8
| ~ spl54_11 ),
inference(duplicate_literal_removal,[],[f4221]) ).
fof(f4227,plain,
( nil = sK49
| ~ spl54_5
| ~ spl54_6
| ~ spl54_8
| ~ spl54_11 ),
inference(forward_subsumption_resolution,[],[f4225,f430]) ).
fof(f4230,plain,
( nil != sK49
| ~ ssList(nil)
| ~ spl54_7
| ~ spl54_9 ),
inference(forward_subsumption_resolution,[],[f728,f590]) ).
fof(f4257,plain,
( spl54_2
| ~ spl54_5
| ~ spl54_6
| ~ spl54_8
| ~ spl54_11 ),
inference(avatar_split_clause,[],[f4227,f599,f582,f569,f564,f549]) ).
fof(f4258,plain,
( nil != sK49
| ~ spl54_7
| ~ spl54_9
| ~ spl54_11 ),
inference(forward_subsumption_resolution,[],[f4230,f600]) ).
fof(f4262,plain,
( ~ spl54_2
| ~ spl54_7
| ~ spl54_9
| ~ spl54_11 ),
inference(avatar_split_clause,[],[f4258,f599,f588,f574,f549]) ).
cnf(s7,plain,
( spl54_3
| spl54_7 ),
inference(sat_conversion,[],[f577]) ).
cnf(s8,plain,
( spl54_2
| spl54_5 ),
inference(sat_conversion,[],[f578]) ).
cnf(s9,plain,
( spl54_2
| spl54_6 ),
inference(sat_conversion,[],[f579]) ).
cnf(s11,plain,
( spl54_2
| spl54_8 ),
inference(sat_conversion,[],[f585]) ).
cnf(s13,plain,
( spl54_3
| spl54_9 ),
inference(sat_conversion,[],[f591]) ).
cnf(s15,plain,
( ~ spl54_2
| ~ spl54_3 ),
inference(sat_conversion,[],[f593]) ).
cnf(s24,plain,
spl54_11,
inference(sat_conversion,[],[f628]) ).
cnf(s321,plain,
( spl54_2
| ~ spl54_5
| ~ spl54_6
| ~ spl54_8
| ~ spl54_11 ),
inference(sat_conversion,[],[f4257]) ).
cnf(s322,plain,
( ~ spl54_2
| ~ spl54_7
| ~ spl54_9
| ~ spl54_11 ),
inference(sat_conversion,[],[f4262]) ).
cnf(s331,plain,
spl54_2,
inference(rat,[],[s321,s8,s9,s11,s24]) ).
cnf(s332,plain,
~ spl54_3,
inference(rat,[],[s15,s331]) ).
cnf(s339,plain,
spl54_9,
inference(rat,[],[s13,s332]) ).
cnf(s341,plain,
spl54_7,
inference(rat,[],[s7,s332]) ).
cnf(s360,plain,
$false,
inference(rat,[],[s322,s24,s331,s339,s341]) ).
fof(f4264,plain,
$false,
inference(avatar_sat_refutation,[],[s360]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC071+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.09/0.36 % Computer : n006.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Mon Sep 28 07:42:41 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.39 Running first-order model finding
% 0.09/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.39/0.52 % (3804479)Will run a generic schedule for satisfiability detection.
% 0.39/0.52 % (3804486)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1619462587:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.39/0.52 % (3804485)% WARNING: option uhcvi not known.
% 0.39/0.52 % (3804484)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3433280271_2999 on theBenchmark for (2999ds/0Mi)
% 0.39/0.52 % (3804487)dis+10_1_sil=32000:sp=arity:random_seed=79531984:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.39/0.52 % (3804488)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4162835479:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.39/0.52 % (3804489)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3825426672:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.39/0.52 % (3804490)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2977009936:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.39/0.52 % (3804485)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4272166116:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.39/0.52 % TRYING [1]
% 0.39/0.52 % TRYING [2]
% 0.39/0.52 % TRYING [3]
% 0.39/0.52 % TRYING [4]
% 0.39/0.52 % (3804487)Instruction limit reached!
% 0.39/0.52 % (3804487)------------------------------
% 0.39/0.52 % (3804487)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.39/0.52 % (3804487)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.39/0.52 % (3804487)CaDiCaL version: 2.1.3
% 0.39/0.52 % (3804487)Termination reason: Instruction limit
% 0.39/0.52 % (3804487)Termination phase: Saturation
% 0.39/0.52 % (3804487)Time elapsed: 0.061 s
% 0.39/0.52 % (3804487)Peak memory usage: 13 MB
% 0.39/0.52 % (3804487)Instructions burned: 104 (million)
% 0.39/0.52 % (3804488)Instruction limit reached!
% 0.39/0.52 % (3804488)------------------------------
% 0.39/0.52 % (3804488)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.39/0.52 % (3804488)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.39/0.52 % (3804488)CaDiCaL version: 2.1.3
% 0.39/0.52 % (3804488)Termination reason: Instruction limit
% 0.39/0.52 % (3804488)Termination phase: Saturation
% 0.39/0.52 % (3804488)Time elapsed: 0.070 s
% 0.39/0.52 % (3804488)Peak memory usage: 13 MB
% 0.39/0.52 % (3804488)Instructions burned: 117 (million)
% 0.39/0.52 % (3804485) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3804479-3804485"...
% 0.39/0.52 % (3804485)...printing done.
% 0.39/0.52 % (3804485)Refutation found. Thanks to Tanya!
% 0.39/0.52 % SZS status Theorem for theBenchmark
% 0.39/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.39/0.52 % (3804485)------------------------------
% 0.39/0.52 % (3804485)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.39/0.52 % (3804485)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.39/0.52 % (3804485)CaDiCaL version: 2.1.3
% 0.39/0.52 % (3804485)Termination reason: Refutation
% 0.39/0.52 % (3804485)Time elapsed: 0.076 s
% 0.39/0.52 % (3804485)Peak memory usage: 15 MB
% 0.39/0.52 % (3804485)Instructions burned: 119 (million)
% 0.39/0.52 % (3804479)Success in time 0.12 s
% 0.39/0.52 % Vampire exiting
%------------------------------------------------------------------------------