%------------------------------------------------------------------------------
% File : Vampire---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 THM
% Computer : n007.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:48:00 PM UTC 2026
% Result : Theorem 1.73s 1.13s
% Output : Refutation 2.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 8
% Syntax : Number of formulae : 69 ( 8 unt; 3 def)
% Number of atoms : 239 ( 39 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 286 ( 116 ~; 117 |; 36 &)
% ( 11 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 4 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-3 aty)
% Number of variables : 104 ( 0 sgn 96 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
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(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(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(f95,plain,
! [X0,X1] :
( in(sK1(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f71]) ).
fof(f96,plain,
! [X0,X1] :
( ~ in(sK1(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f71]) ).
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(f129,plain,
! [X0,X1,X4] :
( ~ in(ordered_pair(X4,X1),X0)
| X1 = X4
| in(X4,fiber(X0,X1))
| ~ relation(X0) ),
inference(equality_resolution,[],[f90]) ).
fof(f130,plain,
! [X2,X0,X4] :
( ~ in(X4,X2)
| fiber(X0,X4) != X2
| ~ relation(X0) ),
inference(equality_resolution,[],[f89]) ).
fof(f131,plain,
! [X0,X4] :
( ~ in(X4,fiber(X0,X4))
| ~ relation(X0) ),
inference(equality_resolution,[],[f130]) ).
fof(f132,plain,
! [X0,X1,X4] :
( ~ in(X4,fiber(X0,X1))
| in(ordered_pair(X4,X1),X0)
| ~ relation(X0) ),
inference(equality_resolution,[],[f88]) ).
fof(f148,plain,
! [X2,X0,X1] :
( subset(fiber(X0,X1),X2)
| ~ relation(X0)
| in(ordered_pair(sK1(fiber(X0,X1),X2),X1),X0) ),
inference(resolution,[],[f132,f95]) ).
fof(f219,plain,
( ~ relation(relation_restriction(sK10,sK8))
| in(ordered_pair(sK1(fiber(relation_restriction(sK10,sK8),sK9),fiber(sK10,sK9)),sK9),relation_restriction(sK10,sK8)) ),
inference(resolution,[],[f148,f119]) ).
fof(f222,definition,
( spl11_1
<=> in(ordered_pair(sK1(fiber(relation_restriction(sK10,sK8),sK9),fiber(sK10,sK9)),sK9),relation_restriction(sK10,sK8)) ),
introduced(definition,[new_symbols(definition,[spl11_1])],[avatar_definition]) ).
fof(f224,plain,
( in(ordered_pair(sK1(fiber(relation_restriction(sK10,sK8),sK9),fiber(sK10,sK9)),sK9),relation_restriction(sK10,sK8))
| ~ spl11_1 ),
inference(avatar_component_clause,[],[f222]) ).
fof(f226,definition,
( spl11_2
<=> relation(relation_restriction(sK10,sK8)) ),
introduced(definition,[new_symbols(definition,[spl11_2])],[avatar_definition]) ).
fof(f227,plain,
( relation(relation_restriction(sK10,sK8))
| ~ spl11_2 ),
inference(avatar_component_clause,[],[f226]) ).
fof(f228,plain,
( ~ relation(relation_restriction(sK10,sK8))
| spl11_2 ),
inference(avatar_component_clause,[],[f226]) ).
fof(f229,plain,
( spl11_1
| ~ spl11_2 ),
inference(avatar_split_clause,[],[f219,f226,f222]) ).
fof(f230,plain,
( ~ relation(sK10)
| spl11_2 ),
inference(resolution,[],[f228,f99]) ).
fof(f231,plain,
( $false
| spl11_2 ),
inference(forward_subsumption_resolution,[],[f230,f118]) ).
fof(f232,plain,
spl11_2,
inference(avatar_contradiction_clause,[],[f231]) ).
fof(f243,plain,
( in(ordered_pair(sK1(fiber(relation_restriction(sK10,sK8),sK9),fiber(sK10,sK9)),sK9),sK10)
| ~ relation(sK10)
| ~ spl11_1 ),
inference(resolution,[],[f224,f115]) ).
fof(f246,plain,
( in(ordered_pair(sK1(fiber(relation_restriction(sK10,sK8),sK9),fiber(sK10,sK9)),sK9),sK10)
| ~ spl11_1 ),
inference(forward_subsumption_resolution,[],[f243,f118]) ).
fof(f254,definition,
( spl11_4
<=> sK9 = sK1(fiber(relation_restriction(sK10,sK8),sK9),fiber(sK10,sK9)) ),
introduced(definition,[new_symbols(definition,[spl11_4])],[avatar_definition]) ).
fof(f255,plain,
( sK9 != sK1(fiber(relation_restriction(sK10,sK8),sK9),fiber(sK10,sK9))
| spl11_4 ),
inference(avatar_component_clause,[],[f254]) ).
fof(f256,plain,
( sK9 = sK1(fiber(relation_restriction(sK10,sK8),sK9),fiber(sK10,sK9))
| ~ spl11_4 ),
inference(avatar_component_clause,[],[f254]) ).
fof(f272,plain,
( in(sK9,fiber(relation_restriction(sK10,sK8),sK9))
| subset(fiber(relation_restriction(sK10,sK8),sK9),fiber(sK10,sK9))
| ~ spl11_4 ),
inference(superposition,[],[f95,f256]) ).
fof(f273,plain,
( in(sK9,fiber(relation_restriction(sK10,sK8),sK9))
| ~ spl11_4 ),
inference(forward_subsumption_resolution,[],[f272,f119]) ).
fof(f326,plain,
( ~ relation(relation_restriction(sK10,sK8))
| ~ spl11_4 ),
inference(resolution,[],[f273,f131]) ).
fof(f330,plain,
( $false
| ~ spl11_2
| ~ spl11_4 ),
inference(forward_subsumption_resolution,[],[f326,f227]) ).
fof(f331,plain,
( ~ spl11_2
| ~ spl11_4 ),
inference(avatar_contradiction_clause,[],[f330]) ).
fof(f332,plain,
( sK9 = sK1(fiber(relation_restriction(sK10,sK8),sK9),fiber(sK10,sK9))
| in(sK1(fiber(relation_restriction(sK10,sK8),sK9),fiber(sK10,sK9)),fiber(sK10,sK9))
| ~ relation(sK10)
| ~ spl11_1 ),
inference(resolution,[],[f246,f129]) ).
fof(f335,plain,
( in(sK1(fiber(relation_restriction(sK10,sK8),sK9),fiber(sK10,sK9)),fiber(sK10,sK9))
| ~ relation(sK10)
| ~ spl11_1
| spl11_4 ),
inference(forward_subsumption_resolution,[],[f332,f255]) ).
fof(f336,plain,
( in(sK1(fiber(relation_restriction(sK10,sK8),sK9),fiber(sK10,sK9)),fiber(sK10,sK9))
| ~ spl11_1
| spl11_4 ),
inference(forward_subsumption_resolution,[],[f335,f118]) ).
fof(f344,plain,
( subset(fiber(relation_restriction(sK10,sK8),sK9),fiber(sK10,sK9))
| ~ spl11_1
| spl11_4 ),
inference(resolution,[],[f336,f96]) ).
fof(f348,plain,
( $false
| ~ spl11_1
| spl11_4 ),
inference(forward_subsumption_resolution,[],[f344,f119]) ).
fof(f349,plain,
( ~ spl11_1
| spl11_4 ),
inference(avatar_contradiction_clause,[],[f348]) ).
cnf(s1,plain,
( spl11_1
| ~ spl11_2 ),
inference(sat_conversion,[],[f229]) ).
cnf(s2,plain,
spl11_2,
inference(sat_conversion,[],[f232]) ).
cnf(s5,plain,
( ~ spl11_2
| ~ spl11_4 ),
inference(sat_conversion,[],[f331]) ).
cnf(s6,plain,
( ~ spl11_1
| spl11_4 ),
inference(sat_conversion,[],[f349]) ).
cnf(s7,plain,
~ spl11_4,
inference(rat,[],[s5,s2]) ).
cnf(s8,plain,
~ spl11_1,
inference(rat,[],[s6,s7]) ).
cnf(s9,plain,
$false,
inference(rat,[],[s1,s2,s8]) ).
fof(f350,plain,
$false,
inference(avatar_sat_refutation,[],[s9]) ).
%------------------------------------------------------------------------------
%----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 THM
% 0.10/0.38 % Computer : n007.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Mon Sep 28 04:17:41 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.73/1.13 % (2019762)Detected formulas, will run a generic FOF schedule.
% 1.73/1.13 % (2019772)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=296550048:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 1.73/1.13 % (2019772)First to succeed.
% 1.73/1.13 % (2019772)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2019762"
% 1.73/1.13 % (2019768)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=2958239032:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 1.73/1.13 % (2019767)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=180110121:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 1.73/1.13 % (2019769)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=2917495594:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 1.73/1.13 % (2019770)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1202983167:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 1.73/1.13 % (2019773)dis-21_1_sil=8000:lcm=predicate:random_seed=3761340516:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 1.73/1.13 % (2019770)Refutation not found, incomplete strategy
% 1.73/1.13 % (2019770)------------------------------
% 1.73/1.13 % (2019770)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.73/1.13 % (2019770)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.73/1.13 % (2019770)CaDiCaL version: 2.1.3
% 1.73/1.13 % (2019770)Termination reason: Refutation not found, incomplete strategy
% 1.73/1.13 % (2019770)Time elapsed: 0.002 s
% 1.73/1.13 % (2019770)Peak memory usage: 88 MB
% 1.73/1.13 % (2019770)Instructions burned: 1 (million)
% 1.73/1.13 % (2019771)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2951482134:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 1.73/1.13 % (2019771)Instruction limit reached!
% 1.73/1.13 % (2019771)------------------------------
% 1.73/1.13 % (2019771)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.73/1.13 % (2019771)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.73/1.13 % (2019771)CaDiCaL version: 2.1.3
% 1.73/1.13 % (2019771)Termination reason: Instruction limit
% 1.73/1.13 % (2019771)Termination phase: Saturation
% 1.73/1.13 % (2019771)Time elapsed: 0.057 s
% 1.73/1.13 % (2019771)Peak memory usage: 88 MB
% 1.73/1.13 % (2019771)Instructions burned: 122 (million)
% 1.73/1.13 % (2019773)Instruction limit reached!
% 1.73/1.13 % (2019773)------------------------------
% 1.73/1.13 % (2019773)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.73/1.13 % (2019773)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.73/1.13 % (2019773)CaDiCaL version: 2.1.3
% 1.73/1.13 % (2019773)Termination reason: Instruction limit
% 1.73/1.13 % (2019773)Termination phase: Saturation
% 1.73/1.13 % (2019773)Time elapsed: 0.071 s
% 1.73/1.13 % (2019773)Peak memory usage: 88 MB
% 1.73/1.13 % (2019773)Instructions burned: 130 (million)
% 1.73/1.13 % (2019772)Refutation found. Thanks to Tanya!
% 1.73/1.13 % SZS status Theorem for theBenchmark
% 1.73/1.13 % SZS output start Proof for theBenchmark
% See solution above
% 2.53/1.32 % (2019772)------------------------------
% 2.53/1.32 % (2019772)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.53/1.32 % (2019772)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.53/1.32 % (2019772)CaDiCaL version: 2.1.3
% 2.53/1.32 % (2019772)Termination reason: Refutation
% 2.53/1.32 % (2019772)Time elapsed: 0.007 s
% 2.53/1.32 % (2019772)Peak memory usage: 90 MB
% 2.53/1.32 % (2019772)Instructions burned: 15 (million)
% 2.53/1.32 % (2019772)------------------------------
% 2.53/1.32 % (2019772)------------------------------
% 2.53/1.32 % (2019762)Success in time 0.27 s
% 2.53/1.32 % Vampire exiting
%------------------------------------------------------------------------------