%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SET815+4 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n010.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:59 PM UTC 2026
% Result : Theorem 2.62s 1.26s
% Output : Refutation 3.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 13
% Syntax : Number of formulae : 99 ( 11 unt; 5 def)
% Number of atoms : 291 ( 6 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 312 ( 120 ~; 130 |; 43 &)
% ( 14 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 6 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 3 con; 0-2 aty)
% Number of variables : 115 ( 0 sgn 106 !; 9 ?)
% 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(f8,axiom,
! [X0,X1] :
( member(X0,singleton(X1))
<=> X0 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',singleton) ).
fof(f10,axiom,
! [X0,X1] :
( member(X0,sum(X1))
<=> ? [X2] :
( member(X2,X1)
& member(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sum) ).
fof(f12,axiom,
! [X0] :
( member(X0,on)
<=> ( set(X0)
& strict_well_order(member_predicate,X0)
& ! [X1] :
( member(X1,X0)
=> subset(X1,X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ordinal_number) ).
fof(f19,axiom,
! [X0,X1] :
( member(X1,suc(X0))
<=> member(X1,union(X0,singleton(X0))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor) ).
fof(f21,conjecture,
! [X0] :
( member(X0,on)
=> equal_set(sum(suc(X0)),X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thV15) ).
fof(f22,negated_conjecture,
~ ! [X0] :
( member(X0,on)
=> equal_set(sum(suc(X0)),X0) ),
inference(negated_conjecture,[status(cth)],[f21]) ).
fof(f24,plain,
! [X0,X1] :
( ( subset(X0,X1)
& subset(X1,X0) )
=> equal_set(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f2]) ).
fof(f25,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f26,plain,
! [X0,X1] :
( equal_set(X0,X1)
| ~ subset(X0,X1)
| ~ subset(X1,X0) ),
inference(ennf_transformation,[],[f24]) ).
fof(f27,plain,
! [X0,X1] :
( equal_set(X0,X1)
| ~ subset(X0,X1)
| ~ subset(X1,X0) ),
inference(flattening,[],[f26]) ).
fof(f29,plain,
! [X0] :
( member(X0,on)
<=> ( set(X0)
& strict_well_order(member_predicate,X0)
& ! [X1] :
( subset(X1,X0)
| ~ member(X1,X0) ) ) ),
inference(ennf_transformation,[],[f12]) ).
fof(f38,plain,
? [X0] :
( ~ equal_set(sum(suc(X0)),X0)
& member(X0,on) ),
inference(ennf_transformation,[],[f22]) ).
fof(f41,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,[],[f25]) ).
fof(f42,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,[],[f41]) ).
fof(f43,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ member(sK1(X0,X1),X1)
& member(sK1(X0,X1),X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X2,sK1(X0,X1))],[f42]) ).
fof(f47,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(f48,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,[],[f47]) ).
fof(f51,plain,
! [X0,X1] :
( ( member(X0,singleton(X1))
| X0 != X1 )
& ( X0 = X1
| ~ member(X0,singleton(X1)) ) ),
inference(nnf_transformation,[],[f8]) ).
fof(f54,plain,
! [X0,X1] :
( ( member(X0,sum(X1))
| ! [X2] :
( ~ member(X2,X1)
| ~ member(X0,X2) ) )
& ( ? [X2] :
( member(X2,X1)
& member(X0,X2) )
| ~ member(X0,sum(X1)) ) ),
inference(nnf_transformation,[],[f10]) ).
fof(f55,plain,
! [X0,X1] :
( ( member(X0,sum(X1))
| ! [X2] :
( ~ member(X2,X1)
| ~ member(X0,X2) ) )
& ( ? [X3] :
( member(X3,X1)
& member(X0,X3) )
| ~ member(X0,sum(X1)) ) ),
inference(rectify,[],[f54]) ).
fof(f56,plain,
! [X0,X1] :
( ( member(X0,sum(X1))
| ! [X2] :
( ~ member(X2,X1)
| ~ member(X0,X2) ) )
& ( ( member(sK2(X0,X1),X1)
& member(X0,sK2(X0,X1)) )
| ~ member(X0,sum(X1)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X3,sK2(X0,X1))],[f55]) ).
fof(f60,plain,
! [X0] :
( ( member(X0,on)
| ~ set(X0)
| ~ strict_well_order(member_predicate,X0)
| ? [X1] :
( ~ subset(X1,X0)
& member(X1,X0) ) )
& ( ( set(X0)
& strict_well_order(member_predicate,X0)
& ! [X1] :
( subset(X1,X0)
| ~ member(X1,X0) ) )
| ~ member(X0,on) ) ),
inference(nnf_transformation,[],[f29]) ).
fof(f61,plain,
! [X0] :
( ( member(X0,on)
| ~ set(X0)
| ~ strict_well_order(member_predicate,X0)
| ? [X1] :
( ~ subset(X1,X0)
& member(X1,X0) ) )
& ( ( set(X0)
& strict_well_order(member_predicate,X0)
& ! [X1] :
( subset(X1,X0)
| ~ member(X1,X0) ) )
| ~ member(X0,on) ) ),
inference(flattening,[],[f60]) ).
fof(f62,plain,
! [X0] :
( ( member(X0,on)
| ~ set(X0)
| ~ strict_well_order(member_predicate,X0)
| ? [X1] :
( ~ subset(X1,X0)
& member(X1,X0) ) )
& ( ( set(X0)
& strict_well_order(member_predicate,X0)
& ! [X2] :
( subset(X2,X0)
| ~ member(X2,X0) ) )
| ~ member(X0,on) ) ),
inference(rectify,[],[f61]) ).
fof(f63,plain,
! [X0] :
( ( member(X0,on)
| ~ set(X0)
| ~ strict_well_order(member_predicate,X0)
| ( ~ subset(sK4(X0),X0)
& member(sK4(X0),X0) ) )
& ( ( set(X0)
& strict_well_order(member_predicate,X0)
& ! [X2] :
( subset(X2,X0)
| ~ member(X2,X0) ) )
| ~ member(X0,on) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(X1,sK4(X0))],[f62]) ).
fof(f82,plain,
! [X0,X1] :
( ( member(X1,suc(X0))
| ~ member(X1,union(X0,singleton(X0))) )
& ( member(X1,union(X0,singleton(X0)))
| ~ member(X1,suc(X0)) ) ),
inference(nnf_transformation,[],[f19]) ).
fof(f83,plain,
( ~ equal_set(sum(suc(sK14)),sK14)
& member(sK14,on) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK14]),skolemize(X0,sK14)],[f38]) ).
fof(f84,plain,
! [X3,X0,X1] :
( ~ subset(X0,X1)
| ~ member(X3,X0)
| member(X3,X1) ),
inference(cnf_transformation,[],[f43]) ).
fof(f85,plain,
! [X0,X1] :
( subset(X0,X1)
| member(sK1(X0,X1),X0) ),
inference(cnf_transformation,[],[f43]) ).
fof(f86,plain,
! [X0,X1] :
( ~ member(sK1(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f43]) ).
fof(f87,plain,
! [X0,X1] :
( equal_set(X0,X1)
| ~ subset(X0,X1)
| ~ subset(X1,X0) ),
inference(cnf_transformation,[],[f27]) ).
fof(f93,plain,
! [X2,X0,X1] :
( ~ member(X0,union(X1,X2))
| member(X0,X2)
| member(X0,X1) ),
inference(cnf_transformation,[],[f48]) ).
fof(f94,plain,
! [X2,X0,X1] :
( member(X0,union(X1,X2))
| ~ member(X0,X2) ),
inference(cnf_transformation,[],[f48]) ).
fof(f100,plain,
! [X0,X1] :
( ~ member(X0,singleton(X1))
| X0 = X1 ),
inference(cnf_transformation,[],[f51]) ).
fof(f101,plain,
! [X0,X1] :
( member(X0,singleton(X1))
| X0 != X1 ),
inference(cnf_transformation,[],[f51]) ).
fof(f105,plain,
! [X0,X1] :
( member(X0,sK2(X0,X1))
| ~ member(X0,sum(X1)) ),
inference(cnf_transformation,[],[f56]) ).
fof(f106,plain,
! [X0,X1] :
( ~ member(X0,sum(X1))
| member(sK2(X0,X1),X1) ),
inference(cnf_transformation,[],[f56]) ).
fof(f107,plain,
! [X2,X0,X1] :
( member(X0,sum(X1))
| ~ member(X2,X1)
| ~ member(X0,X2) ),
inference(cnf_transformation,[],[f56]) ).
fof(f111,plain,
! [X2,X0] :
( ~ member(X0,on)
| ~ member(X2,X0)
| subset(X2,X0) ),
inference(cnf_transformation,[],[f63]) ).
fof(f145,plain,
! [X0,X1] :
( ~ member(X1,suc(X0))
| member(X1,union(X0,singleton(X0))) ),
inference(cnf_transformation,[],[f82]) ).
fof(f146,plain,
! [X0,X1] :
( member(X1,suc(X0))
| ~ member(X1,union(X0,singleton(X0))) ),
inference(cnf_transformation,[],[f82]) ).
fof(f148,plain,
member(sK14,on),
inference(cnf_transformation,[],[f83]) ).
fof(f149,plain,
~ equal_set(sum(suc(sK14)),sK14),
inference(cnf_transformation,[],[f83]) ).
fof(f150,plain,
! [X1] : member(X1,singleton(X1)),
inference(equality_resolution,[],[f101]) ).
fof(f162,plain,
( ~ subset(sum(suc(sK14)),sK14)
| ~ subset(sK14,sum(suc(sK14))) ),
inference(resolution,[],[f87,f149]) ).
fof(f164,definition,
( spl15_1
<=> subset(sK14,sum(suc(sK14))) ),
introduced(definition,[new_symbols(definition,[spl15_1])],[avatar_definition]) ).
fof(f166,plain,
( ~ subset(sK14,sum(suc(sK14)))
| spl15_1 ),
inference(avatar_component_clause,[],[f164]) ).
fof(f168,definition,
( spl15_2
<=> subset(sum(suc(sK14)),sK14) ),
introduced(definition,[new_symbols(definition,[spl15_2])],[avatar_definition]) ).
fof(f170,plain,
( ~ subset(sum(suc(sK14)),sK14)
| spl15_2 ),
inference(avatar_component_clause,[],[f168]) ).
fof(f171,plain,
( ~ spl15_1
| ~ spl15_2 ),
inference(avatar_split_clause,[],[f162,f168,f164]) ).
fof(f172,plain,
( member(sK1(sK14,sum(suc(sK14))),sK14)
| spl15_1 ),
inference(resolution,[],[f166,f85]) ).
fof(f174,plain,
! [X0] :
( ~ member(X0,sK14)
| subset(X0,sK14) ),
inference(resolution,[],[f111,f148]) ).
fof(f187,plain,
! [X2,X0,X1] :
( subset(X2,sum(X1))
| ~ member(sK1(X2,sum(X1)),X0)
| ~ member(X0,X1) ),
inference(resolution,[],[f107,f86]) ).
fof(f337,plain,
( ! [X0] :
( ~ member(X0,suc(sK14))
| ~ member(sK1(sK14,sum(suc(sK14))),X0) )
| spl15_1 ),
inference(resolution,[],[f187,f166]) ).
fof(f339,plain,
( ! [X0] :
( ~ member(X0,union(sK14,singleton(sK14)))
| ~ member(sK1(sK14,sum(suc(sK14))),X0) )
| spl15_1 ),
inference(resolution,[],[f337,f146]) ).
fof(f345,plain,
( ! [X0] :
( ~ member(X0,singleton(sK14))
| ~ member(sK1(sK14,sum(suc(sK14))),X0) )
| spl15_1 ),
inference(resolution,[],[f339,f94]) ).
fof(f355,plain,
( ~ member(sK1(sK14,sum(suc(sK14))),sK14)
| spl15_1 ),
inference(resolution,[],[f345,f150]) ).
fof(f358,plain,
( $false
| spl15_1 ),
inference(forward_subsumption_resolution,[],[f355,f172]) ).
fof(f359,plain,
spl15_1,
inference(avatar_contradiction_clause,[],[f358]) ).
fof(f362,plain,
( member(sK1(sum(suc(sK14)),sK14),sum(suc(sK14)))
| spl15_2 ),
inference(resolution,[],[f170,f85]) ).
fof(f374,plain,
( member(sK2(sK1(sum(suc(sK14)),sK14),suc(sK14)),suc(sK14))
| spl15_2 ),
inference(resolution,[],[f362,f106]) ).
fof(f384,plain,
( member(sK2(sK1(sum(suc(sK14)),sK14),suc(sK14)),union(sK14,singleton(sK14)))
| spl15_2 ),
inference(resolution,[],[f374,f145]) ).
fof(f400,plain,
( member(sK2(sK1(sum(suc(sK14)),sK14),suc(sK14)),singleton(sK14))
| member(sK2(sK1(sum(suc(sK14)),sK14),suc(sK14)),sK14)
| spl15_2 ),
inference(resolution,[],[f384,f93]) ).
fof(f403,definition,
( spl15_5
<=> member(sK2(sK1(sum(suc(sK14)),sK14),suc(sK14)),sK14) ),
introduced(definition,[new_symbols(definition,[spl15_5])],[avatar_definition]) ).
fof(f405,plain,
( member(sK2(sK1(sum(suc(sK14)),sK14),suc(sK14)),sK14)
| ~ spl15_5 ),
inference(avatar_component_clause,[],[f403]) ).
fof(f407,definition,
( spl15_6
<=> member(sK2(sK1(sum(suc(sK14)),sK14),suc(sK14)),singleton(sK14)) ),
introduced(definition,[new_symbols(definition,[spl15_6])],[avatar_definition]) ).
fof(f409,plain,
( member(sK2(sK1(sum(suc(sK14)),sK14),suc(sK14)),singleton(sK14))
| ~ spl15_6 ),
inference(avatar_component_clause,[],[f407]) ).
fof(f410,plain,
( spl15_5
| spl15_6
| spl15_2 ),
inference(avatar_split_clause,[],[f400,f168,f407,f403]) ).
fof(f416,plain,
( subset(sK2(sK1(sum(suc(sK14)),sK14),suc(sK14)),sK14)
| ~ spl15_5 ),
inference(resolution,[],[f405,f174]) ).
fof(f422,plain,
( ! [X0] :
( ~ member(X0,sK2(sK1(sum(suc(sK14)),sK14),suc(sK14)))
| member(X0,sK14) )
| ~ spl15_5 ),
inference(resolution,[],[f416,f84]) ).
fof(f431,plain,
( member(sK1(sum(suc(sK14)),sK14),sK14)
| ~ member(sK1(sum(suc(sK14)),sK14),sum(suc(sK14)))
| ~ spl15_5 ),
inference(resolution,[],[f422,f105]) ).
fof(f434,plain,
( member(sK1(sum(suc(sK14)),sK14),sK14)
| spl15_2
| ~ spl15_5 ),
inference(forward_subsumption_resolution,[],[f431,f362]) ).
fof(f438,plain,
( subset(sum(suc(sK14)),sK14)
| spl15_2
| ~ spl15_5 ),
inference(resolution,[],[f434,f86]) ).
fof(f441,plain,
( $false
| spl15_2
| ~ spl15_5 ),
inference(forward_subsumption_resolution,[],[f438,f170]) ).
fof(f442,plain,
( spl15_2
| ~ spl15_5 ),
inference(avatar_contradiction_clause,[],[f441]) ).
fof(f450,plain,
( sK14 = sK2(sK1(sum(suc(sK14)),sK14),suc(sK14))
| ~ spl15_6 ),
inference(resolution,[],[f409,f100]) ).
fof(f462,plain,
( member(sK1(sum(suc(sK14)),sK14),sK14)
| ~ member(sK1(sum(suc(sK14)),sK14),sum(suc(sK14)))
| ~ spl15_6 ),
inference(superposition,[],[f105,f450]) ).
fof(f463,plain,
( member(sK1(sum(suc(sK14)),sK14),sK14)
| spl15_2
| ~ spl15_6 ),
inference(forward_subsumption_resolution,[],[f462,f362]) ).
fof(f473,definition,
( spl15_9
<=> member(sK1(sum(suc(sK14)),sK14),sK14) ),
introduced(definition,[new_symbols(definition,[spl15_9])],[avatar_definition]) ).
fof(f474,plain,
( member(sK1(sum(suc(sK14)),sK14),sK14)
| ~ spl15_9 ),
inference(avatar_component_clause,[],[f473]) ).
fof(f484,plain,
( spl15_9
| spl15_2
| ~ spl15_6 ),
inference(avatar_split_clause,[],[f463,f407,f168,f473]) ).
fof(f502,plain,
( subset(sum(suc(sK14)),sK14)
| ~ spl15_9 ),
inference(resolution,[],[f474,f86]) ).
fof(f505,plain,
( $false
| spl15_2
| ~ spl15_9 ),
inference(forward_subsumption_resolution,[],[f502,f170]) ).
fof(f506,plain,
( spl15_2
| ~ spl15_9 ),
inference(avatar_contradiction_clause,[],[f505]) ).
cnf(s1,plain,
( ~ spl15_1
| ~ spl15_2 ),
inference(sat_conversion,[],[f171]) ).
cnf(s3,plain,
spl15_1,
inference(sat_conversion,[],[f359]) ).
cnf(s4,plain,
( spl15_2
| spl15_5
| spl15_6 ),
inference(sat_conversion,[],[f410]) ).
cnf(s5,plain,
( spl15_2
| ~ spl15_5 ),
inference(sat_conversion,[],[f442]) ).
cnf(s11,plain,
( spl15_2
| ~ spl15_6
| spl15_9 ),
inference(sat_conversion,[],[f484]) ).
cnf(s13,plain,
( spl15_2
| ~ spl15_9 ),
inference(sat_conversion,[],[f506]) ).
cnf(s14,plain,
~ spl15_2,
inference(rat,[],[s1,s3]) ).
cnf(s15,plain,
~ spl15_9,
inference(rat,[],[s13,s14]) ).
cnf(s16,plain,
~ spl15_6,
inference(rat,[],[s11,s15,s14]) ).
cnf(s17,plain,
~ spl15_5,
inference(rat,[],[s5,s14]) ).
cnf(s18,plain,
$false,
inference(rat,[],[s4,s16,s17,s14]) ).
fof(f507,plain,
$false,
inference(avatar_sat_refutation,[],[s18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET815+4 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n010.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 28 02:54:17 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.40 Running first-order theorem proving
% 0.09/0.40 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.62/1.26 % (1513803)Detected formulas, will run a generic FOF schedule.
% 2.62/1.26 % (1513811)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1577922539:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.62/1.26 % (1513811)Refutation not found, incomplete strategy
% 2.62/1.26 % (1513811)------------------------------
% 2.62/1.26 % (1513811)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.62/1.26 % (1513811)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.62/1.26 % (1513811)CaDiCaL version: 2.1.3
% 2.62/1.26 % (1513811)Termination reason: Refutation not found, incomplete strategy
% 2.62/1.26 % (1513811)Time elapsed: 0.001 s
% 2.62/1.26 % (1513811)Peak memory usage: 88 MB
% 2.62/1.26 % (1513814)dis-21_1_sil=8000:lcm=predicate:random_seed=2120760134: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.62/1.26 % (1513812)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=154781896:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.62/1.26 % (1513810)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=15671155:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.62/1.26 % (1513808)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=1210567210:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.62/1.26 % (1513813)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1245672127:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.62/1.26 % (1513809)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=2122146191:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.62/1.26 % (1513813)First to succeed.
% 2.62/1.26 % (1513813)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1513803"
% 2.62/1.26 % (1513814)Instruction limit reached!
% 2.62/1.26 % (1513814)------------------------------
% 2.62/1.26 % (1513814)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.62/1.26 % (1513814)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.62/1.26 % (1513814)CaDiCaL version: 2.1.3
% 2.62/1.26 % (1513814)Termination reason: Instruction limit
% 2.62/1.26 % (1513814)Termination phase: Saturation
% 2.62/1.26 % (1513814)Time elapsed: 0.073 s
% 2.62/1.26 % (1513814)Peak memory usage: 89 MB
% 2.62/1.26 % (1513814)Instructions burned: 129 (million)
% 2.62/1.26 % (1513812)Instruction limit reached!
% 2.62/1.26 % (1513812)------------------------------
% 2.62/1.26 % (1513812)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.62/1.26 % (1513812)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.62/1.26 % (1513812)CaDiCaL version: 2.1.3
% 2.62/1.26 % (1513812)Termination reason: Instruction limit
% 2.62/1.26 % (1513812)Termination phase: Saturation
% 2.62/1.26 % (1513812)Time elapsed: 0.076 s
% 2.62/1.26 % (1513812)Peak memory usage: 88 MB
% 2.62/1.26 % (1513812)Instructions burned: 120 (million)
% 2.62/1.26 % (1513811)------------------------------
% 2.62/1.26 % (1513811)------------------------------
% 2.62/1.26 % (1513824)lrs+1011_1_sil=32000:sp=occurrence:random_seed=3290944955:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 2.62/1.26 % (1513823)lrs+10_1_sil=32000:urr=on:br=off:random_seed=1097425240:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.62/1.26 % (1513823)Refutation not found, incomplete strategy
% 2.62/1.26 % (1513823)------------------------------
% 2.62/1.26 % (1513823)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.62/1.26 % (1513823)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.62/1.26 % (1513823)CaDiCaL version: 2.1.3
% 2.62/1.26 % (1513823)Termination reason: Refutation not found, incomplete strategy
% 2.62/1.26 % (1513823)Time elapsed: 0.002 s
% 2.62/1.26 % (1513823)Peak memory usage: 88 MB
% 2.62/1.26 % (1513823)Instructions burned: 1 (million)
% 2.62/1.26 % (1513822)lrs+10_1_sil=8000:sp=occurrence:random_seed=1899153010:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.62/1.26 % (1513813)Refutation found. Thanks to Tanya!
% 2.62/1.26 % SZS status Theorem for theBenchmark
% 2.62/1.26 % SZS output start Proof for theBenchmark
% See solution above
% 3.60/1.45 % (1513813)------------------------------
% 3.60/1.45 % (1513813)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.60/1.45 % (1513813)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.60/1.45 % (1513813)CaDiCaL version: 2.1.3
% 3.60/1.45 % (1513813)Termination reason: Refutation
% 3.60/1.45 % (1513813)Time elapsed: 0.020 s
% 3.60/1.45 % (1513813)Peak memory usage: 90 MB
% 3.60/1.45 % (1513813)Instructions burned: 26 (million)
% 3.60/1.45 % (1513813)------------------------------
% 3.60/1.45 % (1513813)------------------------------
% 3.60/1.45 % (1513803)Success in time 0.426 s
% 3.60/1.45 % Vampire exiting
%------------------------------------------------------------------------------