%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU251+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n006.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 12:52:36 PM UTC 2026
% Result : Theorem 2.47s 0.96s
% Output : Refutation 2.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 12
% Syntax : Number of formulae : 85 ( 23 unt; 5 def)
% Number of atoms : 261 ( 55 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 300 ( 124 ~; 124 |; 36 &)
% ( 10 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 6 con; 0-3 aty)
% Number of variables : 136 ( 0 sgn 128 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(f6,axiom,
! [X0] :
( relation(X0)
=> ! [X1,X2] :
( X2 = fiber(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( X3 != X1
& in(ordered_pair(X3,X1),X0) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_wellord1) ).
fof(f7,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(f8,axiom,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_tarski) ).
fof(f15,axiom,
! [X0,X1] :
( relation(X0)
=> relation(relation_restriction(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k2_wellord1) ).
fof(f30,axiom,
! [X0,X1,X2] :
( relation(X2)
=> ( in(X0,relation_restriction(X2,X1))
<=> ( in(X0,X2)
& in(X0,cartesian_product2(X1,X1)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t16_wellord1) ).
fof(f32,conjecture,
! [X0,X1,X2] :
( relation(X2)
=> subset(fiber(relation_restriction(X2,X0),X1),fiber(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t21_wellord1) ).
fof(f33,negated_conjecture,
~ ! [X0,X1,X2] :
( relation(X2)
=> subset(fiber(relation_restriction(X2,X0),X1),fiber(X2,X1)) ),
inference(negated_conjecture,[status(cth)],[f32]) ).
fof(f50,plain,
! [X0] :
( ! [X1,X2] :
( X2 = fiber(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( X3 != X1
& in(ordered_pair(X3,X1),X0) ) ) )
| ~ relation(X0) ),
inference(ennf_transformation,[],[f6]) ).
fof(f51,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f7]) ).
fof(f53,plain,
! [X0,X1] :
( relation(relation_restriction(X0,X1))
| ~ relation(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f54,plain,
! [X0,X1,X2] :
( ( in(X0,relation_restriction(X2,X1))
<=> ( in(X0,X2)
& in(X0,cartesian_product2(X1,X1)) ) )
| ~ relation(X2) ),
inference(ennf_transformation,[],[f30]) ).
fof(f56,plain,
? [X0,X1,X2] :
( ~ subset(fiber(relation_restriction(X2,X0),X1),fiber(X2,X1))
& relation(X2) ),
inference(ennf_transformation,[],[f33]) ).
fof(f65,plain,
! [X0] :
( ! [X1,X2] :
( ( X2 = fiber(X0,X1)
| ? [X3] :
( ( X1 = X3
| ~ in(ordered_pair(X3,X1),X0)
| ~ in(X3,X2) )
& ( ( X3 != X1
& in(ordered_pair(X3,X1),X0) )
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| X1 = X3
| ~ in(ordered_pair(X3,X1),X0) )
& ( ( X3 != X1
& in(ordered_pair(X3,X1),X0) )
| ~ in(X3,X2) ) )
| fiber(X0,X1) != X2 ) )
| ~ relation(X0) ),
inference(nnf_transformation,[],[f50]) ).
fof(f66,plain,
! [X0] :
( ! [X1,X2] :
( ( X2 = fiber(X0,X1)
| ? [X3] :
( ( X1 = X3
| ~ in(ordered_pair(X3,X1),X0)
| ~ in(X3,X2) )
& ( ( X3 != X1
& in(ordered_pair(X3,X1),X0) )
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| X1 = X3
| ~ in(ordered_pair(X3,X1),X0) )
& ( ( X3 != X1
& in(ordered_pair(X3,X1),X0) )
| ~ in(X3,X2) ) )
| fiber(X0,X1) != X2 ) )
| ~ relation(X0) ),
inference(flattening,[],[f65]) ).
fof(f67,plain,
! [X0] :
( ! [X1,X2] :
( ( X2 = fiber(X0,X1)
| ? [X3] :
( ( X1 = X3
| ~ in(ordered_pair(X3,X1),X0)
| ~ in(X3,X2) )
& ( ( X3 != X1
& in(ordered_pair(X3,X1),X0) )
| in(X3,X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| X1 = X4
| ~ in(ordered_pair(X4,X1),X0) )
& ( ( X1 != X4
& in(ordered_pair(X4,X1),X0) )
| ~ in(X4,X2) ) )
| fiber(X0,X1) != X2 ) )
| ~ relation(X0) ),
inference(rectify,[],[f66]) ).
fof(f68,plain,
! [X0] :
( ! [X1,X2] :
( ( X2 = fiber(X0,X1)
| ( ( sK0(X0,X1,X2) = X1
| ~ in(ordered_pair(sK0(X0,X1,X2),X1),X0)
| ~ in(sK0(X0,X1,X2),X2) )
& ( ( sK0(X0,X1,X2) != X1
& in(ordered_pair(sK0(X0,X1,X2),X1),X0) )
| in(sK0(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| X1 = X4
| ~ in(ordered_pair(X4,X1),X0) )
& ( ( X1 != X4
& in(ordered_pair(X4,X1),X0) )
| ~ in(X4,X2) ) )
| fiber(X0,X1) != X2 ) )
| ~ relation(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X3,sK0(X0,X1,X2))],[f67]) ).
fof(f69,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f51]) ).
fof(f70,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f69]) ).
fof(f71,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ in(sK1(X0,X1),X1)
& in(sK1(X0,X1),X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X2,sK1(X0,X1))],[f70]) ).
fof(f78,plain,
! [X0,X1,X2] :
( ( ( in(X0,relation_restriction(X2,X1))
| ~ in(X0,X2)
| ~ in(X0,cartesian_product2(X1,X1)) )
& ( ( in(X0,X2)
& in(X0,cartesian_product2(X1,X1)) )
| ~ in(X0,relation_restriction(X2,X1)) ) )
| ~ relation(X2) ),
inference(nnf_transformation,[],[f54]) ).
fof(f79,plain,
! [X0,X1,X2] :
( ( ( in(X0,relation_restriction(X2,X1))
| ~ in(X0,X2)
| ~ in(X0,cartesian_product2(X1,X1)) )
& ( ( in(X0,X2)
& in(X0,cartesian_product2(X1,X1)) )
| ~ in(X0,relation_restriction(X2,X1)) ) )
| ~ relation(X2) ),
inference(flattening,[],[f78]) ).
fof(f80,plain,
( ~ subset(fiber(relation_restriction(sK10,sK8),sK9),fiber(sK10,sK9))
& relation(sK10) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8,sK9,sK10]),skolemize(X0,sK8),skolemize(X1,sK9),skolemize(X2,sK10)],[f56]) ).
fof(f86,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f4]) ).
fof(f88,plain,
! [X2,X0,X1,X4] :
( in(ordered_pair(X4,X1),X0)
| ~ in(X4,X2)
| fiber(X0,X1) != X2
| ~ relation(X0) ),
inference(cnf_transformation,[],[f68]) ).
fof(f89,plain,
! [X2,X0,X1,X4] :
( X1 != X4
| ~ in(X4,X2)
| fiber(X0,X1) != X2
| ~ relation(X0) ),
inference(cnf_transformation,[],[f68]) ).
fof(f90,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| X1 = X4
| ~ in(ordered_pair(X4,X1),X0)
| fiber(X0,X1) != X2
| ~ relation(X0) ),
inference(cnf_transformation,[],[f68]) ).
fof(f94,plain,
! [X3,X0,X1] :
( ~ subset(X0,X1)
| ~ in(X3,X0)
| in(X3,X1) ),
inference(cnf_transformation,[],[f71]) ).
fof(f95,plain,
! [X0,X1] :
( subset(X0,X1)
| in(sK1(X0,X1),X0) ),
inference(cnf_transformation,[],[f71]) ).
fof(f96,plain,
! [X0,X1] :
( ~ in(sK1(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f71]) ).
fof(f97,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
inference(cnf_transformation,[],[f8]) ).
fof(f99,plain,
! [X0,X1] :
( relation(relation_restriction(X0,X1))
| ~ relation(X0) ),
inference(cnf_transformation,[],[f53]) ).
fof(f115,plain,
! [X2,X0,X1] :
( ~ in(X0,relation_restriction(X2,X1))
| in(X0,X2)
| ~ relation(X2) ),
inference(cnf_transformation,[],[f79]) ).
fof(f118,plain,
relation(sK10),
inference(cnf_transformation,[],[f80]) ).
fof(f119,plain,
~ subset(fiber(relation_restriction(sK10,sK8),sK9),fiber(sK10,sK9)),
inference(cnf_transformation,[],[f80]) ).
fof(f131,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| X1 = X4
| ~ in(unordered_pair(unordered_pair(X4,X1),singleton(X4)),X0)
| fiber(X0,X1) != X2
| ~ relation(X0) ),
inference(definition_unfolding,[],[f90,f97]) ).
fof(f132,plain,
! [X2,X0,X1,X4] :
( in(unordered_pair(unordered_pair(X4,X1),singleton(X4)),X0)
| ~ in(X4,X2)
| fiber(X0,X1) != X2
| ~ relation(X0) ),
inference(definition_unfolding,[],[f88,f97]) ).
fof(f134,plain,
! [X0,X1,X4] :
( ~ in(unordered_pair(unordered_pair(X4,X1),singleton(X4)),X0)
| X1 = X4
| in(X4,fiber(X0,X1))
| ~ relation(X0) ),
inference(equality_resolution,[],[f131]) ).
fof(f135,plain,
! [X2,X0,X4] :
( ~ in(X4,X2)
| fiber(X0,X4) != X2
| ~ relation(X0) ),
inference(equality_resolution,[],[f89]) ).
fof(f136,plain,
! [X0,X4] :
( ~ in(X4,fiber(X0,X4))
| ~ relation(X0) ),
inference(equality_resolution,[],[f135]) ).
fof(f137,plain,
! [X0,X1,X4] :
( ~ in(X4,fiber(X0,X1))
| in(unordered_pair(unordered_pair(X4,X1),singleton(X4)),X0)
| ~ relation(X0) ),
inference(equality_resolution,[],[f132]) ).
fof(f138,definition,
sF11 = relation_restriction(sK10,sK8),
introduced(definition,[new_symbols(definition,[sF11])],[function_definition]) ).
fof(f139,plain,
relation_restriction(sK10,sK8) = sF11,
inference(reorient_equations,[],[f138]) ).
fof(f140,definition,
sF12 = fiber(sF11,sK9),
introduced(definition,[new_symbols(definition,[sF12])],[function_definition]) ).
fof(f141,plain,
fiber(sF11,sK9) = sF12,
inference(reorient_equations,[],[f140]) ).
fof(f142,definition,
sF13 = fiber(sK10,sK9),
introduced(definition,[new_symbols(definition,[sF13])],[function_definition]) ).
fof(f143,plain,
fiber(sK10,sK9) = sF13,
inference(reorient_equations,[],[f142]) ).
fof(f144,plain,
~ subset(sF12,sF13),
inference(definition_folding,[],[f119,f143,f141,f139]) ).
fof(f156,plain,
( relation(sF11)
| ~ relation(sK10) ),
inference(superposition,[],[f99,f139]) ).
fof(f157,plain,
relation(sF11),
inference(forward_subsumption_resolution,[],[f156,f118]) ).
fof(f181,plain,
( ~ in(sK9,sF12)
| ~ relation(sF11) ),
inference(superposition,[],[f136,f141]) ).
fof(f182,plain,
( ~ in(sK9,sF13)
| ~ relation(sK10) ),
inference(superposition,[],[f136,f143]) ).
fof(f183,plain,
~ in(sK9,sF13),
inference(forward_subsumption_resolution,[],[f182,f118]) ).
fof(f184,plain,
~ in(sK9,sF12),
inference(forward_subsumption_resolution,[],[f181,f157]) ).
fof(f185,plain,
in(sK1(sF12,sF13),sF12),
inference(resolution,[],[f95,f144]) ).
fof(f194,plain,
! [X2,X0,X1] :
( ~ in(X0,X1)
| in(X0,X2)
| in(sK1(X1,X2),X1) ),
inference(resolution,[],[f94,f95]) ).
fof(f198,plain,
! [X0] :
( ~ in(X0,sF11)
| in(X0,sK10)
| ~ relation(sK10) ),
inference(superposition,[],[f115,f139]) ).
fof(f199,plain,
! [X0] :
( ~ in(X0,sF11)
| in(X0,sK10) ),
inference(forward_subsumption_resolution,[],[f198,f118]) ).
fof(f230,plain,
! [X0] :
( ~ in(X0,sF12)
| in(unordered_pair(unordered_pair(X0,sK9),singleton(X0)),sF11)
| ~ relation(sF11) ),
inference(superposition,[],[f137,f141]) ).
fof(f233,plain,
! [X0] :
( ~ in(X0,sF12)
| in(unordered_pair(unordered_pair(X0,sK9),singleton(X0)),sF11) ),
inference(forward_subsumption_resolution,[],[f230,f157]) ).
fof(f235,plain,
! [X0] :
( in(unordered_pair(singleton(X0),unordered_pair(X0,sK9)),sF11)
| ~ in(X0,sF12) ),
inference(forward_demodulation,[],[f233,f86]) ).
fof(f240,plain,
! [X2,X0,X1] :
( ~ in(unordered_pair(singleton(X0),unordered_pair(X0,X1)),X2)
| X0 = X1
| in(X0,fiber(X2,X1))
| ~ relation(X2) ),
inference(superposition,[],[f134,f86]) ).
fof(f319,plain,
! [X0] :
( in(unordered_pair(singleton(X0),unordered_pair(X0,sK9)),sK10)
| ~ in(X0,sF12) ),
inference(resolution,[],[f235,f199]) ).
fof(f388,plain,
! [X0] :
( in(sK1(sF12,sF13),X0)
| in(sK1(sF12,X0),sF12) ),
inference(resolution,[],[f194,f185]) ).
fof(f612,plain,
! [X0] :
( ~ in(X0,sF12)
| sK9 = X0
| in(X0,fiber(sK10,sK9))
| ~ relation(sK10) ),
inference(resolution,[],[f319,f240]) ).
fof(f620,plain,
! [X0] :
( ~ in(X0,sF12)
| sK9 = X0
| in(X0,fiber(sK10,sK9)) ),
inference(forward_subsumption_resolution,[],[f612,f118]) ).
fof(f621,plain,
! [X0] :
( ~ in(X0,sF12)
| in(X0,sF13)
| sK9 = X0 ),
inference(forward_demodulation,[],[f620,f143]) ).
fof(f1327,plain,
( in(sK1(sF12,sF13),sF13)
| sK9 = sK1(sF12,sF13) ),
inference(resolution,[],[f621,f185]) ).
fof(f1350,definition,
( spl14_49
<=> sK9 = sK1(sF12,sF13) ),
introduced(definition,[new_symbols(definition,[spl14_49])],[avatar_definition]) ).
fof(f1352,plain,
( sK9 = sK1(sF12,sF13)
| ~ spl14_49 ),
inference(avatar_component_clause,[],[f1350]) ).
fof(f1354,definition,
( spl14_50
<=> in(sK1(sF12,sF13),sF13) ),
introduced(definition,[new_symbols(definition,[spl14_50])],[avatar_definition]) ).
fof(f1356,plain,
( in(sK1(sF12,sF13),sF13)
| ~ spl14_50 ),
inference(avatar_component_clause,[],[f1354]) ).
fof(f1358,plain,
( spl14_49
| spl14_50 ),
inference(avatar_split_clause,[],[f1327,f1354,f1350]) ).
fof(f1567,plain,
( in(sK9,sF12)
| in(sK9,sF13)
| ~ spl14_49 ),
inference(superposition,[],[f388,f1352]) ).
fof(f1569,plain,
( in(sK9,sF13)
| ~ spl14_49 ),
inference(forward_subsumption_resolution,[],[f1567,f184]) ).
fof(f1572,plain,
( $false
| ~ spl14_49 ),
inference(forward_subsumption_resolution,[],[f1569,f183]) ).
fof(f1573,plain,
~ spl14_49,
inference(avatar_contradiction_clause,[],[f1572]) ).
fof(f1670,plain,
( subset(sF12,sF13)
| ~ spl14_50 ),
inference(resolution,[],[f1356,f96]) ).
fof(f1677,plain,
( $false
| ~ spl14_50 ),
inference(forward_subsumption_resolution,[],[f1670,f144]) ).
fof(f1678,plain,
~ spl14_50,
inference(avatar_contradiction_clause,[],[f1677]) ).
cnf(s38,plain,
( spl14_49
| spl14_50 ),
inference(sat_conversion,[],[f1358]) ).
cnf(s49,plain,
~ spl14_49,
inference(sat_conversion,[],[f1573]) ).
cnf(s50,plain,
~ spl14_50,
inference(sat_conversion,[],[f1678]) ).
cnf(s51,plain,
$false,
inference(rat,[],[s38,s50,s49]) ).
fof(f1679,plain,
$false,
inference(avatar_sat_refutation,[],[s51]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU251+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.40 % Computer : n006.cluster.edu
% 0.12/0.40 % Model : x86_64 x86_64
% 0.12/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.40 % Memory : 8046.5625MB
% 0.12/0.40 % OS : Linux 6.8.0-71-generic
% 0.12/0.40 % CPULimit : 300
% 0.12/0.40 % WCLimit : 300
% 0.12/0.40 % DateTime : Mon Sep 28 04:19:25 UTC 2026
% 0.12/0.40 % CPUTime :
% 0.12/0.40 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.43 Running first-order model finding
% 0.12/0.43 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.47/0.96 % (3575965)Will run a generic schedule for satisfiability detection.
% 2.47/0.96 % (3575970)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3412484591_2999 on theBenchmark for (2999ds/0Mi)
% 2.47/0.96 % TRYING [1]
% 2.47/0.96 % TRYING [2]
% 2.47/0.96 % TRYING [3]
% 2.47/0.96 % (3575971)% WARNING: option uhcvi not known.
% 2.47/0.96 % (3575971)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1260562167:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 2.47/0.96 % (3575975)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1841510787:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 2.47/0.96 % (3575973)dis+10_1_sil=32000:sp=arity:random_seed=1766100717:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 2.47/0.96 % (3575972)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3599569963:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 2.47/0.96 % (3575974)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2061619749:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 2.47/0.96 % (3575976)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2410886337:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 2.47/0.96 % TRYING [4]
% 2.47/0.96 % (3575973)Instruction limit reached!
% 2.47/0.96 % (3575973)------------------------------
% 2.47/0.96 % (3575973)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.47/0.96 % (3575973)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.47/0.96 % (3575973)CaDiCaL version: 2.1.3
% 2.47/0.96 % (3575973)Termination reason: Instruction limit
% 2.47/0.96 % (3575973)Termination phase: Saturation
% 2.47/0.96 % (3575973)Time elapsed: 0.067 s
% 2.47/0.96 % (3575973)Peak memory usage: 12 MB
% 2.47/0.96 % (3575973)Instructions burned: 104 (million)
% 2.47/0.96 % (3575974)Instruction limit reached!
% 2.47/0.96 % (3575974)------------------------------
% 2.47/0.96 % (3575974)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.47/0.96 % (3575974)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.47/0.96 % (3575974)CaDiCaL version: 2.1.3
% 2.47/0.96 % (3575974)Termination reason: Instruction limit
% 2.47/0.96 % (3575974)Termination phase: Saturation
% 2.47/0.96 % (3575974)Time elapsed: 0.072 s
% 2.47/0.96 % (3575974)Peak memory usage: 13 MB
% 2.47/0.96 % (3575974)Instructions burned: 116 (million)
% 2.47/0.96 % (3575975)Instruction limit reached!
% 2.47/0.96 % (3575975)------------------------------
% 2.47/0.96 % (3575975)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.47/0.96 % (3575975)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.47/0.96 % (3575975)CaDiCaL version: 2.1.3
% 2.47/0.96 % (3575975)Termination reason: Instruction limit
% 2.47/0.96 % (3575975)Termination phase: Saturation
% 2.47/0.96 % (3575975)Time elapsed: 0.080 s
% 2.47/0.96 % (3575975)Peak memory usage: 13 MB
% 2.47/0.96 % (3575975)Instructions burned: 131 (million)
% 2.47/0.96 % (3575984)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=4290060422:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 2.47/0.96 % TRYING [1]
% 2.47/0.96 % TRYING [2]
% 2.47/0.96 % (3575985)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2195876089:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 2.47/0.96 % TRYING [3]
% 2.47/0.96 % (3575986)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=2718864166:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 2.47/0.96 % (3575976)Instruction limit reached!
% 2.47/0.96 % (3575976)------------------------------
% 2.47/0.96 % (3575976)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.47/0.96 % (3575976)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.47/0.96 % (3575976)CaDiCaL version: 2.1.3
% 2.47/0.96 % (3575976)Termination reason: Instruction limit
% 2.47/0.96 % (3575976)Termination phase: Saturation
% 2.47/0.96 % (3575976)Time elapsed: 0.103 s
% 2.47/0.96 % (3575976)Peak memory usage: 14 MB
% 2.47/0.96 % (3575976)Instructions burned: 159 (million)
% 2.47/0.96 % TRYING [4]
% 2.47/0.96 % (3575990)ott-21_1_sil=16000:fs=off:random_seed=975320062:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 2.47/0.96 % (3575985)Instruction limit reached!
% 2.47/0.96 % (3575985)------------------------------
% 2.47/0.96 % (3575985)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.47/0.96 % (3575985)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.47/0.96 % (3575985)CaDiCaL version: 2.1.3
% 2.47/0.96 % (3575985)Termination reason: Instruction limit
% 2.47/0.96 % (3575985)Termination phase: Saturation
% 2.47/0.96 % (3575985)Time elapsed: 0.085 s
% 2.47/0.96 % (3575985)Peak memory usage: 13 MB
% 2.47/0.96 % (3575985)Instructions burned: 131 (million)
% 2.47/0.96 % (3575992)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=2081974843:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 2.47/0.96 % (3575990)Instruction limit reached!
% 2.47/0.96 % (3575990)------------------------------
% 2.47/0.96 % (3575990)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.47/0.96 % (3575990)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.47/0.96 % (3575990)CaDiCaL version: 2.1.3
% 2.47/0.96 % (3575990)Termination reason: Instruction limit
% 2.47/0.96 % (3575990)Termination phase: Saturation
% 2.47/0.96 % (3575990)Time elapsed: 0.100 s
% 2.47/0.96 % (3575990)Peak memory usage: 12 MB
% 2.47/0.96 % (3575990)Instructions burned: 180 (million)
% 2.47/0.96 % (3575994)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=1518696863:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 2.47/0.96 % TRYING [1]
% 2.47/0.96 % TRYING [2]
% 2.47/0.96 % TRYING [3]
% 2.47/0.96 % TRYING [5]
% 2.47/0.96 % TRYING [4]
% 2.47/0.96 % (3575986)Instruction limit reached!
% 2.47/0.96 % (3575986)------------------------------
% 2.47/0.96 % (3575986)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.47/0.96 % (3575986)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.47/0.96 % (3575986)CaDiCaL version: 2.1.3
% 2.47/0.96 % (3575986)Termination reason: Instruction limit
% 2.47/0.96 % (3575986)Termination phase: Saturation
% 2.47/0.96 % (3575986)Time elapsed: 0.318 s
% 2.47/0.96 % (3575986)Peak memory usage: 16 MB
% 2.47/0.96 % (3575986)Instructions burned: 684 (million)
% 2.47/0.96 % TRYING [5]
% 2.47/0.96 % (3575996)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=438422079:i=1179_2995 on theBenchmark for (2995ds/1179Mi)
% 2.47/0.96 % (3575996) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3575965-3575996"...
% 2.47/0.96 % (3575996)...printing done.
% 2.47/0.96 % (3575996)Refutation found. Thanks to Tanya!
% 2.47/0.96 % SZS status Theorem for theBenchmark
% 2.47/0.96 % SZS output start Proof for theBenchmark
% See solution above
% 2.47/0.96 % (3575996)------------------------------
% 2.47/0.96 % (3575996)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.47/0.96 % (3575996)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.47/0.96 % (3575996)CaDiCaL version: 2.1.3
% 2.47/0.96 % (3575996)Termination reason: Refutation
% 2.47/0.96 % (3575996)Time elapsed: 0.044 s
% 2.47/0.96 % (3575996)Peak memory usage: 13 MB
% 2.47/0.96 % (3575996)Instructions burned: 69 (million)
% 2.47/0.96 % (3575965)Success in time 0.518 s
% 2.47/0.96 % Vampire exiting
%------------------------------------------------------------------------------