%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET645+3 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n005.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 0.19s 0.51s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 10
% Syntax : Number of formulae : 76 ( 17 unt; 2 def)
% Number of atoms : 301 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 371 ( 146 ~; 142 |; 42 &)
% ( 12 <=>; 29 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-2 aty)
% Number of variables : 158 ( 0 sgn 146 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,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/sandbox/benchmark/theBenchmark.p',p1) ).
fof(f4,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/sandbox/benchmark/theBenchmark.p',p4) ).
fof(f10,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/sandbox/benchmark/theBenchmark.p',p10) ).
fof(f13,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/sandbox/benchmark/theBenchmark.p',p13) ).
fof(f14,axiom,
! [X0] :
( ilf_type(X0,set_type)
=> ( ~ empty(power_set(X0))
& ilf_type(power_set(X0),set_type) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p14) ).
fof(f15,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/sandbox/benchmark/theBenchmark.p',p15) ).
fof(f21,axiom,
! [X0] : ilf_type(X0,set_type),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p21) ).
fof(f22,conjecture,
! [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,relation_type(X0,X1))
=> ( member(ordered_pair(X2,X3),X4)
=> ( member(X2,X0)
& member(X3,X1) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_relset_1_7) ).
fof(f23,negated_conjecture,
~ ! [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,relation_type(X0,X1))
=> ( member(ordered_pair(X2,X3),X4)
=> ( member(X2,X0)
& member(X3,X1) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f22]) ).
fof(f24,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,[],[f1]) ).
fof(f27,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,[],[f4]) ).
fof(f33,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,[],[f10]) ).
fof(f36,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,[],[f13]) ).
fof(f37,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,[],[f36]) ).
fof(f38,plain,
! [X0] :
( ( ~ empty(power_set(X0))
& ilf_type(power_set(X0),set_type) )
| ~ ilf_type(X0,set_type) ),
inference(ennf_transformation,[],[f14]) ).
fof(f39,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,[],[f15]) ).
fof(f40,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,[],[f39]) ).
fof(f49,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ( ~ member(X2,X0)
| ~ member(X3,X1) )
& member(ordered_pair(X2,X3),X4)
& ilf_type(X4,relation_type(X0,X1)) )
& ilf_type(X3,set_type) )
& ilf_type(X2,set_type) )
& ilf_type(X1,set_type) )
& ilf_type(X0,set_type) ),
inference(ennf_transformation,[],[f23]) ).
fof(f50,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ( ~ member(X2,X0)
| ~ member(X3,X1) )
& member(ordered_pair(X2,X3),X4)
& ilf_type(X4,relation_type(X0,X1)) )
& ilf_type(X3,set_type) )
& ilf_type(X2,set_type) )
& ilf_type(X1,set_type) )
& ilf_type(X0,set_type) ),
inference(flattening,[],[f49]) ).
fof(f51,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,[],[f24]) ).
fof(f52,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,[],[f51]) ).
fof(f55,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,[],[f33]) ).
fof(f61,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,[],[f37]) ).
fof(f62,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,[],[f61]) ).
fof(f63,plain,
! [X0] :
( ! [X1] :
( ( ( member(X0,power_set(X1))
| ( ~ member(sK3(X0,X1),X1)
& member(sK3(X0,X1),X0)
& ilf_type(sK3(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,[sK3]),skolemize(X2,sK3(X0,X1))],[f62]) ).
fof(f64,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,[],[f40]) ).
fof(f72,plain,
( ( ~ member(sK11,sK9)
| ~ member(sK12,sK10) )
& member(ordered_pair(sK11,sK12),sK13)
& ilf_type(sK13,relation_type(sK9,sK10))
& ilf_type(sK12,set_type)
& ilf_type(sK11,set_type)
& ilf_type(sK10,set_type)
& ilf_type(sK9,set_type) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK9,sK10,sK11,sK12,sK13]),skolemize(X0,sK9),skolemize(X1,sK10),skolemize(X2,sK11),skolemize(X3,sK12),skolemize(X4,sK13)],[f50]) ).
fof(f73,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,[],[f52]) ).
fof(f74,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,[],[f52]) ).
fof(f79,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,[],[f27]) ).
fof(f86,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,[],[f55]) ).
fof(f94,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,[],[f63]) ).
fof(f99,plain,
! [X0] :
( ~ empty(power_set(X0))
| ~ ilf_type(X0,set_type) ),
inference(cnf_transformation,[],[f38]) ).
fof(f100,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,[],[f64]) ).
fof(f114,plain,
! [X0] : ilf_type(X0,set_type),
inference(cnf_transformation,[],[f21]) ).
fof(f119,plain,
ilf_type(sK13,relation_type(sK9,sK10)),
inference(cnf_transformation,[],[f72]) ).
fof(f120,plain,
member(ordered_pair(sK11,sK12),sK13),
inference(cnf_transformation,[],[f72]) ).
fof(f121,plain,
( ~ member(sK11,sK9)
| ~ member(sK12,sK10) ),
inference(cnf_transformation,[],[f72]) ).
fof(f123,definition,
( spl14_1
<=> member(sK12,sK10) ),
introduced(definition,[new_symbols(definition,[spl14_1])],[avatar_definition]) ).
fof(f125,plain,
( ~ member(sK12,sK10)
| spl14_1 ),
inference(avatar_component_clause,[],[f123]) ).
fof(f127,definition,
( spl14_2
<=> member(sK11,sK9) ),
introduced(definition,[new_symbols(definition,[spl14_2])],[avatar_definition]) ).
fof(f130,plain,
( ~ spl14_1
| ~ spl14_2 ),
inference(avatar_split_clause,[],[f121,f127,f123]) ).
fof(f139,plain,
! [X0,X1] :
( member(X0,X1)
| ~ ilf_type(X0,member_type(X1))
| empty(X1)
| ~ ilf_type(X0,set_type) ),
inference(forward_subsumption_resolution,[],[f100,f114]) ).
fof(f141,plain,
! [X0] : ~ empty(power_set(X0)),
inference(forward_subsumption_resolution,[],[f99,f114]) ).
fof(f142,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,[],[f94,f114]) ).
fof(f150,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,[],[f86,f114]) ).
fof(f154,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,[],[f79,f114]) ).
fof(f158,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,[],[f73,f114]) ).
fof(f159,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,[],[f74,f114]) ).
fof(f165,plain,
! [X0,X1] :
( ~ ilf_type(X0,member_type(X1))
| member(X0,X1)
| empty(X1) ),
inference(forward_subsumption_resolution,[],[f139,f114]) ).
fof(f167,plain,
! [X3,X0,X1] :
( member(X3,X1)
| ~ member(X3,X0)
| ~ member(X0,power_set(X1))
| ~ ilf_type(X0,set_type) ),
inference(forward_subsumption_resolution,[],[f142,f114]) ).
fof(f174,plain,
! [X0,X1] :
( ~ ilf_type(X1,subset_type(X0))
| ilf_type(X1,member_type(power_set(X0))) ),
inference(forward_subsumption_resolution,[],[f150,f114]) ).
fof(f178,plain,
! [X3,X0,X1] :
( ~ ilf_type(X3,relation_type(X0,X1))
| ilf_type(X3,subset_type(cross_product(X0,X1))) ),
inference(forward_subsumption_resolution,[],[f154,f114]) ).
fof(f182,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,[],[f158,f114]) ).
fof(f183,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,[],[f159,f114]) ).
fof(f187,plain,
! [X3,X0,X1] :
( ~ member(X3,X0)
| member(X3,X1)
| ~ member(X0,power_set(X1)) ),
inference(forward_subsumption_resolution,[],[f167,f114]) ).
fof(f192,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,[],[f182,f114]) ).
fof(f193,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,[],[f183,f114]) ).
fof(f197,plain,
! [X2,X3,X0,X1] :
( ~ member(ordered_pair(X0,X1),cross_product(X2,X3))
| member(X1,X3) ),
inference(forward_subsumption_resolution,[],[f192,f114]) ).
fof(f198,plain,
! [X2,X3,X0,X1] :
( ~ member(ordered_pair(X0,X1),cross_product(X2,X3))
| member(X0,X2) ),
inference(forward_subsumption_resolution,[],[f193,f114]) ).
fof(f235,plain,
! [X0] :
( ~ member(sK13,power_set(X0))
| member(ordered_pair(sK11,sK12),X0) ),
inference(resolution,[],[f187,f120]) ).
fof(f242,plain,
ilf_type(sK13,subset_type(cross_product(sK9,sK10))),
inference(resolution,[],[f178,f119]) ).
fof(f245,plain,
ilf_type(sK13,member_type(power_set(cross_product(sK9,sK10)))),
inference(resolution,[],[f242,f174]) ).
fof(f254,plain,
( member(sK13,power_set(cross_product(sK9,sK10)))
| empty(power_set(cross_product(sK9,sK10))) ),
inference(resolution,[],[f245,f165]) ).
fof(f255,plain,
member(sK13,power_set(cross_product(sK9,sK10))),
inference(forward_subsumption_resolution,[],[f254,f141]) ).
fof(f265,plain,
member(ordered_pair(sK11,sK12),cross_product(sK9,sK10)),
inference(resolution,[],[f255,f235]) ).
fof(f286,plain,
member(sK11,sK9),
inference(resolution,[],[f265,f198]) ).
fof(f287,plain,
member(sK12,sK10),
inference(resolution,[],[f265,f197]) ).
fof(f293,plain,
( $false
| spl14_1 ),
inference(forward_subsumption_resolution,[],[f287,f125]) ).
fof(f294,plain,
spl14_1,
inference(avatar_contradiction_clause,[],[f293]) ).
fof(f295,plain,
spl14_2,
inference(avatar_split_clause,[],[f286,f127]) ).
cnf(s1,plain,
( ~ spl14_1
| ~ spl14_2 ),
inference(sat_conversion,[],[f130]) ).
cnf(s2,plain,
spl14_1,
inference(sat_conversion,[],[f294]) ).
cnf(s3,plain,
spl14_2,
inference(sat_conversion,[],[f295]) ).
cnf(s4,plain,
$false,
inference(rat,[],[s1,s3,s2]) ).
fof(f296,plain,
$false,
inference(avatar_sat_refutation,[],[s4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET645+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.41 % Computer : n005.cluster.edu
% 0.13/0.41 % Model : x86_64 x86_64
% 0.13/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.41 % Memory : 8046.5625MB
% 0.13/0.41 % OS : Linux 6.8.0-71-generic
% 0.13/0.41 % CPULimit : 300
% 0.13/0.41 % WCLimit : 300
% 0.13/0.41 % DateTime : Mon Sep 28 02:27:53 UTC 2026
% 0.13/0.41 % CPUTime :
% 0.13/0.41 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.45 Running first-order model finding
% 0.13/0.45 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
% 0.19/0.51 % (372455)Will run a generic schedule for satisfiability detection.
% 0.19/0.51 % (372462)% WARNING: option uhcvi not known.
% 0.19/0.51 % (372463)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1775054673:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.51 % (372462)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3806902412:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.51 % (372461)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1276112176_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.51 % (372465)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1965847567:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.51 % (372464)dis+10_1_sil=32000:sp=arity:random_seed=1466783576:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.51 % (372466)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3923443482:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.51 % (372467)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=806883550:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.19/0.51 % (372466) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-372455-372466"...
% 0.19/0.51 % TRYING [1]
% 0.19/0.51 % TRYING [2]
% 0.19/0.51 % (372466)...printing done.
% 0.19/0.51 % (372466)Refutation found. Thanks to Tanya!
% 0.19/0.51 % SZS status Theorem for theBenchmark
% 0.19/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.51 % (372466)------------------------------
% 0.19/0.51 % (372466)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.51 % (372466)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.51 % (372466)CaDiCaL version: 2.1.3
% 0.19/0.51 % (372466)Termination reason: Refutation
% 0.19/0.51 % (372466)Time elapsed: 0.011 s
% 0.19/0.51 % (372466)Peak memory usage: 12 MB
% 0.19/0.51 % (372466)Instructions burned: 9 (million)
% 0.19/0.51 % (372455)Success in time 0.051 s
% 0.19/0.51 % Vampire exiting
%------------------------------------------------------------------------------