%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SYO091_8 : TPTP v9.3.1. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n011.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 02:25:05 PM UTC 2026
% Result : Theorem 2.04s 0.76s
% Output : Refutation 2.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 8
% Syntax : Number of formulae : 108 ( 7 unt; 0 typ; 6 def)
% Number of atoms : 538 ( 116 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 404 ( 150 ~; 217 |; 10 &)
% ( 26 <=>; 0 =>; 0 <=; 1 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 250 ( 194 fml; 56 var)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 12 ( 9 usr; 11 prp; 0-2 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 19 ( 0 sgn 13 !; 6 ?; 19 :)
% Comments :
%------------------------------------------------------------------------------
tff(func_def_2,type,
sK0: $o ).
tff(func_def_3,type,
sK1: $o ).
tff(func_def_4,type,
sK2: $o ).
tff(f1,conjecture,
! [X0: $o,X1: $o,X2: $o] :
( ( ( (X0)
<=> (X1) )
<=> (X2) )
<=> ( (X0)
<=> ( (X1)
<=> (X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM50Q) ).
tff(f2,negated_conjecture,
~ ! [X0: $o,X1: $o,X2: $o] :
( ( ( (X0)
<=> (X1) )
<=> (X2) )
<=> ( (X0)
<=> ( (X1)
<=> (X2) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
tff(f3,plain,
~ ! [X0: $o,X1: $o,X2: $o] :
( ( ( (X0)
<=> (X1) )
<=> (X2) )
<=> ( (X0)
<=> ( (X1)
<=> (X2) ) ) ),
inference(rectify,[],[f2]) ).
tff(f4,plain,
~ ! [X0: $o,X1: $o,X2: $o] :
( ( ( (X0) = (X1) )
<=> ( $true = (X2) ) )
<=> ( ( $true = (X0) )
<=> ( (X1) = (X2) ) ) ),
inference(fool_elimination,[],[f3]) ).
tff(f5,plain,
? [X0: $o,X1: $o,X2: $o] :
( ( ( (X0) = (X1) )
<=> ( $true = (X2) ) )
<~> ( ( $true = (X0) )
<=> ( (X1) = (X2) ) ) ),
inference(ennf_transformation,[],[f4]) ).
tff(f6,plain,
? [X0: $o,X1: $o,X2: $o] :
( ( ( ( ( (X1) != (X2) )
| ( $true != (X0) ) )
& ( ( (X1) = (X2) )
| ( $true = (X0) ) ) )
| ( ( ( $true != (X2) )
| ( (X0) != (X1) ) )
& ( ( $true = (X2) )
| ( (X0) = (X1) ) ) ) )
& ( ( ( ( $true = (X0) )
| ( (X1) != (X2) ) )
& ( ( (X1) = (X2) )
| ( $true != (X0) ) ) )
| ( ( ( (X0) = (X1) )
| ( $true != (X2) ) )
& ( ( $true = (X2) )
| ( (X0) != (X1) ) ) ) ) ),
inference(nnf_transformation,[],[f5]) ).
tff(f7,plain,
( ( ( ( ( sK1 != sK2 )
| ( $true != sK0 ) )
& ( ( sK1 = sK2 )
| ( $true = sK0 ) ) )
| ( ( ( $true != sK2 )
| ( sK0 != sK1 ) )
& ( ( $true = sK2 )
| ( sK0 = sK1 ) ) ) )
& ( ( ( ( $true = sK0 )
| ( sK1 != sK2 ) )
& ( ( sK1 = sK2 )
| ( $true != sK0 ) ) )
| ( ( ( sK0 = sK1 )
| ( $true != sK2 ) )
& ( ( $true = sK2 )
| ( sK0 != sK1 ) ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f6]) ).
tff(f8,plain,
( ( sK1 = sK2 )
| ( $true != sK0 )
| ( $true = sK2 )
| ( sK0 != sK1 ) ),
inference(cnf_transformation,[],[f7]) ).
tff(f9,plain,
( ( sK1 = sK2 )
| ( $true != sK0 )
| ( sK0 = sK1 )
| ( $true != sK2 ) ),
inference(cnf_transformation,[],[f7]) ).
tff(f10,plain,
( ( $true = sK0 )
| ( sK1 != sK2 )
| ( $true = sK2 )
| ( sK0 != sK1 ) ),
inference(cnf_transformation,[],[f7]) ).
tff(f11,plain,
( ( $true = sK0 )
| ( sK1 != sK2 )
| ( sK0 = sK1 )
| ( $true != sK2 ) ),
inference(cnf_transformation,[],[f7]) ).
tff(f12,plain,
( ( sK1 = sK2 )
| ( $true = sK0 )
| ( $true = sK2 )
| ( sK0 = sK1 ) ),
inference(cnf_transformation,[],[f7]) ).
tff(f13,plain,
( ( sK1 = sK2 )
| ( $true = sK0 )
| ( $true != sK2 )
| ( sK0 != sK1 ) ),
inference(cnf_transformation,[],[f7]) ).
tff(f14,plain,
( ( sK1 != sK2 )
| ( $true != sK0 )
| ( $true = sK2 )
| ( sK0 = sK1 ) ),
inference(cnf_transformation,[],[f7]) ).
tff(f15,plain,
( ( sK1 != sK2 )
| ( $true != sK0 )
| ( $true != sK2 )
| ( sK0 != sK1 ) ),
inference(cnf_transformation,[],[f7]) ).
tff(f17,plain,
! [X0: $o] :
( ( $false = (X0) )
| ( $true = (X0) ) ),
introduced(definition,[],[fool_exhaustiveness_axiom]) ).
tff(f19,definition,
( spl3_1
<=> ( sK0 = sK1 ) ),
introduced(definition,[new_symbols(definition,[spl3_1])],[avatar_definition]) ).
tff(f20,plain,
( ( sK0 = sK1 )
| ~ spl3_1 ),
inference(avatar_component_clause,[],[f19]) ).
tff(f21,plain,
( ( sK0 != sK1 )
| spl3_1 ),
inference(avatar_component_clause,[],[f19]) ).
tff(f23,definition,
( spl3_2
<=> ( $true = sK2 ) ),
introduced(definition,[new_symbols(definition,[spl3_2])],[avatar_definition]) ).
tff(f24,plain,
( ( $true != sK2 )
| spl3_2 ),
inference(avatar_component_clause,[],[f23]) ).
tff(f25,plain,
( ( $true = sK2 )
| ~ spl3_2 ),
inference(avatar_component_clause,[],[f23]) ).
tff(f27,definition,
( spl3_3
<=> ( $true = sK0 ) ),
introduced(definition,[new_symbols(definition,[spl3_3])],[avatar_definition]) ).
tff(f28,plain,
( ( $true = sK0 )
| ~ spl3_3 ),
inference(avatar_component_clause,[],[f27]) ).
tff(f29,plain,
( ( $true != sK0 )
| spl3_3 ),
inference(avatar_component_clause,[],[f27]) ).
tff(f31,definition,
( spl3_4
<=> ( sK1 = sK2 ) ),
introduced(definition,[new_symbols(definition,[spl3_4])],[avatar_definition]) ).
tff(f32,plain,
( ( sK1 != sK2 )
| spl3_4 ),
inference(avatar_component_clause,[],[f31]) ).
tff(f33,plain,
( ( sK1 = sK2 )
| ~ spl3_4 ),
inference(avatar_component_clause,[],[f31]) ).
tff(f34,plain,
( ~ spl3_1
| spl3_2
| ~ spl3_3
| spl3_4 ),
inference(avatar_split_clause,[],[f8,f31,f27,f23,f19]) ).
tff(f35,plain,
( ~ spl3_2
| spl3_1
| ~ spl3_3
| spl3_4 ),
inference(avatar_split_clause,[],[f9,f31,f27,f19,f23]) ).
tff(f36,plain,
( ~ spl3_1
| spl3_2
| ~ spl3_4
| spl3_3 ),
inference(avatar_split_clause,[],[f10,f27,f31,f23,f19]) ).
tff(f37,plain,
( ~ spl3_2
| spl3_1
| ~ spl3_4
| spl3_3 ),
inference(avatar_split_clause,[],[f11,f27,f31,f19,f23]) ).
tff(f38,plain,
( spl3_1
| spl3_2
| spl3_3
| spl3_4 ),
inference(avatar_split_clause,[],[f12,f31,f27,f23,f19]) ).
tff(f39,plain,
( ~ spl3_1
| ~ spl3_2
| spl3_3
| spl3_4 ),
inference(avatar_split_clause,[],[f13,f31,f27,f23,f19]) ).
tff(f40,plain,
( spl3_1
| spl3_2
| ~ spl3_3
| ~ spl3_4 ),
inference(avatar_split_clause,[],[f14,f31,f27,f23,f19]) ).
tff(f41,plain,
( ~ spl3_1
| ~ spl3_2
| ~ spl3_3
| ~ spl3_4 ),
inference(avatar_split_clause,[],[f15,f31,f27,f23,f19]) ).
tff(f42,plain,
( ( $true != sK1 )
| ~ spl3_2
| spl3_4 ),
inference(forward_demodulation,[],[f32,f25]) ).
tff(f46,plain,
( ( sK0 != $false )
| ( $true = sK1 )
| spl3_1 ),
inference(superposition,[],[f21,f17]) ).
tff(f50,plain,
( ( sK0 != $false )
| spl3_1
| ~ spl3_2
| spl3_4 ),
inference(forward_subsumption_resolution,[],[f46,f42]) ).
tff(f51,plain,
( ( $false != $false )
| ( $true = sK0 )
| spl3_1
| ~ spl3_2
| spl3_4 ),
inference(superposition,[],[f50,f17]) ).
tff(f52,plain,
( ( $true = sK0 )
| spl3_1
| ~ spl3_2
| spl3_4 ),
inference(trivial_inequality_removal,[],[f51]) ).
tff(f53,plain,
( $false
| spl3_1
| ~ spl3_2
| spl3_3
| spl3_4 ),
inference(forward_subsumption_resolution,[],[f52,f29]) ).
tff(f54,plain,
( spl3_1
| ~ spl3_2
| spl3_3
| spl3_4 ),
inference(avatar_contradiction_clause,[],[f53]) ).
tff(f55,plain,
( ( $true = sK1 )
| ~ spl3_2
| ~ spl3_4 ),
inference(forward_demodulation,[],[f33,f25]) ).
tff(f57,definition,
( spl3_5
<=> ( $true = sK1 ) ),
introduced(definition,[new_symbols(definition,[spl3_5])],[avatar_definition]) ).
tff(f58,plain,
( ( $true != sK1 )
| spl3_5 ),
inference(avatar_component_clause,[],[f57]) ).
tff(f59,plain,
( ( $true = sK1 )
| ~ spl3_5 ),
inference(avatar_component_clause,[],[f57]) ).
tff(f61,definition,
( spl3_6
<=> ( sK0 = $false ) ),
introduced(definition,[new_symbols(definition,[spl3_6])],[avatar_definition]) ).
tff(f63,plain,
( ( sK0 != $false )
| spl3_6 ),
inference(avatar_component_clause,[],[f61]) ).
tff(f65,plain,
( spl3_5
| ~ spl3_2
| ~ spl3_4 ),
inference(avatar_split_clause,[],[f55,f31,f23,f57]) ).
tff(f69,plain,
( ( $true != sK0 )
| spl3_1
| ~ spl3_5 ),
inference(superposition,[],[f21,f59]) ).
tff(f71,plain,
( $false
| spl3_1
| ~ spl3_3
| ~ spl3_5 ),
inference(forward_subsumption_resolution,[],[f69,f28]) ).
tff(f72,plain,
( spl3_1
| ~ spl3_3
| ~ spl3_5 ),
inference(avatar_contradiction_clause,[],[f71]) ).
tff(f75,plain,
( ( sK1 != $false )
| ( $true = sK2 )
| spl3_4 ),
inference(superposition,[],[f32,f17]) ).
tff(f76,plain,
( ( sK1 != $false )
| spl3_2
| spl3_4 ),
inference(forward_subsumption_resolution,[],[f75,f24]) ).
tff(f78,plain,
( ( $false != $false )
| ( $true = sK1 )
| spl3_2
| spl3_4 ),
inference(superposition,[],[f76,f17]) ).
tff(f79,plain,
( ( $true = sK1 )
| spl3_2
| spl3_4 ),
inference(trivial_inequality_removal,[],[f78]) ).
tff(f80,plain,
( $false
| spl3_2
| spl3_4
| spl3_5 ),
inference(forward_subsumption_resolution,[],[f79,f58]) ).
tff(f81,plain,
( spl3_2
| spl3_4
| spl3_5 ),
inference(avatar_contradiction_clause,[],[f80]) ).
tff(f82,plain,
( ( $true = sK1 )
| ~ spl3_1
| ~ spl3_3 ),
inference(forward_demodulation,[],[f20,f28]) ).
tff(f83,plain,
( ~ spl3_5
| ~ spl3_2
| spl3_4 ),
inference(avatar_split_clause,[],[f42,f31,f23,f57]) ).
tff(f89,plain,
( spl3_5
| ~ spl3_1
| ~ spl3_3 ),
inference(avatar_split_clause,[],[f82,f27,f19,f57]) ).
tff(f98,plain,
( ( $true = sK0 )
| ~ spl3_1
| ~ spl3_5 ),
inference(superposition,[],[f20,f59]) ).
tff(f104,plain,
( spl3_3
| ~ spl3_1
| ~ spl3_5 ),
inference(avatar_split_clause,[],[f98,f57,f19,f27]) ).
tff(f105,plain,
( ( sK0 = sK2 )
| ~ spl3_1
| ~ spl3_4 ),
inference(forward_demodulation,[],[f33,f20]) ).
tff(f109,plain,
( ( $true = sK2 )
| ~ spl3_1
| ~ spl3_3
| ~ spl3_4 ),
inference(forward_demodulation,[],[f105,f28]) ).
tff(f110,plain,
( $false
| ~ spl3_1
| spl3_2
| ~ spl3_3
| ~ spl3_4 ),
inference(forward_subsumption_resolution,[],[f109,f24]) ).
tff(f111,plain,
( ~ spl3_1
| spl3_2
| ~ spl3_3
| ~ spl3_4 ),
inference(avatar_contradiction_clause,[],[f110]) ).
tff(f112,plain,
( ( sK0 != $false )
| ( $true = sK1 )
| spl3_1 ),
inference(superposition,[],[f21,f17]) ).
tff(f113,plain,
( spl3_5
| ~ spl3_6
| spl3_1 ),
inference(avatar_split_clause,[],[f112,f19,f61,f57]) ).
tff(f116,plain,
( ( $true != sK1 )
| spl3_2
| ~ spl3_4 ),
inference(superposition,[],[f24,f33]) ).
tff(f117,plain,
( ~ spl3_5
| spl3_2
| ~ spl3_4 ),
inference(avatar_split_clause,[],[f116,f31,f23,f57]) ).
tff(f121,plain,
( ( $false != $false )
| ( $true = sK0 )
| spl3_6 ),
inference(superposition,[],[f63,f17]) ).
tff(f122,plain,
( ( $true = sK0 )
| spl3_6 ),
inference(trivial_inequality_removal,[],[f121]) ).
tff(f123,plain,
( $false
| spl3_3
| spl3_6 ),
inference(forward_subsumption_resolution,[],[f122,f29]) ).
tff(f124,plain,
( spl3_3
| spl3_6 ),
inference(avatar_contradiction_clause,[],[f123]) ).
cnf(s1,plain,
( ~ spl3_1
| spl3_2
| ~ spl3_3
| spl3_4 ),
inference(sat_conversion,[],[f34]) ).
cnf(s2,plain,
( spl3_1
| ~ spl3_2
| ~ spl3_3
| spl3_4 ),
inference(sat_conversion,[],[f35]) ).
cnf(s3,plain,
( ~ spl3_1
| spl3_2
| spl3_3
| ~ spl3_4 ),
inference(sat_conversion,[],[f36]) ).
cnf(s4,plain,
( spl3_1
| ~ spl3_2
| spl3_3
| ~ spl3_4 ),
inference(sat_conversion,[],[f37]) ).
cnf(s5,plain,
( spl3_1
| spl3_2
| spl3_3
| spl3_4 ),
inference(sat_conversion,[],[f38]) ).
cnf(s6,plain,
( ~ spl3_1
| ~ spl3_2
| spl3_3
| spl3_4 ),
inference(sat_conversion,[],[f39]) ).
cnf(s7,plain,
( spl3_1
| spl3_2
| ~ spl3_3
| ~ spl3_4 ),
inference(sat_conversion,[],[f40]) ).
cnf(s8,plain,
( ~ spl3_1
| ~ spl3_2
| ~ spl3_3
| ~ spl3_4 ),
inference(sat_conversion,[],[f41]) ).
cnf(s9,plain,
( spl3_1
| ~ spl3_2
| spl3_3
| spl3_4 ),
inference(sat_conversion,[],[f54]) ).
cnf(s11,plain,
( ~ spl3_2
| ~ spl3_4
| spl3_5 ),
inference(sat_conversion,[],[f65]) ).
cnf(s12,plain,
( spl3_1
| ~ spl3_3
| ~ spl3_5 ),
inference(sat_conversion,[],[f72]) ).
cnf(s13,plain,
( spl3_2
| spl3_4
| spl3_5 ),
inference(sat_conversion,[],[f81]) ).
cnf(s14,plain,
( ~ spl3_2
| spl3_4
| ~ spl3_5 ),
inference(sat_conversion,[],[f83]) ).
cnf(s16,plain,
( ~ spl3_1
| ~ spl3_3
| spl3_5 ),
inference(sat_conversion,[],[f89]) ).
cnf(s21,plain,
( ~ spl3_1
| spl3_3
| ~ spl3_5 ),
inference(sat_conversion,[],[f104]) ).
cnf(s23,plain,
( ~ spl3_1
| spl3_2
| ~ spl3_3
| ~ spl3_4 ),
inference(sat_conversion,[],[f111]) ).
cnf(s24,plain,
( spl3_1
| spl3_5
| ~ spl3_6 ),
inference(sat_conversion,[],[f113]) ).
cnf(s25,plain,
( spl3_2
| ~ spl3_4
| ~ spl3_5 ),
inference(sat_conversion,[],[f117]) ).
cnf(s27,plain,
( spl3_3
| spl3_6 ),
inference(sat_conversion,[],[f124]) ).
cnf(s28,plain,
( spl3_3
| spl3_2
| spl3_1 ),
inference(rat,[],[s25,s24,s5,s27]) ).
cnf(s29,plain,
( spl3_2
| spl3_1 ),
inference(rat,[],[s13,s7,s12,s28]) ).
cnf(s30,plain,
( spl3_3
| ~ spl3_2
| spl3_1 ),
inference(rat,[],[s4,s9]) ).
cnf(s31,plain,
( ~ spl3_2
| spl3_1 ),
inference(rat,[],[s11,s2,s12,s30]) ).
cnf(s32,plain,
spl3_1,
inference(rat,[],[s31,s29]) ).
cnf(s33,plain,
( spl3_3
| spl3_2 ),
inference(rat,[],[s13,s3,s21,s32]) ).
cnf(s34,plain,
( ~ spl3_3
| spl3_2 ),
inference(rat,[],[s1,s23,s32]) ).
cnf(s35,plain,
spl3_2,
inference(rat,[],[s34,s33]) ).
cnf(s36,plain,
spl3_3,
inference(rat,[],[s11,s6,s21,s35,s32]) ).
cnf(s37,plain,
spl3_5,
inference(rat,[],[s16,s32,s36]) ).
cnf(s38,plain,
~ spl3_4,
inference(rat,[],[s8,s32,s35,s36]) ).
cnf(s39,plain,
$false,
inference(rat,[],[s14,s35,s37,s38]) ).
tff(f125,plain,
$false,
inference(avatar_sat_refutation,[],[s39]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYO091_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.19 % Computer : n011.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Mon Sep 28 17:27:01 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.22 Running first-order theorem proving
% 0.08/0.22 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.04/0.76 % (3557384)Detected formulas, will run a generic FOF schedule.
% 2.04/0.76 % (3557475)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3935739163:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.04/0.76 % (3557475)First to succeed.
% 2.04/0.76 % (3557469)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=2841087692:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.04/0.76 % (3557473)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2417222088:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.04/0.76 % (3557468)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=2629865151:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.04/0.76 % (3557475)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3557384"
% 2.04/0.76 % (3557470)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=4257062411:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.04/0.76 % (3557477)dis-21_1_sil=8000:lcm=predicate:random_seed=2855524286: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.04/0.76 % (3557472)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2795537526:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.04/0.76 % (3557477)Refutation not found, incomplete strategy
% 2.04/0.76 % (3557477)------------------------------
% 2.04/0.76 % (3557477)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.04/0.76 % (3557477)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.04/0.76 % (3557477)CaDiCaL version: 2.1.3
% 2.04/0.76 % (3557477)Termination reason: Refutation not found, incomplete strategy
% 2.04/0.76 % (3557477)Time elapsed: 0.001 s
% 2.04/0.76 % (3557477)Peak memory usage: 88 MB
% 2.04/0.76 % (3557473)Also succeeded, but the first one will report.
% 2.04/0.76 % (3557472)Also succeeded, but the first one will report.
% 2.04/0.76 % (3557475)Refutation found. Thanks to Tanya!
% 2.04/0.76 % SZS status Theorem for theBenchmark
% 2.04/0.76 % SZS output start Proof for theBenchmark
% See solution above
% 2.54/0.87 % (3557475)------------------------------
% 2.54/0.87 % (3557475)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.54/0.87 % (3557475)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.54/0.87 % (3557475)CaDiCaL version: 2.1.3
% 2.54/0.87 % (3557475)Termination reason: Refutation
% 2.54/0.87 % (3557475)Time elapsed: 0.003 s
% 2.54/0.87 % (3557475)Peak memory usage: 90 MB
% 2.54/0.87 % (3557475)Instructions burned: 4 (million)
% 2.54/0.87 % (3557475)------------------------------
% 2.54/0.87 % (3557475)------------------------------
% 2.54/0.87 % (3557384)Success in time 0.326 s
% 2.54/0.87 % Vampire exiting
%------------------------------------------------------------------------------