%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU269+1 : 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 : n006.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:48:05 PM UTC 2026
% Result : Theorem 2.67s 1.29s
% Output : Refutation 3.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 6
% Syntax : Number of formulae : 62 ( 11 unt; 0 def)
% Number of atoms : 315 ( 28 equ)
% Maximal formula atoms : 17 ( 5 avg)
% Number of connectives : 426 ( 173 ~; 184 |; 52 &)
% ( 11 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 7 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 1 con; 0-2 aty)
% Number of variables : 156 ( 143 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f9,axiom,
! [X0] :
( relation(X0)
=> ( transitive(X0)
<=> is_transitive_in(X0,relation_field(X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d16_relat_2) ).
fof(f10,axiom,
! [X0,X1] :
( relation(X1)
=> ( X1 = inclusion_relation(X0)
<=> ( relation_field(X1) = X0
& ! [X2,X3] :
( ( in(X2,X0)
& in(X3,X0) )
=> ( in(ordered_pair(X2,X3),X1)
<=> subset(X2,X3) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_wellord2) ).
fof(f13,axiom,
! [X0] :
( relation(X0)
=> ! [X1] :
( is_transitive_in(X0,X1)
<=> ! [X2,X3,X4] :
( ( in(X2,X1)
& in(X3,X1)
& in(X4,X1)
& in(ordered_pair(X2,X3),X0)
& in(ordered_pair(X3,X4),X0) )
=> in(ordered_pair(X2,X4),X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d8_relat_2) ).
fof(f16,axiom,
! [X0] : relation(inclusion_relation(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k1_wellord2) ).
fof(f44,axiom,
! [X0,X1,X2] :
( ( subset(X0,X1)
& subset(X1,X2) )
=> subset(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1_xboole_1) ).
fof(f47,conjecture,
! [X0] : transitive(inclusion_relation(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_wellord2) ).
fof(f48,negated_conjecture,
~ ! [X0] : transitive(inclusion_relation(X0)),
inference(negated_conjecture,[status(cth)],[f47]) ).
fof(f55,plain,
? [X0] : ~ transitive(inclusion_relation(X0)),
inference(ennf_transformation,[],[f48]) ).
fof(f56,plain,
! [X0,X1] :
( ( X1 = inclusion_relation(X0)
<=> ( relation_field(X1) = X0
& ! [X2,X3] :
( ( in(ordered_pair(X2,X3),X1)
<=> subset(X2,X3) )
| ~ in(X2,X0)
| ~ in(X3,X0) ) ) )
| ~ relation(X1) ),
inference(ennf_transformation,[],[f10]) ).
fof(f57,plain,
! [X0,X1] :
( ( X1 = inclusion_relation(X0)
<=> ( relation_field(X1) = X0
& ! [X2,X3] :
( ( in(ordered_pair(X2,X3),X1)
<=> subset(X2,X3) )
| ~ in(X2,X0)
| ~ in(X3,X0) ) ) )
| ~ relation(X1) ),
inference(flattening,[],[f56]) ).
fof(f58,plain,
! [X0] :
( ( transitive(X0)
<=> is_transitive_in(X0,relation_field(X0)) )
| ~ relation(X0) ),
inference(ennf_transformation,[],[f9]) ).
fof(f62,plain,
! [X0,X1,X2] :
( subset(X0,X2)
| ~ subset(X0,X1)
| ~ subset(X1,X2) ),
inference(ennf_transformation,[],[f44]) ).
fof(f63,plain,
! [X0,X1,X2] :
( subset(X0,X2)
| ~ subset(X0,X1)
| ~ subset(X1,X2) ),
inference(flattening,[],[f62]) ).
fof(f64,plain,
! [X0] :
( ! [X1] :
( is_transitive_in(X0,X1)
<=> ! [X2,X3,X4] :
( in(ordered_pair(X2,X4),X0)
| ~ in(X2,X1)
| ~ in(X3,X1)
| ~ in(X4,X1)
| ~ in(ordered_pair(X2,X3),X0)
| ~ in(ordered_pair(X3,X4),X0) ) )
| ~ relation(X0) ),
inference(ennf_transformation,[],[f13]) ).
fof(f65,plain,
! [X0] :
( ! [X1] :
( is_transitive_in(X0,X1)
<=> ! [X2,X3,X4] :
( in(ordered_pair(X2,X4),X0)
| ~ in(X2,X1)
| ~ in(X3,X1)
| ~ in(X4,X1)
| ~ in(ordered_pair(X2,X3),X0)
| ~ in(ordered_pair(X3,X4),X0) ) )
| ~ relation(X0) ),
inference(flattening,[],[f64]) ).
fof(f66,plain,
~ transitive(inclusion_relation(sK0)),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f55]) ).
fof(f67,plain,
! [X0,X1] :
( ( ( X1 = inclusion_relation(X0)
| relation_field(X1) != X0
| ? [X2,X3] :
( ( ~ subset(X2,X3)
| ~ in(ordered_pair(X2,X3),X1) )
& ( subset(X2,X3)
| in(ordered_pair(X2,X3),X1) )
& in(X2,X0)
& in(X3,X0) ) )
& ( ( relation_field(X1) = X0
& ! [X2,X3] :
( ( ( in(ordered_pair(X2,X3),X1)
| ~ subset(X2,X3) )
& ( subset(X2,X3)
| ~ in(ordered_pair(X2,X3),X1) ) )
| ~ in(X2,X0)
| ~ in(X3,X0) ) )
| inclusion_relation(X0) != X1 ) )
| ~ relation(X1) ),
inference(nnf_transformation,[],[f57]) ).
fof(f68,plain,
! [X0,X1] :
( ( ( X1 = inclusion_relation(X0)
| relation_field(X1) != X0
| ? [X2,X3] :
( ( ~ subset(X2,X3)
| ~ in(ordered_pair(X2,X3),X1) )
& ( subset(X2,X3)
| in(ordered_pair(X2,X3),X1) )
& in(X2,X0)
& in(X3,X0) ) )
& ( ( relation_field(X1) = X0
& ! [X2,X3] :
( ( ( in(ordered_pair(X2,X3),X1)
| ~ subset(X2,X3) )
& ( subset(X2,X3)
| ~ in(ordered_pair(X2,X3),X1) ) )
| ~ in(X2,X0)
| ~ in(X3,X0) ) )
| inclusion_relation(X0) != X1 ) )
| ~ relation(X1) ),
inference(flattening,[],[f67]) ).
fof(f69,plain,
! [X0,X1] :
( ( ( X1 = inclusion_relation(X0)
| relation_field(X1) != X0
| ? [X2,X3] :
( ( ~ subset(X2,X3)
| ~ in(ordered_pair(X2,X3),X1) )
& ( subset(X2,X3)
| in(ordered_pair(X2,X3),X1) )
& in(X2,X0)
& in(X3,X0) ) )
& ( ( relation_field(X1) = X0
& ! [X4,X5] :
( ( ( in(ordered_pair(X4,X5),X1)
| ~ subset(X4,X5) )
& ( subset(X4,X5)
| ~ in(ordered_pair(X4,X5),X1) ) )
| ~ in(X4,X0)
| ~ in(X5,X0) ) )
| inclusion_relation(X0) != X1 ) )
| ~ relation(X1) ),
inference(rectify,[],[f68]) ).
fof(f70,plain,
! [X0,X1] :
( ( ( X1 = inclusion_relation(X0)
| relation_field(X1) != X0
| ( ( ~ subset(sK1(X0,X1),sK2(X0,X1))
| ~ in(ordered_pair(sK1(X0,X1),sK2(X0,X1)),X1) )
& ( subset(sK1(X0,X1),sK2(X0,X1))
| in(ordered_pair(sK1(X0,X1),sK2(X0,X1)),X1) )
& in(sK1(X0,X1),X0)
& in(sK2(X0,X1),X0) ) )
& ( ( relation_field(X1) = X0
& ! [X4,X5] :
( ( ( in(ordered_pair(X4,X5),X1)
| ~ subset(X4,X5) )
& ( subset(X4,X5)
| ~ in(ordered_pair(X4,X5),X1) ) )
| ~ in(X4,X0)
| ~ in(X5,X0) ) )
| inclusion_relation(X0) != X1 ) )
| ~ relation(X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2]),skolemize(X2,sK1(X0,X1)),skolemize(X3,sK2(X0,X1))],[f69]) ).
fof(f71,plain,
! [X0] :
( ( ( transitive(X0)
| ~ is_transitive_in(X0,relation_field(X0)) )
& ( is_transitive_in(X0,relation_field(X0))
| ~ transitive(X0) ) )
| ~ relation(X0) ),
inference(nnf_transformation,[],[f58]) ).
fof(f72,plain,
! [X0] :
( ! [X1] :
( ( is_transitive_in(X0,X1)
| ? [X2,X3,X4] :
( ~ in(ordered_pair(X2,X4),X0)
& in(X2,X1)
& in(X3,X1)
& in(X4,X1)
& in(ordered_pair(X2,X3),X0)
& in(ordered_pair(X3,X4),X0) ) )
& ( ! [X2,X3,X4] :
( in(ordered_pair(X2,X4),X0)
| ~ in(X2,X1)
| ~ in(X3,X1)
| ~ in(X4,X1)
| ~ in(ordered_pair(X2,X3),X0)
| ~ in(ordered_pair(X3,X4),X0) )
| ~ is_transitive_in(X0,X1) ) )
| ~ relation(X0) ),
inference(nnf_transformation,[],[f65]) ).
fof(f73,plain,
! [X0] :
( ! [X1] :
( ( is_transitive_in(X0,X1)
| ? [X2,X3,X4] :
( ~ in(ordered_pair(X2,X4),X0)
& in(X2,X1)
& in(X3,X1)
& in(X4,X1)
& in(ordered_pair(X2,X3),X0)
& in(ordered_pair(X3,X4),X0) ) )
& ( ! [X5,X6,X7] :
( in(ordered_pair(X5,X7),X0)
| ~ in(X5,X1)
| ~ in(X6,X1)
| ~ in(X7,X1)
| ~ in(ordered_pair(X5,X6),X0)
| ~ in(ordered_pair(X6,X7),X0) )
| ~ is_transitive_in(X0,X1) ) )
| ~ relation(X0) ),
inference(rectify,[],[f72]) ).
fof(f74,plain,
! [X0] :
( ! [X1] :
( ( is_transitive_in(X0,X1)
| ( ~ in(ordered_pair(sK3(X0,X1),sK5(X0,X1)),X0)
& in(sK3(X0,X1),X1)
& in(sK4(X0,X1),X1)
& in(sK5(X0,X1),X1)
& in(ordered_pair(sK3(X0,X1),sK4(X0,X1)),X0)
& in(ordered_pair(sK4(X0,X1),sK5(X0,X1)),X0) ) )
& ( ! [X5,X6,X7] :
( in(ordered_pair(X5,X7),X0)
| ~ in(X5,X1)
| ~ in(X6,X1)
| ~ in(X7,X1)
| ~ in(ordered_pair(X5,X6),X0)
| ~ in(ordered_pair(X6,X7),X0) )
| ~ is_transitive_in(X0,X1) ) )
| ~ relation(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4,sK5]),skolemize(X2,sK3(X0,X1)),skolemize(X3,sK4(X0,X1)),skolemize(X4,sK5(X0,X1))],[f73]) ).
fof(f77,plain,
~ transitive(inclusion_relation(sK0)),
inference(cnf_transformation,[],[f66]) ).
fof(f78,plain,
! [X0] : relation(inclusion_relation(X0)),
inference(cnf_transformation,[],[f16]) ).
fof(f79,plain,
! [X0,X1,X4,X5] :
( subset(X4,X5)
| ~ in(ordered_pair(X4,X5),X1)
| ~ in(X4,X0)
| ~ in(X5,X0)
| inclusion_relation(X0) != X1
| ~ relation(X1) ),
inference(cnf_transformation,[],[f70]) ).
fof(f80,plain,
! [X0,X1,X4,X5] :
( in(ordered_pair(X4,X5),X1)
| ~ subset(X4,X5)
| ~ in(X4,X0)
| ~ in(X5,X0)
| inclusion_relation(X0) != X1
| ~ relation(X1) ),
inference(cnf_transformation,[],[f70]) ).
fof(f81,plain,
! [X0,X1] :
( relation_field(X1) = X0
| inclusion_relation(X0) != X1
| ~ relation(X1) ),
inference(cnf_transformation,[],[f70]) ).
fof(f87,plain,
! [X0] :
( ~ is_transitive_in(X0,relation_field(X0))
| transitive(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f71]) ).
fof(f92,plain,
! [X2,X0,X1] :
( subset(X0,X2)
| ~ subset(X0,X1)
| ~ subset(X1,X2) ),
inference(cnf_transformation,[],[f63]) ).
fof(f95,plain,
! [X0,X1] :
( in(ordered_pair(sK4(X0,X1),sK5(X0,X1)),X0)
| is_transitive_in(X0,X1)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f74]) ).
fof(f96,plain,
! [X0,X1] :
( in(ordered_pair(sK3(X0,X1),sK4(X0,X1)),X0)
| is_transitive_in(X0,X1)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f74]) ).
fof(f97,plain,
! [X0,X1] :
( in(sK5(X0,X1),X1)
| is_transitive_in(X0,X1)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f74]) ).
fof(f98,plain,
! [X0,X1] :
( in(sK4(X0,X1),X1)
| is_transitive_in(X0,X1)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f74]) ).
fof(f99,plain,
! [X0,X1] :
( in(sK3(X0,X1),X1)
| is_transitive_in(X0,X1)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f74]) ).
fof(f100,plain,
! [X0,X1] :
( ~ in(ordered_pair(sK3(X0,X1),sK5(X0,X1)),X0)
| is_transitive_in(X0,X1)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f74]) ).
fof(f107,plain,
! [X0] :
( relation_field(inclusion_relation(X0)) = X0
| ~ relation(inclusion_relation(X0)) ),
inference(equality_resolution,[],[f81]) ).
fof(f108,plain,
! [X0,X4,X5] :
( in(ordered_pair(X4,X5),inclusion_relation(X0))
| ~ subset(X4,X5)
| ~ in(X4,X0)
| ~ in(X5,X0)
| ~ relation(inclusion_relation(X0)) ),
inference(equality_resolution,[],[f80]) ).
fof(f109,plain,
! [X0,X4,X5] :
( subset(X4,X5)
| ~ in(ordered_pair(X4,X5),inclusion_relation(X0))
| ~ in(X4,X0)
| ~ in(X5,X0)
| ~ relation(inclusion_relation(X0)) ),
inference(equality_resolution,[],[f79]) ).
fof(f113,plain,
! [X0] : relation_field(inclusion_relation(X0)) = X0,
inference(forward_subsumption_resolution,[],[f107,f78]) ).
fof(f114,plain,
! [X0] :
( ~ is_transitive_in(inclusion_relation(X0),X0)
| transitive(inclusion_relation(X0))
| ~ relation(inclusion_relation(X0)) ),
inference(superposition,[],[f87,f113]) ).
fof(f117,plain,
! [X0] :
( ~ is_transitive_in(inclusion_relation(X0),X0)
| transitive(inclusion_relation(X0)) ),
inference(forward_subsumption_resolution,[],[f114,f78]) ).
fof(f146,plain,
! [X0,X4,X5] :
( in(ordered_pair(X4,X5),inclusion_relation(X0))
| ~ subset(X4,X5)
| ~ in(X4,X0)
| ~ in(X5,X0) ),
inference(forward_subsumption_resolution,[],[f108,f78]) ).
fof(f147,plain,
! [X0,X1] :
( ~ subset(sK3(inclusion_relation(X0),X1),sK5(inclusion_relation(X0),X1))
| ~ in(sK3(inclusion_relation(X0),X1),X0)
| ~ in(sK5(inclusion_relation(X0),X1),X0)
| is_transitive_in(inclusion_relation(X0),X1)
| ~ relation(inclusion_relation(X0)) ),
inference(resolution,[],[f146,f100]) ).
fof(f150,plain,
! [X0,X1] :
( ~ subset(sK3(inclusion_relation(X0),X1),sK5(inclusion_relation(X0),X1))
| ~ in(sK3(inclusion_relation(X0),X1),X0)
| ~ in(sK5(inclusion_relation(X0),X1),X0)
| is_transitive_in(inclusion_relation(X0),X1) ),
inference(forward_subsumption_resolution,[],[f147,f78]) ).
fof(f158,plain,
! [X0,X4,X5] :
( ~ in(ordered_pair(X4,X5),inclusion_relation(X0))
| subset(X4,X5)
| ~ in(X4,X0)
| ~ in(X5,X0) ),
inference(forward_subsumption_resolution,[],[f109,f78]) ).
fof(f163,plain,
! [X0,X1] :
( subset(sK4(inclusion_relation(X0),X1),sK5(inclusion_relation(X0),X1))
| ~ in(sK4(inclusion_relation(X0),X1),X0)
| ~ in(sK5(inclusion_relation(X0),X1),X0)
| is_transitive_in(inclusion_relation(X0),X1)
| ~ relation(inclusion_relation(X0)) ),
inference(resolution,[],[f158,f95]) ).
fof(f164,plain,
! [X0,X1] :
( subset(sK3(inclusion_relation(X0),X1),sK4(inclusion_relation(X0),X1))
| ~ in(sK3(inclusion_relation(X0),X1),X0)
| ~ in(sK4(inclusion_relation(X0),X1),X0)
| is_transitive_in(inclusion_relation(X0),X1)
| ~ relation(inclusion_relation(X0)) ),
inference(resolution,[],[f158,f96]) ).
fof(f167,plain,
! [X0,X1] :
( subset(sK3(inclusion_relation(X0),X1),sK4(inclusion_relation(X0),X1))
| ~ in(sK3(inclusion_relation(X0),X1),X0)
| ~ in(sK4(inclusion_relation(X0),X1),X0)
| is_transitive_in(inclusion_relation(X0),X1) ),
inference(forward_subsumption_resolution,[],[f164,f78]) ).
fof(f168,plain,
! [X0,X1] :
( subset(sK4(inclusion_relation(X0),X1),sK5(inclusion_relation(X0),X1))
| ~ in(sK4(inclusion_relation(X0),X1),X0)
| ~ in(sK5(inclusion_relation(X0),X1),X0)
| is_transitive_in(inclusion_relation(X0),X1) ),
inference(forward_subsumption_resolution,[],[f163,f78]) ).
fof(f198,plain,
! [X2,X0,X1] :
( ~ subset(sK3(inclusion_relation(X0),X1),X2)
| ~ in(sK5(inclusion_relation(X0),X1),X0)
| is_transitive_in(inclusion_relation(X0),X1)
| ~ in(sK3(inclusion_relation(X0),X1),X0)
| ~ subset(X2,sK5(inclusion_relation(X0),X1)) ),
inference(resolution,[],[f150,f92]) ).
fof(f205,plain,
! [X0,X1] :
( ~ in(sK5(inclusion_relation(X0),X1),X0)
| is_transitive_in(inclusion_relation(X0),X1)
| ~ in(sK3(inclusion_relation(X0),X1),X0)
| ~ subset(sK4(inclusion_relation(X0),X1),sK5(inclusion_relation(X0),X1))
| ~ in(sK3(inclusion_relation(X0),X1),X0)
| ~ in(sK4(inclusion_relation(X0),X1),X0)
| is_transitive_in(inclusion_relation(X0),X1) ),
inference(resolution,[],[f198,f167]) ).
fof(f209,plain,
! [X0,X1] :
( ~ in(sK5(inclusion_relation(X0),X1),X0)
| is_transitive_in(inclusion_relation(X0),X1)
| ~ in(sK3(inclusion_relation(X0),X1),X0)
| ~ subset(sK4(inclusion_relation(X0),X1),sK5(inclusion_relation(X0),X1))
| ~ in(sK4(inclusion_relation(X0),X1),X0) ),
inference(duplicate_literal_removal,[],[f205]) ).
fof(f210,plain,
! [X0,X1] :
( ~ in(sK5(inclusion_relation(X0),X1),X0)
| is_transitive_in(inclusion_relation(X0),X1)
| ~ in(sK3(inclusion_relation(X0),X1),X0)
| ~ in(sK4(inclusion_relation(X0),X1),X0) ),
inference(forward_subsumption_resolution,[],[f209,f168]) ).
fof(f211,plain,
! [X0] :
( is_transitive_in(inclusion_relation(X0),X0)
| ~ in(sK3(inclusion_relation(X0),X0),X0)
| ~ in(sK4(inclusion_relation(X0),X0),X0)
| is_transitive_in(inclusion_relation(X0),X0)
| ~ relation(inclusion_relation(X0)) ),
inference(resolution,[],[f210,f97]) ).
fof(f213,plain,
! [X0] :
( is_transitive_in(inclusion_relation(X0),X0)
| ~ in(sK3(inclusion_relation(X0),X0),X0)
| ~ in(sK4(inclusion_relation(X0),X0),X0)
| ~ relation(inclusion_relation(X0)) ),
inference(duplicate_literal_removal,[],[f211]) ).
fof(f214,plain,
! [X0] :
( is_transitive_in(inclusion_relation(X0),X0)
| ~ in(sK4(inclusion_relation(X0),X0),X0)
| ~ relation(inclusion_relation(X0)) ),
inference(forward_subsumption_resolution,[],[f213,f99]) ).
fof(f215,plain,
! [X0] :
( is_transitive_in(inclusion_relation(X0),X0)
| ~ relation(inclusion_relation(X0)) ),
inference(forward_subsumption_resolution,[],[f214,f98]) ).
fof(f216,plain,
! [X0] : is_transitive_in(inclusion_relation(X0),X0),
inference(forward_subsumption_resolution,[],[f215,f78]) ).
fof(f232,plain,
! [X0] : transitive(inclusion_relation(X0)),
inference(resolution,[],[f216,f117]) ).
fof(f254,plain,
$false,
inference(resolution,[],[f232,f77]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU269+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.39 % Computer : n006.cluster.edu
% 0.09/0.39 % Model : x86_64 x86_64
% 0.09/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.39 % Memory : 8046.5625MB
% 0.09/0.39 % OS : Linux 6.8.0-71-generic
% 0.09/0.39 % CPULimit : 300
% 0.09/0.39 % WCLimit : 300
% 0.09/0.39 % DateTime : Mon Sep 28 04:25:10 UTC 2026
% 0.09/0.39 % CPUTime :
% 0.09/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.42 Running first-order theorem proving
% 0.09/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.67/1.29 % (3579289)Detected formulas, will run a generic FOF schedule.
% 2.67/1.29 % (3579296)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=2340945619:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.67/1.29 % (3579297)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1108025964:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.67/1.29 % (3579295)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=4117764564:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.67/1.29 % (3579300)dis-21_1_sil=8000:lcm=predicate:random_seed=60759064: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.67/1.29 % (3579294)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=1180181070:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.67/1.29 % (3579298)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3827855052:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.67/1.29 % (3579299)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2484991205:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.67/1.29 % (3579297)Refutation not found, incomplete strategy
% 2.67/1.29 % (3579297)------------------------------
% 2.67/1.29 % (3579297)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.67/1.29 % (3579297)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.67/1.29 % (3579297)CaDiCaL version: 2.1.3
% 2.67/1.29 % (3579297)Termination reason: Refutation not found, incomplete strategy
% 2.67/1.29 % (3579297)Time elapsed: 0.001 s
% 2.67/1.29 % (3579297)Peak memory usage: 88 MB
% 2.67/1.29 % (3579297)Instructions burned: 1 (million)
% 2.67/1.29 % (3579298)First to succeed.
% 2.67/1.29 % (3579298)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3579289"
% 2.67/1.29 % (3579300)Instruction limit reached!
% 2.67/1.29 % (3579300)------------------------------
% 2.67/1.29 % (3579300)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.67/1.29 % (3579300)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.67/1.29 % (3579300)CaDiCaL version: 2.1.3
% 2.67/1.29 % (3579300)Termination reason: Instruction limit
% 2.67/1.29 % (3579300)Termination phase: Saturation
% 2.67/1.29 % (3579300)Time elapsed: 0.082 s
% 2.67/1.29 % (3579300)Peak memory usage: 89 MB
% 2.67/1.29 % (3579300)Instructions burned: 130 (million)
% 2.67/1.29 % (3579299)Instruction limit reached!
% 2.67/1.29 % (3579299)------------------------------
% 2.67/1.29 % (3579299)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.67/1.29 % (3579299)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.67/1.29 % (3579299)CaDiCaL version: 2.1.3
% 2.67/1.29 % (3579299)Termination reason: Instruction limit
% 2.67/1.29 % (3579299)Termination phase: Saturation
% 2.67/1.29 % (3579299)Time elapsed: 0.090 s
% 2.67/1.29 % (3579299)Peak memory usage: 90 MB
% 2.67/1.29 % (3579299)Instructions burned: 140 (million)
% 2.67/1.29 % (3579297)------------------------------
% 2.67/1.29 % (3579297)------------------------------
% 2.67/1.29 % (3579308)lrs+10_1_sil=8000:sp=occurrence:random_seed=198832950:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.67/1.29 % (3579309)lrs+10_1_sil=32000:urr=on:br=off:random_seed=69341089:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.67/1.29 % (3579309)Refutation not found, incomplete strategy
% 2.67/1.29 % (3579309)------------------------------
% 2.67/1.29 % (3579309)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.67/1.29 % (3579309)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.67/1.29 % (3579309)CaDiCaL version: 2.1.3
% 2.67/1.29 % (3579309)Termination reason: Refutation not found, incomplete strategy
% 2.67/1.29 % (3579309)Time elapsed: 0.002 s
% 2.67/1.29 % (3579309)Peak memory usage: 89 MB
% 2.67/1.29 % (3579309)Instructions burned: 2 (million)
% 2.67/1.29 % (3579298)Refutation found. Thanks to Tanya!
% 2.67/1.29 % SZS status Theorem for theBenchmark
% 2.67/1.29 % SZS output start Proof for theBenchmark
% See solution above
% 3.51/1.38 % (3579298)------------------------------
% 3.51/1.38 % (3579298)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.51/1.38 % (3579298)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.51/1.38 % (3579298)CaDiCaL version: 2.1.3
% 3.51/1.38 % (3579298)Termination reason: Refutation
% 3.51/1.38 % (3579298)Time elapsed: 0.009 s
% 3.51/1.38 % (3579298)Peak memory usage: 88 MB
% 3.51/1.38 % (3579298)Instructions burned: 12 (million)
% 3.51/1.38 % (3579298)------------------------------
% 3.51/1.38 % (3579298)------------------------------
% 3.51/1.38 % (3579289)Success in time 0.434 s
% 3.51/1.38 % Vampire exiting
%------------------------------------------------------------------------------