%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWV401+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n015.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:09:07 PM UTC 2026
% Result : Theorem 2.56s 1.60s
% Output : Refutation 5.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 11
% Syntax : Number of formulae : 82 ( 9 unt; 5 def)
% Number of atoms : 217 ( 29 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 220 ( 85 ~; 94 |; 25 &)
% ( 7 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 6 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 141 ( 0 sgn 123 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] :
( less_than(X0,X1)
| less_than(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',totality) ).
fof(f4,axiom,
! [X0,X1] :
( strictly_less_than(X0,X1)
<=> ( less_than(X0,X1)
& ~ less_than(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',stricly_smaller_definition) ).
fof(f11,axiom,
! [X0,X1,X2,X3,X4] :
( pair_in_list(insert_slb(X0,pair(X1,X3)),X2,X4)
<=> ( pair_in_list(X0,X2,X4)
| ( X1 = X2
& X3 = X4 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax23) ).
fof(f17,axiom,
! [X0,X1,X2,X3] :
( strictly_less_than(X3,X2)
=> update_slb(insert_slb(X0,pair(X1,X3)),X2) = insert_slb(update_slb(X0,X2),pair(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax29) ).
fof(f18,axiom,
! [X0,X1,X2,X3] :
( less_than(X2,X3)
=> update_slb(insert_slb(X0,pair(X1,X3)),X2) = insert_slb(update_slb(X0,X2),pair(X1,X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax30) ).
fof(f19,conjecture,
! [X0] :
( ! [X1,X2,X3] :
( ( pair_in_list(X0,X1,X2)
& less_than(X3,X2) )
=> pair_in_list(update_slb(X0,X3),X1,X2) )
=> ! [X4,X5,X6,X7,X8] :
( ( pair_in_list(insert_slb(X0,pair(X7,X8)),X4,X5)
& less_than(X6,X5) )
=> pair_in_list(update_slb(insert_slb(X0,pair(X7,X8)),X6),X4,X5) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l37_co) ).
fof(f20,negated_conjecture,
~ ! [X0] :
( ! [X1,X2,X3] :
( ( pair_in_list(X0,X1,X2)
& less_than(X3,X2) )
=> pair_in_list(update_slb(X0,X3),X1,X2) )
=> ! [X4,X5,X6,X7,X8] :
( ( pair_in_list(insert_slb(X0,pair(X7,X8)),X4,X5)
& less_than(X6,X5) )
=> pair_in_list(update_slb(insert_slb(X0,pair(X7,X8)),X6),X4,X5) ) ),
inference(negated_conjecture,[status(cth)],[f19]) ).
fof(f21,plain,
! [X0,X1] :
( ( less_than(X0,X1)
& ~ less_than(X1,X0) )
=> strictly_less_than(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f4]) ).
fof(f24,plain,
! [X0,X1] :
( strictly_less_than(X0,X1)
| ~ less_than(X0,X1)
| less_than(X1,X0) ),
inference(ennf_transformation,[],[f21]) ).
fof(f25,plain,
! [X0,X1] :
( strictly_less_than(X0,X1)
| ~ less_than(X0,X1)
| less_than(X1,X0) ),
inference(flattening,[],[f24]) ).
fof(f30,plain,
! [X0,X1,X2,X3] :
( update_slb(insert_slb(X0,pair(X1,X3)),X2) = insert_slb(update_slb(X0,X2),pair(X1,X2))
| ~ strictly_less_than(X3,X2) ),
inference(ennf_transformation,[],[f17]) ).
fof(f31,plain,
! [X0,X1,X2,X3] :
( update_slb(insert_slb(X0,pair(X1,X3)),X2) = insert_slb(update_slb(X0,X2),pair(X1,X3))
| ~ less_than(X2,X3) ),
inference(ennf_transformation,[],[f18]) ).
fof(f32,plain,
? [X0] :
( ? [X4,X5,X6,X7,X8] :
( ~ pair_in_list(update_slb(insert_slb(X0,pair(X7,X8)),X6),X4,X5)
& pair_in_list(insert_slb(X0,pair(X7,X8)),X4,X5)
& less_than(X6,X5) )
& ! [X1,X2,X3] :
( pair_in_list(update_slb(X0,X3),X1,X2)
| ~ pair_in_list(X0,X1,X2)
| ~ less_than(X3,X2) ) ),
inference(ennf_transformation,[],[f20]) ).
fof(f33,plain,
? [X0] :
( ? [X4,X5,X6,X7,X8] :
( ~ pair_in_list(update_slb(insert_slb(X0,pair(X7,X8)),X6),X4,X5)
& pair_in_list(insert_slb(X0,pair(X7,X8)),X4,X5)
& less_than(X6,X5) )
& ! [X1,X2,X3] :
( pair_in_list(update_slb(X0,X3),X1,X2)
| ~ pair_in_list(X0,X1,X2)
| ~ less_than(X3,X2) ) ),
inference(flattening,[],[f32]) ).
fof(f36,plain,
! [X0,X1,X2,X3,X4] :
( ( pair_in_list(insert_slb(X0,pair(X1,X3)),X2,X4)
| ( ~ pair_in_list(X0,X2,X4)
& ( X1 != X2
| X3 != X4 ) ) )
& ( pair_in_list(X0,X2,X4)
| ( X1 = X2
& X3 = X4 )
| ~ pair_in_list(insert_slb(X0,pair(X1,X3)),X2,X4) ) ),
inference(nnf_transformation,[],[f11]) ).
fof(f37,plain,
! [X0,X1,X2,X3,X4] :
( ( pair_in_list(insert_slb(X0,pair(X1,X3)),X2,X4)
| ( ~ pair_in_list(X0,X2,X4)
& ( X1 != X2
| X3 != X4 ) ) )
& ( pair_in_list(X0,X2,X4)
| ( X1 = X2
& X3 = X4 )
| ~ pair_in_list(insert_slb(X0,pair(X1,X3)),X2,X4) ) ),
inference(flattening,[],[f36]) ).
fof(f38,plain,
? [X0] :
( ? [X1,X2,X3,X4,X5] :
( ~ pair_in_list(update_slb(insert_slb(X0,pair(X4,X5)),X3),X1,X2)
& pair_in_list(insert_slb(X0,pair(X4,X5)),X1,X2)
& less_than(X3,X2) )
& ! [X6,X7,X8] :
( pair_in_list(update_slb(X0,X8),X6,X7)
| ~ pair_in_list(X0,X6,X7)
| ~ less_than(X8,X7) ) ),
inference(rectify,[],[f33]) ).
fof(f39,plain,
( ~ pair_in_list(update_slb(insert_slb(sK0,pair(sK4,sK5)),sK3),sK1,sK2)
& pair_in_list(insert_slb(sK0,pair(sK4,sK5)),sK1,sK2)
& less_than(sK3,sK2)
& ! [X6,X7,X8] :
( pair_in_list(update_slb(sK0,X8),X6,X7)
| ~ pair_in_list(sK0,X6,X7)
| ~ less_than(X8,X7) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X4,sK4),skolemize(X5,sK5)],[f38]) ).
fof(f41,plain,
! [X0,X1] :
( less_than(X0,X1)
| less_than(X1,X0) ),
inference(cnf_transformation,[],[f2]) ).
fof(f43,plain,
! [X0,X1] :
( strictly_less_than(X0,X1)
| ~ less_than(X0,X1)
| less_than(X1,X0) ),
inference(cnf_transformation,[],[f25]) ).
fof(f52,plain,
! [X2,X3,X0,X1,X4] :
( ~ pair_in_list(insert_slb(X0,pair(X1,X3)),X2,X4)
| X3 = X4
| pair_in_list(X0,X2,X4) ),
inference(cnf_transformation,[],[f37]) ).
fof(f53,plain,
! [X2,X3,X0,X1,X4] :
( ~ pair_in_list(insert_slb(X0,pair(X1,X3)),X2,X4)
| X1 = X2
| pair_in_list(X0,X2,X4) ),
inference(cnf_transformation,[],[f37]) ).
fof(f54,plain,
! [X2,X3,X0,X1,X4] :
( pair_in_list(insert_slb(X0,pair(X1,X3)),X2,X4)
| X1 != X2
| X3 != X4 ),
inference(cnf_transformation,[],[f37]) ).
fof(f55,plain,
! [X2,X3,X0,X1,X4] :
( pair_in_list(insert_slb(X0,pair(X1,X3)),X2,X4)
| ~ pair_in_list(X0,X2,X4) ),
inference(cnf_transformation,[],[f37]) ).
fof(f61,plain,
! [X2,X3,X0,X1] :
( ~ strictly_less_than(X3,X2)
| update_slb(insert_slb(X0,pair(X1,X3)),X2) = insert_slb(update_slb(X0,X2),pair(X1,X2)) ),
inference(cnf_transformation,[],[f30]) ).
fof(f62,plain,
! [X2,X3,X0,X1] :
( update_slb(insert_slb(X0,pair(X1,X3)),X2) = insert_slb(update_slb(X0,X2),pair(X1,X3))
| ~ less_than(X2,X3) ),
inference(cnf_transformation,[],[f31]) ).
fof(f63,plain,
! [X8,X6,X7] :
( ~ pair_in_list(sK0,X6,X7)
| pair_in_list(update_slb(sK0,X8),X6,X7)
| ~ less_than(X8,X7) ),
inference(cnf_transformation,[],[f39]) ).
fof(f64,plain,
less_than(sK3,sK2),
inference(cnf_transformation,[],[f39]) ).
fof(f65,plain,
pair_in_list(insert_slb(sK0,pair(sK4,sK5)),sK1,sK2),
inference(cnf_transformation,[],[f39]) ).
fof(f66,plain,
~ pair_in_list(update_slb(insert_slb(sK0,pair(sK4,sK5)),sK3),sK1,sK2),
inference(cnf_transformation,[],[f39]) ).
fof(f68,plain,
! [X2,X3,X0,X4] :
( pair_in_list(insert_slb(X0,pair(X2,X3)),X2,X4)
| X3 != X4 ),
inference(equality_resolution,[],[f54]) ).
fof(f69,plain,
! [X2,X0,X4] : pair_in_list(insert_slb(X0,pair(X2,X4)),X2,X4),
inference(equality_resolution,[],[f68]) ).
fof(f70,plain,
! [X0,X1] :
( strictly_less_than(X0,X1)
| less_than(X1,X0) ),
inference(forward_subsumption_resolution,[],[f43,f41]) ).
fof(f75,plain,
( sK2 = sK5
| pair_in_list(sK0,sK1,sK2) ),
inference(resolution,[],[f52,f65]) ).
fof(f79,definition,
( spl6_1
<=> pair_in_list(sK0,sK1,sK2) ),
introduced(definition,[new_symbols(definition,[spl6_1])],[avatar_definition]) ).
fof(f81,plain,
( pair_in_list(sK0,sK1,sK2)
| ~ spl6_1 ),
inference(avatar_component_clause,[],[f79]) ).
fof(f83,definition,
( spl6_2
<=> sK2 = sK5 ),
introduced(definition,[new_symbols(definition,[spl6_2])],[avatar_definition]) ).
fof(f85,plain,
( sK2 = sK5
| ~ spl6_2 ),
inference(avatar_component_clause,[],[f83]) ).
fof(f86,plain,
( spl6_1
| spl6_2 ),
inference(avatar_split_clause,[],[f75,f83,f79]) ).
fof(f89,plain,
( sK1 = sK4
| pair_in_list(sK0,sK1,sK2) ),
inference(resolution,[],[f53,f65]) ).
fof(f93,definition,
( spl6_3
<=> sK1 = sK4 ),
introduced(definition,[new_symbols(definition,[spl6_3])],[avatar_definition]) ).
fof(f95,plain,
( sK1 = sK4
| ~ spl6_3 ),
inference(avatar_component_clause,[],[f93]) ).
fof(f96,plain,
( spl6_1
| spl6_3 ),
inference(avatar_split_clause,[],[f89,f93,f79]) ).
fof(f97,plain,
( ! [X0] :
( pair_in_list(update_slb(sK0,X0),sK1,sK2)
| ~ less_than(X0,sK2) )
| ~ spl6_1 ),
inference(resolution,[],[f81,f63]) ).
fof(f100,plain,
! [X2,X3,X0,X1] :
( less_than(X3,X2)
| update_slb(insert_slb(X0,pair(X1,X2)),X3) = insert_slb(update_slb(X0,X3),pair(X1,X3)) ),
inference(resolution,[],[f61,f70]) ).
fof(f101,plain,
( ~ pair_in_list(insert_slb(update_slb(sK0,sK3),pair(sK4,sK5)),sK1,sK2)
| ~ less_than(sK3,sK5) ),
inference(superposition,[],[f66,f62]) ).
fof(f110,definition,
( spl6_4
<=> less_than(sK3,sK5) ),
introduced(definition,[new_symbols(definition,[spl6_4])],[avatar_definition]) ).
fof(f112,plain,
( ~ less_than(sK3,sK5)
| spl6_4 ),
inference(avatar_component_clause,[],[f110]) ).
fof(f114,definition,
( spl6_5
<=> pair_in_list(insert_slb(update_slb(sK0,sK3),pair(sK4,sK5)),sK1,sK2) ),
introduced(definition,[new_symbols(definition,[spl6_5])],[avatar_definition]) ).
fof(f116,plain,
( ~ pair_in_list(insert_slb(update_slb(sK0,sK3),pair(sK4,sK5)),sK1,sK2)
| spl6_5 ),
inference(avatar_component_clause,[],[f114]) ).
fof(f117,plain,
( ~ spl6_4
| ~ spl6_5 ),
inference(avatar_split_clause,[],[f101,f114,f110]) ).
fof(f120,plain,
( ! [X0,X1] : update_slb(insert_slb(X0,pair(X1,sK5)),sK3) = insert_slb(update_slb(X0,sK3),pair(X1,sK3))
| spl6_4 ),
inference(resolution,[],[f100,f112]) ).
fof(f130,plain,
( ~ pair_in_list(insert_slb(update_slb(sK0,sK3),pair(sK4,sK3)),sK1,sK2)
| spl6_4 ),
inference(superposition,[],[f66,f120]) ).
fof(f151,plain,
( ~ pair_in_list(update_slb(sK0,sK3),sK1,sK2)
| spl6_4 ),
inference(resolution,[],[f130,f55]) ).
fof(f163,plain,
( ~ less_than(sK3,sK2)
| ~ spl6_1
| spl6_4 ),
inference(resolution,[],[f151,f97]) ).
fof(f164,plain,
( $false
| ~ spl6_1
| spl6_4 ),
inference(forward_subsumption_resolution,[],[f163,f64]) ).
fof(f165,plain,
( ~ spl6_1
| spl6_4 ),
inference(avatar_contradiction_clause,[],[f164]) ).
fof(f168,plain,
( ~ less_than(sK3,sK2)
| ~ spl6_2
| spl6_4 ),
inference(superposition,[],[f112,f85]) ).
fof(f177,plain,
( $false
| ~ spl6_2
| spl6_4 ),
inference(forward_subsumption_resolution,[],[f168,f64]) ).
fof(f178,plain,
( ~ spl6_2
| spl6_4 ),
inference(avatar_contradiction_clause,[],[f177]) ).
fof(f180,plain,
( ~ pair_in_list(insert_slb(update_slb(sK0,sK3),pair(sK4,sK2)),sK1,sK2)
| ~ spl6_2
| spl6_5 ),
inference(forward_demodulation,[],[f116,f85]) ).
fof(f186,plain,
( ~ pair_in_list(insert_slb(update_slb(sK0,sK3),pair(sK1,sK2)),sK1,sK2)
| ~ spl6_2
| ~ spl6_3
| spl6_5 ),
inference(forward_demodulation,[],[f180,f95]) ).
fof(f187,plain,
( $false
| ~ spl6_2
| ~ spl6_3
| spl6_5 ),
inference(forward_subsumption_resolution,[],[f186,f69]) ).
fof(f188,plain,
( ~ spl6_2
| ~ spl6_3
| spl6_5 ),
inference(avatar_contradiction_clause,[],[f187]) ).
fof(f189,plain,
( ! [X0] :
( pair_in_list(update_slb(sK0,X0),sK1,sK2)
| ~ less_than(X0,sK2) )
| ~ spl6_1 ),
inference(resolution,[],[f81,f63]) ).
fof(f190,plain,
( ~ pair_in_list(update_slb(sK0,sK3),sK1,sK2)
| spl6_5 ),
inference(resolution,[],[f116,f55]) ).
fof(f191,plain,
( ~ less_than(sK3,sK2)
| ~ spl6_1
| spl6_5 ),
inference(resolution,[],[f189,f190]) ).
fof(f192,plain,
( $false
| ~ spl6_1
| spl6_5 ),
inference(forward_subsumption_resolution,[],[f191,f64]) ).
fof(f193,plain,
( ~ spl6_1
| spl6_5 ),
inference(avatar_contradiction_clause,[],[f192]) ).
cnf(s1,plain,
( spl6_1
| spl6_2 ),
inference(sat_conversion,[],[f86]) ).
cnf(s2,plain,
( spl6_1
| spl6_3 ),
inference(sat_conversion,[],[f96]) ).
cnf(s4,plain,
( ~ spl6_4
| ~ spl6_5 ),
inference(sat_conversion,[],[f117]) ).
cnf(s5,plain,
( ~ spl6_1
| spl6_4 ),
inference(sat_conversion,[],[f165]) ).
cnf(s7,plain,
( ~ spl6_2
| spl6_4 ),
inference(sat_conversion,[],[f178]) ).
cnf(s8,plain,
( ~ spl6_2
| ~ spl6_3
| spl6_5 ),
inference(sat_conversion,[],[f188]) ).
cnf(s9,plain,
( ~ spl6_1
| spl6_5 ),
inference(sat_conversion,[],[f193]) ).
cnf(s10,plain,
( ~ spl6_2
| ~ spl6_3 ),
inference(rat,[],[s4,s7,s8]) ).
cnf(s11,plain,
spl6_1,
inference(rat,[],[s10,s1,s2]) ).
cnf(s12,plain,
spl6_5,
inference(rat,[],[s9,s11]) ).
cnf(s13,plain,
spl6_4,
inference(rat,[],[s5,s11]) ).
cnf(s15,plain,
$false,
inference(rat,[],[s4,s12,s13]) ).
fof(f194,plain,
$false,
inference(avatar_sat_refutation,[],[s15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV401+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.25 % Computer : n015.cluster.edu
% 0.11/0.25 % Model : x86_64 x86_64
% 0.11/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.25 % Memory : 8046.5625MB
% 0.11/0.25 % OS : Linux 6.8.0-71-generic
% 0.11/0.25 % CPULimit : 300
% 0.11/0.25 % WCLimit : 300
% 0.11/0.25 % DateTime : Mon Sep 28 10:54:02 UTC 2026
% 0.11/0.26 % CPUTime :
% 0.11/0.26 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.26/0.31 Running first-order theorem proving
% 0.26/0.31 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.56/1.60 % (2541159)Detected formulas, will run a generic FOF schedule.
% 2.56/1.60 % (2541174)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=3902148761:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.56/1.60 % (2541178)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=630425264:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.56/1.60 % (2541177)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1896887410:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.56/1.60 % (2541176)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=3416102174:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.56/1.60 % (2541175)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=3444726755:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.56/1.60 % (2541179)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1261065073:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.56/1.60 % (2541179)First to succeed.
% 2.56/1.60 % (2541180)dis-21_1_sil=8000:lcm=predicate:random_seed=1946215430: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)
% 2.56/1.60 % (2541179)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2541159"
% 2.56/1.60 % (2541180)Refutation not found, incomplete strategy
% 2.56/1.60 % (2541180)------------------------------
% 2.56/1.60 % (2541180)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.56/1.60 % (2541180)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.56/1.60 % (2541180)CaDiCaL version: 2.1.3
% 2.56/1.60 % (2541180)Termination reason: Refutation not found, incomplete strategy
% 2.56/1.60 % (2541180)Time elapsed: 0.004 s
% 2.56/1.60 % (2541180)Peak memory usage: 88 MB
% 2.56/1.60 % (2541180)Instructions burned: 2 (million)
% 2.56/1.60 % (2541178)Instruction limit reached!
% 2.56/1.60 % (2541178)------------------------------
% 2.56/1.60 % (2541178)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.56/1.60 % (2541178)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.56/1.60 % (2541178)CaDiCaL version: 2.1.3
% 2.56/1.60 % (2541178)Termination reason: Instruction limit
% 2.56/1.60 % (2541178)Termination phase: Saturation
% 2.56/1.60 % (2541178)Time elapsed: 0.097 s
% 2.56/1.60 % (2541178)Peak memory usage: 88 MB
% 2.56/1.60 % (2541178)Instructions burned: 120 (million)
% 2.56/1.60 % (2541177)Instruction limit reached!
% 2.56/1.60 % (2541177)------------------------------
% 2.56/1.60 % (2541177)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.56/1.60 % (2541177)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.56/1.60 % (2541177)CaDiCaL version: 2.1.3
% 2.56/1.60 % (2541177)Termination reason: Instruction limit
% 2.56/1.60 % (2541177)Termination phase: Saturation
% 2.56/1.60 % (2541177)Time elapsed: 0.077 s
% 2.56/1.60 % (2541177)Peak memory usage: 88 MB
% 2.56/1.60 % (2541177)Instructions burned: 110 (million)
% 2.56/1.60 % (2541193)lrs+10_1_sil=32000:urr=on:br=off:random_seed=2332688963:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2996 on theBenchmark for (2996ds/157Mi)
% 2.56/1.60 % (2541192)lrs+10_1_sil=8000:sp=occurrence:random_seed=815722460:i=285:sd=3:ss=axioms:sgt=8_2996 on theBenchmark for (2996ds/285Mi)
% 2.56/1.60 % (2541179)Refutation found. Thanks to Tanya!
% 2.56/1.60 % SZS status Theorem for theBenchmark
% 2.56/1.60 % SZS output start Proof for theBenchmark
% See solution above
% 5.77/1.84 % (2541179)------------------------------
% 5.77/1.84 % (2541179)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.77/1.84 % (2541179)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.77/1.84 % (2541179)CaDiCaL version: 2.1.3
% 5.77/1.84 % (2541179)Termination reason: Refutation
% 5.77/1.84 % (2541179)Time elapsed: 0.009 s
% 5.77/1.84 % (2541179)Peak memory usage: 90 MB
% 5.77/1.84 % (2541179)Instructions burned: 10 (million)
% 5.77/1.84 % (2541179)------------------------------
% 5.77/1.84 % (2541179)------------------------------
% 5.77/1.84 % (2541159)Success in time 0.683 s
% 5.77/1.84 % Vampire exiting
%------------------------------------------------------------------------------