%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SET698+4 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n020.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:41:41 PM UTC 2026
% Result : Theorem 2.17s 1.16s
% Output : Refutation 2.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 11
% Syntax : Number of formulae : 104 ( 10 unt; 6 def)
% Number of atoms : 285 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 293 ( 112 ~; 128 |; 35 &)
% ( 13 <=>; 3 =>; 0 <=; 2 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 10 ( 9 usr; 7 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 102 ( 0 sgn 88 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset) ).
fof(f2,axiom,
! [X0,X1] :
( equal_set(X0,X1)
<=> ( subset(X0,X1)
& subset(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_set) ).
fof(f5,axiom,
! [X0,X1,X2] :
( member(X0,union(X1,X2))
<=> ( member(X0,X1)
| member(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',union) ).
fof(f7,axiom,
! [X0,X1,X2] :
( member(X0,difference(X2,X1))
<=> ( member(X0,X2)
& ~ member(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',difference) ).
fof(f12,conjecture,
! [X0,X1,X2] :
( ( subset(X0,X2)
& subset(X1,X2) )
=> ( subset(X0,X1)
<=> equal_set(union(difference(X2,X0),X1),X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thI32) ).
fof(f13,negated_conjecture,
~ ! [X0,X1,X2] :
( ( subset(X0,X2)
& subset(X1,X2) )
=> ( subset(X0,X1)
<=> equal_set(union(difference(X2,X0),X1),X2) ) ),
inference(negated_conjecture,[status(cth)],[f12]) ).
fof(f14,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f16,plain,
? [X0,X1,X2] :
( ( subset(X0,X1)
<~> equal_set(union(difference(X2,X0),X1),X2) )
& subset(X0,X2)
& subset(X1,X2) ),
inference(ennf_transformation,[],[f13]) ).
fof(f17,plain,
? [X0,X1,X2] :
( ( subset(X0,X1)
<~> equal_set(union(difference(X2,X0),X1),X2) )
& subset(X0,X2)
& subset(X1,X2) ),
inference(flattening,[],[f16]) ).
fof(f18,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,[],[f14]) ).
fof(f19,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,[],[f18]) ).
fof(f20,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))],[f19]) ).
fof(f21,plain,
! [X0,X1] :
( ( equal_set(X0,X1)
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| ~ equal_set(X0,X1) ) ),
inference(nnf_transformation,[],[f2]) ).
fof(f22,plain,
! [X0,X1] :
( ( equal_set(X0,X1)
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| ~ equal_set(X0,X1) ) ),
inference(flattening,[],[f21]) ).
fof(f26,plain,
! [X0,X1,X2] :
( ( member(X0,union(X1,X2))
| ( ~ member(X0,X1)
& ~ member(X0,X2) ) )
& ( member(X0,X1)
| member(X0,X2)
| ~ member(X0,union(X1,X2)) ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f27,plain,
! [X0,X1,X2] :
( ( member(X0,union(X1,X2))
| ( ~ member(X0,X1)
& ~ member(X0,X2) ) )
& ( member(X0,X1)
| member(X0,X2)
| ~ member(X0,union(X1,X2)) ) ),
inference(flattening,[],[f26]) ).
fof(f28,plain,
! [X0,X1,X2] :
( ( member(X0,difference(X2,X1))
| ~ member(X0,X2)
| member(X0,X1) )
& ( ( member(X0,X2)
& ~ member(X0,X1) )
| ~ member(X0,difference(X2,X1)) ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f29,plain,
! [X0,X1,X2] :
( ( member(X0,difference(X2,X1))
| ~ member(X0,X2)
| member(X0,X1) )
& ( ( member(X0,X2)
& ~ member(X0,X1) )
| ~ member(X0,difference(X2,X1)) ) ),
inference(flattening,[],[f28]) ).
fof(f39,plain,
? [X0,X1,X2] :
( ( ~ equal_set(union(difference(X2,X0),X1),X2)
| ~ subset(X0,X1) )
& ( equal_set(union(difference(X2,X0),X1),X2)
| subset(X0,X1) )
& subset(X0,X2)
& subset(X1,X2) ),
inference(nnf_transformation,[],[f17]) ).
fof(f40,plain,
? [X0,X1,X2] :
( ( ~ equal_set(union(difference(X2,X0),X1),X2)
| ~ subset(X0,X1) )
& ( equal_set(union(difference(X2,X0),X1),X2)
| subset(X0,X1) )
& subset(X0,X2)
& subset(X1,X2) ),
inference(flattening,[],[f39]) ).
fof(f41,plain,
( ( ~ equal_set(union(difference(sK5,sK3),sK4),sK5)
| ~ subset(sK3,sK4) )
& ( equal_set(union(difference(sK5,sK3),sK4),sK5)
| subset(sK3,sK4) )
& subset(sK3,sK5)
& subset(sK4,sK5) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4,sK5]),skolemize(X0,sK3),skolemize(X1,sK4),skolemize(X2,sK5)],[f40]) ).
fof(f42,plain,
! [X3,X0,X1] :
( ~ subset(X0,X1)
| ~ member(X3,X0)
| member(X3,X1) ),
inference(cnf_transformation,[],[f20]) ).
fof(f43,plain,
! [X0,X1] :
( subset(X0,X1)
| member(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f20]) ).
fof(f44,plain,
! [X0,X1] :
( ~ member(sK0(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f20]) ).
fof(f45,plain,
! [X0,X1] :
( ~ equal_set(X0,X1)
| subset(X1,X0) ),
inference(cnf_transformation,[],[f22]) ).
fof(f47,plain,
! [X0,X1] :
( equal_set(X0,X1)
| ~ subset(X0,X1)
| ~ subset(X1,X0) ),
inference(cnf_transformation,[],[f22]) ).
fof(f53,plain,
! [X2,X0,X1] :
( ~ member(X0,union(X1,X2))
| member(X0,X2)
| member(X0,X1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f54,plain,
! [X2,X0,X1] :
( member(X0,union(X1,X2))
| ~ member(X0,X2) ),
inference(cnf_transformation,[],[f27]) ).
fof(f55,plain,
! [X2,X0,X1] :
( member(X0,union(X1,X2))
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f57,plain,
! [X2,X0,X1] :
( ~ member(X0,difference(X2,X1))
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f29]) ).
fof(f58,plain,
! [X2,X0,X1] :
( ~ member(X0,difference(X2,X1))
| member(X0,X2) ),
inference(cnf_transformation,[],[f29]) ).
fof(f59,plain,
! [X2,X0,X1] :
( member(X0,difference(X2,X1))
| ~ member(X0,X2)
| member(X0,X1) ),
inference(cnf_transformation,[],[f29]) ).
fof(f71,plain,
subset(sK4,sK5),
inference(cnf_transformation,[],[f41]) ).
fof(f72,plain,
subset(sK3,sK5),
inference(cnf_transformation,[],[f41]) ).
fof(f73,plain,
( equal_set(union(difference(sK5,sK3),sK4),sK5)
| subset(sK3,sK4) ),
inference(cnf_transformation,[],[f41]) ).
fof(f74,plain,
( ~ equal_set(union(difference(sK5,sK3),sK4),sK5)
| ~ subset(sK3,sK4) ),
inference(cnf_transformation,[],[f41]) ).
fof(f79,definition,
( spl6_1
<=> subset(sK3,sK4) ),
introduced(definition,[new_symbols(definition,[spl6_1])],[avatar_definition]) ).
fof(f80,plain,
( ~ subset(sK3,sK4)
| spl6_1 ),
inference(avatar_component_clause,[],[f79]) ).
fof(f81,plain,
( subset(sK3,sK4)
| ~ spl6_1 ),
inference(avatar_component_clause,[],[f79]) ).
fof(f83,definition,
( spl6_2
<=> equal_set(union(difference(sK5,sK3),sK4),sK5) ),
introduced(definition,[new_symbols(definition,[spl6_2])],[avatar_definition]) ).
fof(f84,plain,
( ~ equal_set(union(difference(sK5,sK3),sK4),sK5)
| spl6_2 ),
inference(avatar_component_clause,[],[f83]) ).
fof(f85,plain,
( equal_set(union(difference(sK5,sK3),sK4),sK5)
| ~ spl6_2 ),
inference(avatar_component_clause,[],[f83]) ).
fof(f86,plain,
( spl6_1
| spl6_2 ),
inference(avatar_split_clause,[],[f73,f83,f79]) ).
fof(f87,plain,
( ~ spl6_1
| ~ spl6_2 ),
inference(avatar_split_clause,[],[f74,f83,f79]) ).
fof(f88,plain,
( subset(sK5,union(difference(sK5,sK3),sK4))
| ~ spl6_2 ),
inference(resolution,[],[f45,f85]) ).
fof(f91,plain,
( member(sK0(sK3,sK4),sK3)
| spl6_1 ),
inference(resolution,[],[f43,f80]) ).
fof(f93,plain,
! [X2,X0,X1] :
( subset(X0,union(X1,X2))
| ~ member(sK0(X0,union(X1,X2)),X2) ),
inference(resolution,[],[f54,f44]) ).
fof(f95,plain,
! [X2,X0,X1] :
( subset(X0,union(X1,X2))
| ~ member(sK0(X0,union(X1,X2)),X1) ),
inference(resolution,[],[f55,f44]) ).
fof(f96,plain,
! [X0] :
( ~ member(X0,sK4)
| member(X0,sK5) ),
inference(resolution,[],[f42,f71]) ).
fof(f97,plain,
! [X0] :
( member(X0,sK5)
| ~ member(X0,sK3) ),
inference(resolution,[],[f42,f72]) ).
fof(f99,plain,
( ! [X0] :
( member(X0,union(difference(sK5,sK3),sK4))
| ~ member(X0,sK5) )
| ~ spl6_2 ),
inference(resolution,[],[f42,f88]) ).
fof(f110,plain,
( ! [X0] :
( member(X0,sK4)
| ~ member(X0,sK5)
| member(X0,difference(sK5,sK3)) )
| ~ spl6_2 ),
inference(resolution,[],[f99,f53]) ).
fof(f113,plain,
( ! [X0] :
( member(sK0(X0,sK4),difference(sK5,sK3))
| ~ member(sK0(X0,sK4),sK5)
| subset(X0,sK4) )
| ~ spl6_2 ),
inference(resolution,[],[f110,f44]) ).
fof(f117,plain,
( ! [X0] :
( ~ member(sK0(X0,sK4),sK5)
| subset(X0,sK4)
| ~ member(sK0(X0,sK4),sK3) )
| ~ spl6_2 ),
inference(resolution,[],[f113,f57]) ).
fof(f118,plain,
( ! [X0] :
( ~ member(sK0(X0,sK4),sK3)
| subset(X0,sK4) )
| ~ spl6_2 ),
inference(forward_subsumption_resolution,[],[f117,f97]) ).
fof(f119,plain,
( subset(sK3,sK4)
| spl6_1
| ~ spl6_2 ),
inference(resolution,[],[f118,f91]) ).
fof(f120,plain,
( $false
| spl6_1
| ~ spl6_2 ),
inference(forward_subsumption_resolution,[],[f119,f80]) ).
fof(f121,plain,
( spl6_1
| ~ spl6_2 ),
inference(avatar_contradiction_clause,[],[f120]) ).
fof(f122,plain,
( ! [X0] :
( ~ member(X0,sK3)
| member(X0,sK4) )
| ~ spl6_1 ),
inference(resolution,[],[f81,f42]) ).
fof(f123,plain,
( ~ subset(union(difference(sK5,sK3),sK4),sK5)
| ~ subset(sK5,union(difference(sK5,sK3),sK4))
| spl6_2 ),
inference(resolution,[],[f84,f47]) ).
fof(f125,definition,
( spl6_3
<=> subset(sK5,union(difference(sK5,sK3),sK4)) ),
introduced(definition,[new_symbols(definition,[spl6_3])],[avatar_definition]) ).
fof(f127,plain,
( ~ subset(sK5,union(difference(sK5,sK3),sK4))
| spl6_3 ),
inference(avatar_component_clause,[],[f125]) ).
fof(f129,definition,
( spl6_4
<=> subset(union(difference(sK5,sK3),sK4),sK5) ),
introduced(definition,[new_symbols(definition,[spl6_4])],[avatar_definition]) ).
fof(f131,plain,
( ~ subset(union(difference(sK5,sK3),sK4),sK5)
| spl6_4 ),
inference(avatar_component_clause,[],[f129]) ).
fof(f132,plain,
( ~ spl6_3
| ~ spl6_4
| spl6_2 ),
inference(avatar_split_clause,[],[f123,f83,f129,f125]) ).
fof(f133,plain,
( member(sK0(sK5,union(difference(sK5,sK3),sK4)),sK5)
| spl6_3 ),
inference(resolution,[],[f127,f43]) ).
fof(f157,plain,
( ~ member(sK0(sK5,union(difference(sK5,sK3),sK4)),sK4)
| spl6_3 ),
inference(resolution,[],[f93,f127]) ).
fof(f159,plain,
( ~ member(sK0(sK5,union(difference(sK5,sK3),sK4)),difference(sK5,sK3))
| spl6_3 ),
inference(resolution,[],[f95,f127]) ).
fof(f160,plain,
( ~ member(sK0(sK5,union(difference(sK5,sK3),sK4)),sK5)
| member(sK0(sK5,union(difference(sK5,sK3),sK4)),sK3)
| spl6_3 ),
inference(resolution,[],[f159,f59]) ).
fof(f161,plain,
( member(sK0(sK5,union(difference(sK5,sK3),sK4)),sK3)
| spl6_3 ),
inference(forward_subsumption_resolution,[],[f160,f133]) ).
fof(f164,plain,
( member(sK0(sK5,union(difference(sK5,sK3),sK4)),sK4)
| ~ spl6_1
| spl6_3 ),
inference(resolution,[],[f161,f122]) ).
fof(f166,plain,
( $false
| ~ spl6_1
| spl6_3 ),
inference(forward_subsumption_resolution,[],[f164,f157]) ).
fof(f167,plain,
( ~ spl6_1
| spl6_3 ),
inference(avatar_contradiction_clause,[],[f166]) ).
fof(f169,plain,
( member(sK0(union(difference(sK5,sK3),sK4),sK5),union(difference(sK5,sK3),sK4))
| spl6_4 ),
inference(resolution,[],[f131,f43]) ).
fof(f171,plain,
( member(sK0(union(difference(sK5,sK3),sK4),sK5),sK4)
| member(sK0(union(difference(sK5,sK3),sK4),sK5),difference(sK5,sK3))
| spl6_4 ),
inference(resolution,[],[f169,f53]) ).
fof(f174,definition,
( spl6_5
<=> member(sK0(union(difference(sK5,sK3),sK4),sK5),difference(sK5,sK3)) ),
introduced(definition,[new_symbols(definition,[spl6_5])],[avatar_definition]) ).
fof(f176,plain,
( member(sK0(union(difference(sK5,sK3),sK4),sK5),difference(sK5,sK3))
| ~ spl6_5 ),
inference(avatar_component_clause,[],[f174]) ).
fof(f178,definition,
( spl6_6
<=> member(sK0(union(difference(sK5,sK3),sK4),sK5),sK4) ),
introduced(definition,[new_symbols(definition,[spl6_6])],[avatar_definition]) ).
fof(f180,plain,
( member(sK0(union(difference(sK5,sK3),sK4),sK5),sK4)
| ~ spl6_6 ),
inference(avatar_component_clause,[],[f178]) ).
fof(f181,plain,
( spl6_5
| spl6_6
| spl6_4 ),
inference(avatar_split_clause,[],[f171,f129,f178,f174]) ).
fof(f182,plain,
( member(sK0(union(difference(sK5,sK3),sK4),sK5),sK5)
| ~ spl6_6 ),
inference(resolution,[],[f180,f96]) ).
fof(f187,plain,
( subset(union(difference(sK5,sK3),sK4),sK5)
| ~ spl6_6 ),
inference(resolution,[],[f182,f44]) ).
fof(f190,plain,
( $false
| spl6_4
| ~ spl6_6 ),
inference(forward_subsumption_resolution,[],[f187,f131]) ).
fof(f191,plain,
( spl6_4
| ~ spl6_6 ),
inference(avatar_contradiction_clause,[],[f190]) ).
fof(f221,plain,
( member(sK0(union(difference(sK5,sK3),sK4),sK5),sK5)
| ~ spl6_5 ),
inference(resolution,[],[f176,f58]) ).
fof(f227,plain,
( subset(union(difference(sK5,sK3),sK4),sK5)
| ~ spl6_5 ),
inference(resolution,[],[f221,f44]) ).
fof(f232,plain,
( $false
| spl6_4
| ~ spl6_5 ),
inference(forward_subsumption_resolution,[],[f227,f131]) ).
fof(f233,plain,
( spl6_4
| ~ spl6_5 ),
inference(avatar_contradiction_clause,[],[f232]) ).
cnf(s1,plain,
( spl6_1
| spl6_2 ),
inference(sat_conversion,[],[f86]) ).
cnf(s2,plain,
( ~ spl6_1
| ~ spl6_2 ),
inference(sat_conversion,[],[f87]) ).
cnf(s3,plain,
( spl6_1
| ~ spl6_2 ),
inference(sat_conversion,[],[f121]) ).
cnf(s4,plain,
( spl6_2
| ~ spl6_3
| ~ spl6_4 ),
inference(sat_conversion,[],[f132]) ).
cnf(s5,plain,
( ~ spl6_1
| spl6_3 ),
inference(sat_conversion,[],[f167]) ).
cnf(s6,plain,
( spl6_4
| spl6_5
| spl6_6 ),
inference(sat_conversion,[],[f181]) ).
cnf(s7,plain,
( spl6_4
| ~ spl6_6 ),
inference(sat_conversion,[],[f191]) ).
cnf(s8,plain,
( spl6_4
| ~ spl6_5 ),
inference(sat_conversion,[],[f233]) ).
cnf(s9,plain,
spl6_1,
inference(rat,[],[s1,s3]) ).
cnf(s10,plain,
spl6_3,
inference(rat,[],[s5,s9]) ).
cnf(s11,plain,
~ spl6_2,
inference(rat,[],[s2,s9]) ).
cnf(s12,plain,
~ spl6_4,
inference(rat,[],[s4,s10,s11]) ).
cnf(s13,plain,
~ spl6_5,
inference(rat,[],[s8,s12]) ).
cnf(s14,plain,
~ spl6_6,
inference(rat,[],[s7,s12]) ).
cnf(s15,plain,
$false,
inference(rat,[],[s6,s13,s14,s12]) ).
fof(f234,plain,
$false,
inference(avatar_sat_refutation,[],[s15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET698+4 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.38 % Computer : n020.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8046.5625MB
% 0.13/0.38 % OS : Linux 6.8.0-71-generic
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Mon Sep 28 02:34:19 UTC 2026
% 0.13/0.38 % CPUTime :
% 0.13/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.42 Running first-order theorem proving
% 0.13/0.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
% 2.17/1.16 % (3979205)Detected formulas, will run a generic FOF schedule.
% 2.17/1.16 % (3979257)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2289502682:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.17/1.16 % (3979257)First to succeed.
% 2.17/1.16 % (3979257)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3979205"
% 2.17/1.16 % (3979254)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=314055571:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.17/1.16 % (3979255)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=419202682:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.17/1.16 % (3979252)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=3572857277:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.17/1.16 % (3979253)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=1573622213:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.17/1.16 % (3979255)Refutation not found, incomplete strategy
% 2.17/1.16 % (3979255)------------------------------
% 2.17/1.16 % (3979255)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.17/1.16 % (3979255)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.17/1.16 % (3979255)CaDiCaL version: 2.1.3
% 2.17/1.16 % (3979255)Termination reason: Refutation not found, incomplete strategy
% 2.17/1.16 % (3979255)Time elapsed: 0.002 s
% 2.17/1.16 % (3979255)Peak memory usage: 88 MB
% 2.17/1.16 % (3979255)Instructions burned: 1 (million)
% 2.17/1.16 % (3979256)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=143358742:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.17/1.16 % (3979258)dis-21_1_sil=8000:lcm=predicate:random_seed=2199677380: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.17/1.16 % (3979258)Also succeeded, but the first one will report.
% 2.17/1.16 % (3979256)Instruction limit reached!
% 2.17/1.16 % (3979256)------------------------------
% 2.17/1.16 % (3979256)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.17/1.16 % (3979256)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.17/1.16 % (3979256)CaDiCaL version: 2.1.3
% 2.17/1.16 % (3979256)Termination reason: Instruction limit
% 2.17/1.16 % (3979256)Termination phase: Saturation
% 2.17/1.16 % (3979256)Time elapsed: 0.073 s
% 2.17/1.16 % (3979256)Peak memory usage: 88 MB
% 2.17/1.16 % (3979256)Instructions burned: 119 (million)
% 2.17/1.16 % (3979257)Refutation found. Thanks to Tanya!
% 2.17/1.16 % SZS status Theorem for theBenchmark
% 2.17/1.16 % SZS output start Proof for theBenchmark
% See solution above
% 2.71/1.35 % (3979257)------------------------------
% 2.71/1.35 % (3979257)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.71/1.35 % (3979257)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.71/1.35 % (3979257)CaDiCaL version: 2.1.3
% 2.71/1.35 % (3979257)Termination reason: Refutation
% 2.71/1.35 % (3979257)Time elapsed: 0.005 s
% 2.71/1.35 % (3979257)Peak memory usage: 89 MB
% 2.71/1.35 % (3979257)Instructions burned: 11 (million)
% 2.71/1.35 % (3979257)------------------------------
% 2.71/1.35 % (3979257)------------------------------
% 2.71/1.35 % (3979205)Success in time 0.297 s
% 2.71/1.35 % Vampire exiting
%------------------------------------------------------------------------------