%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SET010+3 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n007.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:39:29 PM UTC 2026
% Result : Theorem 2.63s 1.26s
% Output : Refutation 3.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 17
% Syntax : Number of formulae : 98 ( 19 unt; 8 def)
% Number of atoms : 248 ( 12 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 249 ( 99 ~; 107 |; 26 &)
% ( 14 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 8 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 115 ( 0 sgn 110 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1,X2] :
( member(X2,union(X0,X1))
<=> ( member(X2,X0)
| member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',union_defn) ).
fof(f2,axiom,
! [X0,X1,X2] :
( member(X2,intersection(X0,X1))
<=> ( member(X2,X0)
& member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_defn) ).
fof(f3,axiom,
! [X0,X1,X2] :
( member(X2,difference(X0,X1))
<=> ( member(X2,X0)
& ~ member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',difference_defn) ).
fof(f4,axiom,
! [X0,X1,X2] :
( ( subset(X0,X1)
& subset(X2,X1) )
=> subset(union(X0,X2),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',union_subset) ).
fof(f5,axiom,
! [X0,X1] : subset(intersection(X0,X1),X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_is_subset) ).
fof(f6,axiom,
! [X0,X1,X2] :
( subset(X0,X1)
=> subset(difference(X2,X1),difference(X2,X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_difference) ).
fof(f7,axiom,
! [X0,X1] :
( X0 = X1
<=> ( subset(X0,X1)
& subset(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_defn) ).
fof(f10,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_defn) ).
fof(f13,conjecture,
! [X0,X1,X2] : difference(X0,intersection(X1,X2)) = union(difference(X0,X1),difference(X0,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_difference_and_intersection_and_union) ).
fof(f14,negated_conjecture,
~ ! [X0,X1,X2] : difference(X0,intersection(X1,X2)) = union(difference(X0,X1),difference(X0,X2)),
inference(negated_conjecture,[status(cth)],[f13]) ).
fof(f15,plain,
! [X0,X1,X2] :
( subset(union(X0,X2),X1)
| ~ subset(X0,X1)
| ~ subset(X2,X1) ),
inference(ennf_transformation,[],[f4]) ).
fof(f16,plain,
! [X0,X1,X2] :
( subset(union(X0,X2),X1)
| ~ subset(X0,X1)
| ~ subset(X2,X1) ),
inference(flattening,[],[f15]) ).
fof(f17,plain,
! [X0,X1,X2] :
( subset(difference(X2,X1),difference(X2,X0))
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f18,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f10]) ).
fof(f19,plain,
? [X0,X1,X2] : difference(X0,intersection(X1,X2)) != union(difference(X0,X1),difference(X0,X2)),
inference(ennf_transformation,[],[f14]) ).
fof(f20,plain,
! [X0,X1,X2] :
( ( member(X2,union(X0,X1))
| ( ~ member(X2,X0)
& ~ member(X2,X1) ) )
& ( member(X2,X0)
| member(X2,X1)
| ~ member(X2,union(X0,X1)) ) ),
inference(nnf_transformation,[],[f1]) ).
fof(f21,plain,
! [X0,X1,X2] :
( ( member(X2,union(X0,X1))
| ( ~ member(X2,X0)
& ~ member(X2,X1) ) )
& ( member(X2,X0)
| member(X2,X1)
| ~ member(X2,union(X0,X1)) ) ),
inference(flattening,[],[f20]) ).
fof(f22,plain,
! [X0,X1,X2] :
( ( member(X2,intersection(X0,X1))
| ~ member(X2,X0)
| ~ member(X2,X1) )
& ( ( member(X2,X0)
& member(X2,X1) )
| ~ member(X2,intersection(X0,X1)) ) ),
inference(nnf_transformation,[],[f2]) ).
fof(f23,plain,
! [X0,X1,X2] :
( ( member(X2,intersection(X0,X1))
| ~ member(X2,X0)
| ~ member(X2,X1) )
& ( ( member(X2,X0)
& member(X2,X1) )
| ~ member(X2,intersection(X0,X1)) ) ),
inference(flattening,[],[f22]) ).
fof(f24,plain,
! [X0,X1,X2] :
( ( member(X2,difference(X0,X1))
| ~ member(X2,X0)
| member(X2,X1) )
& ( ( member(X2,X0)
& ~ member(X2,X1) )
| ~ member(X2,difference(X0,X1)) ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f25,plain,
! [X0,X1,X2] :
( ( member(X2,difference(X0,X1))
| ~ member(X2,X0)
| member(X2,X1) )
& ( ( member(X2,X0)
& ~ member(X2,X1) )
| ~ member(X2,difference(X0,X1)) ) ),
inference(flattening,[],[f24]) ).
fof(f26,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f27,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(flattening,[],[f26]) ).
fof(f28,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f18]) ).
fof(f29,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f28]) ).
fof(f30,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f29]) ).
fof(f34,plain,
difference(sK2,intersection(sK3,sK4)) != union(difference(sK2,sK3),difference(sK2,sK4)),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3,sK4]),skolemize(X0,sK2),skolemize(X1,sK3),skolemize(X2,sK4)],[f19]) ).
fof(f36,plain,
! [X2,X0,X1] :
( member(X2,union(X0,X1))
| ~ member(X2,X1) ),
inference(cnf_transformation,[],[f21]) ).
fof(f37,plain,
! [X2,X0,X1] :
( member(X2,union(X0,X1))
| ~ member(X2,X0) ),
inference(cnf_transformation,[],[f21]) ).
fof(f38,plain,
! [X2,X0,X1] :
( ~ member(X2,intersection(X0,X1))
| member(X2,X1) ),
inference(cnf_transformation,[],[f23]) ).
fof(f40,plain,
! [X2,X0,X1] :
( member(X2,intersection(X0,X1))
| ~ member(X2,X0)
| ~ member(X2,X1) ),
inference(cnf_transformation,[],[f23]) ).
fof(f41,plain,
! [X2,X0,X1] :
( ~ member(X2,difference(X0,X1))
| ~ member(X2,X1) ),
inference(cnf_transformation,[],[f25]) ).
fof(f42,plain,
! [X2,X0,X1] :
( ~ member(X2,difference(X0,X1))
| member(X2,X0) ),
inference(cnf_transformation,[],[f25]) ).
fof(f43,plain,
! [X2,X0,X1] :
( member(X2,difference(X0,X1))
| ~ member(X2,X0)
| member(X2,X1) ),
inference(cnf_transformation,[],[f25]) ).
fof(f44,plain,
! [X2,X0,X1] :
( subset(union(X0,X2),X1)
| ~ subset(X0,X1)
| ~ subset(X2,X1) ),
inference(cnf_transformation,[],[f16]) ).
fof(f45,plain,
! [X0,X1] : subset(intersection(X0,X1),X0),
inference(cnf_transformation,[],[f5]) ).
fof(f46,plain,
! [X2,X0,X1] :
( subset(difference(X2,X1),difference(X2,X0))
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f17]) ).
fof(f49,plain,
! [X0,X1] :
( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) ),
inference(cnf_transformation,[],[f27]) ).
fof(f53,plain,
! [X0,X1] :
( subset(X0,X1)
| member(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f30]) ).
fof(f54,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ member(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f30]) ).
fof(f60,plain,
difference(sK2,intersection(sK3,sK4)) != union(difference(sK2,sK3),difference(sK2,sK4)),
inference(cnf_transformation,[],[f34]) ).
fof(f65,definition,
! [X0,X1] :
( sQ5_eqProxy(X0,X1)
<=> X0 = X1 ),
introduced(definition,[new_symbols(definition,[sQ5_eqProxy])],[equality_proxy_definition]) ).
fof(f66,plain,
! [X0,X1] :
( sQ5_eqProxy(X0,X1)
| ~ subset(X0,X1)
| ~ subset(X1,X0) ),
inference(equality_proxy_replacement,[],[f49,f65]) ).
fof(f71,plain,
~ sQ5_eqProxy(difference(sK2,intersection(sK3,sK4)),union(difference(sK2,sK3),difference(sK2,sK4))),
inference(equality_proxy_replacement,[],[f60,f65]) ).
fof(f80,plain,
( ~ subset(difference(sK2,intersection(sK3,sK4)),union(difference(sK2,sK3),difference(sK2,sK4)))
| ~ subset(union(difference(sK2,sK3),difference(sK2,sK4)),difference(sK2,intersection(sK3,sK4))) ),
inference(resolution,[],[f66,f71]) ).
fof(f83,definition,
( spl6_1
<=> subset(difference(sK2,intersection(sK3,sK4)),union(difference(sK2,sK3),difference(sK2,sK4))) ),
introduced(definition,[new_symbols(definition,[spl6_1])],[avatar_definition]) ).
fof(f84,plain,
( ~ subset(difference(sK2,intersection(sK3,sK4)),union(difference(sK2,sK3),difference(sK2,sK4)))
| spl6_1 ),
inference(avatar_component_clause,[],[f83]) ).
fof(f86,definition,
( spl6_2
<=> subset(union(difference(sK2,sK3),difference(sK2,sK4)),difference(sK2,intersection(sK3,sK4))) ),
introduced(definition,[new_symbols(definition,[spl6_2])],[avatar_definition]) ).
fof(f87,plain,
( ~ subset(union(difference(sK2,sK3),difference(sK2,sK4)),difference(sK2,intersection(sK3,sK4)))
| spl6_2 ),
inference(avatar_component_clause,[],[f86]) ).
fof(f89,plain,
( ~ spl6_2
| ~ spl6_1 ),
inference(avatar_split_clause,[],[f80,f83,f86]) ).
fof(f90,plain,
( ~ member(sK0(difference(sK2,intersection(sK3,sK4)),union(difference(sK2,sK3),difference(sK2,sK4))),union(difference(sK2,sK3),difference(sK2,sK4)))
| spl6_1 ),
inference(resolution,[],[f84,f54]) ).
fof(f91,plain,
( member(sK0(difference(sK2,intersection(sK3,sK4)),union(difference(sK2,sK3),difference(sK2,sK4))),difference(sK2,intersection(sK3,sK4)))
| spl6_1 ),
inference(resolution,[],[f84,f53]) ).
fof(f92,plain,
( member(sK0(difference(sK2,intersection(sK3,sK4)),union(difference(sK2,sK3),difference(sK2,sK4))),sK2)
| spl6_1 ),
inference(resolution,[],[f91,f42]) ).
fof(f93,plain,
( ~ member(sK0(difference(sK2,intersection(sK3,sK4)),union(difference(sK2,sK3),difference(sK2,sK4))),intersection(sK3,sK4))
| spl6_1 ),
inference(resolution,[],[f91,f41]) ).
fof(f94,plain,
( ~ member(sK0(difference(sK2,intersection(sK3,sK4)),union(difference(sK2,sK3),difference(sK2,sK4))),difference(sK2,sK3))
| spl6_1 ),
inference(resolution,[],[f90,f37]) ).
fof(f95,plain,
( ~ member(sK0(difference(sK2,intersection(sK3,sK4)),union(difference(sK2,sK3),difference(sK2,sK4))),difference(sK2,sK4))
| spl6_1 ),
inference(resolution,[],[f90,f36]) ).
fof(f101,plain,
( ~ member(sK0(difference(sK2,intersection(sK3,sK4)),union(difference(sK2,sK3),difference(sK2,sK4))),sK3)
| ~ member(sK0(difference(sK2,intersection(sK3,sK4)),union(difference(sK2,sK3),difference(sK2,sK4))),sK4)
| spl6_1 ),
inference(resolution,[],[f40,f93]) ).
fof(f103,definition,
( spl6_3
<=> member(sK0(difference(sK2,intersection(sK3,sK4)),union(difference(sK2,sK3),difference(sK2,sK4))),sK4) ),
introduced(definition,[new_symbols(definition,[spl6_3])],[avatar_definition]) ).
fof(f106,definition,
( spl6_4
<=> member(sK0(difference(sK2,intersection(sK3,sK4)),union(difference(sK2,sK3),difference(sK2,sK4))),sK3) ),
introduced(definition,[new_symbols(definition,[spl6_4])],[avatar_definition]) ).
fof(f108,plain,
( ~ spl6_3
| ~ spl6_4
| spl6_1 ),
inference(avatar_split_clause,[],[f101,f83,f106,f103]) ).
fof(f111,plain,
( ~ member(sK0(difference(sK2,intersection(sK3,sK4)),union(difference(sK2,sK3),difference(sK2,sK4))),sK2)
| member(sK0(difference(sK2,intersection(sK3,sK4)),union(difference(sK2,sK3),difference(sK2,sK4))),sK3)
| spl6_1 ),
inference(resolution,[],[f43,f94]) ).
fof(f112,plain,
( ~ member(sK0(difference(sK2,intersection(sK3,sK4)),union(difference(sK2,sK3),difference(sK2,sK4))),sK2)
| member(sK0(difference(sK2,intersection(sK3,sK4)),union(difference(sK2,sK3),difference(sK2,sK4))),sK4)
| spl6_1 ),
inference(resolution,[],[f43,f95]) ).
fof(f115,definition,
( spl6_5
<=> member(sK0(difference(sK2,intersection(sK3,sK4)),union(difference(sK2,sK3),difference(sK2,sK4))),sK2) ),
introduced(definition,[new_symbols(definition,[spl6_5])],[avatar_definition]) ).
fof(f116,plain,
( ~ member(sK0(difference(sK2,intersection(sK3,sK4)),union(difference(sK2,sK3),difference(sK2,sK4))),sK2)
| spl6_5 ),
inference(avatar_component_clause,[],[f115]) ).
fof(f117,plain,
( spl6_3
| ~ spl6_5
| spl6_1 ),
inference(avatar_split_clause,[],[f112,f83,f115,f103]) ).
fof(f119,plain,
( spl6_4
| ~ spl6_5
| spl6_1 ),
inference(avatar_split_clause,[],[f111,f83,f115,f106]) ).
fof(f120,plain,
( $false
| spl6_1
| spl6_5 ),
inference(resolution,[],[f116,f92]) ).
fof(f121,plain,
( spl6_1
| spl6_5 ),
inference(avatar_contradiction_clause,[],[f120]) ).
fof(f124,plain,
( ~ subset(difference(sK2,sK3),difference(sK2,intersection(sK3,sK4)))
| ~ subset(difference(sK2,sK4),difference(sK2,intersection(sK3,sK4)))
| spl6_2 ),
inference(resolution,[],[f44,f87]) ).
fof(f127,definition,
( spl6_6
<=> subset(difference(sK2,sK4),difference(sK2,intersection(sK3,sK4))) ),
introduced(definition,[new_symbols(definition,[spl6_6])],[avatar_definition]) ).
fof(f128,plain,
( ~ subset(difference(sK2,sK4),difference(sK2,intersection(sK3,sK4)))
| spl6_6 ),
inference(avatar_component_clause,[],[f127]) ).
fof(f130,definition,
( spl6_7
<=> subset(difference(sK2,sK3),difference(sK2,intersection(sK3,sK4))) ),
introduced(definition,[new_symbols(definition,[spl6_7])],[avatar_definition]) ).
fof(f131,plain,
( ~ subset(difference(sK2,sK3),difference(sK2,intersection(sK3,sK4)))
| spl6_7 ),
inference(avatar_component_clause,[],[f130]) ).
fof(f132,plain,
( ~ spl6_6
| ~ spl6_7
| spl6_2 ),
inference(avatar_split_clause,[],[f124,f86,f130,f127]) ).
fof(f133,plain,
( ~ subset(intersection(sK3,sK4),sK4)
| spl6_6 ),
inference(resolution,[],[f128,f46]) ).
fof(f144,plain,
( ~ member(sK0(intersection(sK3,sK4),sK4),sK4)
| spl6_6 ),
inference(resolution,[],[f133,f54]) ).
fof(f145,plain,
( member(sK0(intersection(sK3,sK4),sK4),intersection(sK3,sK4))
| spl6_6 ),
inference(resolution,[],[f133,f53]) ).
fof(f157,plain,
( member(sK0(intersection(sK3,sK4),sK4),sK4)
| spl6_6 ),
inference(resolution,[],[f145,f38]) ).
fof(f166,plain,
( $false
| spl6_6 ),
inference(resolution,[],[f157,f144]) ).
fof(f167,plain,
spl6_6,
inference(avatar_contradiction_clause,[],[f166]) ).
fof(f168,plain,
( ~ subset(intersection(sK3,sK4),sK3)
| spl6_7 ),
inference(resolution,[],[f131,f46]) ).
fof(f171,plain,
( $false
| spl6_7 ),
inference(resolution,[],[f168,f45]) ).
fof(f174,plain,
spl6_7,
inference(avatar_contradiction_clause,[],[f171]) ).
cnf(s2,plain,
( ~ spl6_1
| ~ spl6_2 ),
inference(sat_conversion,[],[f89]) ).
cnf(s3,plain,
( spl6_1
| ~ spl6_3
| ~ spl6_4 ),
inference(sat_conversion,[],[f108]) ).
cnf(s4,plain,
( spl6_1
| spl6_3
| ~ spl6_5 ),
inference(sat_conversion,[],[f117]) ).
cnf(s5,plain,
( spl6_1
| spl6_4
| ~ spl6_5 ),
inference(sat_conversion,[],[f119]) ).
cnf(s6,plain,
( spl6_1
| spl6_5 ),
inference(sat_conversion,[],[f121]) ).
cnf(s7,plain,
( spl6_2
| ~ spl6_6
| ~ spl6_7 ),
inference(sat_conversion,[],[f132]) ).
cnf(s11,plain,
spl6_6,
inference(sat_conversion,[],[f167]) ).
cnf(s12,plain,
spl6_7,
inference(sat_conversion,[],[f174]) ).
cnf(s13,plain,
spl6_2,
inference(rat,[],[s7,s12,s11]) ).
cnf(s14,plain,
~ spl6_1,
inference(rat,[],[s2,s13]) ).
cnf(s15,plain,
spl6_5,
inference(rat,[],[s6,s14]) ).
cnf(s16,plain,
spl6_4,
inference(rat,[],[s5,s15,s14]) ).
cnf(s17,plain,
spl6_3,
inference(rat,[],[s4,s15,s14]) ).
cnf(s18,plain,
$false,
inference(rat,[],[s3,s16,s17,s14]) ).
fof(f175,plain,
$false,
inference(avatar_sat_refutation,[],[s18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET010+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.38 % Computer : n007.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Mon Sep 28 00:01:26 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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.63/1.26 % (1910820)Detected formulas, will run a generic FOF schedule.
% 2.63/1.26 % (1910826)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=3675841552:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.63/1.26 % (1910831)dis-21_1_sil=8000:lcm=predicate:random_seed=3545844988: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.63/1.26 % (1910830)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2831069277:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.63/1.26 % (1910829)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3843710864:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.63/1.26 % (1910828)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=321265054:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.63/1.26 % (1910825)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=1311776615:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.63/1.26 % (1910827)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=3432940154:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.63/1.26 % (1910828)Refutation not found, incomplete strategy
% 2.63/1.26 % (1910828)------------------------------
% 2.63/1.26 % (1910828)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.63/1.26 % (1910828)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.63/1.26 % (1910828)CaDiCaL version: 2.1.3
% 2.63/1.26 % (1910828)Termination reason: Refutation not found, incomplete strategy
% 2.63/1.26 % (1910828)Time elapsed: 0.002 s
% 2.63/1.26 % (1910828)Peak memory usage: 88 MB
% 2.63/1.26 % (1910828)Instructions burned: 1 (million)
% 2.63/1.26 % (1910831)First to succeed.
% 2.63/1.26 % (1910831)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1910820"
% 2.63/1.26 % (1910829)Instruction limit reached!
% 2.63/1.26 % (1910829)------------------------------
% 2.63/1.26 % (1910829)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.63/1.26 % (1910829)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.63/1.26 % (1910829)CaDiCaL version: 2.1.3
% 2.63/1.26 % (1910829)Termination reason: Instruction limit
% 2.63/1.26 % (1910829)Termination phase: Saturation
% 2.63/1.26 % (1910829)Time elapsed: 0.073 s
% 2.63/1.26 % (1910829)Peak memory usage: 89 MB
% 2.63/1.26 % (1910829)Instructions burned: 120 (million)
% 2.63/1.26 % (1910830)Instruction limit reached!
% 2.63/1.26 % (1910830)------------------------------
% 2.63/1.26 % (1910830)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.63/1.26 % (1910830)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.63/1.26 % (1910830)CaDiCaL version: 2.1.3
% 2.63/1.26 % (1910830)Termination reason: Instruction limit
% 2.63/1.26 % (1910830)Termination phase: Saturation
% 2.63/1.26 % (1910830)Time elapsed: 0.088 s
% 2.63/1.26 % (1910830)Peak memory usage: 89 MB
% 2.63/1.26 % (1910830)Instructions burned: 140 (million)
% 2.63/1.26 % (1910839)lrs+10_1_sil=8000:sp=occurrence:random_seed=2818349107:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.63/1.26 % (1910840)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3779161403:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.63/1.26 % (1910828)------------------------------
% 2.63/1.26 % (1910828)------------------------------
% 2.63/1.26 % (1910831)Refutation found. Thanks to Tanya!
% 2.63/1.26 % SZS status Theorem for theBenchmark
% 2.63/1.26 % SZS output start Proof for theBenchmark
% See solution above
% 3.44/1.45 % (1910831)------------------------------
% 3.44/1.45 % (1910831)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.44/1.45 % (1910831)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.44/1.45 % (1910831)CaDiCaL version: 2.1.3
% 3.44/1.45 % (1910831)Termination reason: Refutation
% 3.44/1.45 % (1910831)Time elapsed: 0.005 s
% 3.44/1.45 % (1910831)Peak memory usage: 89 MB
% 3.44/1.45 % (1910831)Instructions burned: 5 (million)
% 3.44/1.45 % (1910831)------------------------------
% 3.44/1.45 % (1910831)------------------------------
% 3.44/1.45 % (1910820)Success in time 0.397 s
% 3.44/1.45 % Vampire exiting
%------------------------------------------------------------------------------