%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU243+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n009.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:58 PM UTC 2026
% Result : Theorem 2.52s 1.28s
% Output : Refutation 3.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 7
% Syntax : Number of formulae : 84 ( 5 unt; 4 def)
% Number of atoms : 336 ( 39 equ)
% Maximal formula atoms : 11 ( 4 avg)
% Number of connectives : 430 ( 178 ~; 198 |; 39 &)
% ( 10 <=>; 4 =>; 0 <=; 1 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 5 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-2 aty)
% Number of variables : 82 ( 0 sgn 69 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f36,axiom,
! [X0] :
( relation(X0)
=> ( well_founded_relation(X0)
<=> ! [X1] :
~ ( subset(X1,relation_field(X0))
& X1 != empty_set
& ! [X2] :
~ ( in(X2,X1)
& disjoint(fiber(X0,X2),X1) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_wellord1) ).
fof(f42,axiom,
! [X0] :
( relation(X0)
=> ! [X1] :
( is_well_founded_in(X0,X1)
<=> ! [X2] :
~ ( subset(X2,X1)
& X2 != empty_set
& ! [X3] :
~ ( in(X3,X2)
& disjoint(fiber(X0,X3),X2) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_wellord1) ).
fof(f264,conjecture,
! [X0] :
( relation(X0)
=> ( well_founded_relation(X0)
<=> is_well_founded_in(X0,relation_field(X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t5_wellord1) ).
fof(f265,negated_conjecture,
~ ! [X0] :
( relation(X0)
=> ( well_founded_relation(X0)
<=> is_well_founded_in(X0,relation_field(X0)) ) ),
inference(negated_conjecture,[status(cth)],[f264]) ).
fof(f341,plain,
! [X0] :
( ( well_founded_relation(X0)
<=> ! [X1] :
( ~ subset(X1,relation_field(X0))
| empty_set = X1
| ? [X2] :
( in(X2,X1)
& disjoint(fiber(X0,X2),X1) ) ) )
| ~ relation(X0) ),
inference(ennf_transformation,[],[f36]) ).
fof(f345,plain,
! [X0] :
( ! [X1] :
( is_well_founded_in(X0,X1)
<=> ! [X2] :
( ~ subset(X2,X1)
| empty_set = X2
| ? [X3] :
( in(X3,X2)
& disjoint(fiber(X0,X3),X2) ) ) )
| ~ relation(X0) ),
inference(ennf_transformation,[],[f42]) ).
fof(f548,plain,
? [X0] :
( ( well_founded_relation(X0)
<~> is_well_founded_in(X0,relation_field(X0)) )
& relation(X0) ),
inference(ennf_transformation,[],[f265]) ).
fof(f648,plain,
! [X0] :
( ( ( well_founded_relation(X0)
| ? [X1] :
( subset(X1,relation_field(X0))
& empty_set != X1
& ! [X2] :
( ~ in(X2,X1)
| ~ disjoint(fiber(X0,X2),X1) ) ) )
& ( ! [X1] :
( ~ subset(X1,relation_field(X0))
| empty_set = X1
| ? [X2] :
( in(X2,X1)
& disjoint(fiber(X0,X2),X1) ) )
| ~ well_founded_relation(X0) ) )
| ~ relation(X0) ),
inference(nnf_transformation,[],[f341]) ).
fof(f649,plain,
! [X0] :
( ( ( well_founded_relation(X0)
| ? [X1] :
( subset(X1,relation_field(X0))
& empty_set != X1
& ! [X2] :
( ~ in(X2,X1)
| ~ disjoint(fiber(X0,X2),X1) ) ) )
& ( ! [X3] :
( ~ subset(X3,relation_field(X0))
| empty_set = X3
| ? [X4] :
( in(X4,X3)
& disjoint(fiber(X0,X4),X3) ) )
| ~ well_founded_relation(X0) ) )
| ~ relation(X0) ),
inference(rectify,[],[f648]) ).
fof(f650,plain,
! [X0] :
( ( ( well_founded_relation(X0)
| ( subset(sK32(X0),relation_field(X0))
& empty_set != sK32(X0)
& ! [X2] :
( ~ in(X2,sK32(X0))
| ~ disjoint(fiber(X0,X2),sK32(X0)) ) ) )
& ( ! [X3] :
( ~ subset(X3,relation_field(X0))
| empty_set = X3
| ( in(sK33(X0,X3),X3)
& disjoint(fiber(X0,sK33(X0,X3)),X3) ) )
| ~ well_founded_relation(X0) ) )
| ~ relation(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK32,sK33]),skolemize(X1,sK32(X0)),skolemize(X4,sK33(X0,X3))],[f649]) ).
fof(f667,plain,
! [X0] :
( ! [X1] :
( ( is_well_founded_in(X0,X1)
| ? [X2] :
( subset(X2,X1)
& empty_set != X2
& ! [X3] :
( ~ in(X3,X2)
| ~ disjoint(fiber(X0,X3),X2) ) ) )
& ( ! [X2] :
( ~ subset(X2,X1)
| empty_set = X2
| ? [X3] :
( in(X3,X2)
& disjoint(fiber(X0,X3),X2) ) )
| ~ is_well_founded_in(X0,X1) ) )
| ~ relation(X0) ),
inference(nnf_transformation,[],[f345]) ).
fof(f668,plain,
! [X0] :
( ! [X1] :
( ( is_well_founded_in(X0,X1)
| ? [X2] :
( subset(X2,X1)
& empty_set != X2
& ! [X3] :
( ~ in(X3,X2)
| ~ disjoint(fiber(X0,X3),X2) ) ) )
& ( ! [X4] :
( ~ subset(X4,X1)
| empty_set = X4
| ? [X5] :
( in(X5,X4)
& disjoint(fiber(X0,X5),X4) ) )
| ~ is_well_founded_in(X0,X1) ) )
| ~ relation(X0) ),
inference(rectify,[],[f667]) ).
fof(f669,plain,
! [X0] :
( ! [X1] :
( ( is_well_founded_in(X0,X1)
| ( subset(sK45(X0,X1),X1)
& empty_set != sK45(X0,X1)
& ! [X3] :
( ~ in(X3,sK45(X0,X1))
| ~ disjoint(fiber(X0,X3),sK45(X0,X1)) ) ) )
& ( ! [X4] :
( ~ subset(X4,X1)
| empty_set = X4
| ( in(sK46(X0,X4),X4)
& disjoint(fiber(X0,sK46(X0,X4)),X4) ) )
| ~ is_well_founded_in(X0,X1) ) )
| ~ relation(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK45,sK46]),skolemize(X2,sK45(X0,X1)),skolemize(X5,sK46(X0,X4))],[f668]) ).
fof(f799,plain,
? [X0] :
( ( ~ is_well_founded_in(X0,relation_field(X0))
| ~ well_founded_relation(X0) )
& ( is_well_founded_in(X0,relation_field(X0))
| well_founded_relation(X0) )
& relation(X0) ),
inference(nnf_transformation,[],[f548]) ).
fof(f800,plain,
? [X0] :
( ( ~ is_well_founded_in(X0,relation_field(X0))
| ~ well_founded_relation(X0) )
& ( is_well_founded_in(X0,relation_field(X0))
| well_founded_relation(X0) )
& relation(X0) ),
inference(flattening,[],[f799]) ).
fof(f801,plain,
( ( ~ is_well_founded_in(sK116,relation_field(sK116))
| ~ well_founded_relation(sK116) )
& ( is_well_founded_in(sK116,relation_field(sK116))
| well_founded_relation(sK116) )
& relation(sK116) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK116]),skolemize(X0,sK116)],[f800]) ).
fof(f937,plain,
! [X3,X0] :
( ~ well_founded_relation(X0)
| empty_set = X3
| disjoint(fiber(X0,sK33(X0,X3)),X3)
| ~ subset(X3,relation_field(X0))
| ~ relation(X0) ),
inference(cnf_transformation,[],[f650]) ).
fof(f938,plain,
! [X3,X0] :
( ~ well_founded_relation(X0)
| empty_set = X3
| in(sK33(X0,X3),X3)
| ~ subset(X3,relation_field(X0))
| ~ relation(X0) ),
inference(cnf_transformation,[],[f650]) ).
fof(f939,plain,
! [X2,X0] :
( ~ disjoint(fiber(X0,X2),sK32(X0))
| ~ in(X2,sK32(X0))
| well_founded_relation(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f650]) ).
fof(f940,plain,
! [X0] :
( empty_set != sK32(X0)
| well_founded_relation(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f650]) ).
fof(f941,plain,
! [X0] :
( subset(sK32(X0),relation_field(X0))
| well_founded_relation(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f650]) ).
fof(f968,plain,
! [X0,X1,X4] :
( ~ is_well_founded_in(X0,X1)
| empty_set = X4
| disjoint(fiber(X0,sK46(X0,X4)),X4)
| ~ subset(X4,X1)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f669]) ).
fof(f969,plain,
! [X0,X1,X4] :
( in(sK46(X0,X4),X4)
| empty_set = X4
| ~ subset(X4,X1)
| ~ is_well_founded_in(X0,X1)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f669]) ).
fof(f970,plain,
! [X3,X0,X1] :
( ~ disjoint(fiber(X0,X3),sK45(X0,X1))
| ~ in(X3,sK45(X0,X1))
| is_well_founded_in(X0,X1)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f669]) ).
fof(f971,plain,
! [X0,X1] :
( empty_set != sK45(X0,X1)
| is_well_founded_in(X0,X1)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f669]) ).
fof(f972,plain,
! [X0,X1] :
( subset(sK45(X0,X1),X1)
| is_well_founded_in(X0,X1)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f669]) ).
fof(f1368,plain,
relation(sK116),
inference(cnf_transformation,[],[f801]) ).
fof(f1369,plain,
( is_well_founded_in(sK116,relation_field(sK116))
| well_founded_relation(sK116) ),
inference(cnf_transformation,[],[f801]) ).
fof(f1370,plain,
( ~ is_well_founded_in(sK116,relation_field(sK116))
| ~ well_founded_relation(sK116) ),
inference(cnf_transformation,[],[f801]) ).
fof(f1534,definition,
( spl121_1
<=> well_founded_relation(sK116) ),
introduced(definition,[new_symbols(definition,[spl121_1])],[avatar_definition]) ).
fof(f1535,plain,
( ~ well_founded_relation(sK116)
| spl121_1 ),
inference(avatar_component_clause,[],[f1534]) ).
fof(f1536,plain,
( well_founded_relation(sK116)
| ~ spl121_1 ),
inference(avatar_component_clause,[],[f1534]) ).
fof(f1538,definition,
( spl121_2
<=> is_well_founded_in(sK116,relation_field(sK116)) ),
introduced(definition,[new_symbols(definition,[spl121_2])],[avatar_definition]) ).
fof(f1539,plain,
( ~ is_well_founded_in(sK116,relation_field(sK116))
| spl121_2 ),
inference(avatar_component_clause,[],[f1538]) ).
fof(f1540,plain,
( is_well_founded_in(sK116,relation_field(sK116))
| ~ spl121_2 ),
inference(avatar_component_clause,[],[f1538]) ).
fof(f1541,plain,
( spl121_1
| spl121_2 ),
inference(avatar_split_clause,[],[f1369,f1538,f1534]) ).
fof(f1542,plain,
( ~ spl121_1
| ~ spl121_2 ),
inference(avatar_split_clause,[],[f1370,f1538,f1534]) ).
fof(f1568,definition,
( spl121_5
<=> ! [X0] :
( ~ subset(sK32(sK116),X0)
| ~ is_well_founded_in(sK116,X0) ) ),
introduced(definition,[new_symbols(definition,[spl121_5])],[avatar_definition]) ).
fof(f1569,plain,
( ! [X0] :
( ~ is_well_founded_in(sK116,X0)
| ~ subset(sK32(sK116),X0) )
| ~ spl121_5 ),
inference(avatar_component_clause,[],[f1568]) ).
fof(f1571,definition,
( spl121_6
<=> empty_set = sK32(sK116) ),
introduced(definition,[new_symbols(definition,[spl121_6])],[avatar_definition]) ).
fof(f1573,plain,
( empty_set = sK32(sK116)
| ~ spl121_6 ),
inference(avatar_component_clause,[],[f1571]) ).
fof(f1575,plain,
( ! [X0] :
( empty_set = X0
| disjoint(fiber(sK116,sK33(sK116,X0)),X0)
| ~ subset(X0,relation_field(sK116))
| ~ relation(sK116) )
| ~ spl121_1 ),
inference(resolution,[],[f1536,f937]) ).
fof(f1576,plain,
( ! [X0] :
( empty_set = X0
| in(sK33(sK116,X0),X0)
| ~ subset(X0,relation_field(sK116))
| ~ relation(sK116) )
| ~ spl121_1 ),
inference(resolution,[],[f1536,f938]) ).
fof(f1577,plain,
( ! [X0] :
( in(sK33(sK116,X0),X0)
| empty_set = X0
| ~ subset(X0,relation_field(sK116)) )
| ~ spl121_1 ),
inference(forward_subsumption_resolution,[],[f1576,f1368]) ).
fof(f1578,plain,
( ! [X0] :
( disjoint(fiber(sK116,sK33(sK116,X0)),X0)
| empty_set = X0
| ~ subset(X0,relation_field(sK116)) )
| ~ spl121_1 ),
inference(forward_subsumption_resolution,[],[f1575,f1368]) ).
fof(f1580,plain,
( ! [X0] :
( empty_set = sK45(sK116,X0)
| ~ subset(sK45(sK116,X0),relation_field(sK116))
| ~ in(sK33(sK116,sK45(sK116,X0)),sK45(sK116,X0))
| is_well_founded_in(sK116,X0)
| ~ relation(sK116) )
| ~ spl121_1 ),
inference(resolution,[],[f1578,f970]) ).
fof(f1581,plain,
( ! [X0] :
( empty_set = sK45(sK116,X0)
| ~ subset(sK45(sK116,X0),relation_field(sK116))
| is_well_founded_in(sK116,X0)
| ~ relation(sK116) )
| ~ spl121_1 ),
inference(forward_subsumption_resolution,[],[f1580,f1577]) ).
fof(f1583,plain,
( ! [X0] :
( ~ subset(sK45(sK116,X0),relation_field(sK116))
| empty_set = sK45(sK116,X0)
| is_well_founded_in(sK116,X0) )
| ~ spl121_1 ),
inference(forward_subsumption_resolution,[],[f1581,f1368]) ).
fof(f1584,plain,
( empty_set = sK45(sK116,relation_field(sK116))
| is_well_founded_in(sK116,relation_field(sK116))
| is_well_founded_in(sK116,relation_field(sK116))
| ~ relation(sK116)
| ~ spl121_1 ),
inference(resolution,[],[f1583,f972]) ).
fof(f1585,plain,
( empty_set = sK45(sK116,relation_field(sK116))
| is_well_founded_in(sK116,relation_field(sK116))
| ~ relation(sK116)
| ~ spl121_1 ),
inference(duplicate_literal_removal,[],[f1584]) ).
fof(f1586,plain,
( is_well_founded_in(sK116,relation_field(sK116))
| ~ relation(sK116)
| ~ spl121_1 ),
inference(forward_subsumption_resolution,[],[f1585,f971]) ).
fof(f1587,plain,
( ~ relation(sK116)
| ~ spl121_1
| spl121_2 ),
inference(forward_subsumption_resolution,[],[f1586,f1539]) ).
fof(f1588,plain,
( $false
| ~ spl121_1
| spl121_2 ),
inference(forward_subsumption_resolution,[],[f1587,f1368]) ).
fof(f1589,plain,
( ~ spl121_1
| spl121_2 ),
inference(avatar_contradiction_clause,[],[f1588]) ).
fof(f1590,plain,
( ! [X0] :
( empty_set = X0
| disjoint(fiber(sK116,sK46(sK116,X0)),X0)
| ~ subset(X0,relation_field(sK116))
| ~ relation(sK116) )
| ~ spl121_2 ),
inference(resolution,[],[f1540,f968]) ).
fof(f1591,plain,
( ! [X0] :
( disjoint(fiber(sK116,sK46(sK116,X0)),X0)
| empty_set = X0
| ~ subset(X0,relation_field(sK116)) )
| ~ spl121_2 ),
inference(forward_subsumption_resolution,[],[f1590,f1368]) ).
fof(f1592,plain,
( empty_set = sK32(sK116)
| ~ subset(sK32(sK116),relation_field(sK116))
| ~ in(sK46(sK116,sK32(sK116)),sK32(sK116))
| well_founded_relation(sK116)
| ~ relation(sK116)
| ~ spl121_2 ),
inference(resolution,[],[f1591,f939]) ).
fof(f1595,plain,
( ~ subset(sK32(sK116),relation_field(sK116))
| ~ in(sK46(sK116,sK32(sK116)),sK32(sK116))
| well_founded_relation(sK116)
| ~ relation(sK116)
| ~ spl121_2 ),
inference(forward_subsumption_resolution,[],[f1592,f940]) ).
fof(f1596,plain,
( ~ in(sK46(sK116,sK32(sK116)),sK32(sK116))
| well_founded_relation(sK116)
| ~ relation(sK116)
| ~ spl121_2 ),
inference(forward_subsumption_resolution,[],[f1595,f941]) ).
fof(f1597,plain,
( ~ in(sK46(sK116,sK32(sK116)),sK32(sK116))
| ~ relation(sK116)
| spl121_1
| ~ spl121_2 ),
inference(forward_subsumption_resolution,[],[f1596,f1535]) ).
fof(f1598,plain,
( ~ in(sK46(sK116,sK32(sK116)),sK32(sK116))
| spl121_1
| ~ spl121_2 ),
inference(forward_subsumption_resolution,[],[f1597,f1368]) ).
fof(f1599,plain,
( ! [X0] :
( empty_set = sK32(sK116)
| ~ subset(sK32(sK116),X0)
| ~ is_well_founded_in(sK116,X0)
| ~ relation(sK116) )
| spl121_1
| ~ spl121_2 ),
inference(resolution,[],[f1598,f969]) ).
fof(f1600,plain,
( ! [X0] :
( empty_set = sK32(sK116)
| ~ subset(sK32(sK116),X0)
| ~ is_well_founded_in(sK116,X0) )
| spl121_1
| ~ spl121_2 ),
inference(forward_subsumption_resolution,[],[f1599,f1368]) ).
fof(f1601,plain,
( spl121_5
| spl121_6
| spl121_1
| ~ spl121_2 ),
inference(avatar_split_clause,[],[f1600,f1538,f1534,f1571,f1568]) ).
fof(f1602,plain,
( ~ subset(sK32(sK116),relation_field(sK116))
| ~ spl121_2
| ~ spl121_5 ),
inference(resolution,[],[f1569,f1540]) ).
fof(f1603,plain,
( well_founded_relation(sK116)
| ~ relation(sK116)
| ~ spl121_2
| ~ spl121_5 ),
inference(resolution,[],[f1602,f941]) ).
fof(f1604,plain,
( ~ relation(sK116)
| spl121_1
| ~ spl121_2
| ~ spl121_5 ),
inference(forward_subsumption_resolution,[],[f1603,f1535]) ).
fof(f1605,plain,
( $false
| spl121_1
| ~ spl121_2
| ~ spl121_5 ),
inference(forward_subsumption_resolution,[],[f1604,f1368]) ).
fof(f1606,plain,
( spl121_1
| ~ spl121_2
| ~ spl121_5 ),
inference(avatar_contradiction_clause,[],[f1605]) ).
fof(f1610,plain,
( empty_set != empty_set
| well_founded_relation(sK116)
| ~ relation(sK116)
| ~ spl121_6 ),
inference(superposition,[],[f940,f1573]) ).
fof(f1611,plain,
( well_founded_relation(sK116)
| ~ relation(sK116)
| ~ spl121_6 ),
inference(trivial_inequality_removal,[],[f1610]) ).
fof(f1612,plain,
( ~ relation(sK116)
| spl121_1
| ~ spl121_6 ),
inference(forward_subsumption_resolution,[],[f1611,f1535]) ).
fof(f1614,plain,
( $false
| spl121_1
| ~ spl121_6 ),
inference(forward_subsumption_resolution,[],[f1612,f1368]) ).
fof(f1615,plain,
( spl121_1
| ~ spl121_6 ),
inference(avatar_contradiction_clause,[],[f1614]) ).
cnf(s1,plain,
( spl121_1
| spl121_2 ),
inference(sat_conversion,[],[f1541]) ).
cnf(s2,plain,
( ~ spl121_1
| ~ spl121_2 ),
inference(sat_conversion,[],[f1542]) ).
cnf(s5,plain,
( ~ spl121_1
| spl121_2 ),
inference(sat_conversion,[],[f1589]) ).
cnf(s6,plain,
( spl121_1
| ~ spl121_2
| spl121_5
| spl121_6 ),
inference(sat_conversion,[],[f1601]) ).
cnf(s7,plain,
( spl121_1
| ~ spl121_2
| ~ spl121_5 ),
inference(sat_conversion,[],[f1606]) ).
cnf(s8,plain,
( spl121_1
| ~ spl121_6 ),
inference(sat_conversion,[],[f1615]) ).
cnf(s9,plain,
spl121_1,
inference(rat,[],[s6,s7,s1,s8]) ).
cnf(s10,plain,
spl121_2,
inference(rat,[],[s5,s9]) ).
cnf(s11,plain,
$false,
inference(rat,[],[s2,s10,s9]) ).
fof(f1617,plain,
$false,
inference(avatar_sat_refutation,[],[s11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU243+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.37 % Computer : n009.cluster.edu
% 0.13/0.37 % Model : x86_64 x86_64
% 0.13/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.37 % Memory : 8046.5625MB
% 0.13/0.37 % 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 04:17:15 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.41 Running first-order theorem proving
% 0.13/0.41 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.52/1.28 % (2655419)Detected formulas, will run a generic FOF schedule.
% 2.52/1.28 % (2655425)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=1221954937:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.52/1.28 % (2655428)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=386706013:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.52/1.28 % (2655427)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2283534821:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.52/1.28 % (2655430)dis-21_1_sil=8000:lcm=predicate:random_seed=3870350490: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.52/1.28 % (2655424)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=2050119648:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.52/1.28 % (2655426)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=1687383613:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.52/1.28 % (2655429)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3744160940:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.52/1.28 % (2655429)First to succeed.
% 2.52/1.28 % (2655429)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2655419"
% 2.52/1.28 % (2655427)Instruction limit reached!
% 2.52/1.28 % (2655427)------------------------------
% 2.52/1.28 % (2655427)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.52/1.28 % (2655427)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.52/1.28 % (2655427)CaDiCaL version: 2.1.3
% 2.52/1.28 % (2655427)Termination reason: Instruction limit
% 2.52/1.28 % (2655427)Termination phase: Saturation
% 2.52/1.28 % (2655427)Time elapsed: 0.069 s
% 2.52/1.28 % (2655427)Peak memory usage: 90 MB
% 2.52/1.28 % (2655427)Instructions burned: 110 (million)
% 2.52/1.28 % (2655430)Instruction limit reached!
% 2.52/1.28 % (2655430)------------------------------
% 2.52/1.28 % (2655430)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.52/1.28 % (2655430)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.52/1.28 % (2655430)CaDiCaL version: 2.1.3
% 2.52/1.28 % (2655430)Termination reason: Instruction limit
% 2.52/1.28 % (2655430)Termination phase: Saturation
% 2.52/1.28 % (2655430)Time elapsed: 0.077 s
% 2.52/1.28 % (2655430)Peak memory usage: 90 MB
% 2.52/1.28 % (2655430)Instructions burned: 129 (million)
% 2.52/1.28 % (2655428)Instruction limit reached!
% 2.52/1.28 % (2655428)------------------------------
% 2.52/1.28 % (2655428)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.52/1.28 % (2655428)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.52/1.28 % (2655428)CaDiCaL version: 2.1.3
% 2.52/1.28 % (2655428)Termination reason: Instruction limit
% 2.52/1.28 % (2655428)Termination phase: Saturation
% 2.52/1.28 % (2655428)Time elapsed: 0.080 s
% 2.52/1.28 % (2655428)Peak memory usage: 90 MB
% 2.52/1.28 % (2655428)Instructions burned: 120 (million)
% 2.52/1.28 % (2655438)lrs+10_1_sil=8000:sp=occurrence:random_seed=2518762376:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.52/1.28 % (2655440)lrs+1011_1_sil=32000:sp=occurrence:random_seed=2809619325:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 2.52/1.28 % (2655439)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3324580739:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.52/1.28 % (2655439)Also succeeded, but the first one will report.
% 2.52/1.28 % (2655429)Refutation found. Thanks to Tanya!
% 2.52/1.28 % SZS status Theorem for theBenchmark
% 2.52/1.28 % SZS output start Proof for theBenchmark
% See solution above
% 3.57/1.47 % (2655429)------------------------------
% 3.57/1.47 % (2655429)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.57/1.47 % (2655429)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.57/1.47 % (2655429)CaDiCaL version: 2.1.3
% 3.57/1.47 % (2655429)Termination reason: Refutation
% 3.57/1.47 % (2655429)Time elapsed: 0.021 s
% 3.57/1.47 % (2655429)Peak memory usage: 91 MB
% 3.57/1.47 % (2655429)Instructions burned: 32 (million)
% 3.57/1.47 % (2655429)------------------------------
% 3.57/1.47 % (2655429)------------------------------
% 3.57/1.47 % (2655419)Success in time 0.428 s
% 3.57/1.47 % Vampire exiting
%------------------------------------------------------------------------------