%------------------------------------------------------------------------------
% File : Vampire-SAT---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 SAT
% Computer : n007.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:52:40 PM UTC 2026
% Result : Theorem 5.35s 1.21s
% Output : Refutation 5.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 12
% Syntax : Number of formulae : 111 ( 19 unt; 4 def)
% Number of atoms : 439 ( 34 equ)
% Maximal formula atoms : 17 ( 3 avg)
% Number of connectives : 549 ( 221 ~; 255 |; 52 &)
% ( 15 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 5 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 1 con; 0-2 aty)
% Number of variables : 184 ( 0 sgn 171 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
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(f11,axiom,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_tarski) ).
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(f70,plain,
! [X0] :
( ( transitive(X0)
<=> is_transitive_in(X0,relation_field(X0)) )
| ~ relation(X0) ),
inference(ennf_transformation,[],[f9]) ).
fof(f71,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(f72,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,[],[f71]) ).
fof(f74,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(f75,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,[],[f74]) ).
fof(f79,plain,
! [X0,X1,X2] :
( subset(X0,X2)
| ~ subset(X0,X1)
| ~ subset(X1,X2) ),
inference(ennf_transformation,[],[f44]) ).
fof(f80,plain,
! [X0,X1,X2] :
( subset(X0,X2)
| ~ subset(X0,X1)
| ~ subset(X1,X2) ),
inference(flattening,[],[f79]) ).
fof(f83,plain,
? [X0] : ~ transitive(inclusion_relation(X0)),
inference(ennf_transformation,[],[f48]) ).
fof(f90,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,[],[f70]) ).
fof(f91,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,[],[f72]) ).
fof(f92,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,[],[f91]) ).
fof(f93,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,[],[f92]) ).
fof(f94,plain,
! [X0,X1] :
( ( ( X1 = inclusion_relation(X0)
| relation_field(X1) != X0
| ( ( ~ subset(sK0(X0,X1),sK1(X0,X1))
| ~ in(ordered_pair(sK0(X0,X1),sK1(X0,X1)),X1) )
& ( subset(sK0(X0,X1),sK1(X0,X1))
| in(ordered_pair(sK0(X0,X1),sK1(X0,X1)),X1) )
& in(sK0(X0,X1),X0)
& in(sK1(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,[sK0,sK1]),skolemize(X2,sK0(X0,X1)),skolemize(X3,sK1(X0,X1))],[f93]) ).
fof(f95,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,[],[f75]) ).
fof(f96,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,[],[f95]) ).
fof(f97,plain,
! [X0] :
( ! [X1] :
( ( is_transitive_in(X0,X1)
| ( ~ in(ordered_pair(sK2(X0,X1),sK4(X0,X1)),X0)
& in(sK2(X0,X1),X1)
& in(sK3(X0,X1),X1)
& in(sK4(X0,X1),X1)
& in(ordered_pair(sK2(X0,X1),sK3(X0,X1)),X0)
& in(ordered_pair(sK3(X0,X1),sK4(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,[sK2,sK3,sK4]),skolemize(X2,sK2(X0,X1)),skolemize(X3,sK3(X0,X1)),skolemize(X4,sK4(X0,X1))],[f96]) ).
fof(f109,plain,
~ transitive(inclusion_relation(sK15)),
inference(skolemize,[status(esa),new_symbols(skolem,[sK15]),skolemize(X0,sK15)],[f83]) ).
fof(f120,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f7]) ).
fof(f123,plain,
! [X0] :
( ~ is_transitive_in(X0,relation_field(X0))
| transitive(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f90]) ).
fof(f124,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,[],[f94]) ).
fof(f125,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,[],[f94]) ).
fof(f126,plain,
! [X0,X1] :
( relation_field(X1) = X0
| inclusion_relation(X0) != X1
| ~ relation(X1) ),
inference(cnf_transformation,[],[f94]) ).
fof(f131,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
inference(cnf_transformation,[],[f11]) ).
fof(f134,plain,
! [X0,X1] :
( is_transitive_in(X0,X1)
| in(ordered_pair(sK3(X0,X1),sK4(X0,X1)),X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f97]) ).
fof(f135,plain,
! [X0,X1] :
( is_transitive_in(X0,X1)
| in(ordered_pair(sK2(X0,X1),sK3(X0,X1)),X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f97]) ).
fof(f136,plain,
! [X0,X1] :
( in(sK4(X0,X1),X1)
| is_transitive_in(X0,X1)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f97]) ).
fof(f137,plain,
! [X0,X1] :
( in(sK3(X0,X1),X1)
| is_transitive_in(X0,X1)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f97]) ).
fof(f138,plain,
! [X0,X1] :
( in(sK2(X0,X1),X1)
| is_transitive_in(X0,X1)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f97]) ).
fof(f139,plain,
! [X0,X1] :
( is_transitive_in(X0,X1)
| ~ in(ordered_pair(sK2(X0,X1),sK4(X0,X1)),X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f97]) ).
fof(f140,plain,
! [X0] : relation(inclusion_relation(X0)),
inference(cnf_transformation,[],[f16]) ).
fof(f180,plain,
! [X2,X0,X1] :
( ~ subset(X1,X2)
| ~ subset(X0,X1)
| subset(X0,X2) ),
inference(cnf_transformation,[],[f80]) ).
fof(f184,plain,
~ transitive(inclusion_relation(sK15)),
inference(cnf_transformation,[],[f109]) ).
fof(f192,plain,
! [X0,X1,X4,X5] :
( in(unordered_pair(unordered_pair(X4,X5),singleton(X4)),X1)
| ~ subset(X4,X5)
| ~ in(X4,X0)
| ~ in(X5,X0)
| inclusion_relation(X0) != X1
| ~ relation(X1) ),
inference(definition_unfolding,[],[f125,f131]) ).
fof(f193,plain,
! [X0,X1,X4,X5] :
( subset(X4,X5)
| ~ in(unordered_pair(unordered_pair(X4,X5),singleton(X4)),X1)
| ~ in(X4,X0)
| ~ in(X5,X0)
| inclusion_relation(X0) != X1
| ~ relation(X1) ),
inference(definition_unfolding,[],[f124,f131]) ).
fof(f194,plain,
! [X0,X1] :
( is_transitive_in(X0,X1)
| ~ in(unordered_pair(unordered_pair(sK2(X0,X1),sK4(X0,X1)),singleton(sK2(X0,X1))),X0)
| ~ relation(X0) ),
inference(definition_unfolding,[],[f139,f131]) ).
fof(f195,plain,
! [X0,X1] :
( is_transitive_in(X0,X1)
| in(unordered_pair(unordered_pair(sK2(X0,X1),sK3(X0,X1)),singleton(sK2(X0,X1))),X0)
| ~ relation(X0) ),
inference(definition_unfolding,[],[f135,f131]) ).
fof(f196,plain,
! [X0,X1] :
( is_transitive_in(X0,X1)
| in(unordered_pair(unordered_pair(sK3(X0,X1),sK4(X0,X1)),singleton(sK3(X0,X1))),X0)
| ~ relation(X0) ),
inference(definition_unfolding,[],[f134,f131]) ).
fof(f203,plain,
! [X0] :
( relation_field(inclusion_relation(X0)) = X0
| ~ relation(inclusion_relation(X0)) ),
inference(equality_resolution,[],[f126]) ).
fof(f204,plain,
! [X0,X4,X5] :
( in(unordered_pair(unordered_pair(X4,X5),singleton(X4)),inclusion_relation(X0))
| ~ subset(X4,X5)
| ~ in(X4,X0)
| ~ in(X5,X0)
| ~ relation(inclusion_relation(X0)) ),
inference(equality_resolution,[],[f192]) ).
fof(f205,plain,
! [X0,X4,X5] :
( subset(X4,X5)
| ~ in(unordered_pair(unordered_pair(X4,X5),singleton(X4)),inclusion_relation(X0))
| ~ in(X4,X0)
| ~ in(X5,X0)
| ~ relation(inclusion_relation(X0)) ),
inference(equality_resolution,[],[f193]) ).
fof(f206,plain,
! [X0,X4,X5] :
( subset(X4,X5)
| ~ in(unordered_pair(unordered_pair(X4,X5),singleton(X4)),inclusion_relation(X0))
| ~ in(X4,X0)
| ~ in(X5,X0) ),
inference(global_subsumption,[],[f205,f140]) ).
fof(f207,plain,
! [X0,X4,X5] :
( in(unordered_pair(unordered_pair(X4,X5),singleton(X4)),inclusion_relation(X0))
| ~ subset(X4,X5)
| ~ in(X4,X0)
| ~ in(X5,X0) ),
inference(global_subsumption,[],[f204,f140]) ).
fof(f208,plain,
! [X0] : relation_field(inclusion_relation(X0)) = X0,
inference(global_subsumption,[],[f203,f140]) ).
fof(f676,plain,
! [X0,X4,X5] :
( ~ in(unordered_pair(singleton(X4),unordered_pair(X4,X5)),inclusion_relation(X0))
| subset(X4,X5)
| ~ in(X4,X0)
| ~ in(X5,X0) ),
inference(forward_demodulation,[],[f206,f120]) ).
fof(f677,plain,
! [X0,X4,X5] :
( in(unordered_pair(singleton(X4),unordered_pair(X4,X5)),inclusion_relation(X0))
| ~ subset(X4,X5)
| ~ in(X4,X0)
| ~ in(X5,X0) ),
inference(forward_demodulation,[],[f207,f120]) ).
fof(f1597,plain,
! [X0] :
( ~ is_transitive_in(inclusion_relation(X0),X0)
| transitive(inclusion_relation(X0))
| ~ relation(inclusion_relation(X0)) ),
inference(superposition,[],[f123,f208]) ).
fof(f1619,plain,
! [X0] :
( ~ is_transitive_in(inclusion_relation(X0),X0)
| transitive(inclusion_relation(X0)) ),
inference(forward_subsumption_resolution,[],[f1597,f140]) ).
fof(f8240,plain,
! [X0,X1] :
( ~ in(unordered_pair(singleton(sK2(X0,X1)),unordered_pair(sK2(X0,X1),sK4(X0,X1))),X0)
| is_transitive_in(X0,X1)
| ~ relation(X0) ),
inference(forward_demodulation,[],[f194,f120]) ).
fof(f8285,plain,
! [X0,X1] :
( in(unordered_pair(singleton(sK2(X0,X1)),unordered_pair(sK2(X0,X1),sK3(X0,X1))),X0)
| is_transitive_in(X0,X1)
| ~ relation(X0) ),
inference(forward_demodulation,[],[f195,f120]) ).
fof(f8286,plain,
! [X0,X1] :
( in(unordered_pair(singleton(sK3(X0,X1)),unordered_pair(sK3(X0,X1),sK4(X0,X1))),X0)
| is_transitive_in(X0,X1)
| ~ relation(X0) ),
inference(forward_demodulation,[],[f196,f120]) ).
fof(f8292,plain,
! [X0,X1] :
( is_transitive_in(inclusion_relation(X0),X1)
| ~ relation(inclusion_relation(X0))
| ~ subset(sK2(inclusion_relation(X0),X1),sK4(inclusion_relation(X0),X1))
| ~ in(sK2(inclusion_relation(X0),X1),X0)
| ~ in(sK4(inclusion_relation(X0),X1),X0) ),
inference(resolution,[],[f8240,f677]) ).
fof(f8298,plain,
! [X0,X1] :
( ~ subset(sK2(inclusion_relation(X0),X1),sK4(inclusion_relation(X0),X1))
| is_transitive_in(inclusion_relation(X0),X1)
| ~ in(sK2(inclusion_relation(X0),X1),X0)
| ~ in(sK4(inclusion_relation(X0),X1),X0) ),
inference(forward_subsumption_resolution,[],[f8292,f140]) ).
fof(f9246,plain,
! [X0,X1] :
( is_transitive_in(inclusion_relation(X0),X1)
| ~ relation(inclusion_relation(X0))
| subset(sK2(inclusion_relation(X0),X1),sK3(inclusion_relation(X0),X1))
| ~ in(sK2(inclusion_relation(X0),X1),X0)
| ~ in(sK3(inclusion_relation(X0),X1),X0) ),
inference(resolution,[],[f8285,f676]) ).
fof(f9276,plain,
! [X0,X1] :
( subset(sK2(inclusion_relation(X0),X1),sK3(inclusion_relation(X0),X1))
| is_transitive_in(inclusion_relation(X0),X1)
| ~ in(sK2(inclusion_relation(X0),X1),X0)
| ~ in(sK3(inclusion_relation(X0),X1),X0) ),
inference(forward_subsumption_resolution,[],[f9246,f140]) ).
fof(f9915,plain,
! [X0,X1] :
( is_transitive_in(inclusion_relation(X0),X1)
| ~ relation(inclusion_relation(X0))
| 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) ),
inference(resolution,[],[f8286,f676]) ).
fof(f9933,plain,
! [X0,X1] :
( subset(sK3(inclusion_relation(X0),X1),sK4(inclusion_relation(X0),X1))
| 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,[],[f9915,f140]) ).
fof(f15507,definition,
( spl16_249
<=> is_transitive_in(inclusion_relation(sK15),sK15) ),
introduced(definition,[new_symbols(definition,[spl16_249])],[avatar_definition]) ).
fof(f15508,plain,
( ~ is_transitive_in(inclusion_relation(sK15),sK15)
| spl16_249 ),
inference(avatar_component_clause,[],[f15507]) ).
fof(f15509,plain,
( is_transitive_in(inclusion_relation(sK15),sK15)
| ~ spl16_249 ),
inference(avatar_component_clause,[],[f15507]) ).
fof(f15515,plain,
( transitive(inclusion_relation(sK15))
| ~ spl16_249 ),
inference(resolution,[],[f15509,f1619]) ).
fof(f15516,plain,
( $false
| ~ spl16_249 ),
inference(forward_subsumption_resolution,[],[f15515,f184]) ).
fof(f15517,plain,
~ spl16_249,
inference(avatar_contradiction_clause,[],[f15516]) ).
fof(f15573,definition,
( spl16_251
<=> in(sK2(inclusion_relation(sK15),sK15),sK15) ),
introduced(definition,[new_symbols(definition,[spl16_251])],[avatar_definition]) ).
fof(f15574,plain,
( in(sK2(inclusion_relation(sK15),sK15),sK15)
| ~ spl16_251 ),
inference(avatar_component_clause,[],[f15573]) ).
fof(f15575,plain,
( ~ in(sK2(inclusion_relation(sK15),sK15),sK15)
| spl16_251 ),
inference(avatar_component_clause,[],[f15573]) ).
fof(f15581,plain,
( is_transitive_in(inclusion_relation(sK15),sK15)
| ~ relation(inclusion_relation(sK15))
| spl16_251 ),
inference(resolution,[],[f15575,f138]) ).
fof(f15582,plain,
( ~ relation(inclusion_relation(sK15))
| spl16_249
| spl16_251 ),
inference(forward_subsumption_resolution,[],[f15581,f15508]) ).
fof(f15583,plain,
( $false
| spl16_249
| spl16_251 ),
inference(forward_subsumption_resolution,[],[f15582,f140]) ).
fof(f15584,plain,
( spl16_249
| spl16_251 ),
inference(avatar_contradiction_clause,[],[f15583]) ).
fof(f15670,definition,
( spl16_253
<=> in(sK4(inclusion_relation(sK15),sK15),sK15) ),
introduced(definition,[new_symbols(definition,[spl16_253])],[avatar_definition]) ).
fof(f15671,plain,
( in(sK4(inclusion_relation(sK15),sK15),sK15)
| ~ spl16_253 ),
inference(avatar_component_clause,[],[f15670]) ).
fof(f15672,plain,
( ~ in(sK4(inclusion_relation(sK15),sK15),sK15)
| spl16_253 ),
inference(avatar_component_clause,[],[f15670]) ).
fof(f15678,plain,
( is_transitive_in(inclusion_relation(sK15),sK15)
| ~ relation(inclusion_relation(sK15))
| spl16_253 ),
inference(resolution,[],[f15672,f136]) ).
fof(f15679,plain,
( ~ relation(inclusion_relation(sK15))
| spl16_249
| spl16_253 ),
inference(forward_subsumption_resolution,[],[f15678,f15508]) ).
fof(f15680,plain,
( $false
| spl16_249
| spl16_253 ),
inference(forward_subsumption_resolution,[],[f15679,f140]) ).
fof(f15681,plain,
( spl16_249
| spl16_253 ),
inference(avatar_contradiction_clause,[],[f15680]) ).
fof(f16464,plain,
! [X2,X0,X1] :
( ~ subset(X2,sK3(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)
| subset(X2,sK4(inclusion_relation(X0),X1)) ),
inference(resolution,[],[f9933,f180]) ).
fof(f19033,definition,
( spl16_312
<=> in(sK3(inclusion_relation(sK15),sK15),sK15) ),
introduced(definition,[new_symbols(definition,[spl16_312])],[avatar_definition]) ).
fof(f19034,plain,
( in(sK3(inclusion_relation(sK15),sK15),sK15)
| ~ spl16_312 ),
inference(avatar_component_clause,[],[f19033]) ).
fof(f19035,plain,
( ~ in(sK3(inclusion_relation(sK15),sK15),sK15)
| spl16_312 ),
inference(avatar_component_clause,[],[f19033]) ).
fof(f19067,plain,
( is_transitive_in(inclusion_relation(sK15),sK15)
| ~ relation(inclusion_relation(sK15))
| spl16_312 ),
inference(resolution,[],[f19035,f137]) ).
fof(f19068,plain,
( ~ relation(inclusion_relation(sK15))
| spl16_249
| spl16_312 ),
inference(forward_subsumption_resolution,[],[f19067,f15508]) ).
fof(f19069,plain,
( $false
| spl16_249
| spl16_312 ),
inference(forward_subsumption_resolution,[],[f19068,f140]) ).
fof(f19070,plain,
( spl16_249
| spl16_312 ),
inference(avatar_contradiction_clause,[],[f19069]) ).
fof(f21654,plain,
! [X0,X1] :
( ~ in(sK3(inclusion_relation(X0),X1),X0)
| ~ in(sK4(inclusion_relation(X0),X1),X0)
| is_transitive_in(inclusion_relation(X0),X1)
| subset(sK2(inclusion_relation(X0),X1),sK4(inclusion_relation(X0),X1))
| is_transitive_in(inclusion_relation(X0),X1)
| ~ in(sK2(inclusion_relation(X0),X1),X0)
| ~ in(sK3(inclusion_relation(X0),X1),X0) ),
inference(resolution,[],[f16464,f9276]) ).
fof(f21662,plain,
! [X0,X1] :
( ~ in(sK3(inclusion_relation(X0),X1),X0)
| ~ in(sK4(inclusion_relation(X0),X1),X0)
| is_transitive_in(inclusion_relation(X0),X1)
| subset(sK2(inclusion_relation(X0),X1),sK4(inclusion_relation(X0),X1))
| ~ in(sK2(inclusion_relation(X0),X1),X0) ),
inference(duplicate_literal_removal,[],[f21654]) ).
fof(f21666,plain,
! [X0,X1] :
( ~ in(sK4(inclusion_relation(X0),X1),X0)
| ~ in(sK3(inclusion_relation(X0),X1),X0)
| is_transitive_in(inclusion_relation(X0),X1)
| ~ in(sK2(inclusion_relation(X0),X1),X0) ),
inference(forward_subsumption_resolution,[],[f21662,f8298]) ).
fof(f21668,plain,
( ~ in(sK3(inclusion_relation(sK15),sK15),sK15)
| is_transitive_in(inclusion_relation(sK15),sK15)
| ~ in(sK2(inclusion_relation(sK15),sK15),sK15)
| ~ spl16_253 ),
inference(resolution,[],[f21666,f15671]) ).
fof(f21672,plain,
( is_transitive_in(inclusion_relation(sK15),sK15)
| ~ in(sK2(inclusion_relation(sK15),sK15),sK15)
| ~ spl16_253
| ~ spl16_312 ),
inference(forward_subsumption_resolution,[],[f21668,f19034]) ).
fof(f21674,plain,
( ~ in(sK2(inclusion_relation(sK15),sK15),sK15)
| spl16_249
| ~ spl16_253
| ~ spl16_312 ),
inference(forward_subsumption_resolution,[],[f21672,f15508]) ).
fof(f21676,plain,
( $false
| spl16_249
| ~ spl16_251
| ~ spl16_253
| ~ spl16_312 ),
inference(forward_subsumption_resolution,[],[f21674,f15574]) ).
fof(f21677,plain,
( spl16_249
| ~ spl16_251
| ~ spl16_253
| ~ spl16_312 ),
inference(avatar_contradiction_clause,[],[f21676]) ).
cnf(s7735,plain,
~ spl16_249,
inference(sat_conversion,[],[f15517]) ).
cnf(s7771,plain,
( spl16_249
| spl16_251 ),
inference(sat_conversion,[],[f15584]) ).
cnf(s7839,plain,
( spl16_249
| spl16_253 ),
inference(sat_conversion,[],[f15681]) ).
cnf(s9133,plain,
( spl16_249
| spl16_312 ),
inference(sat_conversion,[],[f19070]) ).
cnf(s10116,plain,
( spl16_249
| ~ spl16_251
| ~ spl16_253
| ~ spl16_312 ),
inference(sat_conversion,[],[f21677]) ).
cnf(s10119,plain,
spl16_312,
inference(rat,[],[s9133,s7735]) ).
cnf(s10120,plain,
spl16_253,
inference(rat,[],[s7839,s7735]) ).
cnf(s10121,plain,
spl16_251,
inference(rat,[],[s7771,s7735]) ).
cnf(s10125,plain,
$false,
inference(rat,[],[s10116,s10119,s7735,s10120,s10121]) ).
fof(f21679,plain,
$false,
inference(avatar_sat_refutation,[],[s10125]) ).
%------------------------------------------------------------------------------
%----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 SAT
% 0.12/0.38 % Computer : n007.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.39 % DateTime : Mon Sep 28 04:23:11 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.42 Running first-order model finding
% 0.12/0.42 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.35/1.21 % (2020642)Will run a generic schedule for satisfiability detection.
% 5.35/1.21 % (2020651)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2310651478:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 5.35/1.21 % (2020648)% WARNING: option uhcvi not known.
% 5.35/1.21 % (2020649)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=934487734:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 5.35/1.21 % (2020647)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3429974862_2999 on theBenchmark for (2999ds/0Mi)
% 5.35/1.21 % (2020648)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1039521761:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 5.35/1.21 % (2020650)dis+10_1_sil=32000:sp=arity:random_seed=1187242919:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 5.35/1.21 % (2020652)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2190328262:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 5.35/1.21 % (2020653)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3574060195:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 5.35/1.21 % TRYING [1]
% 5.35/1.21 % TRYING [2]
% 5.35/1.21 % TRYING [3]
% 5.35/1.21 % TRYING [4]
% 5.35/1.21 % (2020651)Instruction limit reached!
% 5.35/1.21 % (2020651)------------------------------
% 5.35/1.21 % (2020651)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.35/1.21 % (2020651)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.35/1.21 % (2020651)CaDiCaL version: 2.1.3
% 5.35/1.21 % (2020651)Termination reason: Instruction limit
% 5.35/1.21 % (2020651)Termination phase: Saturation
% 5.35/1.21 % (2020651)Time elapsed: 0.040 s
% 5.35/1.21 % (2020651)Peak memory usage: 13 MB
% 5.35/1.21 % (2020651)Instructions burned: 119 (million)
% 5.35/1.21 % (2020661)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3384705912:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 5.35/1.21 % TRYING [1]
% 5.35/1.21 % TRYING [2]
% 5.35/1.21 % TRYING [3]
% 5.35/1.21 % TRYING [4]
% 5.35/1.21 % (2020650)Instruction limit reached!
% 5.35/1.21 % (2020650)------------------------------
% 5.35/1.21 % (2020650)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.35/1.21 % (2020650)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.35/1.21 % (2020650)CaDiCaL version: 2.1.3
% 5.35/1.21 % (2020650)Termination reason: Instruction limit
% 5.35/1.21 % (2020650)Termination phase: Saturation
% 5.35/1.21 % (2020650)Time elapsed: 0.062 s
% 5.35/1.21 % (2020650)Peak memory usage: 12 MB
% 5.35/1.21 % (2020650)Instructions burned: 103 (million)
% 5.35/1.21 % (2020663)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1690004721:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 5.35/1.21 % (2020652)Instruction limit reached!
% 5.35/1.21 % (2020652)------------------------------
% 5.35/1.21 % (2020652)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.35/1.21 % (2020652)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.35/1.21 % (2020652)CaDiCaL version: 2.1.3
% 5.35/1.21 % (2020652)Termination reason: Instruction limit
% 5.35/1.21 % (2020652)Termination phase: Saturation
% 5.35/1.21 % (2020652)Time elapsed: 0.083 s
% 5.35/1.21 % (2020652)Peak memory usage: 13 MB
% 5.35/1.21 % (2020652)Instructions burned: 132 (million)
% 5.35/1.21 % (2020653)Instruction limit reached!
% 5.35/1.21 % (2020653)------------------------------
% 5.35/1.21 % (2020653)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.35/1.21 % (2020653)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.35/1.21 % (2020653)CaDiCaL version: 2.1.3
% 5.35/1.21 % (2020653)Termination reason: Instruction limit
% 5.35/1.21 % (2020653)Termination phase: Saturation
% 5.35/1.21 % (2020653)Time elapsed: 0.090 s
% 5.35/1.21 % (2020653)Peak memory usage: 14 MB
% 5.35/1.21 % (2020653)Instructions burned: 159 (million)
% 5.35/1.21 % (2020665)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=1462469673:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 5.35/1.21 % (2020666)ott-21_1_sil=16000:fs=off:random_seed=832641403:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 5.35/1.21 % (2020663)Instruction limit reached!
% 5.35/1.21 % (2020663)------------------------------
% 5.35/1.21 % (2020663)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.35/1.21 % (2020663)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.35/1.21 % (2020663)CaDiCaL version: 2.1.3
% 5.35/1.21 % (2020663)Termination reason: Instruction limit
% 5.35/1.21 % (2020663)Termination phase: Saturation
% 5.35/1.21 % (2020663)Time elapsed: 0.082 s
% 5.35/1.21 % (2020663)Peak memory usage: 14 MB
% 5.35/1.21 % (2020663)Instructions burned: 132 (million)
% 5.35/1.21 % (2020669)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3036312525:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 5.35/1.21 % (2020666)Instruction limit reached!
% 5.35/1.21 % (2020666)------------------------------
% 5.35/1.21 % (2020666)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.35/1.21 % (2020666)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.35/1.21 % (2020666)CaDiCaL version: 2.1.3
% 5.35/1.21 % (2020666)Termination reason: Instruction limit
% 5.35/1.21 % (2020666)Termination phase: Saturation
% 5.35/1.21 % (2020666)Time elapsed: 0.092 s
% 5.35/1.21 % (2020666)Peak memory usage: 13 MB
% 5.35/1.21 % (2020666)Instructions burned: 181 (million)
% 5.35/1.21 % (2020671)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=3374009929:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 5.35/1.21 % TRYING [1]
% 5.35/1.21 % TRYING [2]
% 5.35/1.21 % TRYING [3]
% 5.35/1.21 % TRYING [4]
% 5.35/1.21 % (2020661)Instruction limit reached!
% 5.35/1.21 % (2020661)------------------------------
% 5.35/1.21 % (2020661)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.35/1.21 % (2020661)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.35/1.21 % (2020661)CaDiCaL version: 2.1.3
% 5.35/1.21 % (2020661)Termination reason: Instruction limit
% 5.35/1.21 % (2020661)Termination phase: Finite model building SAT solving
% 5.35/1.21 % (2020661)Time elapsed: 0.227 s
% 5.35/1.21 % (2020661)Peak memory usage: 17 MB
% 5.35/1.21 % (2020661)Instructions burned: 716 (million)
% 5.35/1.21 % (2020673)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=1619354054:i=1179_2996 on theBenchmark for (2996ds/1179Mi)
% 5.35/1.21 % (2020665)Instruction limit reached!
% 5.35/1.21 % (2020665)------------------------------
% 5.35/1.21 % (2020665)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.35/1.21 % (2020665)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.35/1.21 % (2020665)CaDiCaL version: 2.1.3
% 5.35/1.21 % (2020665)Termination reason: Instruction limit
% 5.35/1.21 % (2020665)Termination phase: Saturation
% 5.35/1.21 % (2020665)Time elapsed: 0.356 s
% 5.35/1.21 % (2020665)Peak memory usage: 18 MB
% 5.35/1.21 % (2020665)Instructions burned: 686 (million)
% 5.35/1.21 % (2020675)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=5231682:i=889:ins=1_2995 on theBenchmark for (2995ds/889Mi)
% 5.35/1.21 % (2020669)Instruction limit reached!
% 5.35/1.21 % (2020669)------------------------------
% 5.35/1.21 % (2020669)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.35/1.21 % (2020669)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.35/1.21 % (2020669)CaDiCaL version: 2.1.3
% 5.35/1.21 % (2020669)Termination reason: Instruction limit
% 5.35/1.21 % (2020669)Termination phase: Saturation
% 5.35/1.21 % (2020669)Time elapsed: 0.332 s
% 5.35/1.21 % (2020669)Peak memory usage: 14 MB
% 5.35/1.21 % (2020669)Instructions burned: 477 (million)
% 5.35/1.21 % (2020677)ott+1_16_sil=32000:plsq=on:plsqc=2:sas=cadical:avsql=on:sp=reverse_frequency:plsqr=128,1:bsr=unit_only:rp=on:newcnf=on:random_seed=1574133304:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2994 on theBenchmark for (2994ds/692Mi)
% 5.35/1.21 % TRYING [14]
% 5.35/1.21 % (2020673)Instruction limit reached!
% 5.35/1.21 % (2020673)------------------------------
% 5.35/1.21 % (2020673)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.35/1.21 % (2020673)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.35/1.21 % (2020673)CaDiCaL version: 2.1.3
% 5.35/1.21 % (2020673)Termination reason: Instruction limit
% 5.35/1.21 % (2020673)Termination phase: Saturation
% 5.35/1.21 % (2020673)Time elapsed: 0.369 s
% 5.35/1.21 % (2020673)Peak memory usage: 23 MB
% 5.35/1.21 % (2020673)Instructions burned: 1181 (million)
% 5.35/1.21 % (2020679)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=4017602460:i=879:kws=inv_precedence:fsr=off_2993 on theBenchmark for (2993ds/879Mi)
% 5.35/1.21 % (2020671)Instruction limit reached!
% 5.35/1.21 % (2020671)------------------------------
% 5.35/1.21 % (2020671)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.35/1.21 % (2020671)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.35/1.21 % (2020671)CaDiCaL version: 2.1.3
% 5.35/1.21 % (2020671)Termination reason: Instruction limit
% 5.35/1.21 % (2020671)Termination phase: Finite model building SAT solving
% 5.35/1.21 % (2020671)Time elapsed: 0.469 s
% 5.35/1.21 % (2020671)Peak memory usage: 15 MB
% 5.35/1.21 % (2020671)Instructions burned: 865 (million)
% 5.35/1.21 % (2020681)fmb+10_1_sil=64000:random_seed=397841082:i=22061:nm=2:gsp=on_2992 on theBenchmark for (2992ds/22061Mi)
% 5.35/1.21 % TRYING [1]
% 5.35/1.21 % TRYING [2]
% 5.35/1.21 % TRYING [3]
% 5.35/1.21 % TRYING [4]
% 5.35/1.21 % (2020649) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2020642-2020649"...
% 5.35/1.21 % (2020649)...printing done.
% 5.35/1.21 % (2020649)Refutation found. Thanks to Tanya!
% 5.35/1.21 % SZS status Theorem for theBenchmark
% 5.35/1.21 % SZS output start Proof for theBenchmark
% See solution above
% 5.35/1.22 % (2020649)------------------------------
% 5.35/1.22 % (2020649)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.35/1.22 % (2020649)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.35/1.22 % (2020649)CaDiCaL version: 2.1.3
% 5.35/1.22 % (2020649)Termination reason: Refutation
% 5.35/1.22 % (2020649)Time elapsed: 0.744 s
% 5.35/1.22 % (2020649)Peak memory usage: 20 MB
% 5.35/1.22 % (2020649)Instructions burned: 1128 (million)
% 5.35/1.22 % (2020642)Success in time 0.785 s
% 5.35/1.22 % Vampire exiting
%------------------------------------------------------------------------------