%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU137+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n001.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 12:47:22 PM UTC 2026
% Result : Theorem 1.73s 6.31s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 10
% Syntax : Number of formulae : 79 ( 8 unt; 5 def)
% Number of atoms : 283 ( 35 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 325 ( 121 ~; 141 |; 45 &)
% ( 11 <=>; 6 =>; 0 <=; 1 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 5 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-3 aty)
% Number of variables : 121 ( 0 sgn 111 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0,X1,X2] :
( X2 = set_union2(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X0)
| in(X3,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_xboole_0) ).
fof(f4,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(f5,axiom,
! [X0,X1,X2] :
( X2 = set_difference(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X0)
& ~ in(X3,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_xboole_0) ).
fof(f17,axiom,
! [X0,X1] :
( ! [X2] :
( in(X2,X0)
<=> in(X2,X1) )
=> X0 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_tarski) ).
fof(f19,conjecture,
! [X0,X1] :
( subset(X0,X1)
=> X1 = set_union2(X0,set_difference(X1,X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t45_xboole_1) ).
fof(f20,negated_conjecture,
~ ! [X0,X1] :
( subset(X0,X1)
=> X1 = set_union2(X0,set_difference(X1,X0)) ),
inference(negated_conjecture,[status(cth)],[f19]) ).
fof(f27,plain,
! [X0,X1] :
( subset(X0,X1)
=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
inference(unused_predicate_definition_removal,[],[f4]) ).
fof(f29,plain,
! [X0,X1] :
( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f27]) ).
fof(f32,plain,
! [X0,X1] :
( X0 = X1
| ? [X2] :
( in(X2,X0)
<~> in(X2,X1) ) ),
inference(ennf_transformation,[],[f17]) ).
fof(f33,plain,
? [X0,X1] :
( set_union2(X0,set_difference(X1,X0)) != X1
& subset(X0,X1) ),
inference(ennf_transformation,[],[f20]) ).
fof(f37,plain,
! [X0,X1,X2] :
( ( X2 = set_union2(X0,X1)
| ? [X3] :
( ( ( ~ in(X3,X0)
& ~ in(X3,X1) )
| ~ in(X3,X2) )
& ( in(X3,X0)
| in(X3,X1)
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ( ~ in(X3,X0)
& ~ in(X3,X1) ) )
& ( in(X3,X0)
| in(X3,X1)
| ~ in(X3,X2) ) )
| set_union2(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f38,plain,
! [X0,X1,X2] :
( ( X2 = set_union2(X0,X1)
| ? [X3] :
( ( ( ~ in(X3,X0)
& ~ in(X3,X1) )
| ~ in(X3,X2) )
& ( in(X3,X0)
| in(X3,X1)
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ( ~ in(X3,X0)
& ~ in(X3,X1) ) )
& ( in(X3,X0)
| in(X3,X1)
| ~ in(X3,X2) ) )
| set_union2(X0,X1) != X2 ) ),
inference(flattening,[],[f37]) ).
fof(f39,plain,
! [X0,X1,X2] :
( ( X2 = set_union2(X0,X1)
| ? [X3] :
( ( ( ~ in(X3,X0)
& ~ in(X3,X1) )
| ~ in(X3,X2) )
& ( in(X3,X0)
| in(X3,X1)
| in(X3,X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( ~ in(X4,X0)
& ~ in(X4,X1) ) )
& ( in(X4,X0)
| in(X4,X1)
| ~ in(X4,X2) ) )
| set_union2(X0,X1) != X2 ) ),
inference(rectify,[],[f38]) ).
fof(f40,plain,
! [X0,X1,X2] :
( ( X2 = set_union2(X0,X1)
| ( ( ( ~ in(sK0(X0,X1,X2),X0)
& ~ in(sK0(X0,X1,X2),X1) )
| ~ in(sK0(X0,X1,X2),X2) )
& ( in(sK0(X0,X1,X2),X0)
| in(sK0(X0,X1,X2),X1)
| in(sK0(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( ~ in(X4,X0)
& ~ in(X4,X1) ) )
& ( in(X4,X0)
| in(X4,X1)
| ~ in(X4,X2) ) )
| set_union2(X0,X1) != X2 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X3,sK0(X0,X1,X2))],[f39]) ).
fof(f41,plain,
! [X0,X1,X2] :
( ( X2 = set_difference(X0,X1)
| ? [X3] :
( ( ~ in(X3,X0)
| in(X3,X1)
| ~ in(X3,X2) )
& ( ( in(X3,X0)
& ~ in(X3,X1) )
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ~ in(X3,X0)
| in(X3,X1) )
& ( ( in(X3,X0)
& ~ in(X3,X1) )
| ~ in(X3,X2) ) )
| set_difference(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f42,plain,
! [X0,X1,X2] :
( ( X2 = set_difference(X0,X1)
| ? [X3] :
( ( ~ in(X3,X0)
| in(X3,X1)
| ~ in(X3,X2) )
& ( ( in(X3,X0)
& ~ in(X3,X1) )
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ~ in(X3,X0)
| in(X3,X1) )
& ( ( in(X3,X0)
& ~ in(X3,X1) )
| ~ in(X3,X2) ) )
| set_difference(X0,X1) != X2 ) ),
inference(flattening,[],[f41]) ).
fof(f43,plain,
! [X0,X1,X2] :
( ( X2 = set_difference(X0,X1)
| ? [X3] :
( ( ~ in(X3,X0)
| in(X3,X1)
| ~ in(X3,X2) )
& ( ( in(X3,X0)
& ~ in(X3,X1) )
| in(X3,X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ~ in(X4,X0)
| in(X4,X1) )
& ( ( in(X4,X0)
& ~ in(X4,X1) )
| ~ in(X4,X2) ) )
| set_difference(X0,X1) != X2 ) ),
inference(rectify,[],[f42]) ).
fof(f44,plain,
! [X0,X1,X2] :
( ( X2 = set_difference(X0,X1)
| ( ( ~ in(sK1(X0,X1,X2),X0)
| in(sK1(X0,X1,X2),X1)
| ~ in(sK1(X0,X1,X2),X2) )
& ( ( in(sK1(X0,X1,X2),X0)
& ~ in(sK1(X0,X1,X2),X1) )
| in(sK1(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ~ in(X4,X0)
| in(X4,X1) )
& ( ( in(X4,X0)
& ~ in(X4,X1) )
| ~ in(X4,X2) ) )
| set_difference(X0,X1) != X2 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X3,sK1(X0,X1,X2))],[f43]) ).
fof(f47,plain,
! [X0,X1] :
( X0 = X1
| ? [X2] :
( ( ~ in(X2,X1)
| ~ in(X2,X0) )
& ( in(X2,X1)
| in(X2,X0) ) ) ),
inference(nnf_transformation,[],[f32]) ).
fof(f48,plain,
! [X0,X1] :
( X0 = X1
| ( ( ~ in(sK4(X0,X1),X1)
| ~ in(sK4(X0,X1),X0) )
& ( in(sK4(X0,X1),X1)
| in(sK4(X0,X1),X0) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(X2,sK4(X0,X1))],[f47]) ).
fof(f49,plain,
( sK6 != set_union2(sK5,set_difference(sK6,sK5))
& subset(sK5,sK6) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5,sK6]),skolemize(X0,sK5),skolemize(X1,sK6)],[f33]) ).
fof(f52,plain,
! [X2,X0,X1,X4] :
( in(X4,X0)
| in(X4,X1)
| ~ in(X4,X2)
| set_union2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f40]) ).
fof(f53,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| ~ in(X4,X1)
| set_union2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f40]) ).
fof(f54,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| ~ in(X4,X0)
| set_union2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f40]) ).
fof(f58,plain,
! [X2,X0,X1] :
( ~ subset(X0,X1)
| ~ in(X2,X0)
| in(X2,X1) ),
inference(cnf_transformation,[],[f29]) ).
fof(f60,plain,
! [X2,X0,X1,X4] :
( in(X4,X0)
| ~ in(X4,X2)
| set_difference(X0,X1) != X2 ),
inference(cnf_transformation,[],[f44]) ).
fof(f61,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| ~ in(X4,X0)
| in(X4,X1)
| set_difference(X0,X1) != X2 ),
inference(cnf_transformation,[],[f44]) ).
fof(f73,plain,
! [X0,X1] :
( X0 = X1
| in(sK4(X0,X1),X1)
| in(sK4(X0,X1),X0) ),
inference(cnf_transformation,[],[f48]) ).
fof(f74,plain,
! [X0,X1] :
( X0 = X1
| ~ in(sK4(X0,X1),X1)
| ~ in(sK4(X0,X1),X0) ),
inference(cnf_transformation,[],[f48]) ).
fof(f76,plain,
subset(sK5,sK6),
inference(cnf_transformation,[],[f49]) ).
fof(f77,plain,
sK6 != set_union2(sK5,set_difference(sK6,sK5)),
inference(cnf_transformation,[],[f49]) ).
fof(f82,plain,
! [X0,X1,X4] :
( in(X4,set_union2(X0,X1))
| ~ in(X4,X0) ),
inference(equality_resolution,[],[f54]) ).
fof(f83,plain,
! [X0,X1,X4] :
( in(X4,set_union2(X0,X1))
| ~ in(X4,X1) ),
inference(equality_resolution,[],[f53]) ).
fof(f84,plain,
! [X0,X1,X4] :
( ~ in(X4,set_union2(X0,X1))
| in(X4,X1)
| in(X4,X0) ),
inference(equality_resolution,[],[f52]) ).
fof(f85,plain,
! [X0,X1,X4] :
( in(X4,set_difference(X0,X1))
| ~ in(X4,X0)
| in(X4,X1) ),
inference(equality_resolution,[],[f61]) ).
fof(f86,plain,
! [X0,X1,X4] :
( ~ in(X4,set_difference(X0,X1))
| in(X4,X0) ),
inference(equality_resolution,[],[f60]) ).
fof(f88,definition,
! [X0,X1] :
( sQ7_eqProxy(X0,X1)
<=> X0 = X1 ),
introduced(definition,[new_symbols(definition,[sQ7_eqProxy])],[equality_proxy_definition]) ).
fof(f98,plain,
! [X0,X1] :
( sQ7_eqProxy(X0,X1)
| ~ in(sK4(X0,X1),X1)
| ~ in(sK4(X0,X1),X0) ),
inference(equality_proxy_replacement,[],[f74,f88]) ).
fof(f99,plain,
! [X0,X1] :
( sQ7_eqProxy(X0,X1)
| in(sK4(X0,X1),X1)
| in(sK4(X0,X1),X0) ),
inference(equality_proxy_replacement,[],[f73,f88]) ).
fof(f101,plain,
~ sQ7_eqProxy(sK6,set_union2(sK5,set_difference(sK6,sK5))),
inference(equality_proxy_replacement,[],[f77,f88]) ).
fof(f136,plain,
! [X0] :
( in(X0,sK6)
| ~ in(X0,sK5) ),
inference(resolution,[],[f58,f76]) ).
fof(f156,plain,
( ~ in(sK4(sK6,set_union2(sK5,set_difference(sK6,sK5))),set_union2(sK5,set_difference(sK6,sK5)))
| ~ in(sK4(sK6,set_union2(sK5,set_difference(sK6,sK5))),sK6) ),
inference(resolution,[],[f98,f101]) ).
fof(f166,definition,
( spl8_5
<=> in(sK4(sK6,set_union2(sK5,set_difference(sK6,sK5))),sK6) ),
introduced(definition,[new_symbols(definition,[spl8_5])],[avatar_definition]) ).
fof(f167,plain,
( ~ in(sK4(sK6,set_union2(sK5,set_difference(sK6,sK5))),sK6)
| spl8_5 ),
inference(avatar_component_clause,[],[f166]) ).
fof(f169,definition,
( spl8_6
<=> in(sK4(sK6,set_union2(sK5,set_difference(sK6,sK5))),set_union2(sK5,set_difference(sK6,sK5))) ),
introduced(definition,[new_symbols(definition,[spl8_6])],[avatar_definition]) ).
fof(f170,plain,
( ~ in(sK4(sK6,set_union2(sK5,set_difference(sK6,sK5))),set_union2(sK5,set_difference(sK6,sK5)))
| spl8_6 ),
inference(avatar_component_clause,[],[f169]) ).
fof(f171,plain,
( ~ spl8_5
| ~ spl8_6 ),
inference(avatar_split_clause,[],[f156,f169,f166]) ).
fof(f172,plain,
( ~ in(sK4(sK6,set_union2(sK5,set_difference(sK6,sK5))),set_difference(sK6,sK5))
| spl8_6 ),
inference(resolution,[],[f170,f83]) ).
fof(f173,plain,
( ~ in(sK4(sK6,set_union2(sK5,set_difference(sK6,sK5))),sK5)
| spl8_6 ),
inference(resolution,[],[f170,f82]) ).
fof(f174,plain,
( ~ in(sK4(sK6,set_union2(sK5,set_difference(sK6,sK5))),sK6)
| in(sK4(sK6,set_union2(sK5,set_difference(sK6,sK5))),sK5)
| spl8_6 ),
inference(resolution,[],[f172,f85]) ).
fof(f176,definition,
( spl8_7
<=> in(sK4(sK6,set_union2(sK5,set_difference(sK6,sK5))),sK5) ),
introduced(definition,[new_symbols(definition,[spl8_7])],[avatar_definition]) ).
fof(f177,plain,
( in(sK4(sK6,set_union2(sK5,set_difference(sK6,sK5))),sK5)
| ~ spl8_7 ),
inference(avatar_component_clause,[],[f176]) ).
fof(f178,plain,
( spl8_7
| ~ spl8_5
| spl8_6 ),
inference(avatar_split_clause,[],[f174,f169,f166,f176]) ).
fof(f179,plain,
( ~ in(sK4(sK6,set_union2(sK5,set_difference(sK6,sK5))),sK5)
| spl8_5 ),
inference(resolution,[],[f167,f136]) ).
fof(f188,plain,
( in(sK4(sK6,set_union2(sK5,set_difference(sK6,sK5))),set_union2(sK5,set_difference(sK6,sK5)))
| in(sK4(sK6,set_union2(sK5,set_difference(sK6,sK5))),sK6) ),
inference(resolution,[],[f99,f101]) ).
fof(f194,plain,
( in(sK4(sK6,set_union2(sK5,set_difference(sK6,sK5))),set_union2(sK5,set_difference(sK6,sK5)))
| ~ spl8_6 ),
inference(avatar_component_clause,[],[f169]) ).
fof(f195,plain,
( spl8_5
| spl8_6 ),
inference(avatar_split_clause,[],[f188,f169,f166]) ).
fof(f200,definition,
( spl8_9
<=> in(sK4(sK6,set_union2(sK5,set_difference(sK6,sK5))),set_difference(sK6,sK5)) ),
introduced(definition,[new_symbols(definition,[spl8_9])],[avatar_definition]) ).
fof(f201,plain,
( in(sK4(sK6,set_union2(sK5,set_difference(sK6,sK5))),set_difference(sK6,sK5))
| ~ spl8_9 ),
inference(avatar_component_clause,[],[f200]) ).
fof(f207,plain,
( $false
| spl8_5
| ~ spl8_7 ),
inference(resolution,[],[f177,f179]) ).
fof(f211,plain,
( spl8_5
| ~ spl8_7 ),
inference(avatar_contradiction_clause,[],[f207]) ).
fof(f214,plain,
( $false
| spl8_6
| ~ spl8_7 ),
inference(resolution,[],[f173,f177]) ).
fof(f215,plain,
( spl8_6
| ~ spl8_7 ),
inference(avatar_contradiction_clause,[],[f214]) ).
fof(f217,plain,
( in(sK4(sK6,set_union2(sK5,set_difference(sK6,sK5))),set_difference(sK6,sK5))
| in(sK4(sK6,set_union2(sK5,set_difference(sK6,sK5))),sK5)
| ~ spl8_6 ),
inference(resolution,[],[f194,f84]) ).
fof(f220,plain,
( spl8_7
| spl8_9
| ~ spl8_6 ),
inference(avatar_split_clause,[],[f217,f169,f200,f176]) ).
fof(f222,plain,
( in(sK4(sK6,set_union2(sK5,set_difference(sK6,sK5))),sK6)
| ~ spl8_9 ),
inference(resolution,[],[f201,f86]) ).
fof(f225,plain,
( spl8_5
| ~ spl8_9 ),
inference(avatar_split_clause,[],[f222,f200,f166]) ).
cnf(s4,plain,
( ~ spl8_5
| ~ spl8_6 ),
inference(sat_conversion,[],[f171]) ).
cnf(s5,plain,
( ~ spl8_5
| spl8_6
| spl8_7 ),
inference(sat_conversion,[],[f178]) ).
cnf(s8,plain,
( spl8_5
| spl8_6 ),
inference(sat_conversion,[],[f195]) ).
cnf(s10,plain,
( spl8_5
| ~ spl8_7 ),
inference(sat_conversion,[],[f211]) ).
cnf(s11,plain,
( spl8_6
| ~ spl8_7 ),
inference(sat_conversion,[],[f215]) ).
cnf(s12,plain,
( ~ spl8_6
| spl8_7
| spl8_9 ),
inference(sat_conversion,[],[f220]) ).
cnf(s13,plain,
( spl8_5
| ~ spl8_9 ),
inference(sat_conversion,[],[f225]) ).
cnf(s14,plain,
spl8_5,
inference(rat,[],[s12,s8,s10,s13]) ).
cnf(s15,plain,
~ spl8_6,
inference(rat,[],[s4,s14]) ).
cnf(s16,plain,
~ spl8_7,
inference(rat,[],[s11,s15]) ).
cnf(s17,plain,
$false,
inference(rat,[],[s5,s14,s16,s15]) ).
fof(f226,plain,
$false,
inference(avatar_sat_refutation,[],[s17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU137+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/5.38 % Computer : n001.cluster.edu
% 0.10/5.38 % Model : x86_64 x86_64
% 0.10/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.38 % Memory : 8046.5625MB
% 0.10/5.38 % OS : Linux 6.8.0-71-generic
% 0.10/5.38 % CPULimit : 300
% 0.10/5.38 % WCLimit : 300
% 0.10/5.38 % DateTime : Mon Sep 28 03:47:08 UTC 2026
% 0.10/5.38 % CPUTime :
% 0.10/5.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/5.42 Running first-order theorem proving
% 0.15/5.42 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
% 1.73/6.31 % (4190982)Detected formulas, will run a generic FOF schedule.
% 1.73/6.31 % (4190989)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=2254934785:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 1.73/6.31 % (4190992)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=686046079:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 1.73/6.31 % (4190987)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=1573437080:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 1.73/6.31 % (4190988)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=2535275400:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 1.73/6.31 % (4190990)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2773441142:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 1.73/6.31 % (4190991)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=604776726:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 1.73/6.31 % (4190993)dis-21_1_sil=8000:lcm=predicate:random_seed=3526633621: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)
% 1.73/6.31 % (4190993)First to succeed.
% 1.73/6.31 % (4190993)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-4190982"
% 1.73/6.31 % (4190990)Instruction limit reached!
% 1.73/6.31 % (4190990)------------------------------
% 1.73/6.31 % (4190990)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.73/6.31 % (4190990)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.73/6.31 % (4190990)CaDiCaL version: 2.1.3
% 1.73/6.31 % (4190990)Termination reason: Instruction limit
% 1.73/6.31 % (4190990)Termination phase: Saturation
% 1.73/6.31 % (4190990)Time elapsed: 0.065 s
% 1.73/6.31 % (4190990)Peak memory usage: 89 MB
% 1.73/6.31 % (4190990)Instructions burned: 111 (million)
% 1.73/6.31 % (4190991)Instruction limit reached!
% 1.73/6.31 % (4190991)------------------------------
% 1.73/6.31 % (4190991)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.73/6.31 % (4190991)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.73/6.31 % (4190991)CaDiCaL version: 2.1.3
% 1.73/6.31 % (4190991)Termination reason: Instruction limit
% 1.73/6.31 % (4190991)Termination phase: Saturation
% 1.73/6.31 % (4190991)Time elapsed: 0.072 s
% 1.73/6.31 % (4190991)Peak memory usage: 88 MB
% 1.73/6.31 % (4190991)Instructions burned: 120 (million)
% 1.73/6.31 % (4190992)Instruction limit reached!
% 1.73/6.31 % (4190992)------------------------------
% 1.73/6.31 % (4190992)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.73/6.31 % (4190992)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.73/6.31 % (4190992)CaDiCaL version: 2.1.3
% 1.73/6.31 % (4190992)Termination reason: Instruction limit
% 1.73/6.31 % (4190992)Termination phase: Saturation
% 1.73/6.31 % (4190992)Time elapsed: 0.093 s
% 1.73/6.31 % (4190992)Peak memory usage: 89 MB
% 1.73/6.31 % (4190992)Instructions burned: 140 (million)
% 1.73/6.31 % (4191001)lrs+10_1_sil=8000:sp=occurrence:random_seed=1940476059:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 1.73/6.31 % (4191002)lrs+10_1_sil=32000:urr=on:br=off:random_seed=1467634435:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 1.73/6.31 % (4191002)Refutation not found, incomplete strategy
% 1.73/6.31 % (4191002)------------------------------
% 1.73/6.31 % (4191002)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.73/6.31 % (4191002)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.73/6.31 % (4191002)CaDiCaL version: 2.1.3
% 1.73/6.31 % (4191002)Termination reason: Refutation not found, incomplete strategy
% 1.73/6.31 % (4191002)Time elapsed: 0.004 s
% 1.73/6.31 % (4191002)Peak memory usage: 89 MB
% 1.73/6.31 % (4191002)Instructions burned: 4 (million)
% 1.73/6.31 % (4191003)lrs+1011_1_sil=32000:sp=occurrence:random_seed=2863086463:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 1.73/6.31 % (4190993)Refutation found. Thanks to Tanya!
% 1.73/6.31 % SZS status Theorem for theBenchmark
% 1.73/6.31 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/6.51 % (4190993)------------------------------
% 0.17/6.51 % (4190993)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.17/6.51 % (4190993)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/6.51 % (4190993)CaDiCaL version: 2.1.3
% 0.17/6.51 % (4190993)Termination reason: Refutation
% 0.17/6.51 % (4190993)Time elapsed: 0.005 s
% 0.17/6.51 % (4190993)Peak memory usage: 89 MB
% 0.17/6.51 % (4190993)Instructions burned: 6 (million)
% 0.17/6.51 % (4190993)------------------------------
% 0.17/6.51 % (4190993)------------------------------
% 0.17/6.51 % (4190982)Success in time 0.431 s
% 0.17/6.51 % Vampire exiting
%------------------------------------------------------------------------------