%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET644+3 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n013.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:44:18 PM UTC 2026
% Result : Theorem 2.56s 0.97s
% Output : Refutation 2.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 17
% Syntax : Number of formulae : 134 ( 22 unt; 5 def)
% Number of atoms : 536 ( 50 equ)
% Maximal formula atoms : 13 ( 4 avg)
% Number of connectives : 686 ( 284 ~; 276 |; 67 &)
% ( 19 <=>; 40 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 5 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 6 con; 0-2 aty)
% Number of variables : 293 ( 0 sgn 267 !; 26 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0] :
( ilf_type(X0,set_type)
=> ! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ! [X3] :
( ilf_type(X3,set_type)
=> ( member(ordered_pair(X0,X1),cross_product(X2,X3))
<=> ( member(X0,X2)
& member(X1,X3) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2) ).
fof(f3,axiom,
! [X0] :
( ilf_type(X0,set_type)
=> ! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ! [X3] :
( ilf_type(X3,set_type)
=> ! [X4] :
( ilf_type(X4,set_type)
=> ( X4 = ordered_pair(X2,X3)
<=> X4 = unordered_pair(unordered_pair(X2,X3),singleton(X2)) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p3) ).
fof(f5,axiom,
! [X0] :
( ilf_type(X0,set_type)
=> ! [X1] :
( ilf_type(X1,set_type)
=> ( ! [X2] :
( ilf_type(X2,subset_type(cross_product(X0,X1)))
=> ilf_type(X2,relation_type(X0,X1)) )
& ! [X3] :
( ilf_type(X3,relation_type(X0,X1))
=> ilf_type(X3,subset_type(cross_product(X0,X1))) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p5) ).
fof(f11,axiom,
! [X0] :
( ilf_type(X0,set_type)
=> ! [X1] :
( ilf_type(X1,set_type)
=> unordered_pair(X0,X1) = unordered_pair(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p11) ).
fof(f14,axiom,
! [X0] :
( ilf_type(X0,set_type)
=> ! [X1] :
( ilf_type(X1,set_type)
=> ( ilf_type(X1,subset_type(X0))
<=> ilf_type(X1,member_type(power_set(X0))) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p14) ).
fof(f19,axiom,
! [X0] :
( ilf_type(X0,set_type)
=> ! [X1] :
( ilf_type(X1,set_type)
=> ( member(X0,power_set(X1))
<=> ! [X2] :
( ilf_type(X2,set_type)
=> ( member(X2,X0)
=> member(X2,X1) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p19) ).
fof(f20,axiom,
! [X0] :
( ilf_type(X0,set_type)
=> ( ~ empty(power_set(X0))
& ilf_type(power_set(X0),set_type) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p20) ).
fof(f21,axiom,
! [X0] :
( ilf_type(X0,set_type)
=> ! [X1] :
( ( ~ empty(X1)
& ilf_type(X1,set_type) )
=> ( ilf_type(X0,member_type(X1))
<=> member(X0,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p21) ).
fof(f23,axiom,
! [X0] :
( ilf_type(X0,set_type)
=> ( relation_like(X0)
<=> ! [X1] :
( ilf_type(X1,set_type)
=> ( member(X1,X0)
=> ? [X2] :
( ilf_type(X2,set_type)
& ? [X3] :
( ilf_type(X3,set_type)
& X1 = ordered_pair(X2,X3) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p23) ).
fof(f24,axiom,
! [X0] :
( ilf_type(X0,set_type)
=> ! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,subset_type(cross_product(X0,X1)))
=> relation_like(X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p24) ).
fof(f27,axiom,
! [X0] : ilf_type(X0,set_type),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p27) ).
fof(f28,conjecture,
! [X0] :
( ilf_type(X0,set_type)
=> ! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ! [X3] :
( ilf_type(X3,relation_type(X0,X1))
=> ( member(X2,X3)
=> ? [X4] :
( ilf_type(X4,set_type)
& ? [X5] :
( ilf_type(X5,set_type)
& X2 = ordered_pair(X4,X5)
& member(X4,X0)
& member(X5,X1) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_relset_1_6) ).
fof(f29,negated_conjecture,
~ ! [X0] :
( ilf_type(X0,set_type)
=> ! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ! [X3] :
( ilf_type(X3,relation_type(X0,X1))
=> ( member(X2,X3)
=> ? [X4] :
( ilf_type(X4,set_type)
& ? [X5] :
( ilf_type(X5,set_type)
& X2 = ordered_pair(X4,X5)
& member(X4,X0)
& member(X5,X1) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f28]) ).
fof(f32,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ! [X3] :
( ( member(ordered_pair(X0,X1),cross_product(X2,X3))
<=> ( member(X0,X2)
& member(X1,X3) ) )
| ~ ilf_type(X3,set_type) )
| ~ ilf_type(X2,set_type) )
| ~ ilf_type(X1,set_type) )
| ~ ilf_type(X0,set_type) ),
inference(ennf_transformation,[],[f2]) ).
fof(f33,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ! [X3] :
( ! [X4] :
( ( X4 = ordered_pair(X2,X3)
<=> X4 = unordered_pair(unordered_pair(X2,X3),singleton(X2)) )
| ~ ilf_type(X4,set_type) )
| ~ ilf_type(X3,set_type) )
| ~ ilf_type(X2,set_type) )
| ~ ilf_type(X1,set_type) )
| ~ ilf_type(X0,set_type) ),
inference(ennf_transformation,[],[f3]) ).
fof(f35,plain,
! [X0] :
( ! [X1] :
( ( ! [X2] :
( ilf_type(X2,relation_type(X0,X1))
| ~ ilf_type(X2,subset_type(cross_product(X0,X1))) )
& ! [X3] :
( ilf_type(X3,subset_type(cross_product(X0,X1)))
| ~ ilf_type(X3,relation_type(X0,X1)) ) )
| ~ ilf_type(X1,set_type) )
| ~ ilf_type(X0,set_type) ),
inference(ennf_transformation,[],[f5]) ).
fof(f41,plain,
! [X0] :
( ! [X1] :
( unordered_pair(X0,X1) = unordered_pair(X1,X0)
| ~ ilf_type(X1,set_type) )
| ~ ilf_type(X0,set_type) ),
inference(ennf_transformation,[],[f11]) ).
fof(f43,plain,
! [X0] :
( ! [X1] :
( ( ilf_type(X1,subset_type(X0))
<=> ilf_type(X1,member_type(power_set(X0))) )
| ~ ilf_type(X1,set_type) )
| ~ ilf_type(X0,set_type) ),
inference(ennf_transformation,[],[f14]) ).
fof(f49,plain,
! [X0] :
( ! [X1] :
( ( member(X0,power_set(X1))
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0)
| ~ ilf_type(X2,set_type) ) )
| ~ ilf_type(X1,set_type) )
| ~ ilf_type(X0,set_type) ),
inference(ennf_transformation,[],[f19]) ).
fof(f50,plain,
! [X0] :
( ! [X1] :
( ( member(X0,power_set(X1))
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0)
| ~ ilf_type(X2,set_type) ) )
| ~ ilf_type(X1,set_type) )
| ~ ilf_type(X0,set_type) ),
inference(flattening,[],[f49]) ).
fof(f51,plain,
! [X0] :
( ( ~ empty(power_set(X0))
& ilf_type(power_set(X0),set_type) )
| ~ ilf_type(X0,set_type) ),
inference(ennf_transformation,[],[f20]) ).
fof(f52,plain,
! [X0] :
( ! [X1] :
( ( ilf_type(X0,member_type(X1))
<=> member(X0,X1) )
| empty(X1)
| ~ ilf_type(X1,set_type) )
| ~ ilf_type(X0,set_type) ),
inference(ennf_transformation,[],[f21]) ).
fof(f53,plain,
! [X0] :
( ! [X1] :
( ( ilf_type(X0,member_type(X1))
<=> member(X0,X1) )
| empty(X1)
| ~ ilf_type(X1,set_type) )
| ~ ilf_type(X0,set_type) ),
inference(flattening,[],[f52]) ).
fof(f56,plain,
! [X0] :
( ( relation_like(X0)
<=> ! [X1] :
( ? [X2] :
( ilf_type(X2,set_type)
& ? [X3] :
( ilf_type(X3,set_type)
& X1 = ordered_pair(X2,X3) ) )
| ~ member(X1,X0)
| ~ ilf_type(X1,set_type) ) )
| ~ ilf_type(X0,set_type) ),
inference(ennf_transformation,[],[f23]) ).
fof(f57,plain,
! [X0] :
( ( relation_like(X0)
<=> ! [X1] :
( ? [X2] :
( ilf_type(X2,set_type)
& ? [X3] :
( ilf_type(X3,set_type)
& X1 = ordered_pair(X2,X3) ) )
| ~ member(X1,X0)
| ~ ilf_type(X1,set_type) ) )
| ~ ilf_type(X0,set_type) ),
inference(flattening,[],[f56]) ).
fof(f58,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( relation_like(X2)
| ~ ilf_type(X2,subset_type(cross_product(X0,X1))) )
| ~ ilf_type(X1,set_type) )
| ~ ilf_type(X0,set_type) ),
inference(ennf_transformation,[],[f24]) ).
fof(f62,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ~ ilf_type(X4,set_type)
| ! [X5] :
( ~ ilf_type(X5,set_type)
| ordered_pair(X4,X5) != X2
| ~ member(X4,X0)
| ~ member(X5,X1) ) )
& member(X2,X3)
& ilf_type(X3,relation_type(X0,X1)) )
& ilf_type(X2,set_type) )
& ilf_type(X1,set_type) )
& ilf_type(X0,set_type) ),
inference(ennf_transformation,[],[f29]) ).
fof(f63,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ~ ilf_type(X4,set_type)
| ! [X5] :
( ~ ilf_type(X5,set_type)
| ordered_pair(X4,X5) != X2
| ~ member(X4,X0)
| ~ member(X5,X1) ) )
& member(X2,X3)
& ilf_type(X3,relation_type(X0,X1)) )
& ilf_type(X2,set_type) )
& ilf_type(X1,set_type) )
& ilf_type(X0,set_type) ),
inference(flattening,[],[f62]) ).
fof(f65,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ! [X3] :
( ( ( member(ordered_pair(X0,X1),cross_product(X2,X3))
| ~ member(X0,X2)
| ~ member(X1,X3) )
& ( ( member(X0,X2)
& member(X1,X3) )
| ~ member(ordered_pair(X0,X1),cross_product(X2,X3)) ) )
| ~ ilf_type(X3,set_type) )
| ~ ilf_type(X2,set_type) )
| ~ ilf_type(X1,set_type) )
| ~ ilf_type(X0,set_type) ),
inference(nnf_transformation,[],[f32]) ).
fof(f66,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ! [X3] :
( ( ( member(ordered_pair(X0,X1),cross_product(X2,X3))
| ~ member(X0,X2)
| ~ member(X1,X3) )
& ( ( member(X0,X2)
& member(X1,X3) )
| ~ member(ordered_pair(X0,X1),cross_product(X2,X3)) ) )
| ~ ilf_type(X3,set_type) )
| ~ ilf_type(X2,set_type) )
| ~ ilf_type(X1,set_type) )
| ~ ilf_type(X0,set_type) ),
inference(flattening,[],[f65]) ).
fof(f67,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ! [X3] :
( ! [X4] :
( ( ( X4 = ordered_pair(X2,X3)
| unordered_pair(unordered_pair(X2,X3),singleton(X2)) != X4 )
& ( X4 = unordered_pair(unordered_pair(X2,X3),singleton(X2))
| ordered_pair(X2,X3) != X4 ) )
| ~ ilf_type(X4,set_type) )
| ~ ilf_type(X3,set_type) )
| ~ ilf_type(X2,set_type) )
| ~ ilf_type(X1,set_type) )
| ~ ilf_type(X0,set_type) ),
inference(nnf_transformation,[],[f33]) ).
fof(f74,plain,
! [X0] :
( ! [X1] :
( ( ( ilf_type(X1,subset_type(X0))
| ~ ilf_type(X1,member_type(power_set(X0))) )
& ( ilf_type(X1,member_type(power_set(X0)))
| ~ ilf_type(X1,subset_type(X0)) ) )
| ~ ilf_type(X1,set_type) )
| ~ ilf_type(X0,set_type) ),
inference(nnf_transformation,[],[f43]) ).
fof(f83,plain,
! [X0] :
( ! [X1] :
( ( ( member(X0,power_set(X1))
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0)
& ilf_type(X2,set_type) ) )
& ( ! [X2] :
( member(X2,X1)
| ~ member(X2,X0)
| ~ ilf_type(X2,set_type) )
| ~ member(X0,power_set(X1)) ) )
| ~ ilf_type(X1,set_type) )
| ~ ilf_type(X0,set_type) ),
inference(nnf_transformation,[],[f50]) ).
fof(f84,plain,
! [X0] :
( ! [X1] :
( ( ( member(X0,power_set(X1))
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0)
& ilf_type(X2,set_type) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0)
| ~ ilf_type(X3,set_type) )
| ~ member(X0,power_set(X1)) ) )
| ~ ilf_type(X1,set_type) )
| ~ ilf_type(X0,set_type) ),
inference(rectify,[],[f83]) ).
fof(f85,plain,
! [X0] :
( ! [X1] :
( ( ( member(X0,power_set(X1))
| ( ~ member(sK7(X0,X1),X1)
& member(sK7(X0,X1),X0)
& ilf_type(sK7(X0,X1),set_type) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0)
| ~ ilf_type(X3,set_type) )
| ~ member(X0,power_set(X1)) ) )
| ~ ilf_type(X1,set_type) )
| ~ ilf_type(X0,set_type) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK7]),skolemize(X2,sK7(X0,X1))],[f84]) ).
fof(f86,plain,
! [X0] :
( ! [X1] :
( ( ( ilf_type(X0,member_type(X1))
| ~ member(X0,X1) )
& ( member(X0,X1)
| ~ ilf_type(X0,member_type(X1)) ) )
| empty(X1)
| ~ ilf_type(X1,set_type) )
| ~ ilf_type(X0,set_type) ),
inference(nnf_transformation,[],[f53]) ).
fof(f88,plain,
! [X0] :
( ( ( relation_like(X0)
| ? [X1] :
( ! [X2] :
( ~ ilf_type(X2,set_type)
| ! [X3] :
( ~ ilf_type(X3,set_type)
| ordered_pair(X2,X3) != X1 ) )
& member(X1,X0)
& ilf_type(X1,set_type) ) )
& ( ! [X1] :
( ? [X2] :
( ilf_type(X2,set_type)
& ? [X3] :
( ilf_type(X3,set_type)
& X1 = ordered_pair(X2,X3) ) )
| ~ member(X1,X0)
| ~ ilf_type(X1,set_type) )
| ~ relation_like(X0) ) )
| ~ ilf_type(X0,set_type) ),
inference(nnf_transformation,[],[f57]) ).
fof(f89,plain,
! [X0] :
( ( ( relation_like(X0)
| ? [X1] :
( ! [X2] :
( ~ ilf_type(X2,set_type)
| ! [X3] :
( ~ ilf_type(X3,set_type)
| ordered_pair(X2,X3) != X1 ) )
& member(X1,X0)
& ilf_type(X1,set_type) ) )
& ( ! [X4] :
( ? [X5] :
( ilf_type(X5,set_type)
& ? [X6] :
( ilf_type(X6,set_type)
& ordered_pair(X5,X6) = X4 ) )
| ~ member(X4,X0)
| ~ ilf_type(X4,set_type) )
| ~ relation_like(X0) ) )
| ~ ilf_type(X0,set_type) ),
inference(rectify,[],[f88]) ).
fof(f90,plain,
! [X0] :
( ( ( relation_like(X0)
| ( ! [X2] :
( ~ ilf_type(X2,set_type)
| ! [X3] :
( ~ ilf_type(X3,set_type)
| ordered_pair(X2,X3) != sK9(X0) ) )
& member(sK9(X0),X0)
& ilf_type(sK9(X0),set_type) ) )
& ( ! [X4] :
( ( ilf_type(sK10(X4),set_type)
& ilf_type(sK11(X4),set_type)
& ordered_pair(sK10(X4),sK11(X4)) = X4 )
| ~ member(X4,X0)
| ~ ilf_type(X4,set_type) )
| ~ relation_like(X0) ) )
| ~ ilf_type(X0,set_type) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK9,sK10,sK11]),skolemize(X1,sK9(X0)),skolemize(X5,sK10(X4)),skolemize(X6,sK11(X4))],[f89]) ).
fof(f94,plain,
( ! [X4] :
( ~ ilf_type(X4,set_type)
| ! [X5] :
( ~ ilf_type(X5,set_type)
| ordered_pair(X4,X5) != sK15
| ~ member(X4,sK13)
| ~ member(X5,sK14) ) )
& member(sK15,sK16)
& ilf_type(sK16,relation_type(sK13,sK14))
& ilf_type(sK15,set_type)
& ilf_type(sK14,set_type)
& ilf_type(sK13,set_type) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK13,sK14,sK15,sK16]),skolemize(X0,sK13),skolemize(X1,sK14),skolemize(X2,sK15),skolemize(X3,sK16)],[f63]) ).
fof(f98,plain,
! [X2,X3,X0,X1] :
( member(X1,X3)
| ~ member(ordered_pair(X0,X1),cross_product(X2,X3))
| ~ ilf_type(X3,set_type)
| ~ ilf_type(X2,set_type)
| ~ ilf_type(X1,set_type)
| ~ ilf_type(X0,set_type) ),
inference(cnf_transformation,[],[f66]) ).
fof(f99,plain,
! [X2,X3,X0,X1] :
( member(X0,X2)
| ~ member(ordered_pair(X0,X1),cross_product(X2,X3))
| ~ ilf_type(X3,set_type)
| ~ ilf_type(X2,set_type)
| ~ ilf_type(X1,set_type)
| ~ ilf_type(X0,set_type) ),
inference(cnf_transformation,[],[f66]) ).
fof(f101,plain,
! [X2,X3,X0,X1,X4] :
( unordered_pair(unordered_pair(X2,X3),singleton(X2)) = X4
| ordered_pair(X2,X3) != X4
| ~ ilf_type(X4,set_type)
| ~ ilf_type(X3,set_type)
| ~ ilf_type(X2,set_type)
| ~ ilf_type(X1,set_type)
| ~ ilf_type(X0,set_type) ),
inference(cnf_transformation,[],[f67]) ).
fof(f104,plain,
! [X3,X0,X1] :
( ilf_type(X3,subset_type(cross_product(X0,X1)))
| ~ ilf_type(X3,relation_type(X0,X1))
| ~ ilf_type(X1,set_type)
| ~ ilf_type(X0,set_type) ),
inference(cnf_transformation,[],[f35]) ).
fof(f113,plain,
! [X0,X1] :
( unordered_pair(X0,X1) = unordered_pair(X1,X0)
| ~ ilf_type(X1,set_type)
| ~ ilf_type(X0,set_type) ),
inference(cnf_transformation,[],[f41]) ).
fof(f118,plain,
! [X0,X1] :
( ilf_type(X1,member_type(power_set(X0)))
| ~ ilf_type(X1,subset_type(X0))
| ~ ilf_type(X1,set_type)
| ~ ilf_type(X0,set_type) ),
inference(cnf_transformation,[],[f74]) ).
fof(f131,plain,
! [X3,X0,X1] :
( member(X3,X1)
| ~ member(X3,X0)
| ~ ilf_type(X3,set_type)
| ~ member(X0,power_set(X1))
| ~ ilf_type(X1,set_type)
| ~ ilf_type(X0,set_type) ),
inference(cnf_transformation,[],[f85]) ).
fof(f136,plain,
! [X0] :
( ~ empty(power_set(X0))
| ~ ilf_type(X0,set_type) ),
inference(cnf_transformation,[],[f51]) ).
fof(f137,plain,
! [X0,X1] :
( member(X0,X1)
| ~ ilf_type(X0,member_type(X1))
| empty(X1)
| ~ ilf_type(X1,set_type)
| ~ ilf_type(X0,set_type) ),
inference(cnf_transformation,[],[f86]) ).
fof(f140,plain,
! [X0,X4] :
( ordered_pair(sK10(X4),sK11(X4)) = X4
| ~ member(X4,X0)
| ~ ilf_type(X4,set_type)
| ~ relation_like(X0)
| ~ ilf_type(X0,set_type) ),
inference(cnf_transformation,[],[f90]) ).
fof(f146,plain,
! [X2,X0,X1] :
( relation_like(X2)
| ~ ilf_type(X2,subset_type(cross_product(X0,X1)))
| ~ ilf_type(X1,set_type)
| ~ ilf_type(X0,set_type) ),
inference(cnf_transformation,[],[f58]) ).
fof(f151,plain,
! [X0] : ilf_type(X0,set_type),
inference(cnf_transformation,[],[f27]) ).
fof(f155,plain,
ilf_type(sK16,relation_type(sK13,sK14)),
inference(cnf_transformation,[],[f94]) ).
fof(f156,plain,
member(sK15,sK16),
inference(cnf_transformation,[],[f94]) ).
fof(f157,plain,
! [X4,X5] :
( ordered_pair(X4,X5) != sK15
| ~ ilf_type(X5,set_type)
| ~ ilf_type(X4,set_type)
| ~ member(X4,sK13)
| ~ member(X5,sK14) ),
inference(cnf_transformation,[],[f94]) ).
fof(f159,plain,
! [X2,X3,X0,X1] :
( ordered_pair(X2,X3) = unordered_pair(unordered_pair(X2,X3),singleton(X2))
| ~ ilf_type(ordered_pair(X2,X3),set_type)
| ~ ilf_type(X3,set_type)
| ~ ilf_type(X2,set_type)
| ~ ilf_type(X1,set_type)
| ~ ilf_type(X0,set_type) ),
inference(equality_resolution,[],[f101]) ).
fof(f164,definition,
sF17 = relation_type(sK13,sK14),
introduced(definition,[new_symbols(definition,[sF17])],[function_definition]) ).
fof(f165,plain,
relation_type(sK13,sK14) = sF17,
inference(reorient_equations,[],[f164]) ).
fof(f166,plain,
ilf_type(sK16,sF17),
inference(definition_folding,[],[f155,f165]) ).
fof(f175,plain,
! [X2,X0,X1] :
( relation_like(X2)
| ~ ilf_type(X2,subset_type(cross_product(X0,X1)))
| ~ ilf_type(X0,set_type) ),
inference(forward_subsumption_resolution,[],[f146,f151]) ).
fof(f176,plain,
! [X0,X4] :
( ordered_pair(sK10(X4),sK11(X4)) = X4
| ~ member(X4,X0)
| ~ relation_like(X0)
| ~ ilf_type(X0,set_type) ),
inference(forward_subsumption_resolution,[],[f140,f151]) ).
fof(f180,plain,
! [X0,X1] :
( member(X0,X1)
| ~ ilf_type(X0,member_type(X1))
| empty(X1)
| ~ ilf_type(X0,set_type) ),
inference(forward_subsumption_resolution,[],[f137,f151]) ).
fof(f182,plain,
! [X0] : ~ empty(power_set(X0)),
inference(forward_subsumption_resolution,[],[f136,f151]) ).
fof(f183,plain,
! [X3,X0,X1] :
( member(X3,X1)
| ~ member(X3,X0)
| ~ member(X0,power_set(X1))
| ~ ilf_type(X1,set_type)
| ~ ilf_type(X0,set_type) ),
inference(forward_subsumption_resolution,[],[f131,f151]) ).
fof(f193,plain,
! [X0,X1] :
( ilf_type(X1,member_type(power_set(X0)))
| ~ ilf_type(X1,subset_type(X0))
| ~ ilf_type(X0,set_type) ),
inference(forward_subsumption_resolution,[],[f118,f151]) ).
fof(f197,plain,
! [X0,X1] :
( unordered_pair(X0,X1) = unordered_pair(X1,X0)
| ~ ilf_type(X0,set_type) ),
inference(forward_subsumption_resolution,[],[f113,f151]) ).
fof(f202,plain,
! [X3,X0,X1] :
( ilf_type(X3,subset_type(cross_product(X0,X1)))
| ~ ilf_type(X3,relation_type(X0,X1))
| ~ ilf_type(X0,set_type) ),
inference(forward_subsumption_resolution,[],[f104,f151]) ).
fof(f204,plain,
! [X2,X3,X0,X1] :
( ordered_pair(X2,X3) = unordered_pair(unordered_pair(X2,X3),singleton(X2))
| ~ ilf_type(X3,set_type)
| ~ ilf_type(X2,set_type)
| ~ ilf_type(X1,set_type)
| ~ ilf_type(X0,set_type) ),
inference(forward_subsumption_resolution,[],[f159,f151]) ).
fof(f206,plain,
! [X2,X3,X0,X1] :
( member(X1,X3)
| ~ member(ordered_pair(X0,X1),cross_product(X2,X3))
| ~ ilf_type(X2,set_type)
| ~ ilf_type(X1,set_type)
| ~ ilf_type(X0,set_type) ),
inference(forward_subsumption_resolution,[],[f98,f151]) ).
fof(f207,plain,
! [X2,X3,X0,X1] :
( member(X0,X2)
| ~ member(ordered_pair(X0,X1),cross_product(X2,X3))
| ~ ilf_type(X2,set_type)
| ~ ilf_type(X1,set_type)
| ~ ilf_type(X0,set_type) ),
inference(forward_subsumption_resolution,[],[f99,f151]) ).
fof(f211,plain,
! [X2,X0,X1] :
( ~ ilf_type(X2,subset_type(cross_product(X0,X1)))
| relation_like(X2) ),
inference(forward_subsumption_resolution,[],[f175,f151]) ).
fof(f212,plain,
! [X0,X4] :
( ~ member(X4,X0)
| ordered_pair(sK10(X4),sK11(X4)) = X4
| ~ relation_like(X0) ),
inference(forward_subsumption_resolution,[],[f176,f151]) ).
fof(f214,plain,
! [X0,X1] :
( ~ ilf_type(X0,member_type(X1))
| member(X0,X1)
| empty(X1) ),
inference(forward_subsumption_resolution,[],[f180,f151]) ).
fof(f216,plain,
! [X3,X0,X1] :
( member(X3,X1)
| ~ member(X3,X0)
| ~ member(X0,power_set(X1))
| ~ ilf_type(X0,set_type) ),
inference(forward_subsumption_resolution,[],[f183,f151]) ).
fof(f224,plain,
! [X0,X1] :
( ilf_type(X1,member_type(power_set(X0)))
| ~ ilf_type(X1,subset_type(X0)) ),
inference(forward_subsumption_resolution,[],[f193,f151]) ).
fof(f226,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(forward_subsumption_resolution,[],[f197,f151]) ).
fof(f229,plain,
! [X3,X0,X1] :
( ~ ilf_type(X3,relation_type(X0,X1))
| ilf_type(X3,subset_type(cross_product(X0,X1))) ),
inference(forward_subsumption_resolution,[],[f202,f151]) ).
fof(f231,plain,
! [X2,X3,X0,X1] :
( ordered_pair(X2,X3) = unordered_pair(unordered_pair(X2,X3),singleton(X2))
| ~ ilf_type(X2,set_type)
| ~ ilf_type(X1,set_type)
| ~ ilf_type(X0,set_type) ),
inference(forward_subsumption_resolution,[],[f204,f151]) ).
fof(f233,plain,
! [X2,X3,X0,X1] :
( member(X1,X3)
| ~ member(ordered_pair(X0,X1),cross_product(X2,X3))
| ~ ilf_type(X1,set_type)
| ~ ilf_type(X0,set_type) ),
inference(forward_subsumption_resolution,[],[f206,f151]) ).
fof(f234,plain,
! [X2,X3,X0,X1] :
( member(X0,X2)
| ~ member(ordered_pair(X0,X1),cross_product(X2,X3))
| ~ ilf_type(X1,set_type)
| ~ ilf_type(X0,set_type) ),
inference(forward_subsumption_resolution,[],[f207,f151]) ).
fof(f238,plain,
! [X3,X0,X1] :
( ~ member(X0,power_set(X1))
| ~ member(X3,X0)
| member(X3,X1) ),
inference(forward_subsumption_resolution,[],[f216,f151]) ).
fof(f240,plain,
! [X2,X3,X0,X1] :
( ordered_pair(X2,X3) = unordered_pair(unordered_pair(X2,X3),singleton(X2))
| ~ ilf_type(X1,set_type)
| ~ ilf_type(X0,set_type) ),
inference(forward_subsumption_resolution,[],[f231,f151]) ).
fof(f242,plain,
! [X2,X3,X0,X1] :
( member(X1,X3)
| ~ member(ordered_pair(X0,X1),cross_product(X2,X3))
| ~ ilf_type(X0,set_type) ),
inference(forward_subsumption_resolution,[],[f233,f151]) ).
fof(f243,plain,
! [X2,X3,X0,X1] :
( member(X0,X2)
| ~ member(ordered_pair(X0,X1),cross_product(X2,X3))
| ~ ilf_type(X0,set_type) ),
inference(forward_subsumption_resolution,[],[f234,f151]) ).
fof(f245,plain,
! [X2,X3,X0] :
( ordered_pair(X2,X3) = unordered_pair(unordered_pair(X2,X3),singleton(X2))
| ~ ilf_type(X0,set_type) ),
inference(forward_subsumption_resolution,[],[f240,f151]) ).
fof(f247,plain,
! [X2,X3,X0,X1] :
( ~ member(ordered_pair(X0,X1),cross_product(X2,X3))
| member(X1,X3) ),
inference(forward_subsumption_resolution,[],[f242,f151]) ).
fof(f248,plain,
! [X2,X3,X0,X1] :
( ~ member(ordered_pair(X0,X1),cross_product(X2,X3))
| member(X0,X2) ),
inference(forward_subsumption_resolution,[],[f243,f151]) ).
fof(f250,plain,
! [X2,X3] : ordered_pair(X2,X3) = unordered_pair(unordered_pair(X2,X3),singleton(X2)),
inference(forward_subsumption_resolution,[],[f245,f151]) ).
fof(f252,plain,
! [X2,X3] : ordered_pair(X2,X3) = unordered_pair(singleton(X2),unordered_pair(X2,X3)),
inference(forward_demodulation,[],[f250,f226]) ).
fof(f285,plain,
! [X0,X1] :
( ~ ilf_type(X0,subset_type(X1))
| member(X0,power_set(X1))
| empty(power_set(X1)) ),
inference(resolution,[],[f224,f214]) ).
fof(f286,plain,
! [X0,X1] :
( ~ ilf_type(X0,subset_type(X1))
| member(X0,power_set(X1)) ),
inference(forward_subsumption_resolution,[],[f285,f182]) ).
fof(f310,plain,
! [X2,X3,X0,X1] :
( ~ member(unordered_pair(singleton(X0),unordered_pair(X0,X1)),cross_product(X2,X3))
| member(X0,X2) ),
inference(superposition,[],[f248,f252]) ).
fof(f311,plain,
! [X2,X3,X0,X1] :
( ~ member(unordered_pair(singleton(X0),unordered_pair(X0,X1)),cross_product(X2,X3))
| member(X1,X3) ),
inference(superposition,[],[f247,f252]) ).
fof(f313,plain,
! [X0,X1] :
( sK15 != unordered_pair(singleton(X0),unordered_pair(X0,X1))
| ~ ilf_type(X1,set_type)
| ~ ilf_type(X0,set_type)
| ~ member(X0,sK13)
| ~ member(X1,sK14) ),
inference(superposition,[],[f157,f252]) ).
fof(f314,plain,
! [X0,X1] :
( sK15 != unordered_pair(singleton(X0),unordered_pair(X0,X1))
| ~ ilf_type(X0,set_type)
| ~ member(X0,sK13)
| ~ member(X1,sK14) ),
inference(forward_subsumption_resolution,[],[f313,f151]) ).
fof(f315,plain,
! [X0,X1] :
( sK15 != unordered_pair(singleton(X0),unordered_pair(X0,X1))
| ~ member(X0,sK13)
| ~ member(X1,sK14) ),
inference(forward_subsumption_resolution,[],[f314,f151]) ).
fof(f319,plain,
! [X0] :
( ~ ilf_type(X0,sF17)
| ilf_type(X0,subset_type(cross_product(sK13,sK14))) ),
inference(superposition,[],[f229,f165]) ).
fof(f335,plain,
( sK15 = ordered_pair(sK10(sK15),sK11(sK15))
| ~ relation_like(sK16) ),
inference(resolution,[],[f212,f156]) ).
fof(f336,plain,
( sK15 = unordered_pair(singleton(sK10(sK15)),unordered_pair(sK10(sK15),sK11(sK15)))
| ~ relation_like(sK16) ),
inference(forward_demodulation,[],[f335,f252]) ).
fof(f344,definition,
( spl18_1
<=> relation_like(sK16) ),
introduced(definition,[new_symbols(definition,[spl18_1])],[avatar_definition]) ).
fof(f346,plain,
( ~ relation_like(sK16)
| spl18_1 ),
inference(avatar_component_clause,[],[f344]) ).
fof(f348,definition,
( spl18_2
<=> sK15 = unordered_pair(singleton(sK10(sK15)),unordered_pair(sK10(sK15),sK11(sK15))) ),
introduced(definition,[new_symbols(definition,[spl18_2])],[avatar_definition]) ).
fof(f350,plain,
( sK15 = unordered_pair(singleton(sK10(sK15)),unordered_pair(sK10(sK15),sK11(sK15)))
| ~ spl18_2 ),
inference(avatar_component_clause,[],[f348]) ).
fof(f351,plain,
( ~ spl18_1
| spl18_2 ),
inference(avatar_split_clause,[],[f336,f348,f344]) ).
fof(f456,plain,
ilf_type(sK16,subset_type(cross_product(sK13,sK14))),
inference(resolution,[],[f319,f166]) ).
fof(f460,plain,
relation_like(sK16),
inference(resolution,[],[f456,f211]) ).
fof(f461,plain,
member(sK16,power_set(cross_product(sK13,sK14))),
inference(resolution,[],[f456,f286]) ).
fof(f462,plain,
( $false
| spl18_1 ),
inference(forward_subsumption_resolution,[],[f460,f346]) ).
fof(f463,plain,
spl18_1,
inference(avatar_contradiction_clause,[],[f462]) ).
fof(f468,plain,
( sK15 != sK15
| ~ member(sK10(sK15),sK13)
| ~ member(sK11(sK15),sK14)
| ~ spl18_2 ),
inference(superposition,[],[f315,f350]) ).
fof(f471,plain,
( ~ member(sK10(sK15),sK13)
| ~ member(sK11(sK15),sK14)
| ~ spl18_2 ),
inference(trivial_inequality_removal,[],[f468]) ).
fof(f475,definition,
( spl18_9
<=> member(sK11(sK15),sK14) ),
introduced(definition,[new_symbols(definition,[spl18_9])],[avatar_definition]) ).
fof(f477,plain,
( ~ member(sK11(sK15),sK14)
| spl18_9 ),
inference(avatar_component_clause,[],[f475]) ).
fof(f479,definition,
( spl18_10
<=> member(sK10(sK15),sK13) ),
introduced(definition,[new_symbols(definition,[spl18_10])],[avatar_definition]) ).
fof(f482,plain,
( ~ spl18_9
| ~ spl18_10
| ~ spl18_2 ),
inference(avatar_split_clause,[],[f471,f348,f479,f475]) ).
fof(f578,plain,
! [X0] :
( ~ member(X0,sK16)
| member(X0,cross_product(sK13,sK14)) ),
inference(resolution,[],[f461,f238]) ).
fof(f612,plain,
member(sK15,cross_product(sK13,sK14)),
inference(resolution,[],[f578,f156]) ).
fof(f643,plain,
( ! [X0,X1] :
( ~ member(sK15,cross_product(X0,X1))
| member(sK10(sK15),X0) )
| ~ spl18_2 ),
inference(superposition,[],[f310,f350]) ).
fof(f651,plain,
( ! [X0,X1] :
( ~ member(sK15,cross_product(X0,X1))
| member(sK11(sK15),X1) )
| ~ spl18_2 ),
inference(superposition,[],[f311,f350]) ).
fof(f793,plain,
( member(sK10(sK15),sK13)
| ~ spl18_2 ),
inference(resolution,[],[f643,f612]) ).
fof(f794,plain,
( spl18_10
| ~ spl18_2 ),
inference(avatar_split_clause,[],[f793,f348,f479]) ).
fof(f925,plain,
( member(sK11(sK15),sK14)
| ~ spl18_2 ),
inference(resolution,[],[f651,f612]) ).
fof(f926,plain,
( $false
| ~ spl18_2
| spl18_9 ),
inference(forward_subsumption_resolution,[],[f925,f477]) ).
fof(f927,plain,
( ~ spl18_2
| spl18_9 ),
inference(avatar_contradiction_clause,[],[f926]) ).
cnf(s1,plain,
( ~ spl18_1
| spl18_2 ),
inference(sat_conversion,[],[f351]) ).
cnf(s5,plain,
spl18_1,
inference(sat_conversion,[],[f463]) ).
cnf(s7,plain,
( ~ spl18_2
| ~ spl18_9
| ~ spl18_10 ),
inference(sat_conversion,[],[f482]) ).
cnf(s16,plain,
( ~ spl18_2
| spl18_10 ),
inference(sat_conversion,[],[f794]) ).
cnf(s20,plain,
( ~ spl18_2
| spl18_9 ),
inference(sat_conversion,[],[f927]) ).
cnf(s26,plain,
spl18_2,
inference(rat,[],[s1,s5]) ).
cnf(s27,plain,
spl18_9,
inference(rat,[],[s20,s26]) ).
cnf(s28,plain,
spl18_10,
inference(rat,[],[s16,s26]) ).
cnf(s29,plain,
$false,
inference(rat,[],[s7,s28,s27,s26]) ).
fof(f928,plain,
$false,
inference(avatar_sat_refutation,[],[s29]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET644+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.38 % Computer : n013.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Mon Sep 28 02:27:27 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.15/0.41 Running first-order model finding
% 0.15/0.41 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
% 2.56/0.97 % (750081)Will run a generic schedule for satisfiability detection.
% 2.56/0.97 % (750087)% WARNING: option uhcvi not known.
% 2.56/0.97 % (750092)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2590262615:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 2.56/0.97 % (750086)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1667004129_2999 on theBenchmark for (2999ds/0Mi)
% 2.56/0.97 % (750090)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4110697053:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 2.56/0.97 % (750087)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4095680007:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 2.56/0.97 % (750091)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2796103676:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 2.56/0.97 % (750088)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=77385424:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 2.56/0.97 % (750089)dis+10_1_sil=32000:sp=arity:random_seed=1983958039:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 2.56/0.97 % TRYING [1]
% 2.56/0.97 % TRYING [2]
% 2.56/0.97 % TRYING [3]
% 2.56/0.97 % TRYING [4]
% 2.56/0.97 % (750089)Instruction limit reached!
% 2.56/0.97 % (750089)------------------------------
% 2.56/0.97 % (750089)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.56/0.97 % (750089)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.56/0.97 % (750089)CaDiCaL version: 2.1.3
% 2.56/0.97 % (750089)Termination reason: Instruction limit
% 2.56/0.97 % (750089)Termination phase: Saturation
% 2.56/0.97 % (750089)Time elapsed: 0.066 s
% 2.56/0.97 % (750089)Peak memory usage: 13 MB
% 2.56/0.97 % (750089)Instructions burned: 104 (million)
% 2.56/0.97 % (750090)Instruction limit reached!
% 2.56/0.97 % (750090)------------------------------
% 2.56/0.97 % (750090)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.56/0.97 % (750090)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.56/0.97 % (750090)CaDiCaL version: 2.1.3
% 2.56/0.97 % (750090)Termination reason: Instruction limit
% 2.56/0.97 % (750090)Termination phase: Saturation
% 2.56/0.97 % (750090)Time elapsed: 0.070 s
% 2.56/0.97 % (750090)Peak memory usage: 12 MB
% 2.56/0.97 % (750090)Instructions burned: 116 (million)
% 2.56/0.97 % (750091)Instruction limit reached!
% 2.56/0.97 % (750091)------------------------------
% 2.56/0.97 % (750091)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.56/0.97 % (750091)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.56/0.97 % (750091)CaDiCaL version: 2.1.3
% 2.56/0.97 % (750091)Termination reason: Instruction limit
% 2.56/0.97 % (750091)Termination phase: Saturation
% 2.56/0.97 % (750091)Time elapsed: 0.083 s
% 2.56/0.97 % (750091)Peak memory usage: 13 MB
% 2.56/0.97 % (750091)Instructions burned: 132 (million)
% 2.56/0.97 % (750100)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2455213823:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 2.56/0.97 % (750101)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3261981877:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 2.56/0.97 % TRYING [1]
% 2.56/0.97 % TRYING [2]
% 2.56/0.97 % TRYING [3]
% 2.56/0.97 % (750102)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=1761547217:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 2.56/0.97 % (750092)Instruction limit reached!
% 2.56/0.97 % (750092)------------------------------
% 2.56/0.97 % (750092)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.56/0.97 % (750092)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.56/0.97 % (750092)CaDiCaL version: 2.1.3
% 2.56/0.97 % (750092)Termination reason: Instruction limit
% 2.56/0.97 % (750092)Termination phase: Saturation
% 2.56/0.97 % (750092)Time elapsed: 0.110 s
% 2.56/0.97 % (750092)Peak memory usage: 13 MB
% 2.56/0.97 % (750092)Instructions burned: 159 (million)
% 2.56/0.97 % (750106)ott-21_1_sil=16000:fs=off:random_seed=1277473554:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 2.56/0.97 % TRYING [4]
% 2.56/0.97 % (750101)Instruction limit reached!
% 2.56/0.97 % (750101)------------------------------
% 2.56/0.97 % (750101)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.56/0.97 % (750101)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.56/0.97 % (750101)CaDiCaL version: 2.1.3
% 2.56/0.97 % (750101)Termination reason: Instruction limit
% 2.56/0.97 % (750101)Termination phase: Saturation
% 2.56/0.97 % (750101)Time elapsed: 0.087 s
% 2.56/0.97 % (750101)Peak memory usage: 13 MB
% 2.56/0.97 % (750101)Instructions burned: 132 (million)
% 2.56/0.97 % (750108)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=227034180:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 2.56/0.97 % (750106)Instruction limit reached!
% 2.56/0.97 % (750106)------------------------------
% 2.56/0.97 % (750106)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.56/0.97 % (750106)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.56/0.97 % (750106)CaDiCaL version: 2.1.3
% 2.56/0.97 % (750106)Termination reason: Instruction limit
% 2.56/0.97 % (750106)Termination phase: Saturation
% 2.56/0.97 % (750106)Time elapsed: 0.084 s
% 2.56/0.97 % (750106)Peak memory usage: 12 MB
% 2.56/0.97 % (750106)Instructions burned: 180 (million)
% 2.56/0.97 % (750110)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=575625218:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 2.56/0.97 % TRYING [1]
% 2.56/0.97 % TRYING [2]
% 2.56/0.97 % TRYING [3]
% 2.56/0.97 % TRYING [4]
% 2.56/0.97 % TRYING [5]
% 2.56/0.97 % TRYING [5]
% 2.56/0.97 % (750102)Instruction limit reached!
% 2.56/0.97 % (750102)------------------------------
% 2.56/0.97 % (750102)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.56/0.97 % (750102)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.56/0.97 % (750102)CaDiCaL version: 2.1.3
% 2.56/0.97 % (750102)Termination reason: Instruction limit
% 2.56/0.97 % (750102)Termination phase: Saturation
% 2.56/0.97 % (750102)Time elapsed: 0.367 s
% 2.56/0.97 % (750102)Peak memory usage: 21 MB
% 2.56/0.97 % (750102)Instructions burned: 685 (million)
% 2.56/0.97 % (750108)Instruction limit reached!
% 2.56/0.97 % (750108)------------------------------
% 2.56/0.97 % (750108)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.56/0.97 % (750108)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.56/0.97 % (750108)CaDiCaL version: 2.1.3
% 2.56/0.97 % (750108)Termination reason: Instruction limit
% 2.56/0.97 % (750108)Termination phase: Saturation
% 2.56/0.97 % (750108)Time elapsed: 0.282 s
% 2.56/0.97 % (750108)Peak memory usage: 17 MB
% 2.56/0.97 % (750108)Instructions burned: 477 (million)
% 2.56/0.97 % (750112)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=98968047:i=1179_2994 on theBenchmark for (2994ds/1179Mi)
% 2.56/0.97 % (750113)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=2377600329:i=889:ins=1_2994 on theBenchmark for (2994ds/889Mi)
% 2.56/0.97 % (750100)Instruction limit reached!
% 2.56/0.97 % (750100)------------------------------
% 2.56/0.97 % (750100)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.56/0.97 % (750100)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.56/0.97 % (750100)CaDiCaL version: 2.1.3
% 2.56/0.97 % (750100)Termination reason: Instruction limit
% 2.56/0.97 % (750100)Termination phase: Finite model building SAT solving
% 2.56/0.97 % (750100)Time elapsed: 0.412 s
% 2.56/0.97 % (750100)Peak memory usage: 16 MB
% 2.56/0.97 % (750100)Instructions burned: 714 (million)
% 2.56/0.97 % (750112) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-750081-750112"...
% 2.56/0.97 % (750112)...printing done.
% 2.56/0.97 % (750112)Refutation found. Thanks to Tanya!
% 2.56/0.97 % SZS status Theorem for theBenchmark
% 2.56/0.97 % SZS output start Proof for theBenchmark
% See solution above
% 2.56/0.97 % (750112)------------------------------
% 2.56/0.97 % (750112)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.56/0.97 % (750112)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.56/0.97 % (750112)CaDiCaL version: 2.1.3
% 2.56/0.97 % (750112)Termination reason: Refutation
% 2.56/0.97 % (750112)Time elapsed: 0.025 s
% 2.56/0.97 % (750112)Peak memory usage: 13 MB
% 2.56/0.97 % (750112)Instructions burned: 38 (million)
% 2.56/0.97 % (750081)Success in time 0.55 s
% 2.56/0.97 % Vampire exiting
%------------------------------------------------------------------------------