%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC200+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 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:02:54 PM UTC 2026
% Result : Theorem 0.90s 0.83s
% Output : Refutation 2.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 9
% Syntax : Number of formulae : 71 ( 14 unt; 3 def)
% Number of atoms : 269 ( 52 equ)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 341 ( 143 ~; 133 |; 41 &)
% ( 7 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 4 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 79 ( 0 sgn 63 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0] :
( ssList(X0)
=> ( singletonP(X0)
<=> ? [X1] :
( ssItem(X1)
& cons(X1,nil) = X0 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax4) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f23,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> hd(cons(X1,X0)) = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax23) ).
fof(f37,axiom,
! [X0] :
( ssItem(X0)
=> ! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssList(X2)
=> ( memberP(cons(X1,X2),X0)
<=> ( X0 = X1
| memberP(X2,X0) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax37) ).
fof(f38,axiom,
! [X0] :
( ssItem(X0)
=> ~ memberP(nil,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax38) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ~ singletonP(X2)
| ? [X4] :
( ssItem(X4)
& ! [X5] :
( ssItem(X5)
=> ( ~ memberP(X0,X5)
| X4 = X5 ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ~ singletonP(X2)
| ? [X4] :
( ssItem(X4)
& ! [X5] :
( ssItem(X5)
=> ( ~ memberP(X0,X5)
| X4 = X5 ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f100,plain,
! [X0] :
( ( singletonP(X0)
<=> ? [X1] :
( ssItem(X1)
& cons(X1,nil) = X0 ) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f4]) ).
fof(f128,plain,
! [X0] :
( ! [X1] :
( hd(cons(X1,X0)) = X1
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f23]) ).
fof(f147,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( memberP(cons(X1,X2),X0)
<=> ( X0 = X1
| memberP(X2,X0) ) )
| ~ ssList(X2) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f37]) ).
fof(f148,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f38]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& singletonP(X2)
& ! [X4] :
( ~ ssItem(X4)
| ? [X5] :
( memberP(X0,X5)
& X4 != X5
& ssItem(X5) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& singletonP(X2)
& ! [X4] :
( ~ ssItem(X4)
| ? [X5] :
( memberP(X0,X5)
& X4 != X5
& ssItem(X5) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f237,plain,
! [X0] :
( ( ( singletonP(X0)
| ! [X1] :
( ~ ssItem(X1)
| cons(X1,nil) != X0 ) )
& ( ? [X1] :
( ssItem(X1)
& cons(X1,nil) = X0 )
| ~ singletonP(X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f100]) ).
fof(f238,plain,
! [X0] :
( ( ( singletonP(X0)
| ! [X1] :
( ~ ssItem(X1)
| cons(X1,nil) != X0 ) )
& ( ? [X2] :
( ssItem(X2)
& cons(X2,nil) = X0 )
| ~ singletonP(X0) ) )
| ~ ssList(X0) ),
inference(rectify,[],[f237]) ).
fof(f239,plain,
! [X0] :
( ( ( singletonP(X0)
| ! [X1] :
( ~ ssItem(X1)
| cons(X1,nil) != X0 ) )
& ( ( ssItem(sK10(X0))
& cons(sK10(X0),nil) = X0 )
| ~ singletonP(X0) ) )
| ~ ssList(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK10]),skolemize(X2,sK10(X0))],[f238]) ).
fof(f279,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( ( memberP(cons(X1,X2),X0)
| ( X0 != X1
& ~ memberP(X2,X0) ) )
& ( X0 = X1
| memberP(X2,X0)
| ~ memberP(cons(X1,X2),X0) ) )
| ~ ssList(X2) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(nnf_transformation,[],[f147]) ).
fof(f280,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( ( memberP(cons(X1,X2),X0)
| ( X0 != X1
& ~ memberP(X2,X0) ) )
& ( X0 = X1
| memberP(X2,X0)
| ~ memberP(cons(X1,X2),X0) ) )
| ~ ssList(X2) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(flattening,[],[f279]) ).
fof(f296,plain,
( sK54 = sK56
& sK53 = sK55
& singletonP(sK55)
& ! [X4] :
( ~ ssItem(X4)
| ( memberP(sK53,sK57(X4))
& sK57(X4) != X4
& ssItem(sK57(X4)) ) )
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56,sK57]),skolemize(X0,sK53),skolemize(X1,sK54),skolemize(X2,sK55),skolemize(X3,sK56),skolemize(X5,sK57(X4))],[f222]) ).
fof(f306,plain,
! [X0] :
( ~ singletonP(X0)
| cons(sK10(X0),nil) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f239]) ).
fof(f307,plain,
! [X0] :
( ssItem(sK10(X0))
| ~ singletonP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f239]) ).
fof(f389,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f398,plain,
! [X0,X1] :
( hd(cons(X1,X0)) = X1
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f128]) ).
fof(f416,plain,
! [X2,X0,X1] :
( memberP(X2,X0)
| X0 = X1
| ~ memberP(cons(X1,X2),X0)
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f280]) ).
fof(f419,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f148]) ).
fof(f496,plain,
ssList(sK53),
inference(cnf_transformation,[],[f296]) ).
fof(f500,plain,
! [X4] :
( ssItem(sK57(X4))
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f296]) ).
fof(f501,plain,
! [X4] :
( sK57(X4) != X4
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f296]) ).
fof(f502,plain,
! [X4] :
( memberP(sK53,sK57(X4))
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f296]) ).
fof(f503,plain,
singletonP(sK55),
inference(cnf_transformation,[],[f296]) ).
fof(f504,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f296]) ).
fof(f541,definition,
( spl58_1
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl58_1])],[avatar_definition]) ).
fof(f542,plain,
( ssList(nil)
| ~ spl58_1 ),
inference(avatar_component_clause,[],[f541]) ).
fof(f574,plain,
spl58_1,
inference(avatar_split_clause,[],[f389,f541]) ).
fof(f575,plain,
singletonP(sK53),
inference(superposition,[],[f503,f504]) ).
fof(f604,plain,
( sK53 = cons(sK10(sK53),nil)
| ~ ssList(sK53) ),
inference(resolution,[],[f306,f575]) ).
fof(f605,plain,
sK53 = cons(sK10(sK53),nil),
inference(forward_subsumption_resolution,[],[f604,f496]) ).
fof(f627,definition,
( spl58_8
<=> ssItem(sK10(sK53)) ),
introduced(definition,[new_symbols(definition,[spl58_8])],[avatar_definition]) ).
fof(f628,plain,
( ssItem(sK10(sK53))
| ~ spl58_8 ),
inference(avatar_component_clause,[],[f627]) ).
fof(f629,plain,
( ~ ssItem(sK10(sK53))
| spl58_8 ),
inference(avatar_component_clause,[],[f627]) ).
fof(f676,plain,
( sK10(sK53) = hd(sK53)
| ~ ssItem(sK10(sK53))
| ~ ssList(nil) ),
inference(superposition,[],[f398,f605]) ).
fof(f678,plain,
( sK10(sK53) = hd(sK53)
| ~ ssItem(sK10(sK53))
| ~ spl58_1 ),
inference(forward_subsumption_resolution,[],[f676,f542]) ).
fof(f680,definition,
( spl58_18
<=> sK10(sK53) = hd(sK53) ),
introduced(definition,[new_symbols(definition,[spl58_18])],[avatar_definition]) ).
fof(f682,plain,
( sK10(sK53) = hd(sK53)
| ~ spl58_18 ),
inference(avatar_component_clause,[],[f680]) ).
fof(f683,plain,
( ~ spl58_8
| spl58_18
| ~ spl58_1 ),
inference(avatar_split_clause,[],[f678,f541,f680,f627]) ).
fof(f684,plain,
( ~ singletonP(sK53)
| ~ ssList(sK53)
| spl58_8 ),
inference(resolution,[],[f629,f307]) ).
fof(f685,plain,
( ~ ssList(sK53)
| spl58_8 ),
inference(forward_subsumption_resolution,[],[f684,f575]) ).
fof(f686,plain,
( $false
| spl58_8 ),
inference(forward_subsumption_resolution,[],[f685,f496]) ).
fof(f687,plain,
spl58_8,
inference(avatar_contradiction_clause,[],[f686]) ).
fof(f713,plain,
( ssItem(hd(sK53))
| ~ spl58_8
| ~ spl58_18 ),
inference(superposition,[],[f628,f682]) ).
fof(f1450,plain,
! [X0,X1] :
( X0 = X1
| ~ memberP(cons(X1,nil),X0)
| ~ ssList(nil)
| ~ ssItem(X1)
| ~ ssItem(X0)
| ~ ssItem(X0) ),
inference(resolution,[],[f416,f419]) ).
fof(f1451,plain,
! [X0,X1] :
( X0 = X1
| ~ memberP(cons(X1,nil),X0)
| ~ ssList(nil)
| ~ ssItem(X1)
| ~ ssItem(X0) ),
inference(duplicate_literal_removal,[],[f1450]) ).
fof(f1452,plain,
( ! [X0,X1] :
( ~ memberP(cons(X1,nil),X0)
| X0 = X1
| ~ ssItem(X1)
| ~ ssItem(X0) )
| ~ spl58_1 ),
inference(forward_subsumption_resolution,[],[f1451,f542]) ).
fof(f3472,plain,
( ! [X0] :
( ~ memberP(sK53,X0)
| sK10(sK53) = X0
| ~ ssItem(sK10(sK53))
| ~ ssItem(X0) )
| ~ spl58_1 ),
inference(superposition,[],[f1452,f605]) ).
fof(f3484,plain,
( ! [X0] :
( ~ memberP(sK53,X0)
| sK10(sK53) = X0
| ~ ssItem(X0) )
| ~ spl58_1
| ~ spl58_8 ),
inference(forward_subsumption_resolution,[],[f3472,f628]) ).
fof(f3489,plain,
( ! [X0] :
( ~ memberP(sK53,X0)
| hd(sK53) = X0
| ~ ssItem(X0) )
| ~ spl58_1
| ~ spl58_8
| ~ spl58_18 ),
inference(forward_demodulation,[],[f3484,f682]) ).
fof(f4099,plain,
( ! [X0] :
( sK57(X0) = hd(sK53)
| ~ ssItem(sK57(X0))
| ~ ssItem(X0) )
| ~ spl58_1
| ~ spl58_8
| ~ spl58_18 ),
inference(resolution,[],[f3489,f502]) ).
fof(f4111,plain,
( ! [X0] :
( sK57(X0) = hd(sK53)
| ~ ssItem(X0) )
| ~ spl58_1
| ~ spl58_8
| ~ spl58_18 ),
inference(forward_subsumption_resolution,[],[f4099,f500]) ).
fof(f4185,plain,
( ! [X0] :
( hd(sK53) != X0
| ~ ssItem(X0)
| ~ ssItem(X0) )
| ~ spl58_1
| ~ spl58_8
| ~ spl58_18 ),
inference(superposition,[],[f501,f4111]) ).
fof(f4188,plain,
( ! [X0] :
( hd(sK53) != X0
| ~ ssItem(X0) )
| ~ spl58_1
| ~ spl58_8
| ~ spl58_18 ),
inference(duplicate_literal_removal,[],[f4185]) ).
fof(f4327,plain,
( ~ ssItem(hd(sK53))
| ~ spl58_1
| ~ spl58_8
| ~ spl58_18 ),
inference(equality_resolution,[],[f4188]) ).
fof(f4328,plain,
( $false
| ~ spl58_1
| ~ spl58_8
| ~ spl58_18 ),
inference(forward_subsumption_resolution,[],[f4327,f713]) ).
fof(f4329,plain,
( ~ spl58_1
| ~ spl58_8
| ~ spl58_18 ),
inference(avatar_contradiction_clause,[],[f4328]) ).
cnf(s9,plain,
spl58_1,
inference(sat_conversion,[],[f574]) ).
cnf(s20,plain,
( ~ spl58_1
| ~ spl58_8
| spl58_18 ),
inference(sat_conversion,[],[f683]) ).
cnf(s21,plain,
spl58_8,
inference(sat_conversion,[],[f687]) ).
cnf(s155,plain,
( ~ spl58_1
| ~ spl58_8
| ~ spl58_18 ),
inference(sat_conversion,[],[f4329]) ).
cnf(s171,plain,
( ~ spl58_1
| spl58_18 ),
inference(rat,[],[s20,s21]) ).
cnf(s182,plain,
~ spl58_18,
inference(rat,[],[s155,s21,s9]) ).
cnf(s187,plain,
$false,
inference(rat,[],[s171,s182,s9]) ).
fof(f4330,plain,
$false,
inference(avatar_sat_refutation,[],[s187]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SWC200+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.03 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.03/0.30 % Computer : n012.cluster.edu
% 0.03/0.30 % Model : x86_64 x86_64
% 0.03/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.30 % Memory : 8046.5625MB
% 0.03/0.30 % OS : Linux 6.8.0-71-generic
% 0.03/0.30 % CPULimit : 300
% 0.03/0.30 % WCLimit : 300
% 0.03/0.30 % DateTime : Mon Sep 28 08:25:34 UTC 2026
% 0.03/0.30 % CPUTime :
% 0.03/0.30 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.03/0.32 Running first-order theorem proving
% 0.03/0.32 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.90/0.83 % (3235028)Detected formulas, will run a generic FOF schedule.
% 0.90/0.83 % (3235037)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3140649597:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 0.90/0.83 % (3235039)dis-21_1_sil=8000:lcm=predicate:random_seed=3330376263:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 0.90/0.83 % (3235033)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=1689058115:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 0.90/0.83 % (3235038)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2856471118:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 0.90/0.83 % (3235034)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=3389707100:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 0.90/0.83 % (3235035)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=2917902486:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 0.90/0.83 % (3235036)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3601143936:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 0.90/0.83 % (3235036)Refutation not found, incomplete strategy
% 0.90/0.83 % (3235036)------------------------------
% 0.90/0.83 % (3235036)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.90/0.83 % (3235036)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.90/0.83 % (3235036)CaDiCaL version: 2.1.3
% 0.90/0.83 % (3235036)Termination reason: Refutation not found, incomplete strategy
% 0.90/0.83 % (3235036)Time elapsed: 0.001 s
% 0.90/0.83 % (3235036)Peak memory usage: 88 MB
% 0.90/0.83 % (3235036)Instructions burned: 2 (million)
% 0.90/0.83 % (3235037)Instruction limit reached!
% 0.90/0.83 % (3235037)------------------------------
% 0.90/0.83 % (3235037)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.90/0.83 % (3235037)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.90/0.83 % (3235037)CaDiCaL version: 2.1.3
% 0.90/0.83 % (3235037)Termination reason: Instruction limit
% 0.90/0.83 % (3235037)Termination phase: Saturation
% 0.90/0.83 % (3235037)Time elapsed: 0.039 s
% 0.90/0.83 % (3235037)Peak memory usage: 88 MB
% 0.90/0.83 % (3235037)Instructions burned: 123 (million)
% 0.90/0.83 % (3235039)Instruction limit reached!
% 0.90/0.83 % (3235039)------------------------------
% 0.90/0.83 % (3235039)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.90/0.83 % (3235039)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.90/0.83 % (3235039)CaDiCaL version: 2.1.3
% 0.90/0.83 % (3235039)Termination reason: Instruction limit
% 0.90/0.83 % (3235039)Termination phase: Saturation
% 0.90/0.83 % (3235039)Time elapsed: 0.041 s
% 0.90/0.83 % (3235039)Peak memory usage: 89 MB
% 0.90/0.83 % (3235039)Instructions burned: 132 (million)
% 0.90/0.83 % (3235038)First to succeed.
% 0.90/0.83 % (3235038)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3235028"
% 0.90/0.83 % (3235048)lrs+10_1_sil=32000:urr=on:br=off:random_seed=552910400:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/157Mi)
% 0.90/0.83 % (3235047)lrs+10_1_sil=8000:sp=occurrence:random_seed=3137093653:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 0.90/0.83 % (3235047)Also succeeded, but the first one will report.
% 0.90/0.83 % (3235036)------------------------------
% 0.90/0.83 % (3235036)------------------------------
% 0.90/0.83 % (3235048)Instruction limit reached!
% 0.90/0.83 % (3235048)------------------------------
% 0.90/0.83 % (3235048)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.90/0.83 % (3235048)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.90/0.83 % (3235048)CaDiCaL version: 2.1.3
% 0.90/0.83 % (3235048)Termination reason: Instruction limit
% 0.90/0.83 % (3235048)Termination phase: Saturation
% 0.90/0.83 % (3235048)Time elapsed: 0.046 s
% 0.90/0.83 % (3235048)Peak memory usage: 90 MB
% 0.90/0.83 % (3235048)Instructions burned: 161 (million)
% 0.90/0.83 % (3235038)Refutation found. Thanks to Tanya!
% 0.90/0.83 % SZS status Theorem for theBenchmark
% 0.90/0.83 % SZS output start Proof for theBenchmark
% See solution above
% 2.47/0.93 % (3235038)------------------------------
% 2.47/0.93 % (3235038)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.47/0.93 % (3235038)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.47/0.93 % (3235038)CaDiCaL version: 2.1.3
% 2.47/0.93 % (3235038)Termination reason: Refutation
% 2.47/0.93 % (3235038)Time elapsed: 0.048 s
% 2.47/0.93 % (3235038)Peak memory usage: 91 MB
% 2.47/0.93 % (3235038)Instructions burned: 133 (million)
% 2.47/0.93 % (3235038)------------------------------
% 2.47/0.93 % (3235038)------------------------------
% 2.47/0.93 % (3235028)Success in time 0.319 s
% 2.47/0.93 % Vampire exiting
%------------------------------------------------------------------------------