%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU240+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 : n012.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:47:57 PM UTC 2026
% Result : Theorem 0.37s 0.78s
% Output : Refutation 2.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 4
% Syntax : Number of formulae : 60 ( 4 unt; 0 def)
% Number of atoms : 285 ( 0 equ)
% Maximal formula atoms : 15 ( 4 avg)
% Number of connectives : 388 ( 163 ~; 161 |; 46 &)
% ( 7 <=>; 9 =>; 0 <=; 2 <~>)
% Maximal formula depth : 15 ( 7 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 126 ( 106 !; 20 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f6,axiom,
! [X0] :
( relation(X0)
=> ( transitive(X0)
<=> is_transitive_in(X0,relation_field(X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d16_relat_2) ).
fof(f9,axiom,
! [X0] :
( relation(X0)
=> ! [X1] :
( is_transitive_in(X0,X1)
<=> ! [X2,X3,X4] :
( ( in(X2,X1)
& in(X3,X1)
& in(X4,X1)
& in(ordered_pair(X2,X3),X0)
& in(ordered_pair(X3,X4),X0) )
=> in(ordered_pair(X2,X4),X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d8_relat_2) ).
fof(f25,conjecture,
! [X0] :
( relation(X0)
=> ( transitive(X0)
<=> ! [X1,X2,X3] :
( ( in(ordered_pair(X1,X2),X0)
& in(ordered_pair(X2,X3),X0) )
=> in(ordered_pair(X1,X3),X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l2_wellord1) ).
fof(f26,negated_conjecture,
~ ! [X0] :
( relation(X0)
=> ( transitive(X0)
<=> ! [X1,X2,X3] :
( ( in(ordered_pair(X1,X2),X0)
& in(ordered_pair(X2,X3),X0) )
=> in(ordered_pair(X1,X3),X0) ) ) ),
inference(negated_conjecture,[status(cth)],[f25]) ).
fof(f35,axiom,
! [X0,X1,X2] :
( relation(X2)
=> ( in(ordered_pair(X0,X1),X2)
=> ( in(X0,relation_field(X2))
& in(X1,relation_field(X2)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t30_relat_1) ).
fof(f39,plain,
? [X0] :
( ( transitive(X0)
<~> ! [X1,X2,X3] :
( in(ordered_pair(X1,X3),X0)
| ~ in(ordered_pair(X1,X2),X0)
| ~ in(ordered_pair(X2,X3),X0) ) )
& relation(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f40,plain,
? [X0] :
( ( transitive(X0)
<~> ! [X1,X2,X3] :
( in(ordered_pair(X1,X3),X0)
| ~ in(ordered_pair(X1,X2),X0)
| ~ in(ordered_pair(X2,X3),X0) ) )
& relation(X0) ),
inference(flattening,[],[f39]) ).
fof(f43,plain,
! [X0] :
( ( transitive(X0)
<=> is_transitive_in(X0,relation_field(X0)) )
| ~ relation(X0) ),
inference(ennf_transformation,[],[f6]) ).
fof(f44,plain,
! [X0,X1,X2] :
( ( in(X0,relation_field(X2))
& in(X1,relation_field(X2)) )
| ~ in(ordered_pair(X0,X1),X2)
| ~ relation(X2) ),
inference(ennf_transformation,[],[f35]) ).
fof(f45,plain,
! [X0,X1,X2] :
( ( in(X0,relation_field(X2))
& in(X1,relation_field(X2)) )
| ~ in(ordered_pair(X0,X1),X2)
| ~ relation(X2) ),
inference(flattening,[],[f44]) ).
fof(f46,plain,
! [X0] :
( ! [X1] :
( is_transitive_in(X0,X1)
<=> ! [X2,X3,X4] :
( in(ordered_pair(X2,X4),X0)
| ~ in(X2,X1)
| ~ in(X3,X1)
| ~ in(X4,X1)
| ~ in(ordered_pair(X2,X3),X0)
| ~ in(ordered_pair(X3,X4),X0) ) )
| ~ relation(X0) ),
inference(ennf_transformation,[],[f9]) ).
fof(f47,plain,
! [X0] :
( ! [X1] :
( is_transitive_in(X0,X1)
<=> ! [X2,X3,X4] :
( in(ordered_pair(X2,X4),X0)
| ~ in(X2,X1)
| ~ in(X3,X1)
| ~ in(X4,X1)
| ~ in(ordered_pair(X2,X3),X0)
| ~ in(ordered_pair(X3,X4),X0) ) )
| ~ relation(X0) ),
inference(flattening,[],[f46]) ).
fof(f48,plain,
? [X0] :
( ( ? [X1,X2,X3] :
( ~ in(ordered_pair(X1,X3),X0)
& in(ordered_pair(X1,X2),X0)
& in(ordered_pair(X2,X3),X0) )
| ~ transitive(X0) )
& ( ! [X1,X2,X3] :
( in(ordered_pair(X1,X3),X0)
| ~ in(ordered_pair(X1,X2),X0)
| ~ in(ordered_pair(X2,X3),X0) )
| transitive(X0) )
& relation(X0) ),
inference(nnf_transformation,[],[f40]) ).
fof(f49,plain,
? [X0] :
( ( ? [X1,X2,X3] :
( ~ in(ordered_pair(X1,X3),X0)
& in(ordered_pair(X1,X2),X0)
& in(ordered_pair(X2,X3),X0) )
| ~ transitive(X0) )
& ( ! [X1,X2,X3] :
( in(ordered_pair(X1,X3),X0)
| ~ in(ordered_pair(X1,X2),X0)
| ~ in(ordered_pair(X2,X3),X0) )
| transitive(X0) )
& relation(X0) ),
inference(flattening,[],[f48]) ).
fof(f50,plain,
? [X0] :
( ( ? [X1,X2,X3] :
( ~ in(ordered_pair(X1,X3),X0)
& in(ordered_pair(X1,X2),X0)
& in(ordered_pair(X2,X3),X0) )
| ~ transitive(X0) )
& ( ! [X4,X5,X6] :
( in(ordered_pair(X4,X6),X0)
| ~ in(ordered_pair(X4,X5),X0)
| ~ in(ordered_pair(X5,X6),X0) )
| transitive(X0) )
& relation(X0) ),
inference(rectify,[],[f49]) ).
fof(f51,plain,
( ( ( ~ in(ordered_pair(sK1,sK3),sK0)
& in(ordered_pair(sK1,sK2),sK0)
& in(ordered_pair(sK2,sK3),sK0) )
| ~ transitive(sK0) )
& ( ! [X4,X5,X6] :
( in(ordered_pair(X4,X6),sK0)
| ~ in(ordered_pair(X4,X5),sK0)
| ~ in(ordered_pair(X5,X6),sK0) )
| transitive(sK0) )
& relation(sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f50]) ).
fof(f52,plain,
! [X0] :
( ( ( transitive(X0)
| ~ is_transitive_in(X0,relation_field(X0)) )
& ( is_transitive_in(X0,relation_field(X0))
| ~ transitive(X0) ) )
| ~ relation(X0) ),
inference(nnf_transformation,[],[f43]) ).
fof(f55,plain,
! [X0] :
( ! [X1] :
( ( is_transitive_in(X0,X1)
| ? [X2,X3,X4] :
( ~ in(ordered_pair(X2,X4),X0)
& in(X2,X1)
& in(X3,X1)
& in(X4,X1)
& in(ordered_pair(X2,X3),X0)
& in(ordered_pair(X3,X4),X0) ) )
& ( ! [X2,X3,X4] :
( in(ordered_pair(X2,X4),X0)
| ~ in(X2,X1)
| ~ in(X3,X1)
| ~ in(X4,X1)
| ~ in(ordered_pair(X2,X3),X0)
| ~ in(ordered_pair(X3,X4),X0) )
| ~ is_transitive_in(X0,X1) ) )
| ~ relation(X0) ),
inference(nnf_transformation,[],[f47]) ).
fof(f56,plain,
! [X0] :
( ! [X1] :
( ( is_transitive_in(X0,X1)
| ? [X2,X3,X4] :
( ~ in(ordered_pair(X2,X4),X0)
& in(X2,X1)
& in(X3,X1)
& in(X4,X1)
& in(ordered_pair(X2,X3),X0)
& in(ordered_pair(X3,X4),X0) ) )
& ( ! [X5,X6,X7] :
( in(ordered_pair(X5,X7),X0)
| ~ in(X5,X1)
| ~ in(X6,X1)
| ~ in(X7,X1)
| ~ in(ordered_pair(X5,X6),X0)
| ~ in(ordered_pair(X6,X7),X0) )
| ~ is_transitive_in(X0,X1) ) )
| ~ relation(X0) ),
inference(rectify,[],[f55]) ).
fof(f57,plain,
! [X0] :
( ! [X1] :
( ( is_transitive_in(X0,X1)
| ( ~ in(ordered_pair(sK6(X0,X1),sK8(X0,X1)),X0)
& in(sK6(X0,X1),X1)
& in(sK7(X0,X1),X1)
& in(sK8(X0,X1),X1)
& in(ordered_pair(sK6(X0,X1),sK7(X0,X1)),X0)
& in(ordered_pair(sK7(X0,X1),sK8(X0,X1)),X0) ) )
& ( ! [X5,X6,X7] :
( in(ordered_pair(X5,X7),X0)
| ~ in(X5,X1)
| ~ in(X6,X1)
| ~ in(X7,X1)
| ~ in(ordered_pair(X5,X6),X0)
| ~ in(ordered_pair(X6,X7),X0) )
| ~ is_transitive_in(X0,X1) ) )
| ~ relation(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK7,sK8]),skolemize(X2,sK6(X0,X1)),skolemize(X3,sK7(X0,X1)),skolemize(X4,sK8(X0,X1))],[f56]) ).
fof(f58,plain,
relation(sK0),
inference(cnf_transformation,[],[f51]) ).
fof(f59,plain,
! [X6,X4,X5] :
( in(ordered_pair(X4,X6),sK0)
| ~ in(ordered_pair(X4,X5),sK0)
| ~ in(ordered_pair(X5,X6),sK0)
| transitive(sK0) ),
inference(cnf_transformation,[],[f51]) ).
fof(f60,plain,
( in(ordered_pair(sK2,sK3),sK0)
| ~ transitive(sK0) ),
inference(cnf_transformation,[],[f51]) ).
fof(f61,plain,
( in(ordered_pair(sK1,sK2),sK0)
| ~ transitive(sK0) ),
inference(cnf_transformation,[],[f51]) ).
fof(f62,plain,
( ~ in(ordered_pair(sK1,sK3),sK0)
| ~ transitive(sK0) ),
inference(cnf_transformation,[],[f51]) ).
fof(f66,plain,
! [X0] :
( is_transitive_in(X0,relation_field(X0))
| ~ transitive(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f52]) ).
fof(f67,plain,
! [X0] :
( ~ is_transitive_in(X0,relation_field(X0))
| transitive(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f52]) ).
fof(f70,plain,
! [X2,X0,X1] :
( ~ in(ordered_pair(X0,X1),X2)
| in(X1,relation_field(X2))
| ~ relation(X2) ),
inference(cnf_transformation,[],[f45]) ).
fof(f71,plain,
! [X2,X0,X1] :
( ~ in(ordered_pair(X0,X1),X2)
| in(X0,relation_field(X2))
| ~ relation(X2) ),
inference(cnf_transformation,[],[f45]) ).
fof(f72,plain,
! [X0,X1,X6,X7,X5] :
( in(ordered_pair(X5,X7),X0)
| ~ in(X5,X1)
| ~ in(X6,X1)
| ~ in(X7,X1)
| ~ in(ordered_pair(X5,X6),X0)
| ~ in(ordered_pair(X6,X7),X0)
| ~ is_transitive_in(X0,X1)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f57]) ).
fof(f73,plain,
! [X0,X1] :
( in(ordered_pair(sK7(X0,X1),sK8(X0,X1)),X0)
| is_transitive_in(X0,X1)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f57]) ).
fof(f74,plain,
! [X0,X1] :
( in(ordered_pair(sK6(X0,X1),sK7(X0,X1)),X0)
| is_transitive_in(X0,X1)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f57]) ).
fof(f78,plain,
! [X0,X1] :
( ~ in(ordered_pair(sK6(X0,X1),sK8(X0,X1)),X0)
| is_transitive_in(X0,X1)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f57]) ).
fof(f97,plain,
( in(sK3,relation_field(sK0))
| ~ relation(sK0)
| ~ transitive(sK0) ),
inference(resolution,[],[f70,f60]) ).
fof(f98,plain,
( in(sK2,relation_field(sK0))
| ~ relation(sK0)
| ~ transitive(sK0) ),
inference(resolution,[],[f70,f61]) ).
fof(f100,plain,
( in(sK2,relation_field(sK0))
| ~ transitive(sK0) ),
inference(forward_subsumption_resolution,[],[f98,f58]) ).
fof(f101,plain,
( in(sK3,relation_field(sK0))
| ~ transitive(sK0) ),
inference(forward_subsumption_resolution,[],[f97,f58]) ).
fof(f105,plain,
( in(sK1,relation_field(sK0))
| ~ relation(sK0)
| ~ transitive(sK0) ),
inference(resolution,[],[f71,f61]) ).
fof(f107,plain,
( in(sK1,relation_field(sK0))
| ~ transitive(sK0) ),
inference(forward_subsumption_resolution,[],[f105,f58]) ).
fof(f124,plain,
! [X0,X1] :
( is_transitive_in(sK0,X0)
| ~ relation(sK0)
| ~ in(ordered_pair(sK6(sK0,X0),X1),sK0)
| ~ in(ordered_pair(X1,sK8(sK0,X0)),sK0)
| transitive(sK0) ),
inference(resolution,[],[f78,f59]) ).
fof(f125,plain,
! [X0,X1] :
( ~ in(ordered_pair(sK6(sK0,X0),X1),sK0)
| is_transitive_in(sK0,X0)
| ~ in(ordered_pair(X1,sK8(sK0,X0)),sK0)
| transitive(sK0) ),
inference(forward_subsumption_resolution,[],[f124,f58]) ).
fof(f127,plain,
! [X0] :
( is_transitive_in(sK0,X0)
| ~ in(ordered_pair(sK7(sK0,X0),sK8(sK0,X0)),sK0)
| transitive(sK0)
| is_transitive_in(sK0,X0)
| ~ relation(sK0) ),
inference(resolution,[],[f125,f74]) ).
fof(f128,plain,
! [X0] :
( is_transitive_in(sK0,X0)
| ~ in(ordered_pair(sK7(sK0,X0),sK8(sK0,X0)),sK0)
| transitive(sK0)
| ~ relation(sK0) ),
inference(duplicate_literal_removal,[],[f127]) ).
fof(f130,plain,
! [X0] :
( is_transitive_in(sK0,X0)
| transitive(sK0)
| ~ relation(sK0) ),
inference(forward_subsumption_resolution,[],[f128,f73]) ).
fof(f131,plain,
! [X0] :
( is_transitive_in(sK0,X0)
| transitive(sK0) ),
inference(forward_subsumption_resolution,[],[f130,f58]) ).
fof(f132,plain,
! [X0,X1] :
( ~ in(sK1,X0)
| ~ in(X1,X0)
| ~ in(sK3,X0)
| ~ in(ordered_pair(sK1,X1),sK0)
| ~ in(ordered_pair(X1,sK3),sK0)
| ~ is_transitive_in(sK0,X0)
| ~ relation(sK0)
| ~ transitive(sK0) ),
inference(resolution,[],[f72,f62]) ).
fof(f144,plain,
! [X0,X1] :
( ~ in(ordered_pair(sK1,X1),sK0)
| ~ in(X1,X0)
| ~ in(sK3,X0)
| ~ in(sK1,X0)
| ~ in(ordered_pair(X1,sK3),sK0)
| ~ is_transitive_in(sK0,X0)
| ~ transitive(sK0) ),
inference(forward_subsumption_resolution,[],[f132,f58]) ).
fof(f145,plain,
( transitive(sK0)
| transitive(sK0)
| ~ relation(sK0) ),
inference(resolution,[],[f131,f67]) ).
fof(f146,plain,
( transitive(sK0)
| ~ relation(sK0) ),
inference(duplicate_literal_removal,[],[f145]) ).
fof(f147,plain,
transitive(sK0),
inference(forward_subsumption_resolution,[],[f146,f58]) ).
fof(f148,plain,
! [X0] :
( ~ in(sK2,X0)
| ~ in(sK3,X0)
| ~ in(sK1,X0)
| ~ in(ordered_pair(sK2,sK3),sK0)
| ~ is_transitive_in(sK0,X0)
| ~ transitive(sK0)
| ~ transitive(sK0) ),
inference(resolution,[],[f144,f61]) ).
fof(f151,plain,
! [X0] :
( ~ in(sK2,X0)
| ~ in(sK3,X0)
| ~ in(sK1,X0)
| ~ in(ordered_pair(sK2,sK3),sK0)
| ~ is_transitive_in(sK0,X0)
| ~ transitive(sK0) ),
inference(duplicate_literal_removal,[],[f148]) ).
fof(f153,plain,
! [X0] :
( ~ in(sK2,X0)
| ~ in(sK3,X0)
| ~ in(sK1,X0)
| ~ is_transitive_in(sK0,X0)
| ~ transitive(sK0) ),
inference(forward_subsumption_resolution,[],[f151,f60]) ).
fof(f157,plain,
! [X0] :
( ~ is_transitive_in(sK0,X0)
| ~ in(sK3,X0)
| ~ in(sK1,X0)
| ~ in(sK2,X0) ),
inference(forward_subsumption_resolution,[],[f153,f147]) ).
fof(f159,plain,
( ~ in(sK3,relation_field(sK0))
| ~ in(sK1,relation_field(sK0))
| ~ in(sK2,relation_field(sK0))
| ~ transitive(sK0)
| ~ relation(sK0) ),
inference(resolution,[],[f157,f66]) ).
fof(f162,plain,
( ~ in(sK1,relation_field(sK0))
| ~ in(sK2,relation_field(sK0))
| ~ transitive(sK0)
| ~ relation(sK0) ),
inference(forward_subsumption_resolution,[],[f159,f101]) ).
fof(f163,plain,
( ~ in(sK2,relation_field(sK0))
| ~ transitive(sK0)
| ~ relation(sK0) ),
inference(forward_subsumption_resolution,[],[f162,f107]) ).
fof(f164,plain,
( ~ transitive(sK0)
| ~ relation(sK0) ),
inference(forward_subsumption_resolution,[],[f163,f100]) ).
fof(f165,plain,
~ relation(sK0),
inference(forward_subsumption_resolution,[],[f164,f147]) ).
fof(f166,plain,
$false,
inference(forward_subsumption_resolution,[],[f165,f58]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SEU240+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.02 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.03/0.30 % Computer : n012.cluster.edu
% 0.03/0.30 % Model : x86_64 x86_64
% 0.03/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.30 % Memory : 8046.5625MB
% 0.03/0.30 % OS : Linux 6.8.0-71-generic
% 0.03/0.30 % CPULimit : 300
% 0.03/0.30 % WCLimit : 300
% 0.03/0.30 % DateTime : Mon Sep 28 04:16:04 UTC 2026
% 0.03/0.30 % CPUTime :
% 0.03/0.30 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.03/0.32 Running first-order theorem proving
% 0.03/0.32 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
% 0.37/0.78 % (3009003)Detected formulas, will run a generic FOF schedule.
% 0.37/0.78 % (3009008)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=965975501:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 0.37/0.78 % (3009011)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=4069387854:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 0.37/0.78 % (3009009)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=1645047546:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 0.37/0.78 % (3009013)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3151573403:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 0.37/0.78 % (3009010)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=3826715869:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 0.37/0.78 % (3009014)dis-21_1_sil=8000:lcm=predicate:random_seed=3377803307: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)
% 0.37/0.78 % (3009012)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3146155102:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 0.37/0.78 % (3009011)Refutation not found, incomplete strategy
% 0.37/0.78 % (3009011)------------------------------
% 0.37/0.78 % (3009011)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.37/0.78 % (3009011)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.37/0.78 % (3009011)CaDiCaL version: 2.1.3
% 0.37/0.78 % (3009011)Termination reason: Refutation not found, incomplete strategy
% 0.37/0.78 % (3009011)Time elapsed: 0.0000 s
% 0.37/0.78 % (3009011)Peak memory usage: 87 MB
% 0.37/0.78 % (3009012)First to succeed.
% 0.37/0.78 % (3009012)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3009003"
% 0.37/0.78 % (3009013)Also succeeded, but the first one will report.
% 0.37/0.78 % (3009014)Instruction limit reached!
% 0.37/0.78 % (3009014)------------------------------
% 0.37/0.78 % (3009014)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.37/0.78 % (3009014)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.37/0.78 % (3009014)CaDiCaL version: 2.1.3
% 0.37/0.78 % (3009014)Termination reason: Instruction limit
% 0.37/0.78 % (3009014)Termination phase: Saturation
% 0.37/0.78 % (3009014)Time elapsed: 0.026 s
% 0.37/0.78 % (3009014)Peak memory usage: 88 MB
% 0.37/0.78 % (3009014)Instructions burned: 132 (million)
% 0.37/0.78 % (3009022)lrs+10_1_sil=8000:sp=occurrence:random_seed=3062428833:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 0.37/0.78 % (3009022)Also succeeded, but the first one will report.
% 0.37/0.78 % (3009011)------------------------------
% 0.37/0.78 % (3009011)------------------------------
% 0.37/0.78 % (3009012)Refutation found. Thanks to Tanya!
% 0.37/0.78 % SZS status Theorem for theBenchmark
% 0.37/0.78 % SZS output start Proof for theBenchmark
% See solution above
% 2.03/0.87 % (3009012)------------------------------
% 2.03/0.87 % (3009012)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.03/0.87 % (3009012)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.03/0.87 % (3009012)CaDiCaL version: 2.1.3
% 2.03/0.87 % (3009012)Termination reason: Refutation
% 2.03/0.87 % (3009012)Time elapsed: 0.002 s
% 2.03/0.87 % (3009012)Peak memory usage: 88 MB
% 2.03/0.87 % (3009012)Instructions burned: 5 (million)
% 2.03/0.87 % (3009012)------------------------------
% 2.03/0.87 % (3009012)------------------------------
% 2.03/0.87 % (3009003)Success in time 0.261 s
% 2.03/0.87 % Vampire exiting
%------------------------------------------------------------------------------