%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU235+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 : n002.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:55 PM UTC 2026
% Result : Theorem 3.77s 1.56s
% Output : Refutation 5.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 14
% Syntax : Number of formulae : 79 ( 27 unt; 0 def)
% Number of atoms : 229 ( 14 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 259 ( 109 ~; 84 |; 42 &)
% ( 6 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-1 aty)
% Number of variables : 125 ( 115 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] :
( ordinal(X0)
=> ( epsilon_transitive(X0)
& epsilon_connected(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cc1_ordinal1) ).
fof(f9,axiom,
! [X0] :
( epsilon_transitive(X0)
<=> ! [X1] :
( in(X1,X0)
=> subset(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_ordinal1) ).
fof(f13,axiom,
! [X0] :
? [X1] : element(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',existence_m1_subset_1) ).
fof(f30,axiom,
! [X0,X1] :
( ( ordinal(X0)
& ordinal(X1) )
=> ( ordinal_subset(X0,X1)
<=> subset(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',redefinition_r1_ordinal1) ).
fof(f32,axiom,
! [X0,X1] : subset(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(f34,axiom,
! [X0,X1] :
( ordinal(X1)
=> ( in(X0,X1)
=> ordinal(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t23_ordinal1) ).
fof(f35,axiom,
! [X0] :
( ordinal(X0)
=> ! [X1] :
( ordinal(X1)
=> ~ ( ~ in(X0,X1)
& X0 != X1
& ~ in(X1,X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t24_ordinal1) ).
fof(f36,axiom,
! [X0,X1] :
( element(X0,X1)
=> ( empty(X1)
| in(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_subset) ).
fof(f37,conjecture,
! [X0,X1] :
( ordinal(X1)
=> ~ ( subset(X0,X1)
& X0 != empty_set
& ! [X2] :
( ordinal(X2)
=> ~ ( in(X2,X0)
& ! [X3] :
( ordinal(X3)
=> ( in(X3,X0)
=> ordinal_subset(X2,X3) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t32_ordinal1) ).
fof(f38,negated_conjecture,
~ ! [X0,X1] :
( ordinal(X1)
=> ~ ( subset(X0,X1)
& X0 != empty_set
& ! [X2] :
( ordinal(X2)
=> ~ ( in(X2,X0)
& ! [X3] :
( ordinal(X3)
=> ( in(X3,X0)
=> ordinal_subset(X2,X3) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f37]) ).
fof(f39,axiom,
! [X0,X1] :
( element(X0,powerset(X1))
<=> subset(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_subset) ).
fof(f40,axiom,
! [X0,X1,X2] :
( ( in(X0,X1)
& element(X1,powerset(X2)) )
=> element(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t4_subset) ).
fof(f41,axiom,
! [X0,X1,X2] :
~ ( in(X0,X1)
& element(X1,powerset(X2))
& empty(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t5_subset) ).
fof(f42,axiom,
! [X0] :
( empty(X0)
=> X0 = empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t6_boole) ).
fof(f44,axiom,
! [X0,X1] :
~ ( in(X0,X1)
& ! [X2] :
~ ( in(X2,X1)
& ! [X3] :
~ ( in(X3,X1)
& in(X3,X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t7_tarski) ).
fof(f46,plain,
! [X0] : subset(X0,X0),
inference(rectify,[],[f32]) ).
fof(f57,plain,
! [X0] :
( ( epsilon_transitive(X0)
& epsilon_connected(X0) )
| ~ ordinal(X0) ),
inference(ennf_transformation,[],[f3]) ).
fof(f66,plain,
! [X0] :
( epsilon_transitive(X0)
<=> ! [X1] :
( subset(X1,X0)
| ~ in(X1,X0) ) ),
inference(ennf_transformation,[],[f9]) ).
fof(f67,plain,
! [X0,X1] :
( ( ordinal_subset(X0,X1)
<=> subset(X0,X1) )
| ~ ordinal(X0)
| ~ ordinal(X1) ),
inference(ennf_transformation,[],[f30]) ).
fof(f68,plain,
! [X0,X1] :
( ( ordinal_subset(X0,X1)
<=> subset(X0,X1) )
| ~ ordinal(X0)
| ~ ordinal(X1) ),
inference(flattening,[],[f67]) ).
fof(f72,plain,
! [X0,X1] :
( ordinal(X0)
| ~ in(X0,X1)
| ~ ordinal(X1) ),
inference(ennf_transformation,[],[f34]) ).
fof(f73,plain,
! [X0,X1] :
( ordinal(X0)
| ~ in(X0,X1)
| ~ ordinal(X1) ),
inference(flattening,[],[f72]) ).
fof(f74,plain,
! [X0] :
( ! [X1] :
( in(X0,X1)
| X0 = X1
| in(X1,X0)
| ~ ordinal(X1) )
| ~ ordinal(X0) ),
inference(ennf_transformation,[],[f35]) ).
fof(f75,plain,
! [X0] :
( ! [X1] :
( in(X0,X1)
| X0 = X1
| in(X1,X0)
| ~ ordinal(X1) )
| ~ ordinal(X0) ),
inference(flattening,[],[f74]) ).
fof(f76,plain,
! [X0,X1] :
( empty(X1)
| in(X0,X1)
| ~ element(X0,X1) ),
inference(ennf_transformation,[],[f36]) ).
fof(f77,plain,
! [X0,X1] :
( empty(X1)
| in(X0,X1)
| ~ element(X0,X1) ),
inference(flattening,[],[f76]) ).
fof(f78,plain,
? [X0,X1] :
( subset(X0,X1)
& X0 != empty_set
& ! [X2] :
( ~ in(X2,X0)
| ? [X3] :
( ~ ordinal_subset(X2,X3)
& in(X3,X0)
& ordinal(X3) )
| ~ ordinal(X2) )
& ordinal(X1) ),
inference(ennf_transformation,[],[f38]) ).
fof(f79,plain,
? [X0,X1] :
( subset(X0,X1)
& X0 != empty_set
& ! [X2] :
( ~ in(X2,X0)
| ? [X3] :
( ~ ordinal_subset(X2,X3)
& in(X3,X0)
& ordinal(X3) )
| ~ ordinal(X2) )
& ordinal(X1) ),
inference(flattening,[],[f78]) ).
fof(f80,plain,
! [X0,X1,X2] :
( element(X0,X2)
| ~ in(X0,X1)
| ~ element(X1,powerset(X2)) ),
inference(ennf_transformation,[],[f40]) ).
fof(f81,plain,
! [X0,X1,X2] :
( element(X0,X2)
| ~ in(X0,X1)
| ~ element(X1,powerset(X2)) ),
inference(flattening,[],[f80]) ).
fof(f82,plain,
! [X0,X1,X2] :
( ~ in(X0,X1)
| ~ element(X1,powerset(X2))
| ~ empty(X2) ),
inference(ennf_transformation,[],[f41]) ).
fof(f83,plain,
! [X0] :
( X0 = empty_set
| ~ empty(X0) ),
inference(ennf_transformation,[],[f42]) ).
fof(f85,plain,
! [X0,X1] :
( ~ in(X0,X1)
| ? [X2] :
( in(X2,X1)
& ! [X3] :
( ~ in(X3,X1)
| ~ in(X3,X2) ) ) ),
inference(ennf_transformation,[],[f44]) ).
fof(f87,plain,
! [X0] :
( ( epsilon_transitive(X0)
| ? [X1] :
( ~ subset(X1,X0)
& in(X1,X0) ) )
& ( ! [X1] :
( subset(X1,X0)
| ~ in(X1,X0) )
| ~ epsilon_transitive(X0) ) ),
inference(nnf_transformation,[],[f66]) ).
fof(f88,plain,
! [X0] :
( ( epsilon_transitive(X0)
| ? [X1] :
( ~ subset(X1,X0)
& in(X1,X0) ) )
& ( ! [X2] :
( subset(X2,X0)
| ~ in(X2,X0) )
| ~ epsilon_transitive(X0) ) ),
inference(rectify,[],[f87]) ).
fof(f89,plain,
! [X0] :
( ( epsilon_transitive(X0)
| ( ~ subset(sK0(X0),X0)
& in(sK0(X0),X0) ) )
& ( ! [X2] :
( subset(X2,X0)
| ~ in(X2,X0) )
| ~ epsilon_transitive(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X1,sK0(X0))],[f88]) ).
fof(f90,plain,
! [X0] : element(sK1(X0),X0),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X1,sK1(X0))],[f13]) ).
fof(f103,plain,
! [X0,X1] :
( ( ( ordinal_subset(X0,X1)
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ~ ordinal_subset(X0,X1) ) )
| ~ ordinal(X0)
| ~ ordinal(X1) ),
inference(nnf_transformation,[],[f68]) ).
fof(f104,plain,
( subset(sK14,sK15)
& empty_set != sK14
& ! [X2] :
( ~ in(X2,sK14)
| ( ~ ordinal_subset(X2,sK16(X2))
& in(sK16(X2),sK14)
& ordinal(sK16(X2)) )
| ~ ordinal(X2) )
& ordinal(sK15) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK14,sK15,sK16]),skolemize(X0,sK14),skolemize(X1,sK15),skolemize(X3,sK16(X2))],[f79]) ).
fof(f105,plain,
! [X0,X1] :
( ( element(X0,powerset(X1))
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ~ element(X0,powerset(X1)) ) ),
inference(nnf_transformation,[],[f39]) ).
fof(f106,plain,
! [X0,X1] :
( ~ in(X0,X1)
| ( in(sK17(X1),X1)
& ! [X3] :
( ~ in(X3,X1)
| ~ in(X3,sK17(X1)) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK17]),skolemize(X2,sK17(X1))],[f85]) ).
fof(f110,plain,
! [X0] :
( ~ ordinal(X0)
| epsilon_transitive(X0) ),
inference(cnf_transformation,[],[f57]) ).
fof(f119,plain,
! [X2,X0] :
( ~ in(X2,X0)
| subset(X2,X0)
| ~ epsilon_transitive(X0) ),
inference(cnf_transformation,[],[f89]) ).
fof(f122,plain,
! [X0] : element(sK1(X0),X0),
inference(cnf_transformation,[],[f90]) ).
fof(f164,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| ordinal_subset(X0,X1)
| ~ ordinal(X0)
| ~ ordinal(X1) ),
inference(cnf_transformation,[],[f103]) ).
fof(f166,plain,
! [X0] : subset(X0,X0),
inference(cnf_transformation,[],[f46]) ).
fof(f168,plain,
! [X0,X1] :
( ~ in(X0,X1)
| ordinal(X0)
| ~ ordinal(X1) ),
inference(cnf_transformation,[],[f73]) ).
fof(f169,plain,
! [X0,X1] :
( in(X1,X0)
| in(X0,X1)
| X0 = X1
| ~ ordinal(X1)
| ~ ordinal(X0) ),
inference(cnf_transformation,[],[f75]) ).
fof(f170,plain,
! [X0,X1] :
( ~ element(X0,X1)
| in(X0,X1)
| empty(X1) ),
inference(cnf_transformation,[],[f77]) ).
fof(f171,plain,
ordinal(sK15),
inference(cnf_transformation,[],[f104]) ).
fof(f172,plain,
! [X2] :
( ~ in(X2,sK14)
| ordinal(sK16(X2))
| ~ ordinal(X2) ),
inference(cnf_transformation,[],[f104]) ).
fof(f173,plain,
! [X2] :
( in(sK16(X2),sK14)
| ~ in(X2,sK14)
| ~ ordinal(X2) ),
inference(cnf_transformation,[],[f104]) ).
fof(f174,plain,
! [X2] :
( ~ ordinal_subset(X2,sK16(X2))
| ~ in(X2,sK14)
| ~ ordinal(X2) ),
inference(cnf_transformation,[],[f104]) ).
fof(f175,plain,
empty_set != sK14,
inference(cnf_transformation,[],[f104]) ).
fof(f176,plain,
subset(sK14,sK15),
inference(cnf_transformation,[],[f104]) ).
fof(f178,plain,
! [X0,X1] :
( element(X0,powerset(X1))
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f105]) ).
fof(f179,plain,
! [X2,X0,X1] :
( ~ element(X1,powerset(X2))
| ~ in(X0,X1)
| element(X0,X2) ),
inference(cnf_transformation,[],[f81]) ).
fof(f180,plain,
! [X2,X0,X1] :
( ~ element(X1,powerset(X2))
| ~ in(X0,X1)
| ~ empty(X2) ),
inference(cnf_transformation,[],[f82]) ).
fof(f181,plain,
! [X0] :
( ~ empty(X0)
| empty_set = X0 ),
inference(cnf_transformation,[],[f83]) ).
fof(f183,plain,
! [X3,X0,X1] :
( ~ in(X3,sK17(X1))
| ~ in(X3,X1)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f106]) ).
fof(f184,plain,
! [X0,X1] :
( ~ in(X0,X1)
| in(sK17(X1),X1) ),
inference(cnf_transformation,[],[f106]) ).
fof(f194,plain,
~ empty(sK14),
inference(unit_resulting_resolution,[],[f181,f175]) ).
fof(f198,plain,
element(sK14,powerset(sK15)),
inference(unit_resulting_resolution,[],[f178,f176]) ).
fof(f306,plain,
in(sK1(sK14),sK14),
inference(unit_resulting_resolution,[],[f170,f194,f122]) ).
fof(f328,plain,
~ empty(sK15),
inference(unit_resulting_resolution,[],[f180,f198,f306]) ).
fof(f333,plain,
in(sK17(sK14),sK14),
inference(unit_resulting_resolution,[],[f184,f306]) ).
fof(f436,plain,
element(sK17(sK14),sK15),
inference(unit_resulting_resolution,[],[f179,f198,f333]) ).
fof(f703,plain,
in(sK17(sK14),sK15),
inference(unit_resulting_resolution,[],[f170,f328,f436]) ).
fof(f1318,plain,
ordinal(sK17(sK14)),
inference(unit_resulting_resolution,[],[f168,f171,f703]) ).
fof(f1348,plain,
ordinal(sK16(sK17(sK14))),
inference(unit_resulting_resolution,[],[f172,f333,f1318]) ).
fof(f1349,plain,
in(sK16(sK17(sK14)),sK14),
inference(unit_resulting_resolution,[],[f173,f333,f1318]) ).
fof(f1350,plain,
~ ordinal_subset(sK17(sK14),sK16(sK17(sK14))),
inference(unit_resulting_resolution,[],[f174,f333,f1318]) ).
fof(f2703,plain,
epsilon_transitive(sK16(sK17(sK14))),
inference(unit_resulting_resolution,[],[f110,f1348]) ).
fof(f3159,plain,
~ in(sK16(sK17(sK14)),sK17(sK14)),
inference(unit_resulting_resolution,[],[f183,f1349,f1349]) ).
fof(f4660,plain,
~ subset(sK17(sK14),sK16(sK17(sK14))),
inference(unit_resulting_resolution,[],[f164,f1318,f1348,f1350]) ).
fof(f5149,plain,
~ in(sK17(sK14),sK16(sK17(sK14))),
inference(unit_resulting_resolution,[],[f119,f2703,f4660]) ).
fof(f5326,plain,
sK17(sK14) = sK16(sK17(sK14)),
inference(unit_resulting_resolution,[],[f169,f1318,f1348,f3159,f5149]) ).
fof(f6092,plain,
~ subset(sK17(sK14),sK17(sK14)),
inference(superposition,[],[f4660,f5326]) ).
fof(f6107,plain,
$false,
inference(forward_subsumption_resolution,[],[f6092,f166]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU235+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.11/0.37 % Computer : n002.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 28 04:17:37 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/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
% 3.77/1.56 % (4138990)Detected formulas, will run a generic FOF schedule.
% 3.77/1.56 % (4138999)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1305166916:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.77/1.56 % (4138999)Instruction limit reached!
% 3.77/1.56 % (4138999)------------------------------
% 3.77/1.56 % (4138999)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.77/1.56 % (4138999)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.77/1.56 % (4138999)CaDiCaL version: 2.1.3
% 3.77/1.56 % (4138999)Termination reason: Instruction limit
% 3.77/1.56 % (4138999)Termination phase: Saturation
% 3.77/1.56 % (4138999)Time elapsed: 0.033 s
% 3.77/1.56 % (4138999)Peak memory usage: 88 MB
% 3.77/1.56 % (4138999)Instructions burned: 122 (million)
% 3.77/1.56 % (4138997)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=513844734:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.77/1.56 % (4138998)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2309864007:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.77/1.56 % (4139000)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3716371705:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.77/1.56 % (4138996)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=1421477105:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.77/1.56 % (4139001)dis-21_1_sil=8000:lcm=predicate:random_seed=854110332: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)
% 3.77/1.56 % (4138995)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=2678010441:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.77/1.56 % (4138998)Refutation not found, incomplete strategy
% 3.77/1.56 % (4138998)------------------------------
% 3.77/1.56 % (4138998)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.77/1.56 % (4138998)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.77/1.56 % (4138998)CaDiCaL version: 2.1.3
% 3.77/1.56 % (4138998)Termination reason: Refutation not found, incomplete strategy
% 3.77/1.56 % (4138998)Time elapsed: 0.003 s
% 3.77/1.56 % (4138998)Peak memory usage: 88 MB
% 3.77/1.56 % (4138998)Instructions burned: 2 (million)
% 3.77/1.56 % (4139001)Instruction limit reached!
% 3.77/1.56 % (4139001)------------------------------
% 3.77/1.56 % (4139001)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.77/1.56 % (4139001)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.77/1.56 % (4139001)CaDiCaL version: 2.1.3
% 3.77/1.56 % (4139001)Termination reason: Instruction limit
% 3.77/1.56 % (4139001)Termination phase: Saturation
% 3.77/1.56 % (4139001)Time elapsed: 0.077 s
% 3.77/1.56 % (4139001)Peak memory usage: 89 MB
% 3.77/1.56 % (4139001)Instructions burned: 130 (million)
% 3.77/1.56 % (4139000)Instruction limit reached!
% 3.77/1.56 % (4139000)------------------------------
% 3.77/1.56 % (4139000)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.77/1.56 % (4139000)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.77/1.56 % (4139000)CaDiCaL version: 2.1.3
% 3.77/1.56 % (4139000)Termination reason: Instruction limit
% 3.77/1.56 % (4139000)Termination phase: Saturation
% 3.77/1.56 % (4139000)Time elapsed: 0.104 s
% 3.77/1.56 % (4139000)Peak memory usage: 90 MB
% 3.77/1.56 % (4139000)Instructions burned: 140 (million)
% 3.77/1.56 % (4139003)lrs+10_1_sil=8000:sp=occurrence:random_seed=3203402118:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 3.77/1.56 % (4139003)Instruction limit reached!
% 3.77/1.56 % (4139003)------------------------------
% 3.77/1.56 % (4139003)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.77/1.56 % (4139003)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.77/1.56 % (4139003)CaDiCaL version: 2.1.3
% 3.77/1.56 % (4139003)Termination reason: Instruction limit
% 3.77/1.56 % (4139003)Termination phase: Saturation
% 3.77/1.56 % (4139003)Time elapsed: 0.097 s
% 3.77/1.56 % (4139003)Peak memory usage: 91 MB
% 3.77/1.56 % (4139003)Instructions burned: 287 (million)
% 3.77/1.56 % (4139010)lrs+10_1_sil=32000:urr=on:br=off:random_seed=2038730648:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 3.77/1.56 % (4139010)Refutation not found, incomplete strategy
% 3.77/1.56 % (4139010)------------------------------
% 3.77/1.56 % (4139010)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.77/1.56 % (4139010)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.77/1.56 % (4139010)CaDiCaL version: 2.1.3
% 3.77/1.56 % (4139010)Termination reason: Refutation not found, incomplete strategy
% 3.77/1.56 % (4139010)Time elapsed: 0.003 s
% 3.77/1.56 % (4139010)Peak memory usage: 89 MB
% 3.77/1.56 % (4139010)Instructions burned: 2 (million)
% 3.77/1.56 % (4138998)------------------------------
% 3.77/1.56 % (4138998)------------------------------
% 3.77/1.56 % (4139012)lrs+1011_1_sil=32000:sp=occurrence:random_seed=3378439281:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 3.77/1.56 % (4139013)dis+10_5:1_slsqr=1,4:sil=8000:fde=unused:erd=off:urr=full:fd=off:s2agt=8:br=off:slsq=on:random_seed=2933046517:s2a=on:i=248:s2at=1.23:gtg=position_2996 on theBenchmark for (2996ds/248Mi)
% 3.77/1.56 % (4139013)First to succeed.
% 3.77/1.56 % (4139013)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-4138990"
% 3.77/1.56 % (4139016)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=624849606:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2995 on theBenchmark for (2995ds/294Mi)
% 3.77/1.56 % (4139016)Refutation not found, incomplete strategy
% 3.77/1.56 % (4139016)------------------------------
% 3.77/1.56 % (4139016)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.77/1.56 % (4139016)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.77/1.56 % (4139016)CaDiCaL version: 2.1.3
% 3.77/1.56 % (4139016)Termination reason: Refutation not found, incomplete strategy
% 3.77/1.56 % (4139016)Time elapsed: 0.003 s
% 3.77/1.56 % (4139016)Peak memory usage: 88 MB
% 3.77/1.56 % (4139016)Instructions burned: 2 (million)
% 3.77/1.56 % (4139012)Instruction limit reached!
% 3.77/1.56 % (4139012)------------------------------
% 3.77/1.56 % (4139012)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.77/1.56 % (4139012)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.77/1.56 % (4139012)CaDiCaL version: 2.1.3
% 3.77/1.56 % (4139012)Termination reason: Instruction limit
% 3.77/1.56 % (4139012)Termination phase: Saturation
% 3.77/1.56 % (4139012)Time elapsed: 0.223 s
% 3.77/1.56 % (4139012)Peak memory usage: 91 MB
% 3.77/1.56 % (4139012)Instructions burned: 326 (million)
% 3.77/1.56 % (4139010)------------------------------
% 3.77/1.56 % (4139010)------------------------------
% 3.77/1.56 % (4139013)Refutation found. Thanks to Tanya!
% 3.77/1.56 % SZS status Theorem for theBenchmark
% 3.77/1.56 % SZS output start Proof for theBenchmark
% See solution above
% 5.59/1.76 % (4139013)------------------------------
% 5.59/1.76 % (4139013)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.59/1.76 % (4139013)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.59/1.76 % (4139013)CaDiCaL version: 2.1.3
% 5.59/1.76 % (4139013)Termination reason: Refutation
% 5.59/1.76 % (4139013)Time elapsed: 0.046 s
% 5.59/1.76 % (4139013)Peak memory usage: 90 MB
% 5.59/1.76 % (4139013)Instructions burned: 143 (million)
% 5.59/1.76 % (4139013)------------------------------
% 5.59/1.76 % (4139013)------------------------------
% 5.59/1.76 % (4138990)Success in time 0.707 s
% 5.59/1.76 % Vampire exiting
%------------------------------------------------------------------------------