%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU168+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n015.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:33 PM UTC 2026
% Result : Theorem 3.53s 1.60s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 6
% Syntax : Number of formulae : 74 ( 6 unt; 2 def)
% Number of atoms : 322 ( 10 equ)
% Maximal formula atoms : 11 ( 4 avg)
% Number of connectives : 404 ( 156 ~; 148 |; 85 &)
% ( 4 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 1 con; 0-2 aty)
% Number of variables : 182 ( 152 !; 30 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f9,axiom,
! [X0,X1] :
( X1 = powerset(X0)
<=> ! [X2] :
( in(X2,X1)
<=> subset(X2,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_zfmisc_1) ).
fof(f13,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(f56,conjecture,
! [X0] :
? [X1] :
( in(X0,X1)
& ! [X2,X3] :
( ( in(X2,X1)
& subset(X3,X2) )
=> in(X3,X1) )
& ! [X2] :
( in(X2,X1)
=> in(powerset(X2),X1) )
& ! [X2] :
~ ( subset(X2,X1)
& ~ are_equipotent(X2,X1)
& ~ in(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t136_zfmisc_1) ).
fof(f57,negated_conjecture,
~ ! [X0] :
? [X1] :
( in(X0,X1)
& ! [X2,X3] :
( ( in(X2,X1)
& subset(X3,X2) )
=> in(X3,X1) )
& ! [X2] :
( in(X2,X1)
=> in(powerset(X2),X1) )
& ! [X2] :
~ ( subset(X2,X1)
& ~ are_equipotent(X2,X1)
& ~ in(X2,X1) ) ),
inference(negated_conjecture,[status(cth)],[f56]) ).
fof(f99,axiom,
! [X0] :
? [X1] :
( in(X0,X1)
& ! [X2,X3] :
( ( in(X2,X1)
& subset(X3,X2) )
=> in(X3,X1) )
& ! [X2] :
~ ( in(X2,X1)
& ! [X3] :
~ ( in(X3,X1)
& ! [X4] :
( subset(X4,X2)
=> in(X4,X3) ) ) )
& ! [X2] :
~ ( subset(X2,X1)
& ~ are_equipotent(X2,X1)
& ~ in(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t9_tarski) ).
fof(f105,plain,
~ ! [X0] :
? [X1] :
( in(X0,X1)
& ! [X2,X3] :
( ( in(X2,X1)
& subset(X3,X2) )
=> in(X3,X1) )
& ! [X4] :
( in(X4,X1)
=> in(powerset(X4),X1) )
& ! [X5] :
~ ( subset(X5,X1)
& ~ are_equipotent(X5,X1)
& ~ in(X5,X1) ) ),
inference(rectify,[],[f57]) ).
fof(f108,plain,
! [X0] :
? [X1] :
( in(X0,X1)
& ! [X2,X3] :
( ( in(X2,X1)
& subset(X3,X2) )
=> in(X3,X1) )
& ! [X4] :
~ ( in(X4,X1)
& ! [X5] :
~ ( in(X5,X1)
& ! [X6] :
( subset(X6,X4)
=> in(X6,X5) ) ) )
& ! [X7] :
~ ( subset(X7,X1)
& ~ are_equipotent(X7,X1)
& ~ in(X7,X1) ) ),
inference(rectify,[],[f99]) ).
fof(f112,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f13]) ).
fof(f129,plain,
? [X0] :
! [X1] :
( ~ in(X0,X1)
| ? [X2,X3] :
( ~ in(X3,X1)
& in(X2,X1)
& subset(X3,X2) )
| ? [X4] :
( ~ in(powerset(X4),X1)
& in(X4,X1) )
| ? [X5] :
( subset(X5,X1)
& ~ are_equipotent(X5,X1)
& ~ in(X5,X1) ) ),
inference(ennf_transformation,[],[f105]) ).
fof(f130,plain,
? [X0] :
! [X1] :
( ~ in(X0,X1)
| ? [X2,X3] :
( ~ in(X3,X1)
& in(X2,X1)
& subset(X3,X2) )
| ? [X4] :
( ~ in(powerset(X4),X1)
& in(X4,X1) )
| ? [X5] :
( subset(X5,X1)
& ~ are_equipotent(X5,X1)
& ~ in(X5,X1) ) ),
inference(flattening,[],[f129]) ).
fof(f156,plain,
! [X0] :
? [X1] :
( in(X0,X1)
& ! [X2,X3] :
( in(X3,X1)
| ~ in(X2,X1)
| ~ subset(X3,X2) )
& ! [X4] :
( ~ in(X4,X1)
| ? [X5] :
( in(X5,X1)
& ! [X6] :
( in(X6,X5)
| ~ subset(X6,X4) ) ) )
& ! [X7] :
( ~ subset(X7,X1)
| are_equipotent(X7,X1)
| in(X7,X1) ) ),
inference(ennf_transformation,[],[f108]) ).
fof(f157,plain,
! [X0] :
? [X1] :
( in(X0,X1)
& ! [X2,X3] :
( in(X3,X1)
| ~ in(X2,X1)
| ~ subset(X3,X2) )
& ! [X4] :
( ~ in(X4,X1)
| ? [X5] :
( in(X5,X1)
& ! [X6] :
( in(X6,X5)
| ~ subset(X6,X4) ) ) )
& ! [X7] :
( ~ subset(X7,X1)
| are_equipotent(X7,X1)
| in(X7,X1) ) ),
inference(flattening,[],[f156]) ).
fof(f159,definition,
! [X1] :
( ? [X5] :
( subset(X5,X1)
& ~ are_equipotent(X5,X1)
& ~ in(X5,X1) )
| ~ sP0(X1) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f160,plain,
? [X0] :
! [X1] :
( ~ in(X0,X1)
| ? [X2,X3] :
( ~ in(X3,X1)
& in(X2,X1)
& subset(X3,X2) )
| ? [X4] :
( ~ in(powerset(X4),X1)
& in(X4,X1) )
| sP0(X1) ),
inference(definition_folding,[],[f130,f159]) ).
fof(f169,plain,
! [X0,X1] :
( ( X1 = powerset(X0)
| ? [X2] :
( ( ~ subset(X2,X0)
| ~ in(X2,X1) )
& ( subset(X2,X0)
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| ~ subset(X2,X0) )
& ( subset(X2,X0)
| ~ in(X2,X1) ) )
| powerset(X0) != X1 ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f170,plain,
! [X0,X1] :
( ( X1 = powerset(X0)
| ? [X2] :
( ( ~ subset(X2,X0)
| ~ in(X2,X1) )
& ( subset(X2,X0)
| in(X2,X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| ~ subset(X3,X0) )
& ( subset(X3,X0)
| ~ in(X3,X1) ) )
| powerset(X0) != X1 ) ),
inference(rectify,[],[f169]) ).
fof(f171,plain,
! [X0,X1] :
( ( X1 = powerset(X0)
| ( ( ~ subset(sK3(X0,X1),X0)
| ~ in(sK3(X0,X1),X1) )
& ( subset(sK3(X0,X1),X0)
| in(sK3(X0,X1),X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| ~ subset(X3,X0) )
& ( subset(X3,X0)
| ~ in(X3,X1) ) )
| powerset(X0) != X1 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(X2,sK3(X0,X1))],[f170]) ).
fof(f183,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f112]) ).
fof(f184,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f183]) ).
fof(f185,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ in(sK11(X0,X1),X1)
& in(sK11(X0,X1),X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK11]),skolemize(X2,sK11(X0,X1))],[f184]) ).
fof(f208,plain,
! [X1] :
( ? [X5] :
( subset(X5,X1)
& ~ are_equipotent(X5,X1)
& ~ in(X5,X1) )
| ~ sP0(X1) ),
inference(nnf_transformation,[],[f159]) ).
fof(f209,plain,
! [X0] :
( ? [X1] :
( subset(X1,X0)
& ~ are_equipotent(X1,X0)
& ~ in(X1,X0) )
| ~ sP0(X0) ),
inference(rectify,[],[f208]) ).
fof(f210,plain,
! [X0] :
( ( subset(sK19(X0),X0)
& ~ are_equipotent(sK19(X0),X0)
& ~ in(sK19(X0),X0) )
| ~ sP0(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK19]),skolemize(X1,sK19(X0))],[f209]) ).
fof(f211,plain,
! [X1] :
( ~ in(sK20,X1)
| ( ~ in(sK22(X1),X1)
& in(sK21(X1),X1)
& subset(sK22(X1),sK21(X1)) )
| ( ~ in(powerset(sK23(X1)),X1)
& in(sK23(X1),X1) )
| sP0(X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK20,sK21,sK22,sK23]),skolemize(X0,sK20),skolemize(X2,sK21(X1)),skolemize(X3,sK22(X1)),skolemize(X4,sK23(X1))],[f160]) ).
fof(f224,plain,
! [X0] :
( in(X0,sK27(X0))
& ! [X2,X3] :
( in(X3,sK27(X0))
| ~ in(X2,sK27(X0))
| ~ subset(X3,X2) )
& ! [X4] :
( ~ in(X4,sK27(X0))
| ( in(sK28(X0,X4),sK27(X0))
& ! [X6] :
( in(X6,sK28(X0,X4))
| ~ subset(X6,X4) ) ) )
& ! [X7] :
( ~ subset(X7,sK27(X0))
| are_equipotent(X7,sK27(X0))
| in(X7,sK27(X0)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK27,sK28]),skolemize(X1,sK27(X0)),skolemize(X5,sK28(X0,X4))],[f157]) ).
fof(f239,plain,
! [X3,X0,X1] :
( subset(X3,X0)
| ~ in(X3,X1)
| powerset(X0) != X1 ),
inference(cnf_transformation,[],[f171]) ).
fof(f264,plain,
! [X0,X1] :
( in(sK11(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f185]) ).
fof(f265,plain,
! [X0,X1] :
( ~ in(sK11(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f185]) ).
fof(f323,plain,
! [X0] :
( ~ in(sK19(X0),X0)
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f210]) ).
fof(f324,plain,
! [X0] :
( ~ are_equipotent(sK19(X0),X0)
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f210]) ).
fof(f325,plain,
! [X0] :
( subset(sK19(X0),X0)
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f210]) ).
fof(f326,plain,
! [X1] :
( subset(sK22(X1),sK21(X1))
| ~ in(sK20,X1)
| in(sK23(X1),X1)
| sP0(X1) ),
inference(cnf_transformation,[],[f211]) ).
fof(f327,plain,
! [X1] :
( ~ in(sK20,X1)
| subset(sK22(X1),sK21(X1))
| ~ in(powerset(sK23(X1)),X1)
| sP0(X1) ),
inference(cnf_transformation,[],[f211]) ).
fof(f328,plain,
! [X1] :
( in(sK23(X1),X1)
| in(sK21(X1),X1)
| ~ in(sK20,X1)
| sP0(X1) ),
inference(cnf_transformation,[],[f211]) ).
fof(f329,plain,
! [X1] :
( ~ in(sK20,X1)
| in(sK21(X1),X1)
| ~ in(powerset(sK23(X1)),X1)
| sP0(X1) ),
inference(cnf_transformation,[],[f211]) ).
fof(f330,plain,
! [X1] :
( ~ in(sK22(X1),X1)
| ~ in(sK20,X1)
| in(sK23(X1),X1)
| sP0(X1) ),
inference(cnf_transformation,[],[f211]) ).
fof(f331,plain,
! [X1] :
( ~ in(sK20,X1)
| ~ in(sK22(X1),X1)
| ~ in(powerset(sK23(X1)),X1)
| sP0(X1) ),
inference(cnf_transformation,[],[f211]) ).
fof(f386,plain,
! [X0,X7] :
( ~ subset(X7,sK27(X0))
| are_equipotent(X7,sK27(X0))
| in(X7,sK27(X0)) ),
inference(cnf_transformation,[],[f224]) ).
fof(f387,plain,
! [X0,X6,X4] :
( in(X6,sK28(X0,X4))
| ~ in(X4,sK27(X0))
| ~ subset(X6,X4) ),
inference(cnf_transformation,[],[f224]) ).
fof(f388,plain,
! [X0,X4] :
( in(sK28(X0,X4),sK27(X0))
| ~ in(X4,sK27(X0)) ),
inference(cnf_transformation,[],[f224]) ).
fof(f389,plain,
! [X2,X3,X0] :
( ~ in(X2,sK27(X0))
| in(X3,sK27(X0))
| ~ subset(X3,X2) ),
inference(cnf_transformation,[],[f224]) ).
fof(f390,plain,
! [X0] : in(X0,sK27(X0)),
inference(cnf_transformation,[],[f224]) ).
fof(f456,plain,
! [X3,X0] :
( ~ in(X3,powerset(X0))
| subset(X3,X0) ),
inference(equality_resolution,[],[f239]) ).
fof(f483,definition,
! [X1] : sF29(X1) = powerset(sK23(X1)),
introduced(definition,[new_symbols(definition,[sF29])],[function_definition]) ).
fof(f484,plain,
! [X1] : powerset(sK23(X1)) = sF29(X1),
inference(reorient_equations,[],[f483]) ).
fof(f485,plain,
! [X1] :
( ~ in(sF29(X1),X1)
| ~ in(sK22(X1),X1)
| ~ in(sK20,X1)
| sP0(X1) ),
inference(definition_folding,[],[f331,f484]) ).
fof(f486,plain,
! [X1] :
( ~ in(sF29(X1),X1)
| in(sK21(X1),X1)
| ~ in(sK20,X1)
| sP0(X1) ),
inference(definition_folding,[],[f329,f484]) ).
fof(f487,plain,
! [X1] :
( subset(sK22(X1),sK21(X1))
| ~ in(sK20,X1)
| ~ in(sF29(X1),X1)
| sP0(X1) ),
inference(definition_folding,[],[f327,f484]) ).
fof(f491,plain,
! [X0,X1] :
( subset(sK11(powerset(X0),X1),X0)
| subset(powerset(X0),X1) ),
inference(resolution,[],[f264,f456]) ).
fof(f512,plain,
! [X2,X0,X1] :
( ~ subset(X0,sK28(X1,X2))
| in(X0,sK27(X1))
| ~ in(X2,sK27(X1)) ),
inference(resolution,[],[f389,f388]) ).
fof(f587,plain,
! [X2,X0,X1] :
( ~ subset(sK11(X2,sK28(X1,X0)),X0)
| ~ in(X0,sK27(X1))
| subset(X2,sK28(X1,X0)) ),
inference(resolution,[],[f387,f265]) ).
fof(f794,plain,
! [X0,X1] :
( subset(powerset(X0),sK28(X1,X0))
| ~ in(X0,sK27(X1))
| subset(powerset(X0),sK28(X1,X0)) ),
inference(resolution,[],[f491,f587]) ).
fof(f811,plain,
! [X0,X1] :
( subset(powerset(X0),sK28(X1,X0))
| ~ in(X0,sK27(X1)) ),
inference(duplicate_literal_removal,[],[f794]) ).
fof(f1008,plain,
! [X0,X1] :
( ~ in(X0,sK27(X1))
| in(powerset(X0),sK27(X1))
| ~ in(X0,sK27(X1)) ),
inference(resolution,[],[f811,f512]) ).
fof(f1017,plain,
! [X0,X1] :
( in(powerset(X0),sK27(X1))
| ~ in(X0,sK27(X1)) ),
inference(duplicate_literal_removal,[],[f1008]) ).
fof(f1022,plain,
! [X0,X1] :
( ~ in(sK23(X0),sK27(X1))
| in(sF29(X0),sK27(X1)) ),
inference(superposition,[],[f1017,f484]) ).
fof(f1050,plain,
! [X0] :
( are_equipotent(sK19(sK27(X0)),sK27(X0))
| in(sK19(sK27(X0)),sK27(X0))
| ~ sP0(sK27(X0)) ),
inference(resolution,[],[f386,f325]) ).
fof(f1054,plain,
! [X0] :
( in(sK19(sK27(X0)),sK27(X0))
| ~ sP0(sK27(X0)) ),
inference(forward_subsumption_resolution,[],[f1050,f324]) ).
fof(f1055,plain,
! [X0] : ~ sP0(sK27(X0)),
inference(forward_subsumption_resolution,[],[f1054,f323]) ).
fof(f1237,plain,
! [X0] :
( in(sF29(sK27(X0)),sK27(X0))
| in(sK21(sK27(X0)),sK27(X0))
| ~ in(sK20,sK27(X0))
| sP0(sK27(X0)) ),
inference(resolution,[],[f1022,f328]) ).
fof(f1244,plain,
! [X0] :
( in(sK21(sK27(X0)),sK27(X0))
| ~ in(sK20,sK27(X0))
| sP0(sK27(X0)) ),
inference(forward_subsumption_resolution,[],[f1237,f486]) ).
fof(f1246,plain,
! [X0] :
( in(sK21(sK27(X0)),sK27(X0))
| ~ in(sK20,sK27(X0)) ),
inference(forward_subsumption_resolution,[],[f1244,f1055]) ).
fof(f1247,plain,
! [X0,X1] :
( ~ subset(X1,sK21(sK27(X0)))
| in(X1,sK27(X0))
| ~ in(sK20,sK27(X0)) ),
inference(resolution,[],[f1246,f389]) ).
fof(f1260,plain,
! [X0] :
( in(sK22(sK27(X0)),sK27(X0))
| ~ in(sK20,sK27(X0))
| ~ in(sK20,sK27(X0))
| ~ in(sF29(sK27(X0)),sK27(X0))
| sP0(sK27(X0)) ),
inference(resolution,[],[f1247,f487]) ).
fof(f1261,plain,
! [X0] :
( in(sK22(sK27(X0)),sK27(X0))
| ~ in(sK20,sK27(X0))
| ~ in(sK20,sK27(X0))
| in(sK23(sK27(X0)),sK27(X0))
| sP0(sK27(X0)) ),
inference(resolution,[],[f1247,f326]) ).
fof(f1263,plain,
! [X0] :
( in(sK22(sK27(X0)),sK27(X0))
| ~ in(sK20,sK27(X0))
| in(sK23(sK27(X0)),sK27(X0))
| sP0(sK27(X0)) ),
inference(duplicate_literal_removal,[],[f1261]) ).
fof(f1264,plain,
! [X0] :
( in(sK22(sK27(X0)),sK27(X0))
| ~ in(sK20,sK27(X0))
| ~ in(sF29(sK27(X0)),sK27(X0))
| sP0(sK27(X0)) ),
inference(duplicate_literal_removal,[],[f1260]) ).
fof(f1265,plain,
! [X0] :
( ~ in(sK20,sK27(X0))
| in(sK23(sK27(X0)),sK27(X0))
| sP0(sK27(X0)) ),
inference(forward_subsumption_resolution,[],[f1263,f330]) ).
fof(f1266,plain,
! [X0] :
( ~ in(sK20,sK27(X0))
| ~ in(sF29(sK27(X0)),sK27(X0))
| sP0(sK27(X0)) ),
inference(forward_subsumption_resolution,[],[f1264,f485]) ).
fof(f1267,plain,
! [X0] :
( in(sK23(sK27(X0)),sK27(X0))
| ~ in(sK20,sK27(X0)) ),
inference(forward_subsumption_resolution,[],[f1265,f1055]) ).
fof(f1268,plain,
! [X0] :
( ~ in(sF29(sK27(X0)),sK27(X0))
| ~ in(sK20,sK27(X0)) ),
inference(forward_subsumption_resolution,[],[f1266,f1055]) ).
fof(f1272,plain,
! [X0] :
( ~ in(sK20,sK27(X0))
| in(sF29(sK27(X0)),sK27(X0)) ),
inference(resolution,[],[f1267,f1022]) ).
fof(f1277,plain,
! [X0] : ~ in(sK20,sK27(X0)),
inference(forward_subsumption_resolution,[],[f1272,f1268]) ).
fof(f1278,plain,
$false,
inference(resolution,[],[f1277,f390]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU168+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.38 % Computer : n015.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Mon Sep 28 03:55:16 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/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
% 3.53/1.60 % (2242705)Detected formulas, will run a generic FOF schedule.
% 3.53/1.60 % (2242710)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=1354396381:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.53/1.60 % (2242712)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=2846160352:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.53/1.60 % (2242713)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=955917405:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.53/1.60 % (2242711)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=2822961054:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.53/1.60 % (2242715)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=754840281:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.53/1.60 % (2242716)dis-21_1_sil=8000:lcm=predicate:random_seed=3735434651: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)
% 3.53/1.60 % (2242714)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3657474541:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.53/1.60 % (2242716)Instruction limit reached!
% 3.53/1.60 % (2242716)------------------------------
% 3.53/1.60 % (2242716)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.53/1.60 % (2242716)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.53/1.60 % (2242716)CaDiCaL version: 2.1.3
% 3.53/1.60 % (2242716)Termination reason: Instruction limit
% 3.53/1.60 % (2242716)Termination phase: Saturation
% 3.53/1.60 % (2242716)Time elapsed: 0.059 s
% 3.53/1.60 % (2242716)Peak memory usage: 89 MB
% 3.53/1.60 % (2242716)Instructions burned: 132 (million)
% 3.53/1.60 % (2242713)Instruction limit reached!
% 3.53/1.60 % (2242713)------------------------------
% 3.53/1.60 % (2242713)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.53/1.60 % (2242713)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.53/1.60 % (2242713)CaDiCaL version: 2.1.3
% 3.53/1.60 % (2242713)Termination reason: Instruction limit
% 3.53/1.60 % (2242713)Termination phase: Saturation
% 3.53/1.60 % (2242713)Time elapsed: 0.070 s
% 3.53/1.60 % (2242713)Peak memory usage: 89 MB
% 3.53/1.60 % (2242713)Instructions burned: 110 (million)
% 3.53/1.60 % (2242714)Instruction limit reached!
% 3.53/1.60 % (2242714)------------------------------
% 3.53/1.60 % (2242714)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.53/1.60 % (2242714)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.53/1.60 % (2242714)CaDiCaL version: 2.1.3
% 3.53/1.60 % (2242714)Termination reason: Instruction limit
% 3.53/1.60 % (2242714)Termination phase: Saturation
% 3.53/1.60 % (2242714)Time elapsed: 0.075 s
% 3.53/1.60 % (2242714)Peak memory usage: 88 MB
% 3.53/1.60 % (2242714)Instructions burned: 120 (million)
% 3.53/1.60 % (2242715)Instruction limit reached!
% 3.53/1.60 % (2242715)------------------------------
% 3.53/1.60 % (2242715)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.53/1.60 % (2242715)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.53/1.60 % (2242715)CaDiCaL version: 2.1.3
% 3.53/1.60 % (2242715)Termination reason: Instruction limit
% 3.53/1.60 % (2242715)Termination phase: Saturation
% 3.53/1.60 % (2242715)Time elapsed: 0.104 s
% 3.53/1.60 % (2242715)Peak memory usage: 89 MB
% 3.53/1.60 % (2242715)Instructions burned: 139 (million)
% 3.53/1.60 % (2242724)lrs+10_1_sil=8000:sp=occurrence:random_seed=1257899297:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 3.53/1.60 % (2242725)lrs+10_1_sil=32000:urr=on:br=off:random_seed=268650164:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 3.53/1.60 % (2242726)lrs+1011_1_sil=32000:sp=occurrence:random_seed=3907589815:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 3.53/1.60 % (2242727)dis+10_5:1_slsqr=1,4:sil=8000:fde=unused:erd=off:urr=full:fd=off:s2agt=8:br=off:slsq=on:random_seed=1419488463:s2a=on:i=248:s2at=1.23:gtg=position_2997 on theBenchmark for (2997ds/248Mi)
% 3.53/1.60 % (2242725)Instruction limit reached!
% 3.53/1.60 % (2242725)------------------------------
% 3.53/1.60 % (2242725)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.53/1.60 % (2242725)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.53/1.60 % (2242725)CaDiCaL version: 2.1.3
% 3.53/1.60 % (2242725)Termination reason: Instruction limit
% 3.53/1.60 % (2242725)Termination phase: Saturation
% 3.53/1.60 % (2242725)Time elapsed: 0.093 s
% 3.53/1.60 % (2242725)Peak memory usage: 90 MB
% 3.53/1.60 % (2242725)Instructions burned: 158 (million)
% 3.53/1.60 % (2242727)Instruction limit reached!
% 3.53/1.60 % (2242727)------------------------------
% 3.53/1.60 % (2242727)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.53/1.60 % (2242727)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.53/1.60 % (2242727)CaDiCaL version: 2.1.3
% 3.53/1.60 % (2242727)Termination reason: Instruction limit
% 3.53/1.60 % (2242727)Termination phase: Saturation
% 3.53/1.60 % (2242727)Time elapsed: 0.133 s
% 3.53/1.60 % (2242727)Peak memory usage: 92 MB
% 3.53/1.60 % (2242727)Instructions burned: 250 (million)
% 3.53/1.60 % (2242724)Instruction limit reached!
% 3.53/1.60 % (2242724)------------------------------
% 3.53/1.60 % (2242724)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.53/1.60 % (2242724)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.53/1.60 % (2242724)CaDiCaL version: 2.1.3
% 3.53/1.60 % (2242724)Termination reason: Instruction limit
% 3.53/1.60 % (2242724)Termination phase: Saturation
% 3.53/1.60 % (2242724)Time elapsed: 0.183 s
% 3.53/1.60 % (2242724)Peak memory usage: 91 MB
% 3.53/1.60 % (2242724)Instructions burned: 285 (million)
% 3.53/1.60 % (2242710)First to succeed.
% 3.53/1.60 % (2242726)Instruction limit reached!
% 3.53/1.60 % (2242726)------------------------------
% 3.53/1.60 % (2242726)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.53/1.60 % (2242726)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.53/1.60 % (2242726)CaDiCaL version: 2.1.3
% 3.53/1.60 % (2242726)Termination reason: Instruction limit
% 3.53/1.60 % (2242726)Termination phase: Saturation
% 3.53/1.60 % (2242726)Time elapsed: 0.227 s
% 3.53/1.60 % (2242726)Peak memory usage: 92 MB
% 3.53/1.60 % (2242726)Instructions burned: 326 (million)
% 3.53/1.60 % (2242710)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2242705"
% 3.53/1.60 % (2242732)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=1622344746:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2995 on theBenchmark for (2995ds/294Mi)
% 3.53/1.60 % (2242733)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=825143010:i=2350_2994 on theBenchmark for (2994ds/2350Mi)
% 3.53/1.60 % (2242734)dis-1011_32:1_sfv=off:sil=16000:sos=all:erd=off:acc=on:fd=off:flr=on:random_seed=547182366:cts=off:i=113:fsr=off:ss=included:sgt=4_2994 on theBenchmark for (2994ds/113Mi)
% 3.53/1.60 % (2242735)lrs-1004_1_sil=8000:sp=occurrence:sos=all:erd=off:fs=off:bce=on:random_seed=1849808315:i=127:av=off:fsr=off:sup=off_2993 on theBenchmark for (2993ds/127Mi)
% 3.53/1.60 % (2242710)Refutation found. Thanks to Tanya!
% 3.53/1.60 % SZS status Theorem for theBenchmark
% 3.53/1.60 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/1.80 % (2242710)------------------------------
% 0.18/1.80 % (2242710)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.18/1.80 % (2242710)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/1.80 % (2242710)CaDiCaL version: 2.1.3
% 0.18/1.80 % (2242710)Termination reason: Refutation
% 0.18/1.80 % (2242710)Time elapsed: 0.488 s
% 0.18/1.80 % (2242710)Peak memory usage: 132 MB
% 0.18/1.80 % (2242710)Instructions burned: 1237 (million)
% 0.18/1.80 % (2242710)------------------------------
% 0.18/1.80 % (2242710)------------------------------
% 0.18/1.80 % (2242705)Success in time 0.786 s
% 0.18/1.80 % Vampire exiting
%------------------------------------------------------------------------------