%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU283+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 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:52:43 PM UTC 2026
% Result : Theorem 2.04s 0.84s
% Output : Refutation 2.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 14
% Syntax : Number of formulae : 137 ( 16 unt; 8 def)
% Number of atoms : 594 ( 158 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 755 ( 298 ~; 309 |; 111 &)
% ( 20 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 6 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 2 con; 0-2 aty)
% Number of variables : 239 ( 0 sgn 202 !; 37 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
! [X0] :
( ( ! [X1,X2,X3] :
( ( in(X1,X0)
& X2 = singleton(X1)
& X3 = singleton(X1) )
=> X2 = X3 )
& ! [X1] :
~ ( in(X1,X0)
& ! [X2] : X2 != singleton(X1) ) )
=> ? [X1] :
( relation(X1)
& function(X1)
& relation_dom(X1) = X0
& ! [X2] :
( in(X2,X0)
=> apply(X1,X2) = singleton(X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s2_funct_1__e16_22__wellord2__1) ).
fof(f2,negated_conjecture,
~ ! [X0] :
( ( ! [X1,X2,X3] :
( ( in(X1,X0)
& X2 = singleton(X1)
& X3 = singleton(X1) )
=> X2 = X3 )
& ! [X1] :
~ ( in(X1,X0)
& ! [X2] : X2 != singleton(X1) ) )
=> ? [X1] :
( relation(X1)
& function(X1)
& relation_dom(X1) = X0
& ! [X2] :
( in(X2,X0)
=> apply(X1,X2) = singleton(X2) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f8,axiom,
! [X0] :
( ! [X1,X2,X3] :
( ( in(X1,X0)
& X2 = singleton(X1)
& in(X1,X0)
& X3 = singleton(X1) )
=> X2 = X3 )
=> ? [X1] :
( relation(X1)
& function(X1)
& ! [X2,X3] :
( in(ordered_pair(X2,X3),X1)
<=> ( in(X2,X0)
& in(X2,X0)
& X3 = singleton(X2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_funct_1__e16_22__wellord2__1) ).
fof(f11,axiom,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(f12,axiom,
! [X0] :
( ( relation(X0)
& function(X0) )
=> ! [X1,X2] :
( ( in(X1,relation_dom(X0))
=> ( X2 = apply(X0,X1)
<=> in(ordered_pair(X1,X2),X0) ) )
& ( ~ in(X1,relation_dom(X0))
=> ( X2 = apply(X0,X1)
<=> X2 = empty_set ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_funct_1) ).
fof(f13,axiom,
! [X0] :
( relation(X0)
=> ! [X1] :
( X1 = relation_dom(X0)
<=> ! [X2] :
( in(X2,X1)
<=> ? [X3] : in(ordered_pair(X2,X3),X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_relat_1) ).
fof(f14,axiom,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_tarski) ).
fof(f39,plain,
~ ! [X0] :
( ( ! [X1,X2,X3] :
( ( in(X1,X0)
& X2 = singleton(X1)
& X3 = singleton(X1) )
=> X2 = X3 )
& ! [X4] :
~ ( in(X4,X0)
& ! [X5] : singleton(X4) != X5 ) )
=> ? [X6] :
( relation(X6)
& function(X6)
& relation_dom(X6) = X0
& ! [X7] :
( in(X7,X0)
=> apply(X6,X7) = singleton(X7) ) ) ),
inference(rectify,[],[f2]) ).
fof(f40,plain,
! [X0] :
( ! [X1,X2,X3] :
( ( in(X1,X0)
& X2 = singleton(X1)
& in(X1,X0)
& X3 = singleton(X1) )
=> X2 = X3 )
=> ? [X4] :
( relation(X4)
& function(X4)
& ! [X5,X6] :
( in(ordered_pair(X5,X6),X4)
<=> ( in(X5,X0)
& in(X5,X0)
& singleton(X5) = X6 ) ) ) ),
inference(rectify,[],[f8]) ).
fof(f43,plain,
? [X0] :
( ! [X6] :
( ~ relation(X6)
| ~ function(X6)
| relation_dom(X6) != X0
| ? [X7] :
( apply(X6,X7) != singleton(X7)
& in(X7,X0) ) )
& ! [X1,X2,X3] :
( X2 = X3
| ~ in(X1,X0)
| singleton(X1) != X2
| singleton(X1) != X3 )
& ! [X4] :
( ~ in(X4,X0)
| ? [X5] : singleton(X4) = X5 ) ),
inference(ennf_transformation,[],[f39]) ).
fof(f44,plain,
? [X0] :
( ! [X6] :
( ~ relation(X6)
| ~ function(X6)
| relation_dom(X6) != X0
| ? [X7] :
( apply(X6,X7) != singleton(X7)
& in(X7,X0) ) )
& ! [X1,X2,X3] :
( X2 = X3
| ~ in(X1,X0)
| singleton(X1) != X2
| singleton(X1) != X3 )
& ! [X4] :
( ~ in(X4,X0)
| ? [X5] : singleton(X4) = X5 ) ),
inference(flattening,[],[f43]) ).
fof(f46,plain,
! [X0] :
( ? [X4] :
( relation(X4)
& function(X4)
& ! [X5,X6] :
( in(ordered_pair(X5,X6),X4)
<=> ( in(X5,X0)
& in(X5,X0)
& singleton(X5) = X6 ) ) )
| ? [X1,X2,X3] :
( X2 != X3
& in(X1,X0)
& X2 = singleton(X1)
& in(X1,X0)
& X3 = singleton(X1) ) ),
inference(ennf_transformation,[],[f40]) ).
fof(f47,plain,
! [X0] :
( ? [X4] :
( relation(X4)
& function(X4)
& ! [X5,X6] :
( in(ordered_pair(X5,X6),X4)
<=> ( in(X5,X0)
& in(X5,X0)
& singleton(X5) = X6 ) ) )
| ? [X1,X2,X3] :
( X2 != X3
& in(X1,X0)
& X2 = singleton(X1)
& in(X1,X0)
& X3 = singleton(X1) ) ),
inference(flattening,[],[f46]) ).
fof(f50,plain,
! [X0] :
( ! [X1,X2] :
( ( ( X2 = apply(X0,X1)
<=> in(ordered_pair(X1,X2),X0) )
| ~ in(X1,relation_dom(X0)) )
& ( ( X2 = apply(X0,X1)
<=> X2 = empty_set )
| in(X1,relation_dom(X0)) ) )
| ~ relation(X0)
| ~ function(X0) ),
inference(ennf_transformation,[],[f12]) ).
fof(f51,plain,
! [X0] :
( ! [X1,X2] :
( ( ( X2 = apply(X0,X1)
<=> in(ordered_pair(X1,X2),X0) )
| ~ in(X1,relation_dom(X0)) )
& ( ( X2 = apply(X0,X1)
<=> X2 = empty_set )
| in(X1,relation_dom(X0)) ) )
| ~ relation(X0)
| ~ function(X0) ),
inference(flattening,[],[f50]) ).
fof(f52,plain,
! [X0] :
( ! [X1] :
( X1 = relation_dom(X0)
<=> ! [X2] :
( in(X2,X1)
<=> ? [X3] : in(ordered_pair(X2,X3),X0) ) )
| ~ relation(X0) ),
inference(ennf_transformation,[],[f13]) ).
fof(f63,definition,
! [X0] :
( ? [X4] :
( relation(X4)
& function(X4)
& ! [X5,X6] :
( in(ordered_pair(X5,X6),X4)
<=> ( in(X5,X0)
& in(X5,X0)
& singleton(X5) = X6 ) ) )
| ~ sP0(X0) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f64,plain,
! [X0] :
( sP0(X0)
| ? [X1,X2,X3] :
( X2 != X3
& in(X1,X0)
& X2 = singleton(X1)
& in(X1,X0)
& X3 = singleton(X1) ) ),
inference(definition_folding,[],[f47,f63]) ).
fof(f65,plain,
? [X0] :
( ! [X1] :
( ~ relation(X1)
| ~ function(X1)
| relation_dom(X1) != X0
| ? [X2] :
( apply(X1,X2) != singleton(X2)
& in(X2,X0) ) )
& ! [X3,X4,X5] :
( X4 = X5
| ~ in(X3,X0)
| singleton(X3) != X4
| singleton(X3) != X5 )
& ! [X6] :
( ~ in(X6,X0)
| ? [X7] : singleton(X6) = X7 ) ),
inference(rectify,[],[f44]) ).
fof(f66,plain,
( ! [X1] :
( ~ relation(X1)
| ~ function(X1)
| relation_dom(X1) != sK1
| ( apply(X1,sK2(X1)) != singleton(sK2(X1))
& in(sK2(X1),sK1) ) )
& ! [X3,X4,X5] :
( X4 = X5
| ~ in(X3,sK1)
| singleton(X3) != X4
| singleton(X3) != X5 )
& ! [X6] :
( ~ in(X6,sK1)
| singleton(X6) = sK3(X6) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,sK3]),skolemize(X0,sK1),skolemize(X2,sK2(X1)),skolemize(X7,sK3(X6))],[f65]) ).
fof(f68,plain,
! [X0] :
( ? [X4] :
( relation(X4)
& function(X4)
& ! [X5,X6] :
( ( in(ordered_pair(X5,X6),X4)
| ~ in(X5,X0)
| ~ in(X5,X0)
| singleton(X5) != X6 )
& ( ( in(X5,X0)
& in(X5,X0)
& singleton(X5) = X6 )
| ~ in(ordered_pair(X5,X6),X4) ) ) )
| ~ sP0(X0) ),
inference(nnf_transformation,[],[f63]) ).
fof(f69,plain,
! [X0] :
( ? [X4] :
( relation(X4)
& function(X4)
& ! [X5,X6] :
( ( in(ordered_pair(X5,X6),X4)
| ~ in(X5,X0)
| ~ in(X5,X0)
| singleton(X5) != X6 )
& ( ( in(X5,X0)
& in(X5,X0)
& singleton(X5) = X6 )
| ~ in(ordered_pair(X5,X6),X4) ) ) )
| ~ sP0(X0) ),
inference(flattening,[],[f68]) ).
fof(f70,plain,
! [X0] :
( ? [X1] :
( relation(X1)
& function(X1)
& ! [X2,X3] :
( ( in(ordered_pair(X2,X3),X1)
| ~ in(X2,X0)
| ~ in(X2,X0)
| singleton(X2) != X3 )
& ( ( in(X2,X0)
& in(X2,X0)
& singleton(X2) = X3 )
| ~ in(ordered_pair(X2,X3),X1) ) ) )
| ~ sP0(X0) ),
inference(rectify,[],[f69]) ).
fof(f71,plain,
! [X0] :
( ( relation(sK5(X0))
& function(sK5(X0))
& ! [X2,X3] :
( ( in(ordered_pair(X2,X3),sK5(X0))
| ~ in(X2,X0)
| ~ in(X2,X0)
| singleton(X2) != X3 )
& ( ( in(X2,X0)
& in(X2,X0)
& singleton(X2) = X3 )
| ~ in(ordered_pair(X2,X3),sK5(X0)) ) ) )
| ~ sP0(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(X1,sK5(X0))],[f70]) ).
fof(f72,plain,
! [X0] :
( sP0(X0)
| ( sK7(X0) != sK8(X0)
& in(sK6(X0),X0)
& sK7(X0) = singleton(sK6(X0))
& in(sK6(X0),X0)
& sK8(X0) = singleton(sK6(X0)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK7,sK8]),skolemize(X1,sK6(X0)),skolemize(X2,sK7(X0)),skolemize(X3,sK8(X0))],[f64]) ).
fof(f73,plain,
! [X0] :
( ! [X1,X2] :
( ( ( ( X2 = apply(X0,X1)
| ~ in(ordered_pair(X1,X2),X0) )
& ( in(ordered_pair(X1,X2),X0)
| apply(X0,X1) != X2 ) )
| ~ in(X1,relation_dom(X0)) )
& ( ( ( X2 = apply(X0,X1)
| empty_set != X2 )
& ( X2 = empty_set
| apply(X0,X1) != X2 ) )
| in(X1,relation_dom(X0)) ) )
| ~ relation(X0)
| ~ function(X0) ),
inference(nnf_transformation,[],[f51]) ).
fof(f74,plain,
! [X0] :
( ! [X1] :
( ( X1 = relation_dom(X0)
| ? [X2] :
( ( ! [X3] : ~ in(ordered_pair(X2,X3),X0)
| ~ in(X2,X1) )
& ( ? [X3] : in(ordered_pair(X2,X3),X0)
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| ! [X3] : ~ in(ordered_pair(X2,X3),X0) )
& ( ? [X3] : in(ordered_pair(X2,X3),X0)
| ~ in(X2,X1) ) )
| relation_dom(X0) != X1 ) )
| ~ relation(X0) ),
inference(nnf_transformation,[],[f52]) ).
fof(f75,plain,
! [X0] :
( ! [X1] :
( ( X1 = relation_dom(X0)
| ? [X2] :
( ( ! [X3] : ~ in(ordered_pair(X2,X3),X0)
| ~ in(X2,X1) )
& ( ? [X4] : in(ordered_pair(X2,X4),X0)
| in(X2,X1) ) ) )
& ( ! [X5] :
( ( in(X5,X1)
| ! [X6] : ~ in(ordered_pair(X5,X6),X0) )
& ( ? [X7] : in(ordered_pair(X5,X7),X0)
| ~ in(X5,X1) ) )
| relation_dom(X0) != X1 ) )
| ~ relation(X0) ),
inference(rectify,[],[f74]) ).
fof(f76,plain,
! [X0] :
( ! [X1] :
( ( X1 = relation_dom(X0)
| ( ( ! [X3] : ~ in(ordered_pair(sK9(X0,X1),X3),X0)
| ~ in(sK9(X0,X1),X1) )
& ( in(ordered_pair(sK9(X0,X1),sK10(X0,X1)),X0)
| in(sK9(X0,X1),X1) ) ) )
& ( ! [X5] :
( ( in(X5,X1)
| ! [X6] : ~ in(ordered_pair(X5,X6),X0) )
& ( in(ordered_pair(X5,sK11(X0,X5)),X0)
| ~ in(X5,X1) ) )
| relation_dom(X0) != X1 ) )
| ~ relation(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK9,sK10,sK11]),skolemize(X2,sK9(X0,X1)),skolemize(X4,sK10(X0,X1)),skolemize(X7,sK11(X0,X5))],[f75]) ).
fof(f85,plain,
! [X6] :
( ~ in(X6,sK1)
| singleton(X6) = sK3(X6) ),
inference(cnf_transformation,[],[f66]) ).
fof(f87,plain,
! [X1] :
( relation_dom(X1) != sK1
| ~ function(X1)
| ~ relation(X1)
| in(sK2(X1),sK1) ),
inference(cnf_transformation,[],[f66]) ).
fof(f88,plain,
! [X1] :
( ~ relation(X1)
| ~ function(X1)
| relation_dom(X1) != sK1
| apply(X1,sK2(X1)) != singleton(sK2(X1)) ),
inference(cnf_transformation,[],[f66]) ).
fof(f93,plain,
! [X2,X3,X0] :
( in(X2,X0)
| ~ in(ordered_pair(X2,X3),sK5(X0))
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f71]) ).
fof(f95,plain,
! [X2,X3,X0] :
( in(ordered_pair(X2,X3),sK5(X0))
| ~ in(X2,X0)
| ~ in(X2,X0)
| singleton(X2) != X3
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f71]) ).
fof(f96,plain,
! [X0] :
( function(sK5(X0))
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f71]) ).
fof(f97,plain,
! [X0] :
( relation(sK5(X0))
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f71]) ).
fof(f98,plain,
! [X0] :
( sP0(X0)
| sK8(X0) = singleton(sK6(X0)) ),
inference(cnf_transformation,[],[f72]) ).
fof(f100,plain,
! [X0] :
( sP0(X0)
| sK7(X0) = singleton(sK6(X0)) ),
inference(cnf_transformation,[],[f72]) ).
fof(f102,plain,
! [X0] :
( sK7(X0) != sK8(X0)
| sP0(X0) ),
inference(cnf_transformation,[],[f72]) ).
fof(f105,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f11]) ).
fof(f109,plain,
! [X2,X0,X1] :
( apply(X0,X1) = X2
| ~ in(ordered_pair(X1,X2),X0)
| ~ in(X1,relation_dom(X0))
| ~ relation(X0)
| ~ function(X0) ),
inference(cnf_transformation,[],[f73]) ).
fof(f111,plain,
! [X0,X1,X6,X5] :
( in(X5,X1)
| ~ in(ordered_pair(X5,X6),X0)
| relation_dom(X0) != X1
| ~ relation(X0) ),
inference(cnf_transformation,[],[f76]) ).
fof(f112,plain,
! [X0,X1] :
( relation_dom(X0) = X1
| in(ordered_pair(sK9(X0,X1),sK10(X0,X1)),X0)
| in(sK9(X0,X1),X1)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f76]) ).
fof(f113,plain,
! [X3,X0,X1] :
( relation_dom(X0) = X1
| ~ in(ordered_pair(sK9(X0,X1),X3),X0)
| ~ in(sK9(X0,X1),X1)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f76]) ).
fof(f114,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
inference(cnf_transformation,[],[f14]) ).
fof(f141,plain,
! [X2,X3,X0] :
( in(unordered_pair(unordered_pair(X2,X3),singleton(X2)),sK5(X0))
| ~ in(X2,X0)
| ~ in(X2,X0)
| singleton(X2) != X3
| ~ sP0(X0) ),
inference(definition_unfolding,[],[f95,f114]) ).
fof(f143,plain,
! [X2,X3,X0] :
( ~ in(unordered_pair(unordered_pair(X2,X3),singleton(X2)),sK5(X0))
| in(X2,X0)
| ~ sP0(X0) ),
inference(definition_unfolding,[],[f93,f114]) ).
fof(f145,plain,
! [X2,X0,X1] :
( apply(X0,X1) = X2
| ~ in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X0)
| ~ in(X1,relation_dom(X0))
| ~ relation(X0)
| ~ function(X0) ),
inference(definition_unfolding,[],[f109,f114]) ).
fof(f147,plain,
! [X3,X0,X1] :
( ~ in(unordered_pair(unordered_pair(sK9(X0,X1),X3),singleton(sK9(X0,X1))),X0)
| relation_dom(X0) = X1
| ~ in(sK9(X0,X1),X1)
| ~ relation(X0) ),
inference(definition_unfolding,[],[f113,f114]) ).
fof(f148,plain,
! [X0,X1] :
( ~ relation(X0)
| in(unordered_pair(unordered_pair(sK9(X0,X1),sK10(X0,X1)),singleton(sK9(X0,X1))),X0)
| in(sK9(X0,X1),X1)
| relation_dom(X0) = X1 ),
inference(definition_unfolding,[],[f112,f114]) ).
fof(f149,plain,
! [X0,X1,X6,X5] :
( in(X5,X1)
| ~ in(unordered_pair(unordered_pair(X5,X6),singleton(X5)),X0)
| relation_dom(X0) != X1
| ~ relation(X0) ),
inference(definition_unfolding,[],[f111,f114]) ).
fof(f154,plain,
! [X2,X0] :
( in(unordered_pair(unordered_pair(X2,singleton(X2)),singleton(X2)),sK5(X0))
| ~ in(X2,X0)
| ~ in(X2,X0)
| ~ sP0(X0) ),
inference(equality_resolution,[],[f141]) ).
fof(f158,plain,
! [X0,X6,X5] :
( ~ in(unordered_pair(unordered_pair(X5,X6),singleton(X5)),X0)
| in(X5,relation_dom(X0))
| ~ relation(X0) ),
inference(equality_resolution,[],[f149]) ).
fof(f160,definition,
! [X1] : sF19(X1) = apply(X1,sK2(X1)),
introduced(definition,[new_symbols(definition,[sF19])],[function_definition]) ).
fof(f161,plain,
! [X1] : apply(X1,sK2(X1)) = sF19(X1),
inference(reorient_equations,[],[f160]) ).
fof(f162,definition,
! [X1] : sF20(X1) = singleton(sK2(X1)),
introduced(definition,[new_symbols(definition,[sF20])],[function_definition]) ).
fof(f163,plain,
! [X1] : singleton(sK2(X1)) = sF20(X1),
inference(reorient_equations,[],[f162]) ).
fof(f164,plain,
! [X1] :
( sF19(X1) != sF20(X1)
| ~ function(X1)
| relation_dom(X1) != sK1
| ~ relation(X1) ),
inference(definition_folding,[],[f88,f163,f161]) ).
fof(f165,plain,
! [X2,X0] :
( in(unordered_pair(unordered_pair(X2,singleton(X2)),singleton(X2)),sK5(X0))
| ~ in(X2,X0)
| ~ sP0(X0) ),
inference(duplicate_literal_removal,[],[f154]) ).
fof(f166,plain,
! [X2,X0,X1] :
( ~ in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X0)
| apply(X0,X1) = X2
| ~ relation(X0)
| ~ function(X0) ),
inference(forward_subsumption_resolution,[],[f145,f158]) ).
fof(f167,plain,
! [X2,X0] :
( in(unordered_pair(singleton(X2),unordered_pair(X2,singleton(X2))),sK5(X0))
| ~ in(X2,X0)
| ~ sP0(X0) ),
inference(forward_demodulation,[],[f165,f105]) ).
fof(f194,definition,
( spl21_2
<=> sP0(sK1) ),
introduced(definition,[new_symbols(definition,[spl21_2])],[avatar_definition]) ).
fof(f195,plain,
( ~ sP0(sK1)
| spl21_2 ),
inference(avatar_component_clause,[],[f194]) ).
fof(f196,plain,
( sP0(sK1)
| ~ spl21_2 ),
inference(avatar_component_clause,[],[f194]) ).
fof(f205,plain,
! [X0] :
( singleton(sK2(X0)) != sF19(X0)
| ~ function(X0)
| relation_dom(X0) != sK1
| ~ relation(X0) ),
inference(superposition,[],[f164,f163]) ).
fof(f345,plain,
! [X2,X0,X1] :
( ~ in(unordered_pair(singleton(X0),unordered_pair(X0,X1)),X2)
| apply(X2,X0) = X1
| ~ relation(X2)
| ~ function(X2) ),
inference(superposition,[],[f166,f105]) ).
fof(f365,plain,
! [X2,X0,X1] :
( ~ in(unordered_pair(singleton(sK9(X0,X1)),unordered_pair(sK9(X0,X1),X2)),X0)
| relation_dom(X0) = X1
| ~ in(sK9(X0,X1),X1)
| ~ relation(X0) ),
inference(superposition,[],[f147,f105]) ).
fof(f371,plain,
! [X0,X1] :
( in(unordered_pair(unordered_pair(sK9(sK5(X0),X1),sK10(sK5(X0),X1)),singleton(sK9(sK5(X0),X1))),sK5(X0))
| in(sK9(sK5(X0),X1),X1)
| relation_dom(sK5(X0)) = X1
| ~ sP0(X0) ),
inference(resolution,[],[f148,f97]) ).
fof(f687,plain,
( singleton(sK6(sK1)) = sK7(sK1)
| spl21_2 ),
inference(resolution,[],[f195,f100]) ).
fof(f688,plain,
( singleton(sK6(sK1)) = sK8(sK1)
| spl21_2 ),
inference(resolution,[],[f195,f98]) ).
fof(f745,plain,
( sK7(sK1) = sK8(sK1)
| spl21_2 ),
inference(superposition,[],[f687,f688]) ).
fof(f776,plain,
! [X0,X1] :
( singleton(X1) = apply(sK5(X0),X1)
| ~ relation(sK5(X0))
| ~ function(sK5(X0))
| ~ in(X1,X0)
| ~ sP0(X0) ),
inference(resolution,[],[f345,f167]) ).
fof(f791,plain,
! [X0,X1] :
( singleton(X1) = apply(sK5(X0),X1)
| ~ function(sK5(X0))
| ~ in(X1,X0)
| ~ sP0(X0) ),
inference(forward_subsumption_resolution,[],[f776,f97]) ).
fof(f792,plain,
! [X0,X1] :
( ~ in(X1,X0)
| singleton(X1) = apply(sK5(X0),X1)
| ~ sP0(X0) ),
inference(forward_subsumption_resolution,[],[f791,f96]) ).
fof(f827,plain,
( sK7(sK1) != sK7(sK1)
| sP0(sK1)
| spl21_2 ),
inference(superposition,[],[f102,f745]) ).
fof(f828,plain,
( sP0(sK1)
| spl21_2 ),
inference(trivial_inequality_removal,[],[f827]) ).
fof(f829,plain,
( $false
| spl21_2 ),
inference(forward_subsumption_resolution,[],[f828,f195]) ).
fof(f830,plain,
spl21_2,
inference(avatar_contradiction_clause,[],[f829]) ).
fof(f933,plain,
! [X0,X1] :
( relation_dom(sK5(X0)) = X1
| ~ in(sK9(sK5(X0),X1),X1)
| ~ relation(sK5(X0))
| ~ in(sK9(sK5(X0),X1),X0)
| ~ sP0(X0) ),
inference(resolution,[],[f365,f167]) ).
fof(f940,plain,
! [X0,X1] :
( ~ in(sK9(sK5(X0),X1),X1)
| relation_dom(sK5(X0)) = X1
| ~ in(sK9(sK5(X0),X1),X0)
| ~ sP0(X0) ),
inference(forward_subsumption_resolution,[],[f933,f97]) ).
fof(f1179,plain,
! [X0,X1] :
( in(sK9(sK5(X0),X1),X1)
| relation_dom(sK5(X0)) = X1
| ~ sP0(X0)
| in(sK9(sK5(X0),X1),X0)
| ~ sP0(X0) ),
inference(resolution,[],[f371,f143]) ).
fof(f1186,plain,
! [X0,X1] :
( in(sK9(sK5(X0),X1),X1)
| in(sK9(sK5(X0),X1),X0)
| ~ sP0(X0)
| relation_dom(sK5(X0)) = X1 ),
inference(duplicate_literal_removal,[],[f1179]) ).
fof(f1299,definition,
( spl21_47
<=> relation(sK5(sK1)) ),
introduced(definition,[new_symbols(definition,[spl21_47])],[avatar_definition]) ).
fof(f1300,plain,
( relation(sK5(sK1))
| ~ spl21_47 ),
inference(avatar_component_clause,[],[f1299]) ).
fof(f1301,plain,
( ~ relation(sK5(sK1))
| spl21_47 ),
inference(avatar_component_clause,[],[f1299]) ).
fof(f1324,plain,
( ~ sP0(sK1)
| spl21_47 ),
inference(resolution,[],[f1301,f97]) ).
fof(f1325,plain,
( $false
| ~ spl21_2
| spl21_47 ),
inference(forward_subsumption_resolution,[],[f1324,f196]) ).
fof(f1326,plain,
( ~ spl21_2
| spl21_47 ),
inference(avatar_contradiction_clause,[],[f1325]) ).
fof(f1386,definition,
( spl21_52
<=> function(sK5(sK1)) ),
introduced(definition,[new_symbols(definition,[spl21_52])],[avatar_definition]) ).
fof(f1387,plain,
( function(sK5(sK1))
| ~ spl21_52 ),
inference(avatar_component_clause,[],[f1386]) ).
fof(f1388,plain,
( ~ function(sK5(sK1))
| spl21_52 ),
inference(avatar_component_clause,[],[f1386]) ).
fof(f1403,plain,
( ~ sP0(sK1)
| spl21_52 ),
inference(resolution,[],[f1388,f96]) ).
fof(f1404,plain,
( $false
| ~ spl21_2
| spl21_52 ),
inference(forward_subsumption_resolution,[],[f1403,f196]) ).
fof(f1405,plain,
( ~ spl21_2
| spl21_52 ),
inference(avatar_contradiction_clause,[],[f1404]) ).
fof(f1616,definition,
( spl21_61
<=> sK1 = relation_dom(sK5(sK1)) ),
introduced(definition,[new_symbols(definition,[spl21_61])],[avatar_definition]) ).
fof(f1617,plain,
( sK1 != relation_dom(sK5(sK1))
| spl21_61 ),
inference(avatar_component_clause,[],[f1616]) ).
fof(f1618,plain,
( sK1 = relation_dom(sK5(sK1))
| ~ spl21_61 ),
inference(avatar_component_clause,[],[f1616]) ).
fof(f1980,plain,
( sK1 != sK1
| ~ function(sK5(sK1))
| ~ relation(sK5(sK1))
| in(sK2(sK5(sK1)),sK1)
| ~ spl21_61 ),
inference(superposition,[],[f87,f1618]) ).
fof(f1988,plain,
( ~ function(sK5(sK1))
| ~ relation(sK5(sK1))
| in(sK2(sK5(sK1)),sK1)
| ~ spl21_61 ),
inference(trivial_inequality_removal,[],[f1980]) ).
fof(f1991,plain,
( ~ relation(sK5(sK1))
| in(sK2(sK5(sK1)),sK1)
| ~ spl21_52
| ~ spl21_61 ),
inference(forward_subsumption_resolution,[],[f1988,f1387]) ).
fof(f1994,plain,
( in(sK2(sK5(sK1)),sK1)
| ~ spl21_47
| ~ spl21_52
| ~ spl21_61 ),
inference(forward_subsumption_resolution,[],[f1991,f1300]) ).
fof(f1997,plain,
( singleton(sK2(sK5(sK1))) = sK3(sK2(sK5(sK1)))
| ~ spl21_47
| ~ spl21_52
| ~ spl21_61 ),
inference(resolution,[],[f1994,f85]) ).
fof(f2146,plain,
( singleton(sK2(sK5(sK1))) = apply(sK5(sK1),sK2(sK5(sK1)))
| ~ sP0(sK1)
| ~ spl21_47
| ~ spl21_52
| ~ spl21_61 ),
inference(resolution,[],[f792,f1994]) ).
fof(f2160,plain,
( singleton(sK2(sK5(sK1))) = apply(sK5(sK1),sK2(sK5(sK1)))
| ~ spl21_2
| ~ spl21_47
| ~ spl21_52
| ~ spl21_61 ),
inference(forward_subsumption_resolution,[],[f2146,f196]) ).
fof(f2163,plain,
( singleton(sK2(sK5(sK1))) = sF19(sK5(sK1))
| ~ spl21_2
| ~ spl21_47
| ~ spl21_52
| ~ spl21_61 ),
inference(forward_demodulation,[],[f2160,f161]) ).
fof(f2164,plain,
( sK3(sK2(sK5(sK1))) = sF19(sK5(sK1))
| ~ spl21_2
| ~ spl21_47
| ~ spl21_52
| ~ spl21_61 ),
inference(forward_demodulation,[],[f2163,f1997]) ).
fof(f2206,plain,
( singleton(sK2(sK5(sK1))) != sK3(sK2(sK5(sK1)))
| ~ function(sK5(sK1))
| sK1 != relation_dom(sK5(sK1))
| ~ relation(sK5(sK1))
| ~ spl21_2
| ~ spl21_47
| ~ spl21_52
| ~ spl21_61 ),
inference(superposition,[],[f205,f2164]) ).
fof(f2207,plain,
( ~ function(sK5(sK1))
| sK1 != relation_dom(sK5(sK1))
| ~ relation(sK5(sK1))
| ~ spl21_2
| ~ spl21_47
| ~ spl21_52
| ~ spl21_61 ),
inference(forward_subsumption_resolution,[],[f2206,f1997]) ).
fof(f2208,plain,
( sK1 != relation_dom(sK5(sK1))
| ~ relation(sK5(sK1))
| ~ spl21_2
| ~ spl21_47
| ~ spl21_52
| ~ spl21_61 ),
inference(forward_subsumption_resolution,[],[f2207,f1387]) ).
fof(f2209,plain,
( ~ relation(sK5(sK1))
| ~ spl21_2
| ~ spl21_47
| ~ spl21_52
| ~ spl21_61 ),
inference(forward_subsumption_resolution,[],[f2208,f1618]) ).
fof(f2210,plain,
( $false
| ~ spl21_2
| ~ spl21_47
| ~ spl21_52
| ~ spl21_61 ),
inference(forward_subsumption_resolution,[],[f2209,f1300]) ).
fof(f2211,plain,
( ~ spl21_2
| ~ spl21_47
| ~ spl21_52
| ~ spl21_61 ),
inference(avatar_contradiction_clause,[],[f2210]) ).
fof(f2787,plain,
! [X0] :
( in(sK9(sK5(X0),X0),X0)
| ~ sP0(X0)
| relation_dom(sK5(X0)) = X0 ),
inference(factoring,[],[f1186]) ).
fof(f4971,definition,
( spl21_186
<=> in(sK9(sK5(sK1),sK1),sK1) ),
introduced(definition,[new_symbols(definition,[spl21_186])],[avatar_definition]) ).
fof(f4972,plain,
( in(sK9(sK5(sK1),sK1),sK1)
| ~ spl21_186 ),
inference(avatar_component_clause,[],[f4971]) ).
fof(f4973,plain,
( ~ in(sK9(sK5(sK1),sK1),sK1)
| spl21_186 ),
inference(avatar_component_clause,[],[f4971]) ).
fof(f5215,plain,
( sK1 = relation_dom(sK5(sK1))
| ~ in(sK9(sK5(sK1),sK1),sK1)
| ~ sP0(sK1)
| ~ spl21_186 ),
inference(resolution,[],[f4972,f940]) ).
fof(f5224,plain,
( sK1 = relation_dom(sK5(sK1))
| ~ sP0(sK1)
| ~ spl21_186 ),
inference(forward_subsumption_resolution,[],[f5215,f2787]) ).
fof(f5227,plain,
( ~ sP0(sK1)
| spl21_61
| ~ spl21_186 ),
inference(forward_subsumption_resolution,[],[f5224,f1617]) ).
fof(f5228,plain,
( $false
| ~ spl21_2
| spl21_61
| ~ spl21_186 ),
inference(forward_subsumption_resolution,[],[f5227,f196]) ).
fof(f5229,plain,
( ~ spl21_2
| spl21_61
| ~ spl21_186 ),
inference(avatar_contradiction_clause,[],[f5228]) ).
fof(f7919,plain,
( ~ sP0(sK1)
| sK1 = relation_dom(sK5(sK1))
| spl21_186 ),
inference(resolution,[],[f2787,f4973]) ).
fof(f7935,plain,
( sK1 = relation_dom(sK5(sK1))
| ~ spl21_2
| spl21_186 ),
inference(forward_subsumption_resolution,[],[f7919,f196]) ).
fof(f7937,plain,
( $false
| ~ spl21_2
| spl21_61
| spl21_186 ),
inference(forward_subsumption_resolution,[],[f7935,f1617]) ).
fof(f7938,plain,
( ~ spl21_2
| spl21_61
| spl21_186 ),
inference(avatar_contradiction_clause,[],[f7937]) ).
cnf(s12,plain,
spl21_2,
inference(sat_conversion,[],[f830]) ).
cnf(s31,plain,
( ~ spl21_2
| spl21_47 ),
inference(sat_conversion,[],[f1326]) ).
cnf(s36,plain,
( ~ spl21_2
| spl21_52 ),
inference(sat_conversion,[],[f1405]) ).
cnf(s54,plain,
( ~ spl21_2
| ~ spl21_47
| ~ spl21_52
| ~ spl21_61 ),
inference(sat_conversion,[],[f2211]) ).
cnf(s159,plain,
( ~ spl21_2
| spl21_61
| ~ spl21_186 ),
inference(sat_conversion,[],[f5229]) ).
cnf(s286,plain,
( ~ spl21_2
| spl21_61
| spl21_186 ),
inference(sat_conversion,[],[f7938]) ).
cnf(s293,plain,
spl21_52,
inference(rat,[],[s36,s12]) ).
cnf(s294,plain,
spl21_47,
inference(rat,[],[s31,s12]) ).
cnf(s295,plain,
~ spl21_61,
inference(rat,[],[s54,s293,s12,s294]) ).
cnf(s296,plain,
spl21_186,
inference(rat,[],[s286,s12,s295]) ).
cnf(s297,plain,
$false,
inference(rat,[],[s159,s12,s296,s295]) ).
fof(f7939,plain,
$false,
inference(avatar_sat_refutation,[],[s297]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU283+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.37 % Computer : n009.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 28 04:28:45 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41 Running first-order model finding
% 0.11/0.41 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.04/0.84 % (2659460)Will run a generic schedule for satisfiability detection.
% 2.04/0.84 % (2659469)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1636837027:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 2.04/0.84 % (2659466)% WARNING: option uhcvi not known.
% 2.04/0.84 % (2659465)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2948421071_2999 on theBenchmark for (2999ds/0Mi)
% 2.04/0.84 % (2659467)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=818674065:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 2.04/0.84 % (2659466)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2571026476:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 2.04/0.84 % (2659468)dis+10_1_sil=32000:sp=arity:random_seed=1118576849:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 2.04/0.84 % (2659471)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4204042363:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 2.04/0.84 % (2659470)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=517594618:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 2.04/0.84 % TRYING [1]
% 2.04/0.84 % TRYING [2]
% 2.04/0.84 % TRYING [3]
% 2.04/0.84 % TRYING [4]
% 2.04/0.84 % (2659469)Instruction limit reached!
% 2.04/0.84 % (2659469)------------------------------
% 2.04/0.84 % (2659469)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.04/0.84 % (2659469)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.04/0.84 % (2659469)CaDiCaL version: 2.1.3
% 2.04/0.84 % (2659469)Termination reason: Instruction limit
% 2.04/0.84 % (2659469)Termination phase: Saturation
% 2.04/0.84 % (2659469)Time elapsed: 0.039 s
% 2.04/0.84 % (2659469)Peak memory usage: 13 MB
% 2.04/0.84 % (2659469)Instructions burned: 117 (million)
% 2.04/0.84 % (2659479)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2389342273:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 2.04/0.84 % TRYING [1]
% 2.04/0.84 % TRYING [2]
% 2.04/0.84 % TRYING [3]
% 2.04/0.84 % TRYING [4]
% 2.04/0.84 % (2659468)Instruction limit reached!
% 2.04/0.84 % (2659468)------------------------------
% 2.04/0.84 % (2659468)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.04/0.84 % (2659468)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.04/0.84 % (2659468)CaDiCaL version: 2.1.3
% 2.04/0.84 % (2659468)Termination reason: Instruction limit
% 2.04/0.84 % (2659468)Termination phase: Saturation
% 2.04/0.84 % (2659468)Time elapsed: 0.061 s
% 2.04/0.84 % (2659468)Peak memory usage: 12 MB
% 2.04/0.84 % (2659468)Instructions burned: 104 (million)
% 2.04/0.84 % (2659481)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1176660118:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 2.04/0.84 % (2659470)Instruction limit reached!
% 2.04/0.84 % (2659470)------------------------------
% 2.04/0.84 % (2659470)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.04/0.84 % (2659470)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.04/0.84 % (2659470)CaDiCaL version: 2.1.3
% 2.04/0.84 % (2659470)Termination reason: Instruction limit
% 2.04/0.84 % (2659470)Termination phase: Saturation
% 2.04/0.84 % (2659470)Time elapsed: 0.084 s
% 2.04/0.84 % (2659470)Peak memory usage: 13 MB
% 2.04/0.84 % (2659470)Instructions burned: 132 (million)
% 2.04/0.84 % (2659471)Instruction limit reached!
% 2.04/0.84 % (2659471)------------------------------
% 2.04/0.84 % (2659471)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.04/0.84 % (2659471)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.04/0.84 % (2659471)CaDiCaL version: 2.1.3
% 2.04/0.84 % (2659471)Termination reason: Instruction limit
% 2.04/0.84 % (2659471)Termination phase: Saturation
% 2.04/0.84 % (2659471)Time elapsed: 0.098 s
% 2.04/0.84 % (2659471)Peak memory usage: 14 MB
% 2.04/0.84 % (2659471)Instructions burned: 160 (million)
% 2.04/0.84 % (2659483)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=4245934793:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 2.04/0.84 % (2659484)ott-21_1_sil=16000:fs=off:random_seed=2227101349:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 2.04/0.84 % TRYING [5]
% 2.04/0.84 % (2659481)Instruction limit reached!
% 2.04/0.84 % (2659481)------------------------------
% 2.04/0.84 % (2659481)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.04/0.84 % (2659481)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.04/0.84 % (2659481)CaDiCaL version: 2.1.3
% 2.04/0.84 % (2659481)Termination reason: Instruction limit
% 2.04/0.84 % (2659481)Termination phase: Saturation
% 2.04/0.84 % (2659481)Time elapsed: 0.090 s
% 2.04/0.84 % (2659481)Peak memory usage: 13 MB
% 2.04/0.84 % (2659481)Instructions burned: 131 (million)
% 2.04/0.84 % TRYING [5]
% 2.04/0.84 % (2659487)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=972950377:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 2.04/0.84 % (2659484)Instruction limit reached!
% 2.04/0.84 % (2659484)------------------------------
% 2.04/0.84 % (2659484)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.04/0.84 % (2659484)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.04/0.84 % (2659484)CaDiCaL version: 2.1.3
% 2.04/0.84 % (2659484)Termination reason: Instruction limit
% 2.04/0.84 % (2659484)Termination phase: Saturation
% 2.04/0.84 % (2659484)Time elapsed: 0.083 s
% 2.04/0.84 % (2659484)Peak memory usage: 12 MB
% 2.04/0.84 % (2659484)Instructions burned: 181 (million)
% 2.04/0.84 % (2659489)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=3164682836:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 2.04/0.84 % TRYING [1]
% 2.04/0.84 % TRYING [2]
% 2.04/0.84 % TRYING [3]
% 2.04/0.84 % TRYING [4]
% 2.04/0.84 % (2659479)Instruction limit reached!
% 2.04/0.84 % (2659479)------------------------------
% 2.04/0.84 % (2659479)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.04/0.84 % (2659479)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.04/0.84 % (2659479)CaDiCaL version: 2.1.3
% 2.04/0.84 % (2659479)Termination reason: Instruction limit
% 2.04/0.84 % (2659479)Termination phase: Finite model building SAT solving
% 2.04/0.84 % (2659479)Time elapsed: 0.216 s
% 2.04/0.84 % (2659479)Peak memory usage: 19 MB
% 2.04/0.84 % (2659479)Instructions burned: 716 (million)
% 2.04/0.84 % (2659491)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=1922033593:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 2.04/0.84 % TRYING [5]
% 2.04/0.84 % (2659491) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2659460-2659491"...
% 2.04/0.84 % (2659491)...printing done.
% 2.04/0.84 % (2659491)Refutation found. Thanks to Tanya!
% 2.04/0.84 % SZS status Theorem for theBenchmark
% 2.04/0.84 % SZS output start Proof for theBenchmark
% See solution above
% 2.04/0.84 % (2659491)------------------------------
% 2.04/0.84 % (2659491)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.04/0.84 % (2659491)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.04/0.84 % (2659491)CaDiCaL version: 2.1.3
% 2.04/0.84 % (2659491)Termination reason: Refutation
% 2.04/0.84 % (2659491)Time elapsed: 0.115 s
% 2.04/0.84 % (2659491)Peak memory usage: 16 MB
% 2.04/0.84 % (2659491)Instructions burned: 346 (million)
% 2.04/0.84 % (2659460)Success in time 0.423 s
% 2.04/0.84 % Vampire exiting
%------------------------------------------------------------------------------