%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET601+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 : n004.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:05 PM UTC 2026
% Result : Theorem 44.54s 16.83s
% Output : Refutation 44.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 33
% Number of leaves : 22
% Syntax : Number of formulae : 238 ( 178 unt; 10 def)
% Number of atoms : 369 ( 172 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 208 ( 77 ~; 100 |; 24 &)
% ( 6 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 13 con; 0-2 aty)
% Number of variables : 249 ( 242 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1,X2] : union(union(X0,X1),X2) = union(X0,union(X1,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',associativity_of_union) ).
fof(f2,axiom,
! [X0] : intersection(X0,X0) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',idempotency_of_intersection) ).
fof(f3,axiom,
! [X0,X1,X2] : intersection(intersection(X0,X1),X2) = intersection(X0,intersection(X1,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',associativity_of_intersection) ).
fof(f4,axiom,
! [X0,X1] : union(X0,intersection(X0,X1)) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',union_intersection) ).
fof(f5,axiom,
! [X0,X1,X2] : union(X0,intersection(X1,X2)) = intersection(union(X0,X1),union(X0,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',union_distributes_over_intersection) ).
fof(f6,axiom,
! [X0,X1,X2] :
( member(X2,union(X0,X1))
<=> ( member(X2,X0)
| member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',union_defn) ).
fof(f7,axiom,
! [X0,X1,X2] :
( member(X2,intersection(X0,X1))
<=> ( member(X2,X0)
& member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection_defn) ).
fof(f9,axiom,
! [X0,X1] : union(X0,X1) = union(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_of_union) ).
fof(f10,axiom,
! [X0,X1] : intersection(X0,X1) = intersection(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_of_intersection) ).
fof(f11,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset_defn) ).
fof(f13,axiom,
! [X0,X1] :
( X0 = X1
<=> ! [X2] :
( member(X2,X0)
<=> member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_member_defn) ).
fof(f14,conjecture,
! [X0,X1,X2] : union(union(intersection(X0,X1),intersection(X1,X2)),intersection(X2,X0)) = intersection(intersection(union(X0,X1),union(X1,X2)),union(X2,X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_th72) ).
fof(f15,negated_conjecture,
~ ! [X0,X1,X2] : union(union(intersection(X0,X1),intersection(X1,X2)),intersection(X2,X0)) = intersection(intersection(union(X0,X1),union(X1,X2)),union(X2,X0)),
inference(negated_conjecture,[status(cth)],[f14]) ).
fof(f16,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f11]) ).
fof(f17,plain,
? [X0,X1,X2] : union(union(intersection(X0,X1),intersection(X1,X2)),intersection(X2,X0)) != intersection(intersection(union(X0,X1),union(X1,X2)),union(X2,X0)),
inference(ennf_transformation,[],[f15]) ).
fof(f18,plain,
! [X0,X1,X2] :
( ( member(X2,union(X0,X1))
| ( ~ member(X2,X0)
& ~ member(X2,X1) ) )
& ( member(X2,X0)
| member(X2,X1)
| ~ member(X2,union(X0,X1)) ) ),
inference(nnf_transformation,[],[f6]) ).
fof(f19,plain,
! [X0,X1,X2] :
( ( member(X2,union(X0,X1))
| ( ~ member(X2,X0)
& ~ member(X2,X1) ) )
& ( member(X2,X0)
| member(X2,X1)
| ~ member(X2,union(X0,X1)) ) ),
inference(flattening,[],[f18]) ).
fof(f20,plain,
! [X0,X1,X2] :
( ( member(X2,intersection(X0,X1))
| ~ member(X2,X0)
| ~ member(X2,X1) )
& ( ( member(X2,X0)
& member(X2,X1) )
| ~ member(X2,intersection(X0,X1)) ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f21,plain,
! [X0,X1,X2] :
( ( member(X2,intersection(X0,X1))
| ~ member(X2,X0)
| ~ member(X2,X1) )
& ( ( member(X2,X0)
& member(X2,X1) )
| ~ member(X2,intersection(X0,X1)) ) ),
inference(flattening,[],[f20]) ).
fof(f24,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f16]) ).
fof(f25,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f24]) ).
fof(f26,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f25]) ).
fof(f27,plain,
! [X0,X1] :
( ( X0 = X1
| ? [X2] :
( ( ~ member(X2,X1)
| ~ member(X2,X0) )
& ( member(X2,X1)
| member(X2,X0) ) ) )
& ( ! [X2] :
( ( member(X2,X0)
| ~ member(X2,X1) )
& ( member(X2,X1)
| ~ member(X2,X0) ) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f13]) ).
fof(f28,plain,
! [X0,X1] :
( ( X0 = X1
| ? [X2] :
( ( ~ member(X2,X1)
| ~ member(X2,X0) )
& ( member(X2,X1)
| member(X2,X0) ) ) )
& ( ! [X3] :
( ( member(X3,X0)
| ~ member(X3,X1) )
& ( member(X3,X1)
| ~ member(X3,X0) ) )
| X0 != X1 ) ),
inference(rectify,[],[f27]) ).
fof(f29,plain,
! [X0,X1] :
( ( X0 = X1
| ( ( ~ member(sK1(X0,X1),X1)
| ~ member(sK1(X0,X1),X0) )
& ( member(sK1(X0,X1),X1)
| member(sK1(X0,X1),X0) ) ) )
& ( ! [X3] :
( ( member(X3,X0)
| ~ member(X3,X1) )
& ( member(X3,X1)
| ~ member(X3,X0) ) )
| X0 != X1 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X2,sK1(X0,X1))],[f28]) ).
fof(f30,plain,
union(union(intersection(sK2,sK3),intersection(sK3,sK4)),intersection(sK4,sK2)) != intersection(intersection(union(sK2,sK3),union(sK3,sK4)),union(sK4,sK2)),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3,sK4]),skolemize(X0,sK2),skolemize(X1,sK3),skolemize(X2,sK4)],[f17]) ).
fof(f31,plain,
! [X2,X0,X1] : union(union(X0,X1),X2) = union(X0,union(X1,X2)),
inference(cnf_transformation,[],[f1]) ).
fof(f32,plain,
! [X0] : intersection(X0,X0) = X0,
inference(cnf_transformation,[],[f2]) ).
fof(f33,plain,
! [X2,X0,X1] : intersection(intersection(X0,X1),X2) = intersection(X0,intersection(X1,X2)),
inference(cnf_transformation,[],[f3]) ).
fof(f34,plain,
! [X0,X1] : union(X0,intersection(X0,X1)) = X0,
inference(cnf_transformation,[],[f4]) ).
fof(f35,plain,
! [X2,X0,X1] : union(X0,intersection(X1,X2)) = intersection(union(X0,X1),union(X0,X2)),
inference(cnf_transformation,[],[f5]) ).
fof(f36,plain,
! [X2,X0,X1] :
( ~ member(X2,union(X0,X1))
| member(X2,X1)
| member(X2,X0) ),
inference(cnf_transformation,[],[f19]) ).
fof(f37,plain,
! [X2,X0,X1] :
( member(X2,union(X0,X1))
| ~ member(X2,X1) ),
inference(cnf_transformation,[],[f19]) ).
fof(f38,plain,
! [X2,X0,X1] :
( member(X2,union(X0,X1))
| ~ member(X2,X0) ),
inference(cnf_transformation,[],[f19]) ).
fof(f39,plain,
! [X2,X0,X1] :
( ~ member(X2,intersection(X0,X1))
| member(X2,X1) ),
inference(cnf_transformation,[],[f21]) ).
fof(f40,plain,
! [X2,X0,X1] :
( ~ member(X2,intersection(X0,X1))
| member(X2,X0) ),
inference(cnf_transformation,[],[f21]) ).
fof(f41,plain,
! [X2,X0,X1] :
( member(X2,intersection(X0,X1))
| ~ member(X2,X0)
| ~ member(X2,X1) ),
inference(cnf_transformation,[],[f21]) ).
fof(f45,plain,
! [X0,X1] : union(X0,X1) = union(X1,X0),
inference(cnf_transformation,[],[f9]) ).
fof(f46,plain,
! [X0,X1] : intersection(X0,X1) = intersection(X1,X0),
inference(cnf_transformation,[],[f10]) ).
fof(f47,plain,
! [X3,X0,X1] :
( ~ subset(X0,X1)
| ~ member(X3,X0)
| member(X3,X1) ),
inference(cnf_transformation,[],[f26]) ).
fof(f48,plain,
! [X0,X1] :
( member(sK0(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f26]) ).
fof(f49,plain,
! [X0,X1] :
( ~ member(sK0(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f26]) ).
fof(f53,plain,
! [X0,X1] :
( member(sK1(X0,X1),X1)
| member(sK1(X0,X1),X0)
| X0 = X1 ),
inference(cnf_transformation,[],[f29]) ).
fof(f54,plain,
! [X0,X1] :
( ~ member(sK1(X0,X1),X1)
| X0 = X1
| ~ member(sK1(X0,X1),X0) ),
inference(cnf_transformation,[],[f29]) ).
fof(f55,plain,
union(union(intersection(sK2,sK3),intersection(sK3,sK4)),intersection(sK4,sK2)) != intersection(intersection(union(sK2,sK3),union(sK3,sK4)),union(sK4,sK2)),
inference(cnf_transformation,[],[f30]) ).
fof(f60,definition,
sF5 = intersection(sK2,sK3),
introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).
fof(f61,plain,
intersection(sK2,sK3) = sF5,
inference(reorient_equations,[],[f60]) ).
fof(f62,definition,
sF6 = intersection(sK3,sK4),
introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).
fof(f63,plain,
intersection(sK3,sK4) = sF6,
inference(reorient_equations,[],[f62]) ).
fof(f64,definition,
sF7 = union(sF5,sF6),
introduced(definition,[new_symbols(definition,[sF7])],[function_definition]) ).
fof(f65,plain,
union(sF5,sF6) = sF7,
inference(reorient_equations,[],[f64]) ).
fof(f66,definition,
sF8 = intersection(sK4,sK2),
introduced(definition,[new_symbols(definition,[sF8])],[function_definition]) ).
fof(f67,plain,
intersection(sK4,sK2) = sF8,
inference(reorient_equations,[],[f66]) ).
fof(f68,definition,
sF9 = union(sF7,sF8),
introduced(definition,[new_symbols(definition,[sF9])],[function_definition]) ).
fof(f69,plain,
union(sF7,sF8) = sF9,
inference(reorient_equations,[],[f68]) ).
fof(f70,definition,
sF10 = union(sK2,sK3),
introduced(definition,[new_symbols(definition,[sF10])],[function_definition]) ).
fof(f71,plain,
union(sK2,sK3) = sF10,
inference(reorient_equations,[],[f70]) ).
fof(f72,definition,
sF11 = union(sK3,sK4),
introduced(definition,[new_symbols(definition,[sF11])],[function_definition]) ).
fof(f73,plain,
union(sK3,sK4) = sF11,
inference(reorient_equations,[],[f72]) ).
fof(f74,definition,
sF12 = intersection(sF10,sF11),
introduced(definition,[new_symbols(definition,[sF12])],[function_definition]) ).
fof(f75,plain,
intersection(sF10,sF11) = sF12,
inference(reorient_equations,[],[f74]) ).
fof(f76,definition,
sF13 = union(sK4,sK2),
introduced(definition,[new_symbols(definition,[sF13])],[function_definition]) ).
fof(f77,plain,
union(sK4,sK2) = sF13,
inference(reorient_equations,[],[f76]) ).
fof(f78,definition,
sF14 = intersection(sF12,sF13),
introduced(definition,[new_symbols(definition,[sF14])],[function_definition]) ).
fof(f79,plain,
intersection(sF12,sF13) = sF14,
inference(reorient_equations,[],[f78]) ).
fof(f80,plain,
sF9 != sF14,
inference(definition_folding,[],[f55,f79,f77,f75,f73,f71,f69,f67,f65,f63,f61]) ).
fof(f81,plain,
sF8 = intersection(sK2,sK4),
inference(forward_demodulation,[],[f67,f46]) ).
fof(f82,plain,
sF13 = union(sK2,sK4),
inference(forward_demodulation,[],[f77,f45]) ).
fof(f83,plain,
! [X0] : union(X0,X0) = X0,
inference(superposition,[],[f34,f32]) ).
fof(f84,plain,
sK2 = union(sK2,sF5),
inference(superposition,[],[f34,f61]) ).
fof(f85,plain,
sK2 = union(sK2,sF8),
inference(superposition,[],[f34,f81]) ).
fof(f86,plain,
sK3 = union(sK3,sF6),
inference(superposition,[],[f34,f63]) ).
fof(f88,plain,
sF12 = union(sF12,sF14),
inference(superposition,[],[f34,f79]) ).
fof(f90,plain,
! [X0,X1] : union(X1,intersection(X0,X1)) = X1,
inference(superposition,[],[f34,f46]) ).
fof(f101,plain,
! [X0] :
( ~ member(X0,sF8)
| member(X0,sF9) ),
inference(superposition,[],[f37,f69]) ).
fof(f124,plain,
! [X0] :
( ~ member(X0,sF14)
| member(X0,sF13) ),
inference(superposition,[],[f39,f79]) ).
fof(f135,plain,
! [X2,X0,X1] :
( member(sK0(intersection(X0,X1),X2),X0)
| subset(intersection(X0,X1),X2) ),
inference(resolution,[],[f48,f40]) ).
fof(f136,plain,
! [X2,X0,X1] :
( member(sK0(intersection(X0,X1),X2),X1)
| subset(intersection(X0,X1),X2) ),
inference(resolution,[],[f48,f39]) ).
fof(f140,plain,
! [X2,X0,X1] :
( ~ member(sK0(X0,union(X1,X2)),X1)
| subset(X0,union(X1,X2)) ),
inference(resolution,[],[f49,f38]) ).
fof(f153,plain,
! [X0] : union(sK2,union(sK3,X0)) = union(sF10,X0),
inference(superposition,[],[f31,f71]) ).
fof(f154,plain,
! [X0] : union(sK2,union(sK4,X0)) = union(sF13,X0),
inference(superposition,[],[f31,f82]) ).
fof(f155,plain,
! [X0] : union(sK2,union(sF5,X0)) = union(sK2,X0),
inference(superposition,[],[f31,f84]) ).
fof(f156,plain,
! [X0] : union(sK2,X0) = union(sK2,union(sF8,X0)),
inference(superposition,[],[f31,f85]) ).
fof(f157,plain,
! [X0] : union(sK3,union(sK4,X0)) = union(sF11,X0),
inference(superposition,[],[f31,f73]) ).
fof(f159,plain,
! [X0] : union(sF5,union(sF6,X0)) = union(sF7,X0),
inference(superposition,[],[f31,f65]) ).
fof(f160,plain,
! [X0] : union(sF7,union(sF8,X0)) = union(sF9,X0),
inference(superposition,[],[f31,f69]) ).
fof(f170,plain,
! [X2,X3,X0,X1] :
( member(X3,union(X0,union(X1,X2)))
| ~ member(X3,X2) ),
inference(superposition,[],[f37,f31]) ).
fof(f176,plain,
! [X0,X1] : intersection(X0,X1) = intersection(X0,intersection(X0,X1)),
inference(superposition,[],[f33,f32]) ).
fof(f178,plain,
! [X2,X0,X1] : intersection(intersection(X0,X1),X2) = intersection(X1,intersection(X0,X2)),
inference(superposition,[],[f33,f46]) ).
fof(f183,plain,
! [X0] : intersection(sF10,intersection(sF11,X0)) = intersection(sF12,X0),
inference(superposition,[],[f33,f75]) ).
fof(f184,plain,
! [X0] : intersection(sF12,intersection(sF13,X0)) = intersection(sF14,X0),
inference(superposition,[],[f33,f79]) ).
fof(f188,plain,
! [X0,X1] : intersection(X0,X1) = intersection(X0,intersection(X1,intersection(X0,X1))),
inference(superposition,[],[f32,f33]) ).
fof(f192,plain,
! [X2,X0,X1] : intersection(X0,intersection(X1,X2)) = intersection(X2,intersection(X0,X1)),
inference(superposition,[],[f46,f33]) ).
fof(f205,plain,
! [X0] :
( ~ member(X0,sF10)
| member(X0,sK3)
| member(X0,sK2) ),
inference(superposition,[],[f36,f71]) ).
fof(f206,plain,
! [X0] :
( ~ member(X0,sF13)
| member(X0,sK4)
| member(X0,sK2) ),
inference(superposition,[],[f36,f82]) ).
fof(f209,plain,
! [X0] :
( ~ member(X0,sF11)
| member(X0,sK4)
| member(X0,sK3) ),
inference(superposition,[],[f36,f73]) ).
fof(f224,plain,
! [X0] :
( ~ member(X0,sK3)
| ~ member(X0,sK2)
| member(X0,sF5) ),
inference(superposition,[],[f41,f61]) ).
fof(f225,plain,
! [X0] :
( ~ member(X0,sK4)
| ~ member(X0,sK2)
| member(X0,sF8) ),
inference(superposition,[],[f41,f81]) ).
fof(f226,plain,
! [X0] :
( ~ member(X0,sK4)
| ~ member(X0,sK3)
| member(X0,sF6) ),
inference(superposition,[],[f41,f63]) ).
fof(f232,plain,
! [X0,X1] : union(X0,intersection(X0,X1)) = intersection(X0,union(X0,X1)),
inference(superposition,[],[f35,f83]) ).
fof(f234,plain,
! [X2,X0,X1] : intersection(union(X0,X1),union(X1,X2)) = union(X1,intersection(X0,X2)),
inference(superposition,[],[f35,f45]) ).
fof(f240,plain,
! [X0] : union(sK3,intersection(sK4,X0)) = intersection(sF11,union(sK3,X0)),
inference(superposition,[],[f35,f73]) ).
fof(f242,plain,
! [X0] : union(sF5,intersection(sF6,X0)) = intersection(sF7,union(sF5,X0)),
inference(superposition,[],[f35,f65]) ).
fof(f249,plain,
! [X2,X0,X1] : union(X1,intersection(X2,X0)) = intersection(union(X1,X2),union(X0,X1)),
inference(superposition,[],[f35,f45]) ).
fof(f271,plain,
! [X2,X0,X1] : union(X0,intersection(X1,X2)) = intersection(union(X0,X2),union(X0,X1)),
inference(superposition,[],[f46,f35]) ).
fof(f287,plain,
! [X0,X1] : intersection(X0,union(X0,X1)) = X0,
inference(forward_demodulation,[],[f232,f34]) ).
fof(f313,plain,
! [X2,X0,X1] :
( member(sK1(intersection(X0,X1),X2),X2)
| member(sK1(intersection(X0,X1),X2),X1)
| intersection(X0,X1) = X2 ),
inference(resolution,[],[f53,f39]) ).
fof(f352,plain,
! [X2,X0,X1] : union(X2,intersection(X0,intersection(X1,X2))) = X2,
inference(superposition,[],[f90,f33]) ).
fof(f353,plain,
sK3 = union(sK3,sF5),
inference(superposition,[],[f90,f61]) ).
fof(f354,plain,
sK4 = union(sK4,sF8),
inference(superposition,[],[f90,f81]) ).
fof(f355,plain,
sK4 = union(sK4,sF6),
inference(superposition,[],[f90,f63]) ).
fof(f356,plain,
sF11 = union(sF11,sF12),
inference(superposition,[],[f90,f75]) ).
fof(f389,plain,
! [X0] : union(sF10,X0) = union(sK2,union(X0,sK3)),
inference(superposition,[],[f153,f45]) ).
fof(f416,plain,
union(sK2,sK4) = union(sF13,sF8),
inference(superposition,[],[f154,f354]) ).
fof(f421,plain,
! [X0] : union(sF13,X0) = union(sK2,union(X0,sK4)),
inference(superposition,[],[f154,f45]) ).
fof(f432,plain,
union(sK2,sK4) = union(sF8,sF13),
inference(forward_demodulation,[],[f416,f45]) ).
fof(f435,plain,
sF13 = union(sF8,sF13),
inference(forward_demodulation,[],[f432,f82]) ).
fof(f436,plain,
union(sK2,sK4) = union(sF13,sF6),
inference(superposition,[],[f154,f355]) ).
fof(f445,plain,
union(sK2,sK4) = union(sF6,sF13),
inference(forward_demodulation,[],[f436,f45]) ).
fof(f447,plain,
sF13 = union(sF6,sF13),
inference(forward_demodulation,[],[f445,f82]) ).
fof(f448,plain,
union(sK3,sK4) = union(sF11,sF8),
inference(superposition,[],[f157,f354]) ).
fof(f468,plain,
union(sK3,sK4) = union(sF8,sF11),
inference(forward_demodulation,[],[f448,f45]) ).
fof(f472,plain,
sF11 = union(sF8,sF11),
inference(forward_demodulation,[],[f468,f73]) ).
fof(f484,plain,
union(sF5,sF6) = union(sF7,sF6),
inference(superposition,[],[f159,f83]) ).
fof(f486,plain,
! [X0] : union(sF7,X0) = union(sF5,union(X0,sF6)),
inference(superposition,[],[f159,f45]) ).
fof(f494,plain,
union(sF5,sF6) = union(sF6,sF7),
inference(forward_demodulation,[],[f484,f45]) ).
fof(f498,plain,
sF7 = union(sF6,sF7),
inference(forward_demodulation,[],[f494,f65]) ).
fof(f510,plain,
union(sF7,sF8) = union(sF9,sF8),
inference(superposition,[],[f160,f83]) ).
fof(f520,plain,
union(sF7,sF8) = union(sF8,sF9),
inference(forward_demodulation,[],[f510,f45]) ).
fof(f524,plain,
sF9 = union(sF8,sF9),
inference(forward_demodulation,[],[f520,f69]) ).
fof(f544,plain,
sF14 = intersection(sF12,sF14),
inference(superposition,[],[f176,f79]) ).
fof(f657,plain,
! [X0] : intersection(sF12,X0) = intersection(sF10,intersection(X0,sF11)),
inference(superposition,[],[f183,f46]) ).
fof(f672,plain,
union(sF9,sF9) = union(sF7,sF9),
inference(superposition,[],[f160,f524]) ).
fof(f680,plain,
sF9 = union(sF7,sF9),
inference(forward_demodulation,[],[f672,f83]) ).
fof(f683,plain,
! [X0] : intersection(sF14,X0) = intersection(sF12,intersection(X0,sF13)),
inference(superposition,[],[f184,f46]) ).
fof(f1007,plain,
! [X0,X1] :
( member(X0,union(X1,sF12))
| ~ member(X0,sF14) ),
inference(superposition,[],[f170,f88]) ).
fof(f2413,plain,
! [X0] : union(sK3,intersection(sK4,X0)) = intersection(sF11,union(X0,sK3)),
inference(superposition,[],[f240,f45]) ).
fof(f3065,plain,
! [X0,X1] :
( subset(intersection(X0,X1),X0)
| subset(intersection(X0,X1),X0) ),
inference(resolution,[],[f135,f49]) ).
fof(f3144,plain,
! [X0,X1] : subset(intersection(X0,X1),X0),
inference(duplicate_literal_removal,[],[f3065]) ).
fof(f3189,plain,
! [X0] : subset(intersection(sF12,X0),sF10),
inference(superposition,[],[f3144,f183]) ).
fof(f3284,plain,
! [X0,X1] :
( subset(X0,union(X0,X1))
| subset(X0,union(X0,X1)) ),
inference(resolution,[],[f140,f48]) ).
fof(f3286,plain,
! [X2,X0,X1] :
( subset(intersection(X0,X1),union(X1,X2))
| subset(intersection(X0,X1),union(X1,X2)) ),
inference(resolution,[],[f140,f136]) ).
fof(f3340,plain,
! [X2,X0,X1] : subset(intersection(X0,X1),union(X1,X2)),
inference(duplicate_literal_removal,[],[f3286]) ).
fof(f3342,plain,
! [X0,X1] : subset(X0,union(X0,X1)),
inference(duplicate_literal_removal,[],[f3284]) ).
fof(f4185,plain,
! [X0] : intersection(sF9,union(sF8,X0)) = union(sF8,intersection(sF7,X0)),
inference(superposition,[],[f234,f69]) ).
fof(f4204,plain,
! [X2,X0,X1] : union(X0,intersection(X1,intersection(X2,X0))) = intersection(union(X1,X0),X0),
inference(superposition,[],[f234,f90]) ).
fof(f4263,plain,
! [X2,X3,X0,X1] : intersection(union(X0,intersection(X1,X2)),X3) = intersection(union(X0,X2),intersection(union(X1,X0),X3)),
inference(superposition,[],[f178,f234]) ).
fof(f4319,plain,
! [X2,X0,X1] : union(X0,intersection(X1,intersection(X2,X0))) = intersection(X0,union(X1,X0)),
inference(forward_demodulation,[],[f4204,f46]) ).
fof(f4372,plain,
! [X0,X1] : intersection(X0,union(X1,X0)) = X0,
inference(forward_demodulation,[],[f4319,f352]) ).
fof(f4534,plain,
! [X2,X0,X1] : union(X0,intersection(X1,X2)) = intersection(union(X0,X1),intersection(union(X2,X0),union(X0,intersection(X1,X2)))),
inference(superposition,[],[f188,f249]) ).
fof(f4545,plain,
! [X2,X0,X1] : union(X0,intersection(X1,X2)) = intersection(union(X0,intersection(X2,X1)),union(X0,intersection(X1,X2))),
inference(forward_demodulation,[],[f4534,f4263]) ).
fof(f4627,plain,
! [X2,X0,X1] : union(X0,intersection(X1,X2)) = union(X0,intersection(intersection(X2,X1),intersection(X1,X2))),
inference(forward_demodulation,[],[f4545,f35]) ).
fof(f4669,plain,
! [X2,X0,X1] : union(X0,intersection(X1,X2)) = union(X0,intersection(X2,intersection(intersection(X2,X1),X1))),
inference(forward_demodulation,[],[f4627,f192]) ).
fof(f4684,plain,
! [X2,X0,X1] : union(X0,intersection(X1,X2)) = union(X0,intersection(X2,intersection(X1,intersection(X2,X1)))),
inference(forward_demodulation,[],[f4669,f46]) ).
fof(f4695,plain,
! [X2,X0,X1] : union(X0,intersection(X1,X2)) = union(X0,intersection(X2,X1)),
inference(forward_demodulation,[],[f4684,f188]) ).
fof(f4736,plain,
! [X0] : subset(sF5,union(sF7,X0)),
inference(superposition,[],[f3342,f159]) ).
fof(f6880,plain,
! [X0,X1] :
( member(sK1(intersection(X0,X1),X1),X1)
| intersection(X0,X1) = X1 ),
inference(factoring,[],[f313]) ).
fof(f8062,plain,
sF6 = intersection(sF6,sF7),
inference(superposition,[],[f287,f498]) ).
fof(f8065,plain,
sF6 = intersection(sF6,sF13),
inference(superposition,[],[f287,f447]) ).
fof(f8071,plain,
sF8 = intersection(sF8,sF13),
inference(superposition,[],[f287,f435]) ).
fof(f8072,plain,
sF8 = intersection(sF8,sF11),
inference(superposition,[],[f287,f472]) ).
fof(f8327,plain,
subset(sF14,sF10),
inference(superposition,[],[f3189,f544]) ).
fof(f8396,plain,
! [X0] :
( ~ member(X0,sF14)
| member(X0,sF10) ),
inference(resolution,[],[f8327,f47]) ).
fof(f8839,plain,
subset(sF5,sF9),
inference(superposition,[],[f4736,f680]) ).
fof(f8934,plain,
! [X0] :
( ~ member(X0,sF5)
| member(X0,sF9) ),
inference(resolution,[],[f8839,f47]) ).
fof(f9957,plain,
! [X0] : subset(sF6,union(sF7,X0)),
inference(superposition,[],[f3340,f8062]) ).
fof(f12005,plain,
! [X0] :
( ~ member(X0,sF14)
| member(X0,sF11) ),
inference(superposition,[],[f1007,f356]) ).
fof(f14083,plain,
union(sK2,sK3) = union(sF10,sF8),
inference(superposition,[],[f156,f389]) ).
fof(f14154,plain,
union(sK2,sK3) = union(sF8,sF10),
inference(forward_demodulation,[],[f14083,f45]) ).
fof(f14175,plain,
sF10 = union(sF8,sF10),
inference(forward_demodulation,[],[f14154,f71]) ).
fof(f14227,plain,
sF8 = intersection(sF8,sF10),
inference(superposition,[],[f287,f14175]) ).
fof(f14275,plain,
union(sK2,sK4) = union(sF13,sF5),
inference(superposition,[],[f155,f421]) ).
fof(f14348,plain,
union(sK2,sK4) = union(sF5,sF13),
inference(forward_demodulation,[],[f14275,f45]) ).
fof(f14370,plain,
sF13 = union(sF5,sF13),
inference(forward_demodulation,[],[f14348,f82]) ).
fof(f14392,plain,
intersection(sF7,sF13) = union(sF5,intersection(sF6,sF13)),
inference(superposition,[],[f242,f14370]) ).
fof(f14451,plain,
union(sF5,sF6) = intersection(sF7,sF13),
inference(forward_demodulation,[],[f14392,f8065]) ).
fof(f14456,plain,
sF7 = intersection(sF7,sF13),
inference(forward_demodulation,[],[f14451,f65]) ).
fof(f14588,plain,
union(sF5,sK3) = union(sF7,sK3),
inference(superposition,[],[f486,f86]) ).
fof(f14664,plain,
union(sF5,sK3) = union(sK3,sF7),
inference(forward_demodulation,[],[f14588,f45]) ).
fof(f14680,plain,
union(sK3,sF5) = union(sK3,sF7),
inference(forward_demodulation,[],[f14664,f45]) ).
fof(f14687,plain,
sK3 = union(sK3,sF7),
inference(forward_demodulation,[],[f14680,f353]) ).
fof(f14741,plain,
sF7 = intersection(sF7,sK3),
inference(superposition,[],[f4372,f14687]) ).
fof(f14742,plain,
sF7 = intersection(sK3,sF7),
inference(forward_demodulation,[],[f14741,f46]) ).
fof(f16208,plain,
intersection(sF10,sF8) = intersection(sF12,sF8),
inference(superposition,[],[f657,f8072]) ).
fof(f16276,plain,
intersection(sF10,sF8) = intersection(sF8,sF12),
inference(forward_demodulation,[],[f16208,f46]) ).
fof(f16292,plain,
intersection(sF8,sF10) = intersection(sF8,sF12),
inference(forward_demodulation,[],[f16276,f46]) ).
fof(f16302,plain,
sF8 = intersection(sF8,sF12),
inference(forward_demodulation,[],[f16292,f14227]) ).
fof(f16575,plain,
intersection(sF12,sF8) = intersection(sF14,sF8),
inference(superposition,[],[f683,f8071]) ).
fof(f16650,plain,
intersection(sF12,sF8) = intersection(sF8,sF14),
inference(forward_demodulation,[],[f16575,f46]) ).
fof(f16666,plain,
intersection(sF8,sF12) = intersection(sF8,sF14),
inference(forward_demodulation,[],[f16650,f46]) ).
fof(f16676,plain,
sF8 = intersection(sF8,sF14),
inference(forward_demodulation,[],[f16666,f16302]) ).
fof(f16907,plain,
subset(sF6,sF9),
inference(superposition,[],[f9957,f680]) ).
fof(f17376,plain,
! [X0] :
( ~ member(X0,sF6)
| member(X0,sF9) ),
inference(resolution,[],[f16907,f47]) ).
fof(f25907,plain,
intersection(sF14,sF7) = intersection(sF12,sF7),
inference(superposition,[],[f683,f14456]) ).
fof(f25960,plain,
intersection(sF14,sF7) = intersection(sF7,sF12),
inference(forward_demodulation,[],[f25907,f46]) ).
fof(f25963,plain,
intersection(sF7,sF12) = intersection(sF7,sF14),
inference(forward_demodulation,[],[f25960,f46]) ).
fof(f30314,plain,
sF12 = union(sF12,sF8),
inference(superposition,[],[f90,f16302]) ).
fof(f30363,plain,
sF12 = union(sF8,sF12),
inference(forward_demodulation,[],[f30314,f45]) ).
fof(f31548,plain,
sF14 = union(sF14,sF8),
inference(superposition,[],[f90,f16676]) ).
fof(f31599,plain,
sF14 = union(sF8,sF14),
inference(forward_demodulation,[],[f31548,f45]) ).
fof(f45253,plain,
intersection(sF11,sF10) = union(sK3,intersection(sK4,sK2)),
inference(superposition,[],[f2413,f71]) ).
fof(f45347,plain,
intersection(sF11,sF10) = union(sK3,intersection(sK2,sK4)),
inference(forward_demodulation,[],[f45253,f4695]) ).
fof(f45367,plain,
intersection(sF11,sF10) = union(sK3,sF8),
inference(forward_demodulation,[],[f45347,f81]) ).
fof(f45385,plain,
intersection(sF10,sF11) = union(sK3,sF8),
inference(forward_demodulation,[],[f45367,f46]) ).
fof(f45395,plain,
sF12 = union(sK3,sF8),
inference(forward_demodulation,[],[f45385,f75]) ).
fof(f45434,plain,
! [X0] : union(sF8,intersection(X0,sK3)) = intersection(union(sF8,X0),sF12),
inference(superposition,[],[f249,f45395]) ).
fof(f45475,plain,
! [X0] : intersection(sF12,union(sF8,X0)) = union(sF8,intersection(X0,sK3)),
inference(forward_demodulation,[],[f45434,f46]) ).
fof(f47108,plain,
! [X0] : intersection(sF12,union(sF8,X0)) = union(sF8,intersection(X0,sF12)),
inference(superposition,[],[f271,f30363]) ).
fof(f47141,plain,
! [X0] : union(sF8,intersection(X0,sK3)) = union(sF8,intersection(X0,sF12)),
inference(forward_demodulation,[],[f47108,f45475]) ).
fof(f52797,plain,
intersection(sF9,sF14) = union(sF8,intersection(sF7,sF14)),
inference(superposition,[],[f4185,f31599]) ).
fof(f52936,plain,
intersection(sF9,sF14) = union(sF8,intersection(sF7,sF12)),
inference(forward_demodulation,[],[f52797,f25963]) ).
fof(f52969,plain,
intersection(sF9,sF14) = union(sF8,intersection(sF7,sK3)),
inference(forward_demodulation,[],[f52936,f47141]) ).
fof(f52987,plain,
intersection(sF9,sF14) = union(sF8,intersection(sK3,sF7)),
inference(forward_demodulation,[],[f52969,f4695]) ).
fof(f53001,plain,
union(sF8,sF7) = intersection(sF9,sF14),
inference(forward_demodulation,[],[f52987,f14742]) ).
fof(f53003,plain,
union(sF7,sF8) = intersection(sF9,sF14),
inference(forward_demodulation,[],[f53001,f45]) ).
fof(f53005,plain,
sF9 = intersection(sF9,sF14),
inference(forward_demodulation,[],[f53003,f69]) ).
fof(f79457,plain,
( member(sK1(sF9,sF14),sF14)
| sF9 = sF14 ),
inference(superposition,[],[f6880,f53005]) ).
fof(f79500,plain,
member(sK1(sF9,sF14),sF14),
inference(forward_subsumption_resolution,[],[f79457,f80]) ).
fof(f79501,plain,
( sF9 = sF14
| ~ member(sK1(sF9,sF14),sF9) ),
inference(resolution,[],[f79500,f54]) ).
fof(f79502,plain,
member(sK1(sF9,sF14),sF10),
inference(resolution,[],[f79500,f8396]) ).
fof(f79503,plain,
member(sK1(sF9,sF14),sF11),
inference(resolution,[],[f79500,f12005]) ).
fof(f79505,plain,
member(sK1(sF9,sF14),sF13),
inference(resolution,[],[f79500,f124]) ).
fof(f79506,plain,
~ member(sK1(sF9,sF14),sF9),
inference(forward_subsumption_resolution,[],[f79501,f80]) ).
fof(f79945,plain,
( member(sK1(sF9,sF14),sK3)
| member(sK1(sF9,sF14),sK2) ),
inference(resolution,[],[f79502,f205]) ).
fof(f80058,plain,
( member(sK1(sF9,sF14),sK4)
| member(sK1(sF9,sF14),sK3) ),
inference(resolution,[],[f79503,f209]) ).
fof(f80307,plain,
( member(sK1(sF9,sF14),sK4)
| member(sK1(sF9,sF14),sK2) ),
inference(resolution,[],[f79505,f206]) ).
fof(f81033,plain,
( member(sK1(sF9,sF14),sK3)
| ~ member(sK1(sF9,sF14),sK2)
| member(sK1(sF9,sF14),sF8) ),
inference(resolution,[],[f80058,f225]) ).
fof(f81036,plain,
( member(sK1(sF9,sF14),sF8)
| member(sK1(sF9,sF14),sK3) ),
inference(forward_subsumption_resolution,[],[f81033,f79945]) ).
fof(f81149,plain,
( member(sK1(sF9,sF14),sK2)
| ~ member(sK1(sF9,sF14),sK3)
| member(sK1(sF9,sF14),sF6) ),
inference(resolution,[],[f80307,f226]) ).
fof(f81153,plain,
( member(sK1(sF9,sF14),sF6)
| member(sK1(sF9,sF14),sK2) ),
inference(forward_subsumption_resolution,[],[f81149,f79945]) ).
fof(f81532,plain,
( member(sK1(sF9,sF14),sK3)
| member(sK1(sF9,sF14),sF9) ),
inference(resolution,[],[f81036,f101]) ).
fof(f81538,plain,
member(sK1(sF9,sF14),sK3),
inference(forward_subsumption_resolution,[],[f81532,f79506]) ).
fof(f81686,plain,
( ~ member(sK1(sF9,sF14),sK2)
| member(sK1(sF9,sF14),sF5) ),
inference(resolution,[],[f81538,f224]) ).
fof(f81814,plain,
( member(sK1(sF9,sF14),sK2)
| member(sK1(sF9,sF14),sF9) ),
inference(resolution,[],[f81153,f17376]) ).
fof(f81816,plain,
member(sK1(sF9,sF14),sK2),
inference(forward_subsumption_resolution,[],[f81814,f79506]) ).
fof(f82933,plain,
member(sK1(sF9,sF14),sF5),
inference(resolution,[],[f81686,f81816]) ).
fof(f83052,plain,
member(sK1(sF9,sF14),sF9),
inference(resolution,[],[f82933,f8934]) ).
fof(f83055,plain,
$false,
inference(forward_subsumption_resolution,[],[f83052,f79506]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET601+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/10.39 % Computer : n004.cluster.edu
% 0.10/10.39 % Model : x86_64 x86_64
% 0.10/10.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/10.39 % Memory : 8046.5625MB
% 0.10/10.39 % OS : Linux 6.8.0-71-generic
% 0.10/10.39 % CPULimit : 300
% 0.10/10.39 % WCLimit : 300
% 0.10/10.39 % DateTime : Mon Sep 28 02:17:48 UTC 2026
% 0.10/10.39 % CPUTime :
% 0.10/10.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.15/10.42 Running first-order model finding
% 0.15/10.42 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 15.36/12.68 % (4082596)Will run a generic schedule for satisfiability detection.
% 15.36/12.68 % (4082605)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3075194070:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 15.36/12.68 % (4082602)% WARNING: option uhcvi not known.
% 15.36/12.68 % (4082601)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1309916083_2999 on theBenchmark for (2999ds/0Mi)
% 15.36/12.68 % (4082607)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2003299183:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 15.36/12.68 % (4082602)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2840001340:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 15.36/12.68 % (4082603)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2415516177:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 15.36/12.68 % (4082604)dis+10_1_sil=32000:sp=arity:random_seed=1263817622:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 15.36/12.68 % (4082606)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3739701125:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 15.36/12.68 % TRYING [1]
% 15.36/12.68 % TRYING [2]
% 15.36/12.68 % TRYING [3]
% 15.36/12.68 % TRYING [4]
% 15.36/12.68 % TRYING [5]
% 15.36/12.68 % (4082605)Instruction limit reached!
% 15.36/12.68 % (4082605)------------------------------
% 15.36/12.68 % (4082605)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.36/12.68 % (4082605)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.36/12.68 % (4082605)CaDiCaL version: 2.1.3
% 15.36/12.68 % (4082605)Termination reason: Instruction limit
% 15.36/12.68 % (4082605)Termination phase: Saturation
% 15.36/12.68 % (4082605)Time elapsed: 0.038 s
% 15.36/12.68 % (4082605)Peak memory usage: 12 MB
% 15.36/12.68 % (4082605)Instructions burned: 119 (million)
% 15.36/12.68 % (4082615)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1291287427:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 15.36/12.68 % TRYING [1]
% 15.36/12.68 % TRYING [2]
% 15.36/12.68 % TRYING [3]
% 15.36/12.68 % TRYING [4]
% 15.36/12.68 % (4082604)Instruction limit reached!
% 15.36/12.68 % (4082604)------------------------------
% 15.36/12.68 % (4082604)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.36/12.69 % (4082604)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.36/12.69 % (4082604)CaDiCaL version: 2.1.3
% 15.36/12.69 % (4082604)Termination reason: Instruction limit
% 15.36/12.69 % (4082604)Termination phase: Saturation
% 15.36/12.69 % (4082604)Time elapsed: 0.060 s
% 15.36/12.69 % (4082604)Peak memory usage: 12 MB
% 15.36/12.69 % (4082604)Instructions burned: 104 (million)
% 15.36/12.69 % TRYING [5]
% 15.36/12.69 % (4082606)Instruction limit reached!
% 15.36/12.69 % (4082606)------------------------------
% 15.36/12.69 % (4082606)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.36/12.69 % (4082606)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.36/12.69 % (4082606)CaDiCaL version: 2.1.3
% 15.36/12.69 % (4082606)Termination reason: Instruction limit
% 15.36/12.69 % (4082606)Termination phase: Saturation
% 15.36/12.69 % (4082606)Time elapsed: 0.077 s
% 15.36/12.69 % (4082606)Peak memory usage: 12 MB
% 15.36/12.69 % (4082606)Instructions burned: 133 (million)
% 15.36/12.69 % (4082617)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=298934162:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 15.36/12.69 % TRYING [6]
% 15.36/12.69 % (4082618)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=238620446:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 15.36/12.69 % (4082607)Instruction limit reached!
% 15.36/12.69 % (4082607)------------------------------
% 15.36/12.69 % (4082607)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.36/12.69 % (4082607)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.36/12.69 % (4082607)CaDiCaL version: 2.1.3
% 15.36/12.69 % (4082607)Termination reason: Instruction limit
% 15.36/12.69 % (4082607)Termination phase: Saturation
% 15.36/12.69 % (4082607)Time elapsed: 0.098 s
% 15.36/12.69 % (4082607)Peak memory usage: 12 MB
% 15.36/12.69 % (4082607)Instructions burned: 160 (million)
% 15.36/12.69 % TRYING [6]
% 15.36/12.69 % (4082621)ott-21_1_sil=16000:fs=off:random_seed=1993702409:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 15.36/12.69 % (4082617)Instruction limit reached!
% 15.36/12.69 % (4082617)------------------------------
% 15.36/12.69 % (4082617)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 40.40/16.19 % (4082617)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 40.40/16.19 % (4082617)CaDiCaL version: 2.1.3
% 40.40/16.19 % (4082617)Termination reason: Instruction limit
% 40.40/16.19 % (4082617)Termination phase: Saturation
% 40.40/16.19 % (4082617)Time elapsed: 0.083 s
% 40.40/16.19 % (4082617)Peak memory usage: 13 MB
% 40.40/16.19 % (4082617)Instructions burned: 133 (million)
% 40.40/16.19 % (4082623)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=2407903636:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 40.40/16.19 % (4082621)Instruction limit reached!
% 40.40/16.19 % (4082621)------------------------------
% 40.40/16.19 % (4082621)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 40.40/16.19 % (4082621)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 40.40/16.19 % (4082621)CaDiCaL version: 2.1.3
% 40.40/16.19 % (4082621)Termination reason: Instruction limit
% 40.40/16.19 % (4082621)Termination phase: Saturation
% 40.40/16.19 % (4082621)Time elapsed: 0.075 s
% 40.40/16.19 % (4082621)Peak memory usage: 11 MB
% 40.40/16.19 % (4082621)Instructions burned: 180 (million)
% 40.40/16.19 % (4082625)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=2446527377:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 40.40/16.19 % TRYING [1]
% 40.40/16.19 % TRYING [2]
% 40.40/16.19 % TRYING [3]
% 40.40/16.19 % TRYING [7]
% 40.40/16.19 % (4082615)Instruction limit reached!
% 40.40/16.19 % (4082615)------------------------------
% 40.40/16.19 % (4082615)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 40.40/16.19 % (4082615)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 40.40/16.19 % (4082615)CaDiCaL version: 2.1.3
% 40.40/16.19 % (4082615)Termination reason: Instruction limit
% 40.40/16.19 % (4082615)Termination phase: Finite model building constraint generation
% 40.40/16.19 % (4082615)Time elapsed: 0.184 s
% 40.40/16.19 % (4082615)Peak memory usage: 25 MB
% 40.40/16.19 % (4082615)Instructions burned: 722 (million)
% 40.40/16.19 % TRYING [4]
% 40.40/16.19 % (4082627)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=4250511018:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 40.40/16.19 % TRYING [7]
% 40.40/16.19 % TRYING [5]
% 40.40/16.19 % TRYING [6]
% 40.40/16.19 % (4082618)Instruction limit reached!
% 40.40/16.19 % (4082618)------------------------------
% 40.40/16.19 % (4082618)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 40.40/16.19 % (4082618)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 40.40/16.19 % (4082618)CaDiCaL version: 2.1.3
% 40.40/16.19 % (4082618)Termination reason: Instruction limit
% 40.40/16.19 % (4082618)Termination phase: Saturation
% 40.40/16.19 % (4082618)Time elapsed: 0.359 s
% 40.40/16.19 % (4082618)Peak memory usage: 17 MB
% 40.40/16.19 % (4082618)Instructions burned: 685 (million)
% 40.40/16.19 % (4082623)Instruction limit reached!
% 40.40/16.19 % (4082623)------------------------------
% 40.40/16.19 % (4082623)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 40.40/16.19 % (4082623)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 40.40/16.19 % (4082623)CaDiCaL version: 2.1.3
% 40.40/16.19 % (4082623)Termination reason: Instruction limit
% 40.40/16.19 % (4082623)Termination phase: Saturation
% 40.40/16.19 % (4082623)Time elapsed: 0.276 s
% 40.40/16.19 % (4082623)Peak memory usage: 15 MB
% 40.40/16.19 % (4082623)Instructions burned: 478 (million)
% 40.40/16.19 % (4082629)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=7706402:i=889:ins=1_2995 on theBenchmark for (2995ds/889Mi)
% 40.40/16.19 % (4082630)ott+1_16_sil=32000:plsq=on:plsqc=2:sas=cadical:avsql=on:sp=reverse_frequency:plsqr=128,1:bsr=unit_only:rp=on:newcnf=on:random_seed=3190357425:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2995 on theBenchmark for (2995ds/692Mi)
% 40.40/16.19 % (4082625)Instruction limit reached!
% 40.40/16.19 % (4082625)------------------------------
% 40.40/16.19 % (4082625)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 40.40/16.19 % (4082625)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 40.40/16.19 % (4082625)CaDiCaL version: 2.1.3
% 40.40/16.19 % (4082625)Termination reason: Instruction limit
% 40.40/16.19 % (4082625)Termination phase: Finite model building SAT solving
% 40.40/16.19 % (4082625)Time elapsed: 0.328 s
% 40.40/16.19 % (4082625)Peak memory usage: 21 MB
% 40.40/16.19 % (4082625)Instructions burned: 865 (million)
% 40.40/16.19 % (4082633)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=4251915530:i=879:kws=inv_precedence:fsr=off_2994 on theBenchmark for (2994ds/879Mi)
% 44.54/16.83 % TRYING [14]
% 44.54/16.83 % TRYING [8]
% 44.54/16.83 % (4082627)Instruction limit reached!
% 44.54/16.83 % (4082627)------------------------------
% 44.54/16.83 % (4082627)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 44.54/16.83 % (4082627)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 44.54/16.83 % (4082627)CaDiCaL version: 2.1.3
% 44.54/16.83 % (4082627)Termination reason: Instruction limit
% 44.54/16.83 % (4082627)Termination phase: Saturation
% 44.54/16.83 % (4082627)Time elapsed: 0.363 s
% 44.54/16.83 % (4082627)Peak memory usage: 21 MB
% 44.54/16.83 % (4082627)Instructions burned: 1181 (million)
% 44.54/16.83 % (4082635)fmb+10_1_sil=64000:random_seed=3988385430:i=22061:nm=2:gsp=on_2993 on theBenchmark for (2993ds/22061Mi)
% 44.54/16.83 % TRYING [1]
% 44.54/16.83 % TRYING [2]
% 44.54/16.83 % TRYING [3]
% 44.54/16.83 % TRYING [4]
% 44.54/16.83 % TRYING [5]
% 44.54/16.83 % TRYING [6]
% 44.54/16.83 % (4082629)Instruction limit reached!
% 44.54/16.83 % (4082629)------------------------------
% 44.54/16.83 % (4082629)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 44.54/16.83 % (4082629)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 44.54/16.83 % (4082629)CaDiCaL version: 2.1.3
% 44.54/16.83 % (4082629)Termination reason: Instruction limit
% 44.54/16.83 % (4082629)Termination phase: Finite model building constraint generation
% 44.54/16.83 % (4082629)Time elapsed: 0.332 s
% 44.54/16.83 % (4082629)Peak memory usage: 78 MB
% 44.54/16.83 % (4082629)Instructions burned: 890 (million)
% 44.54/16.83 % (4082637)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=250157761:i=9515:nm=5_2991 on theBenchmark for (2991ds/9515Mi)
% 44.54/16.83 % TRYING [20]
% 44.54/16.83 % TRYING [7]
% 44.54/16.83 % (4082630)Instruction limit reached!
% 44.54/16.83 % (4082630)------------------------------
% 44.54/16.83 % (4082630)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 44.54/16.83 % (4082630)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 44.54/16.83 % (4082630)CaDiCaL version: 2.1.3
% 44.54/16.83 % (4082630)Termination reason: Instruction limit
% 44.54/16.83 % (4082630)Termination phase: Saturation
% 44.54/16.83 % (4082630)Time elapsed: 0.391 s
% 44.54/16.83 % (4082630)Peak memory usage: 17 MB
% 44.54/16.83 % (4082630)Instructions burned: 693 (million)
% 44.54/16.83 % (4082639)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=2607668125:fmbsr=1.7:i=920_2990 on theBenchmark for (2990ds/920Mi)
% 44.54/16.83 % TRYING [8]
% 44.54/16.83 % (4082633)Instruction limit reached!
% 44.54/16.83 % (4082633)------------------------------
% 44.54/16.83 % (4082633)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 44.54/16.83 % (4082633)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 44.54/16.83 % (4082633)CaDiCaL version: 2.1.3
% 44.54/16.83 % (4082633)Termination reason: Instruction limit
% 44.54/16.83 % (4082633)Termination phase: Saturation
% 44.54/16.83 % (4082633)Time elapsed: 0.455 s
% 44.54/16.83 % (4082633)Peak memory usage: 16 MB
% 44.54/16.83 % (4082633)Instructions burned: 879 (million)
% 44.54/16.83 % (4082641)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=2531586599:i=5131_2989 on theBenchmark for (2989ds/5131Mi)
% 44.54/16.83 % TRYING [8]
% 44.54/16.83 % (4082639)Instruction limit reached!
% 44.54/16.83 % (4082639)------------------------------
% 44.54/16.83 % (4082639)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 44.54/16.83 % (4082639)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 44.54/16.83 % (4082639)CaDiCaL version: 2.1.3
% 44.54/16.83 % (4082639)Termination reason: Instruction limit
% 44.54/16.83 % (4082639)Termination phase: Finite model building SAT solving
% 44.54/16.83 % (4082639)Time elapsed: 0.436 s
% 44.54/16.83 % (4082639)Peak memory usage: 59 MB
% 44.54/16.83 % (4082639)Instructions burned: 921 (million)
% 44.54/16.83 % TRYING [9]
% 44.54/16.83 % (4082643)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=1088784178:i=1472:ins=7:fdi=8:gsp=on_2986 on theBenchmark for (2986ds/1472Mi)
% 44.54/16.83 % TRYING [9]
% 44.54/16.83 % (4082643)Instruction limit reached!
% 44.54/16.83 % (4082643)------------------------------
% 44.54/16.83 % (4082643)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 44.54/16.83 % (4082643)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 44.54/16.83 % (4082643)CaDiCaL version: 2.1.3
% 44.54/16.83 % (4082643)Termination reason: Instruction limit
% 44.54/16.83 % (4082643)Termination phase: Saturation
% 44.54/16.83 % (4082643)Time elapsed: 0.835 s
% 44.54/16.83 % (4082643)Peak memory usage: 34 MB
% 44.54/16.83 % (4082643)Instructions burned: 1473 (million)
% 44.54/16.83 % (4082645)fmb+10_1_sil=16000:sas=cadical:bce=on:fmbss=77:random_seed=766077226:i=6324_2977 on theBenchmark for (2977ds/6324Mi)
% 44.54/16.83 % TRYING [77]
% 44.54/16.83 % TRYING [10]
% 44.54/16.83 % TRYING [10]
% 44.54/16.83 % (4082641)Instruction limit reached!
% 44.54/16.83 % (4082641)------------------------------
% 44.54/16.83 % (4082641)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 44.54/16.83 % (4082641)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 44.54/16.83 % (4082641)CaDiCaL version: 2.1.3
% 44.54/16.83 % (4082641)Termination reason: Instruction limit
% 44.54/16.83 % (4082641)Termination phase: Saturation
% 44.54/16.83 % (4082641)Time elapsed: 2.692 s
% 44.54/16.83 % (4082641)Peak memory usage: 47 MB
% 44.54/16.83 % (4082641)Instructions burned: 5131 (million)
% 44.54/16.83 % (4082693)fmb+10_1_fmbas=function:sil=32000:sas=cadical:fmbss=16:random_seed=4048934312:fmbsr=2.30978:i=2174_2962 on theBenchmark for (2962ds/2174Mi)
% 44.54/16.83 % TRYING [16]
% 44.54/16.83 % (4082637)Instruction limit reached!
% 44.54/16.83 % (4082637)------------------------------
% 44.54/16.83 % (4082637)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 44.54/16.83 % (4082637)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 44.54/16.83 % (4082637)CaDiCaL version: 2.1.3
% 44.54/16.83 % (4082637)Termination reason: Instruction limit
% 44.54/16.83 % (4082637)Termination phase: Finite model building constraint generation
% 44.54/16.83 % (4082637)Time elapsed: 3.434 s
% 44.54/16.83 % (4082637)Peak memory usage: 668 MB
% 44.54/16.83 % (4082637)Instructions burned: 9515 (million)
% 44.54/16.83 % (4082746)ott-2_1_sil=16000:newcnf=on:random_seed=1465937908:avsq=on:i=869:avsqr=1,16:kws=inv_arity_squared_2956 on theBenchmark for (2956ds/869Mi)
% 44.54/16.83 % (4082693)Instruction limit reached!
% 44.54/16.83 % (4082693)------------------------------
% 44.54/16.83 % (4082693)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 44.54/16.83 % (4082693)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 44.54/16.83 % (4082693)CaDiCaL version: 2.1.3
% 44.54/16.83 % (4082693)Termination reason: Instruction limit
% 44.54/16.83 % (4082693)Termination phase: Finite model building constraint generation
% 44.54/16.83 % (4082693)Time elapsed: 0.754 s
% 44.54/16.83 % (4082693)Peak memory usage: 139 MB
% 44.54/16.83 % (4082693)Instructions burned: 2176 (million)
% 44.54/16.83 % (4082803)ott+10_1_sil=32000:tgt=ground:random_seed=2319232033:i=5114:av=off_2954 on theBenchmark for (2954ds/5114Mi)
% 44.54/16.83 % (4082645)Instruction limit reached!
% 44.54/16.83 % (4082645)------------------------------
% 44.54/16.83 % (4082645)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 44.54/16.83 % (4082645)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 44.54/16.83 % (4082645)CaDiCaL version: 2.1.3
% 44.54/16.83 % (4082645)Termination reason: Instruction limit
% 44.54/16.83 % (4082645)Termination phase: Finite model building constraint generation
% 44.54/16.83 % (4082645)Time elapsed: 2.350 s
% 44.54/16.83 % (4082645)Peak memory usage: 508 MB
% 44.54/16.83 % (4082645)Instructions burned: 6325 (million)
% 44.54/16.83 % (4082805)fmb+10_1_sil=64000:sas=cadical:bce=on:rp=on:random_seed=66379866:i=54282_2953 on theBenchmark for (2953ds/54282Mi)
% 44.54/16.83 % TRYING [1]
% 44.54/16.83 % TRYING [2]
% 44.54/16.83 % TRYING [3]
% 44.54/16.83 % TRYING [4]
% 44.54/16.83 % TRYING [5]
% 44.54/16.83 % TRYING [6]
% 44.54/16.83 % (4082746)Instruction limit reached!
% 44.54/16.83 % (4082746)------------------------------
% 44.54/16.83 % (4082746)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 44.54/16.83 % (4082746)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 44.54/16.83 % (4082746)CaDiCaL version: 2.1.3
% 44.54/16.83 % (4082746)Termination reason: Instruction limit
% 44.54/16.83 % (4082746)Termination phase: Saturation
% 44.54/16.83 % (4082746)Time elapsed: 0.496 s
% 44.54/16.83 % (4082746)Peak memory usage: 17 MB
% 44.54/16.83 % (4082746)Instructions burned: 870 (million)
% 44.54/16.83 % TRYING [7]
% 44.54/16.83 % (4082807)dis-11_1_sil=16000:sp=reverse_frequency:alpa=true:random_seed=1853399522:i=3512:aac=none_2950 on theBenchmark for (2950ds/3512Mi)
% 44.54/16.83 % TRYING [8]
% 44.54/16.83 % TRYING [11]
% 44.54/16.83 % (4082635)Instruction limit reached!
% 44.54/16.83 % (4082635)------------------------------
% 44.54/16.83 % (4082635)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 44.54/16.83 % (4082635)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 44.54/16.83 % (4082635)CaDiCaL version: 2.1.3
% 44.54/16.83 % (4082635)Termination reason: Instruction limit
% 44.54/16.83 % (4082635)Termination phase: Finite model building constraint generation
% 44.54/16.83 % (4082635)Time elapsed: 5.114 s
% 44.54/16.83 % (4082635)Peak memory usage: 148 MB
% 44.54/16.83 % (4082635)Instructions burned: 22062 (million)
% 44.54/16.83 % (4082809)dis+21_1_sil=32000:sas=cadical:random_seed=3128896348:i=3773:amm=off_2942 on theBenchmark for (2942ds/3773Mi)
% 44.54/16.83 % TRYING [9]
% 44.54/16.83 % TRYING [11]
% 44.54/16.83 % (4082803) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-4082596-4082803"...
% 44.54/16.83 % (4082803)...printing done.
% 44.54/16.83 % (4082803)Refutation found. Thanks to Tanya!
% 44.54/16.83 % SZS status Theorem for theBenchmark
% 44.54/16.83 % SZS output start Proof for theBenchmark
% See solution above
% 44.54/16.84 % (4082803)------------------------------
% 44.54/16.84 % (4082803)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 44.54/16.84 % (4082803)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 44.54/16.84 % (4082803)CaDiCaL version: 2.1.3
% 44.54/16.84 % (4082803)Termination reason: Refutation
% 44.54/16.84 % (4082803)Time elapsed: 1.788 s
% 44.54/16.84 % (4082803)Peak memory usage: 37 MB
% 44.54/16.84 % (4082803)Instructions burned: 3088 (million)
% 44.54/16.84 % (4082596)Success in time 6.405 s
% 44.54/16.84 % Vampire exiting
%------------------------------------------------------------------------------