%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU391+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n003.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:53:06 PM UTC 2026
% Result : Theorem 0.11s 0.47s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 6
% Syntax : Number of formulae : 83 ( 10 unt; 3 def)
% Number of atoms : 291 ( 19 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 339 ( 131 ~; 164 |; 27 &)
% ( 8 <=>; 7 =>; 0 <=; 2 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 4 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 58 ( 0 sgn 49 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f21,axiom,
! [X0] :
( ( ~ empty_carrier(X0)
& one_sorted_str(X0) )
=> ! [X1] :
( ( ~ empty_carrier(X1)
& net_str(X1,X0) )
=> filter_of_net_str(X0,X1) = a_2_1_yellow19(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_yellow19) ).
fof(f61,axiom,
! [X0,X1,X2] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1)
& ~ empty_carrier(X2)
& net_str(X2,X1) )
=> ( in(X0,a_2_1_yellow19(X1,X2))
<=> ? [X3] :
( element(X3,powerset(the_carrier(X1)))
& X0 = X3
& is_eventually_in(X1,X2,X3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fraenkel_a_2_1_yellow19) ).
fof(f92,conjecture,
! [X0] :
( ( ~ empty_carrier(X0)
& one_sorted_str(X0) )
=> ! [X1] :
( ( ~ empty_carrier(X1)
& net_str(X1,X0) )
=> ! [X2] :
( in(X2,filter_of_net_str(X0,X1))
<=> ( is_eventually_in(X0,X1,X2)
& element(X2,powerset(the_carrier(X0))) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t11_yellow19) ).
fof(f93,negated_conjecture,
~ ! [X0] :
( ( ~ empty_carrier(X0)
& one_sorted_str(X0) )
=> ! [X1] :
( ( ~ empty_carrier(X1)
& net_str(X1,X0) )
=> ! [X2] :
( in(X2,filter_of_net_str(X0,X1))
<=> ( is_eventually_in(X0,X1,X2)
& element(X2,powerset(the_carrier(X0))) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f92]) ).
fof(f189,plain,
! [X0] :
( ! [X1] :
( filter_of_net_str(X0,X1) = a_2_1_yellow19(X0,X1)
| empty_carrier(X1)
| ~ net_str(X1,X0) )
| empty_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(ennf_transformation,[],[f21]) ).
fof(f190,plain,
! [X0] :
( ! [X1] :
( filter_of_net_str(X0,X1) = a_2_1_yellow19(X0,X1)
| empty_carrier(X1)
| ~ net_str(X1,X0) )
| empty_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(flattening,[],[f189]) ).
fof(f221,plain,
! [X0,X1,X2] :
( ( in(X0,a_2_1_yellow19(X1,X2))
<=> ? [X3] :
( element(X3,powerset(the_carrier(X1)))
& X0 = X3
& is_eventually_in(X1,X2,X3) ) )
| empty_carrier(X1)
| ~ one_sorted_str(X1)
| empty_carrier(X2)
| ~ net_str(X2,X1) ),
inference(ennf_transformation,[],[f61]) ).
fof(f222,plain,
! [X0,X1,X2] :
( ( in(X0,a_2_1_yellow19(X1,X2))
<=> ? [X3] :
( element(X3,powerset(the_carrier(X1)))
& X0 = X3
& is_eventually_in(X1,X2,X3) ) )
| empty_carrier(X1)
| ~ one_sorted_str(X1)
| empty_carrier(X2)
| ~ net_str(X2,X1) ),
inference(flattening,[],[f221]) ).
fof(f242,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( in(X2,filter_of_net_str(X0,X1))
<~> ( is_eventually_in(X0,X1,X2)
& element(X2,powerset(the_carrier(X0))) ) )
& ~ empty_carrier(X1)
& net_str(X1,X0) )
& ~ empty_carrier(X0)
& one_sorted_str(X0) ),
inference(ennf_transformation,[],[f93]) ).
fof(f243,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( in(X2,filter_of_net_str(X0,X1))
<~> ( is_eventually_in(X0,X1,X2)
& element(X2,powerset(the_carrier(X0))) ) )
& ~ empty_carrier(X1)
& net_str(X1,X0) )
& ~ empty_carrier(X0)
& one_sorted_str(X0) ),
inference(flattening,[],[f242]) ).
fof(f281,plain,
! [X0,X1] :
( ~ net_str(X1,X0)
| empty_carrier(X0)
| ~ one_sorted_str(X0)
| empty_carrier(X1)
| filter_of_net_str(X0,X1) = a_2_1_yellow19(X0,X1) ),
inference(cnf_transformation,[],[f190]) ).
fof(f367,plain,
! [X2,X0,X1] :
( is_eventually_in(X1,X2,sK6(X0,X1,X2))
| empty_carrier(X2)
| ~ one_sorted_str(X1)
| empty_carrier(X1)
| ~ net_str(X2,X1)
| ~ in(X0,a_2_1_yellow19(X1,X2)) ),
inference(cnf_transformation,[],[f222]) ).
fof(f368,plain,
! [X2,X0,X1] :
( ~ net_str(X2,X1)
| empty_carrier(X2)
| ~ one_sorted_str(X1)
| empty_carrier(X1)
| sK6(X0,X1,X2) = X0
| ~ in(X0,a_2_1_yellow19(X1,X2)) ),
inference(cnf_transformation,[],[f222]) ).
fof(f369,plain,
! [X2,X0,X1] :
( ~ net_str(X2,X1)
| empty_carrier(X2)
| ~ one_sorted_str(X1)
| empty_carrier(X1)
| element(sK6(X0,X1,X2),powerset(the_carrier(X1)))
| ~ in(X0,a_2_1_yellow19(X1,X2)) ),
inference(cnf_transformation,[],[f222]) ).
fof(f370,plain,
! [X2,X3,X0,X1] :
( ~ net_str(X2,X1)
| empty_carrier(X2)
| ~ one_sorted_str(X1)
| empty_carrier(X1)
| ~ is_eventually_in(X1,X2,X3)
| X0 != X3
| ~ element(X3,powerset(the_carrier(X1)))
| in(X0,a_2_1_yellow19(X1,X2)) ),
inference(cnf_transformation,[],[f222]) ).
fof(f485,plain,
( ~ element(sK35,powerset(the_carrier(sK33)))
| ~ is_eventually_in(sK33,sK34,sK35)
| ~ in(sK35,filter_of_net_str(sK33,sK34)) ),
inference(cnf_transformation,[],[f243]) ).
fof(f486,plain,
( element(sK35,powerset(the_carrier(sK33)))
| in(sK35,filter_of_net_str(sK33,sK34)) ),
inference(cnf_transformation,[],[f243]) ).
fof(f487,plain,
( is_eventually_in(sK33,sK34,sK35)
| in(sK35,filter_of_net_str(sK33,sK34)) ),
inference(cnf_transformation,[],[f243]) ).
fof(f488,plain,
net_str(sK34,sK33),
inference(cnf_transformation,[],[f243]) ).
fof(f489,plain,
~ empty_carrier(sK34),
inference(cnf_transformation,[],[f243]) ).
fof(f490,plain,
one_sorted_str(sK33),
inference(cnf_transformation,[],[f243]) ).
fof(f491,plain,
~ empty_carrier(sK33),
inference(cnf_transformation,[],[f243]) ).
fof(f502,plain,
! [X2,X3,X1] :
( ~ is_eventually_in(X1,X2,X3)
| empty_carrier(X2)
| ~ one_sorted_str(X1)
| empty_carrier(X1)
| ~ net_str(X2,X1)
| ~ element(X3,powerset(the_carrier(X1)))
| in(X3,a_2_1_yellow19(X1,X2)) ),
inference(equality_resolution,[],[f370]) ).
fof(f504,definition,
( spl37_1
<=> in(sK35,filter_of_net_str(sK33,sK34)) ),
introduced(definition,[new_symbols(definition,[spl37_1])],[avatar_definition]) ).
fof(f505,plain,
( in(sK35,filter_of_net_str(sK33,sK34))
| ~ spl37_1 ),
inference(avatar_component_clause,[],[f504]) ).
fof(f506,plain,
( ~ in(sK35,filter_of_net_str(sK33,sK34))
| spl37_1 ),
inference(avatar_component_clause,[],[f504]) ).
fof(f508,definition,
( spl37_2
<=> is_eventually_in(sK33,sK34,sK35) ),
introduced(definition,[new_symbols(definition,[spl37_2])],[avatar_definition]) ).
fof(f509,plain,
( is_eventually_in(sK33,sK34,sK35)
| ~ spl37_2 ),
inference(avatar_component_clause,[],[f508]) ).
fof(f510,plain,
( ~ is_eventually_in(sK33,sK34,sK35)
| spl37_2 ),
inference(avatar_component_clause,[],[f508]) ).
fof(f512,definition,
( spl37_3
<=> element(sK35,powerset(the_carrier(sK33))) ),
introduced(definition,[new_symbols(definition,[spl37_3])],[avatar_definition]) ).
fof(f513,plain,
( element(sK35,powerset(the_carrier(sK33)))
| ~ spl37_3 ),
inference(avatar_component_clause,[],[f512]) ).
fof(f514,plain,
( ~ element(sK35,powerset(the_carrier(sK33)))
| spl37_3 ),
inference(avatar_component_clause,[],[f512]) ).
fof(f515,plain,
( ~ spl37_1
| ~ spl37_2
| ~ spl37_3 ),
inference(avatar_split_clause,[],[f485,f512,f508,f504]) ).
fof(f516,plain,
( spl37_1
| spl37_3 ),
inference(avatar_split_clause,[],[f486,f512,f504]) ).
fof(f517,plain,
( spl37_1
| spl37_2 ),
inference(avatar_split_clause,[],[f487,f508,f504]) ).
fof(f1032,plain,
( empty_carrier(sK33)
| ~ one_sorted_str(sK33)
| empty_carrier(sK34)
| filter_of_net_str(sK33,sK34) = a_2_1_yellow19(sK33,sK34) ),
inference(resolution,[],[f281,f488]) ).
fof(f1035,plain,
( ~ one_sorted_str(sK33)
| empty_carrier(sK34)
| filter_of_net_str(sK33,sK34) = a_2_1_yellow19(sK33,sK34) ),
inference(forward_subsumption_resolution,[],[f1032,f491]) ).
fof(f1036,plain,
( empty_carrier(sK34)
| filter_of_net_str(sK33,sK34) = a_2_1_yellow19(sK33,sK34) ),
inference(forward_subsumption_resolution,[],[f1035,f490]) ).
fof(f1037,plain,
filter_of_net_str(sK33,sK34) = a_2_1_yellow19(sK33,sK34),
inference(forward_subsumption_resolution,[],[f1036,f489]) ).
fof(f1095,plain,
! [X0] :
( empty_carrier(sK34)
| ~ one_sorted_str(sK33)
| empty_carrier(sK33)
| sK6(X0,sK33,sK34) = X0
| ~ in(X0,a_2_1_yellow19(sK33,sK34)) ),
inference(resolution,[],[f368,f488]) ).
fof(f1098,plain,
! [X0] :
( ~ one_sorted_str(sK33)
| empty_carrier(sK33)
| sK6(X0,sK33,sK34) = X0
| ~ in(X0,a_2_1_yellow19(sK33,sK34)) ),
inference(forward_subsumption_resolution,[],[f1095,f489]) ).
fof(f1099,plain,
! [X0] :
( empty_carrier(sK33)
| sK6(X0,sK33,sK34) = X0
| ~ in(X0,a_2_1_yellow19(sK33,sK34)) ),
inference(forward_subsumption_resolution,[],[f1098,f490]) ).
fof(f1100,plain,
! [X0] :
( sK6(X0,sK33,sK34) = X0
| ~ in(X0,a_2_1_yellow19(sK33,sK34)) ),
inference(forward_subsumption_resolution,[],[f1099,f491]) ).
fof(f1101,plain,
! [X0] :
( ~ in(X0,filter_of_net_str(sK33,sK34))
| sK6(X0,sK33,sK34) = X0 ),
inference(forward_demodulation,[],[f1100,f1037]) ).
fof(f1114,plain,
! [X0] :
( empty_carrier(sK34)
| ~ one_sorted_str(sK33)
| empty_carrier(sK33)
| element(sK6(X0,sK33,sK34),powerset(the_carrier(sK33)))
| ~ in(X0,a_2_1_yellow19(sK33,sK34)) ),
inference(resolution,[],[f369,f488]) ).
fof(f1117,plain,
! [X0] :
( ~ one_sorted_str(sK33)
| empty_carrier(sK33)
| element(sK6(X0,sK33,sK34),powerset(the_carrier(sK33)))
| ~ in(X0,a_2_1_yellow19(sK33,sK34)) ),
inference(forward_subsumption_resolution,[],[f1114,f489]) ).
fof(f1118,plain,
! [X0] :
( empty_carrier(sK33)
| element(sK6(X0,sK33,sK34),powerset(the_carrier(sK33)))
| ~ in(X0,a_2_1_yellow19(sK33,sK34)) ),
inference(forward_subsumption_resolution,[],[f1117,f490]) ).
fof(f1119,plain,
! [X0] :
( element(sK6(X0,sK33,sK34),powerset(the_carrier(sK33)))
| ~ in(X0,a_2_1_yellow19(sK33,sK34)) ),
inference(forward_subsumption_resolution,[],[f1118,f491]) ).
fof(f1120,plain,
! [X0] :
( ~ in(X0,filter_of_net_str(sK33,sK34))
| element(sK6(X0,sK33,sK34),powerset(the_carrier(sK33))) ),
inference(forward_demodulation,[],[f1119,f1037]) ).
fof(f1127,plain,
( empty_carrier(sK34)
| ~ one_sorted_str(sK33)
| empty_carrier(sK33)
| ~ net_str(sK34,sK33)
| ~ element(sK35,powerset(the_carrier(sK33)))
| in(sK35,a_2_1_yellow19(sK33,sK34))
| ~ spl37_2 ),
inference(resolution,[],[f502,f509]) ).
fof(f1131,plain,
( ~ one_sorted_str(sK33)
| empty_carrier(sK33)
| ~ net_str(sK34,sK33)
| ~ element(sK35,powerset(the_carrier(sK33)))
| in(sK35,a_2_1_yellow19(sK33,sK34))
| ~ spl37_2 ),
inference(forward_subsumption_resolution,[],[f1127,f489]) ).
fof(f1132,plain,
( empty_carrier(sK33)
| ~ net_str(sK34,sK33)
| ~ element(sK35,powerset(the_carrier(sK33)))
| in(sK35,a_2_1_yellow19(sK33,sK34))
| ~ spl37_2 ),
inference(forward_subsumption_resolution,[],[f1131,f490]) ).
fof(f1133,plain,
( ~ net_str(sK34,sK33)
| ~ element(sK35,powerset(the_carrier(sK33)))
| in(sK35,a_2_1_yellow19(sK33,sK34))
| ~ spl37_2 ),
inference(forward_subsumption_resolution,[],[f1132,f491]) ).
fof(f1134,plain,
( ~ element(sK35,powerset(the_carrier(sK33)))
| in(sK35,a_2_1_yellow19(sK33,sK34))
| ~ spl37_2 ),
inference(forward_subsumption_resolution,[],[f1133,f488]) ).
fof(f1135,plain,
( in(sK35,a_2_1_yellow19(sK33,sK34))
| ~ spl37_2
| ~ spl37_3 ),
inference(forward_subsumption_resolution,[],[f1134,f513]) ).
fof(f1136,plain,
( in(sK35,filter_of_net_str(sK33,sK34))
| ~ spl37_2
| ~ spl37_3 ),
inference(forward_demodulation,[],[f1135,f1037]) ).
fof(f1137,plain,
( $false
| spl37_1
| ~ spl37_2
| ~ spl37_3 ),
inference(forward_subsumption_resolution,[],[f1136,f506]) ).
fof(f1138,plain,
( spl37_1
| ~ spl37_2
| ~ spl37_3 ),
inference(avatar_contradiction_clause,[],[f1137]) ).
fof(f1150,plain,
( sK35 = sK6(sK35,sK33,sK34)
| ~ spl37_1 ),
inference(resolution,[],[f505,f1101]) ).
fof(f1159,plain,
( is_eventually_in(sK33,sK34,sK35)
| empty_carrier(sK34)
| ~ one_sorted_str(sK33)
| empty_carrier(sK33)
| ~ net_str(sK34,sK33)
| ~ in(sK35,a_2_1_yellow19(sK33,sK34))
| ~ spl37_1 ),
inference(superposition,[],[f367,f1150]) ).
fof(f1160,plain,
( element(sK6(sK35,sK33,sK34),powerset(the_carrier(sK33)))
| ~ spl37_1 ),
inference(resolution,[],[f1120,f505]) ).
fof(f1165,plain,
( element(sK35,powerset(the_carrier(sK33)))
| ~ spl37_1 ),
inference(forward_demodulation,[],[f1160,f1150]) ).
fof(f1166,plain,
( $false
| ~ spl37_1
| spl37_3 ),
inference(forward_subsumption_resolution,[],[f1165,f514]) ).
fof(f1167,plain,
( ~ spl37_1
| spl37_3 ),
inference(avatar_contradiction_clause,[],[f1166]) ).
fof(f1168,plain,
( empty_carrier(sK34)
| ~ one_sorted_str(sK33)
| empty_carrier(sK33)
| ~ net_str(sK34,sK33)
| ~ in(sK35,a_2_1_yellow19(sK33,sK34))
| ~ spl37_1
| spl37_2 ),
inference(forward_subsumption_resolution,[],[f1159,f510]) ).
fof(f1169,plain,
( ~ one_sorted_str(sK33)
| empty_carrier(sK33)
| ~ net_str(sK34,sK33)
| ~ in(sK35,a_2_1_yellow19(sK33,sK34))
| ~ spl37_1
| spl37_2 ),
inference(forward_subsumption_resolution,[],[f1168,f489]) ).
fof(f1170,plain,
( empty_carrier(sK33)
| ~ net_str(sK34,sK33)
| ~ in(sK35,a_2_1_yellow19(sK33,sK34))
| ~ spl37_1
| spl37_2 ),
inference(forward_subsumption_resolution,[],[f1169,f490]) ).
fof(f1171,plain,
( ~ net_str(sK34,sK33)
| ~ in(sK35,a_2_1_yellow19(sK33,sK34))
| ~ spl37_1
| spl37_2 ),
inference(forward_subsumption_resolution,[],[f1170,f491]) ).
fof(f1172,plain,
( ~ in(sK35,a_2_1_yellow19(sK33,sK34))
| ~ spl37_1
| spl37_2 ),
inference(forward_subsumption_resolution,[],[f1171,f488]) ).
fof(f1173,plain,
( ~ in(sK35,filter_of_net_str(sK33,sK34))
| ~ spl37_1
| spl37_2 ),
inference(forward_demodulation,[],[f1172,f1037]) ).
fof(f1174,plain,
( $false
| ~ spl37_1
| spl37_2 ),
inference(forward_subsumption_resolution,[],[f1173,f505]) ).
fof(f1175,plain,
( ~ spl37_1
| spl37_2 ),
inference(avatar_contradiction_clause,[],[f1174]) ).
cnf(s1,plain,
( ~ spl37_1
| ~ spl37_2
| ~ spl37_3 ),
inference(sat_conversion,[],[f515]) ).
cnf(s2,plain,
( spl37_1
| spl37_3 ),
inference(sat_conversion,[],[f516]) ).
cnf(s3,plain,
( spl37_1
| spl37_2 ),
inference(sat_conversion,[],[f517]) ).
cnf(s14,plain,
( spl37_1
| ~ spl37_2
| ~ spl37_3 ),
inference(sat_conversion,[],[f1138]) ).
cnf(s18,plain,
( ~ spl37_1
| spl37_3 ),
inference(sat_conversion,[],[f1167]) ).
cnf(s19,plain,
( ~ spl37_1
| spl37_2 ),
inference(sat_conversion,[],[f1175]) ).
cnf(s20,plain,
spl37_1,
inference(rat,[],[s14,s2,s3]) ).
cnf(s21,plain,
spl37_2,
inference(rat,[],[s19,s20]) ).
cnf(s22,plain,
spl37_3,
inference(rat,[],[s18,s20]) ).
cnf(s25,plain,
$false,
inference(rat,[],[s1,s21,s22,s20]) ).
fof(f1176,plain,
$false,
inference(avatar_sat_refutation,[],[s25]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU391+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.37 % Computer : n003.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 28 05:06:57 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.40 Running first-order model finding
% 0.11/0.40 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.11/0.47 % (1200327)Will run a generic schedule for satisfiability detection.
% 0.11/0.47 % (1200335)% WARNING: option uhcvi not known.
% 0.11/0.47 % (1200338)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2618449223:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.11/0.47 % (1200335)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=60790146:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.11/0.47 % (1200334)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4073837680_2999 on theBenchmark for (2999ds/0Mi)
% 0.11/0.47 % (1200336)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=321554398:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.11/0.47 % (1200337)dis+10_1_sil=32000:sp=arity:random_seed=2892683765:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.11/0.47 % (1200340)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3956942405:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.11/0.47 % (1200339)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1178719082:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.11/0.47 % (1200338) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1200327-1200338"...
% 0.11/0.47 % (1200338)...printing done.
% 0.11/0.47 % TRYING [1]
% 0.11/0.47 % TRYING [2]
% 0.11/0.47 % (1200338)Refutation found. Thanks to Tanya!
% 0.11/0.47 % SZS status Theorem for theBenchmark
% 0.11/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.47 % (1200338)------------------------------
% 0.11/0.47 % (1200338)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.47 % (1200338)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.47 % (1200338)CaDiCaL version: 2.1.3
% 0.11/0.47 % (1200338)Termination reason: Refutation
% 0.11/0.47 % (1200338)Time elapsed: 0.012 s
% 0.11/0.47 % (1200338)Peak memory usage: 13 MB
% 0.11/0.47 % (1200338)Instructions burned: 30 (million)
% 0.11/0.47 % (1200327)Success in time 0.063 s
% 0.11/0.47 % Vampire exiting
%------------------------------------------------------------------------------