%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU114+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n011.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:51:57 PM UTC 2026
% Result : Theorem 3.04s 0.94s
% Output : Refutation 3.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 11
% Syntax : Number of formulae : 60 ( 21 unt; 2 def)
% Number of atoms : 195 ( 28 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 218 ( 83 ~; 81 |; 39 &)
% ( 8 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 85 ( 79 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0] :
( finite(X0)
=> ! [X1] :
( element(X1,powerset(X0))
=> finite(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cc2_finset_1) ).
fof(f7,axiom,
! [X0,X1] :
( X0 = X1
<=> ( subset(X0,X1)
& subset(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d10_xboole_0) ).
fof(f8,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(f9,axiom,
! [X0,X1] :
( preboolean(X1)
=> ( X1 = finite_subsets(X0)
<=> ! [X2] :
( in(X2,X1)
<=> ( subset(X2,X0)
& finite(X2) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_finsub_1) ).
fof(f15,axiom,
! [X0] :
( ~ empty(finite_subsets(X0))
& cup_closed(finite_subsets(X0))
& diff_closed(finite_subsets(X0))
& preboolean(finite_subsets(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc2_finsub_1) ).
fof(f27,axiom,
! [X0,X1] :
( in(X0,X1)
=> element(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1_subset) ).
fof(f28,axiom,
! [X0] : subset(finite_subsets(X0),powerset(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t26_finsub_1) ).
fof(f29,conjecture,
! [X0] :
( finite(X0)
=> finite_subsets(X0) = powerset(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t27_finsub_1) ).
fof(f30,negated_conjecture,
~ ! [X0] :
( finite(X0)
=> finite_subsets(X0) = powerset(X0) ),
inference(negated_conjecture,[status(cth)],[f29]) ).
fof(f32,axiom,
! [X0,X1] :
( element(X0,powerset(X1))
<=> subset(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_subset) ).
fof(f50,plain,
! [X0] :
( ! [X1] :
( finite(X1)
| ~ element(X1,powerset(X0)) )
| ~ finite(X0) ),
inference(ennf_transformation,[],[f4]) ).
fof(f54,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f8]) ).
fof(f55,plain,
! [X0,X1] :
( ( X1 = finite_subsets(X0)
<=> ! [X2] :
( in(X2,X1)
<=> ( subset(X2,X0)
& finite(X2) ) ) )
| ~ preboolean(X1) ),
inference(ennf_transformation,[],[f9]) ).
fof(f61,plain,
! [X0,X1] :
( element(X0,X1)
| ~ in(X0,X1) ),
inference(ennf_transformation,[],[f27]) ).
fof(f62,plain,
? [X0] :
( powerset(X0) != finite_subsets(X0)
& finite(X0) ),
inference(ennf_transformation,[],[f30]) ).
fof(f71,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f72,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(flattening,[],[f71]) ).
fof(f73,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,[],[f54]) ).
fof(f74,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,[],[f73]) ).
fof(f75,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ in(sK0(X0,X1),X1)
& in(sK0(X0,X1),X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f74]) ).
fof(f76,plain,
! [X0,X1] :
( ( ( X1 = finite_subsets(X0)
| ? [X2] :
( ( ~ subset(X2,X0)
| ~ finite(X2)
| ~ in(X2,X1) )
& ( ( subset(X2,X0)
& finite(X2) )
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| ~ subset(X2,X0)
| ~ finite(X2) )
& ( ( subset(X2,X0)
& finite(X2) )
| ~ in(X2,X1) ) )
| finite_subsets(X0) != X1 ) )
| ~ preboolean(X1) ),
inference(nnf_transformation,[],[f55]) ).
fof(f77,plain,
! [X0,X1] :
( ( ( X1 = finite_subsets(X0)
| ? [X2] :
( ( ~ subset(X2,X0)
| ~ finite(X2)
| ~ in(X2,X1) )
& ( ( subset(X2,X0)
& finite(X2) )
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| ~ subset(X2,X0)
| ~ finite(X2) )
& ( ( subset(X2,X0)
& finite(X2) )
| ~ in(X2,X1) ) )
| finite_subsets(X0) != X1 ) )
| ~ preboolean(X1) ),
inference(flattening,[],[f76]) ).
fof(f78,plain,
! [X0,X1] :
( ( ( X1 = finite_subsets(X0)
| ? [X2] :
( ( ~ subset(X2,X0)
| ~ finite(X2)
| ~ in(X2,X1) )
& ( ( subset(X2,X0)
& finite(X2) )
| in(X2,X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| ~ subset(X3,X0)
| ~ finite(X3) )
& ( ( subset(X3,X0)
& finite(X3) )
| ~ in(X3,X1) ) )
| finite_subsets(X0) != X1 ) )
| ~ preboolean(X1) ),
inference(rectify,[],[f77]) ).
fof(f79,plain,
! [X0,X1] :
( ( ( X1 = finite_subsets(X0)
| ( ( ~ subset(sK1(X0,X1),X0)
| ~ finite(sK1(X0,X1))
| ~ in(sK1(X0,X1),X1) )
& ( ( subset(sK1(X0,X1),X0)
& finite(sK1(X0,X1)) )
| in(sK1(X0,X1),X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| ~ subset(X3,X0)
| ~ finite(X3) )
& ( ( subset(X3,X0)
& finite(X3) )
| ~ in(X3,X1) ) )
| finite_subsets(X0) != X1 ) )
| ~ preboolean(X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X2,sK1(X0,X1))],[f78]) ).
fof(f90,plain,
( powerset(sK12) != finite_subsets(sK12)
& finite(sK12) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK12]),skolemize(X0,sK12)],[f62]) ).
fof(f91,plain,
! [X0,X1] :
( ( element(X0,powerset(X1))
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ~ element(X0,powerset(X1)) ) ),
inference(nnf_transformation,[],[f32]) ).
fof(f96,plain,
! [X0,X1] :
( ~ element(X1,powerset(X0))
| finite(X1)
| ~ finite(X0) ),
inference(cnf_transformation,[],[f50]) ).
fof(f101,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| ~ subset(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f72]) ).
fof(f103,plain,
! [X0,X1] :
( subset(X0,X1)
| in(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f75]) ).
fof(f104,plain,
! [X0,X1] :
( ~ in(sK0(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f75]) ).
fof(f107,plain,
! [X3,X0,X1] :
( in(X3,X1)
| ~ subset(X3,X0)
| ~ finite(X3)
| finite_subsets(X0) != X1
| ~ preboolean(X1) ),
inference(cnf_transformation,[],[f79]) ).
fof(f119,plain,
! [X0] : preboolean(finite_subsets(X0)),
inference(cnf_transformation,[],[f15]) ).
fof(f146,plain,
! [X0,X1] :
( ~ in(X0,X1)
| element(X0,X1) ),
inference(cnf_transformation,[],[f61]) ).
fof(f147,plain,
! [X0] : subset(finite_subsets(X0),powerset(X0)),
inference(cnf_transformation,[],[f28]) ).
fof(f148,plain,
finite(sK12),
inference(cnf_transformation,[],[f90]) ).
fof(f149,plain,
powerset(sK12) != finite_subsets(sK12),
inference(cnf_transformation,[],[f90]) ).
fof(f151,plain,
! [X0,X1] :
( ~ element(X0,powerset(X1))
| subset(X0,X1) ),
inference(cnf_transformation,[],[f91]) ).
fof(f160,plain,
! [X3,X0] :
( in(X3,finite_subsets(X0))
| ~ subset(X3,X0)
| ~ finite(X3)
| ~ preboolean(finite_subsets(X0)) ),
inference(equality_resolution,[],[f107]) ).
fof(f163,definition,
sF13 = powerset(sK12),
introduced(definition,[new_symbols(definition,[sF13])],[function_definition]) ).
fof(f164,plain,
powerset(sK12) = sF13,
inference(reorient_equations,[],[f163]) ).
fof(f165,definition,
sF14 = finite_subsets(sK12),
introduced(definition,[new_symbols(definition,[sF14])],[function_definition]) ).
fof(f166,plain,
finite_subsets(sK12) = sF14,
inference(reorient_equations,[],[f165]) ).
fof(f167,plain,
sF13 != sF14,
inference(definition_folding,[],[f149,f166,f164]) ).
fof(f170,plain,
! [X3,X0] :
( ~ subset(X3,X0)
| in(X3,finite_subsets(X0))
| ~ finite(X3) ),
inference(forward_subsumption_resolution,[],[f160,f119]) ).
fof(f196,plain,
subset(finite_subsets(sK12),sF13),
inference(superposition,[],[f147,f164]) ).
fof(f197,plain,
subset(sF14,sF13),
inference(forward_demodulation,[],[f196,f166]) ).
fof(f267,plain,
! [X0] :
( ~ element(X0,sF13)
| subset(X0,sK12) ),
inference(superposition,[],[f151,f164]) ).
fof(f301,plain,
! [X0] :
( ~ element(X0,sF13)
| finite(X0)
| ~ finite(sK12) ),
inference(superposition,[],[f96,f164]) ).
fof(f302,plain,
! [X0] :
( ~ element(X0,sF13)
| finite(X0) ),
inference(forward_subsumption_resolution,[],[f301,f148]) ).
fof(f346,plain,
( ~ subset(sF13,sF14)
| sF13 = sF14 ),
inference(resolution,[],[f101,f197]) ).
fof(f347,plain,
~ subset(sF13,sF14),
inference(forward_subsumption_resolution,[],[f346,f167]) ).
fof(f348,plain,
in(sK0(sF13,sF14),sF13),
inference(resolution,[],[f347,f103]) ).
fof(f354,plain,
element(sK0(sF13,sF14),sF13),
inference(resolution,[],[f348,f146]) ).
fof(f378,plain,
finite(sK0(sF13,sF14)),
inference(resolution,[],[f354,f302]) ).
fof(f524,plain,
subset(sK0(sF13,sF14),sK12),
inference(resolution,[],[f267,f354]) ).
fof(f533,plain,
( in(sK0(sF13,sF14),finite_subsets(sK12))
| ~ finite(sK0(sF13,sF14)) ),
inference(resolution,[],[f524,f170]) ).
fof(f548,plain,
in(sK0(sF13,sF14),finite_subsets(sK12)),
inference(forward_subsumption_resolution,[],[f533,f378]) ).
fof(f549,plain,
in(sK0(sF13,sF14),sF14),
inference(forward_demodulation,[],[f548,f166]) ).
fof(f553,plain,
subset(sF13,sF14),
inference(resolution,[],[f549,f104]) ).
fof(f559,plain,
$false,
inference(forward_subsumption_resolution,[],[f553,f347]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU114+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.35 % Computer : n011.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Mon Sep 28 03:35:15 UTC 2026
% 0.10/0.35 % CPUTime :
% 0.10/0.35 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.14/0.40 Running first-order model finding
% 0.14/0.40 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
% 3.04/0.94 % (2990455)Will run a generic schedule for satisfiability detection.
% 3.04/0.94 % (2990460)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1929305083_2999 on theBenchmark for (2999ds/0Mi)
% 3.04/0.94 % TRYING [1]
% 3.04/0.94 % TRYING [2]
% 3.04/0.94 % TRYING [3]
% 3.04/0.94 % TRYING [4]
% 3.04/0.94 % (2990461)% WARNING: option uhcvi not known.
% 3.04/0.94 % TRYING [5]
% 3.04/0.94 % (2990461)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3252743646:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 3.04/0.94 % (2990462)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3640416788:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 3.04/0.94 % (2990463)dis+10_1_sil=32000:sp=arity:random_seed=3447861272:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 3.04/0.94 % (2990464)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4135904242:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 3.04/0.94 % TRYING [6]
% 3.04/0.94 % (2990466)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1673078007:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 3.04/0.94 % TRYING [7]
% 3.04/0.94 % (2990465)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4023308060:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 3.04/0.94 % TRYING [8]
% 3.04/0.94 % (2990463)Instruction limit reached!
% 3.04/0.94 % (2990463)------------------------------
% 3.04/0.94 % (2990463)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.04/0.94 % (2990463)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.04/0.94 % (2990463)CaDiCaL version: 2.1.3
% 3.04/0.94 % (2990463)Termination reason: Instruction limit
% 3.04/0.94 % (2990463)Termination phase: Saturation
% 3.04/0.94 % (2990463)Time elapsed: 0.061 s
% 3.04/0.94 % (2990463)Peak memory usage: 12 MB
% 3.04/0.94 % (2990463)Instructions burned: 105 (million)
% 3.04/0.94 % (2990464)Instruction limit reached!
% 3.04/0.94 % (2990464)------------------------------
% 3.04/0.94 % (2990464)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.04/0.94 % (2990464)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.04/0.94 % (2990464)CaDiCaL version: 2.1.3
% 3.04/0.94 % (2990464)Termination reason: Instruction limit
% 3.04/0.94 % (2990464)Termination phase: Saturation
% 3.04/0.94 % (2990464)Time elapsed: 0.073 s
% 3.04/0.94 % (2990464)Peak memory usage: 12 MB
% 3.04/0.94 % (2990464)Instructions burned: 117 (million)
% 3.04/0.94 % (2990483)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2714509837:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 3.04/0.94 % TRYING [1]
% 3.04/0.94 % TRYING [2]
% 3.04/0.94 % TRYING [3]
% 3.04/0.94 % TRYING [4]
% 3.04/0.94 % TRYING [5]
% 3.04/0.94 % (2990489)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=886532316:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 3.04/0.94 % TRYING [6]
% 3.04/0.94 % (2990466)Instruction limit reached!
% 3.04/0.94 % (2990466)------------------------------
% 3.04/0.94 % (2990466)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.04/0.94 % (2990466)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.04/0.94 % (2990466)CaDiCaL version: 2.1.3
% 3.04/0.94 % (2990466)Termination reason: Instruction limit
% 3.04/0.94 % (2990466)Termination phase: Saturation
% 3.04/0.94 % (2990466)Time elapsed: 0.105 s
% 3.04/0.94 % (2990466)Peak memory usage: 14 MB
% 3.04/0.94 % (2990466)Instructions burned: 159 (million)
% 3.04/0.94 % (2990465)Instruction limit reached!
% 3.04/0.94 % (2990465)------------------------------
% 3.04/0.94 % (2990465)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.04/0.94 % (2990465)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.04/0.94 % (2990465)CaDiCaL version: 2.1.3
% 3.04/0.94 % (2990465)Termination reason: Instruction limit
% 3.04/0.94 % (2990465)Termination phase: Saturation
% 3.04/0.94 % (2990465)Time elapsed: 0.095 s
% 3.04/0.94 % (2990465)Peak memory usage: 13 MB
% 3.04/0.94 % (2990465)Instructions burned: 132 (million)
% 3.04/0.94 % TRYING [9]
% 3.04/0.94 % TRYING [7]
% 3.04/0.94 % (2990505)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=3298625071:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 3.04/0.94 % (2990506)ott-21_1_sil=16000:fs=off:random_seed=2792657724:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 3.04/0.94 % (2990489)Instruction limit reached!
% 3.04/0.94 % (2990489)------------------------------
% 3.04/0.94 % (2990489)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.04/0.94 % (2990489)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.04/0.94 % TRYING [8]
% 3.04/0.94 % (2990489)CaDiCaL version: 2.1.3
% 3.04/0.94 % (2990489)Termination reason: Instruction limit
% 3.04/0.94 % (2990489)Termination phase: Saturation
% 3.04/0.94 % (2990489)Time elapsed: 0.092 s
% 3.04/0.94 % (2990489)Peak memory usage: 13 MB
% 3.04/0.94 % (2990489)Instructions burned: 131 (million)
% 3.04/0.94 % (2990541)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=2214231855:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 3.04/0.94 % (2990506)Instruction limit reached!
% 3.04/0.94 % (2990506)------------------------------
% 3.04/0.94 % (2990506)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.04/0.94 % (2990506)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.04/0.94 % (2990506)CaDiCaL version: 2.1.3
% 3.04/0.94 % (2990506)Termination reason: Instruction limit
% 3.04/0.94 % (2990506)Termination phase: Saturation
% 3.04/0.94 % (2990506)Time elapsed: 0.095 s
% 3.04/0.94 % (2990506)Peak memory usage: 13 MB
% 3.04/0.94 % (2990506)Instructions burned: 180 (million)
% 3.04/0.94 % (2990555)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=2823124726:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 3.04/0.94 % TRYING [1]
% 3.04/0.94 % TRYING [2]
% 3.04/0.94 % TRYING [3]
% 3.04/0.94 % TRYING [4]
% 3.04/0.94 % TRYING [5]
% 3.04/0.94 % TRYING [6]
% 3.04/0.94 % TRYING [7]
% 3.04/0.94 % TRYING [8]
% 3.04/0.94 % TRYING [9]
% 3.04/0.94 % (2990483)Instruction limit reached!
% 3.04/0.94 % (2990483)------------------------------
% 3.04/0.94 % (2990483)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.04/0.94 % (2990483)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.04/0.94 % (2990483)CaDiCaL version: 2.1.3
% 3.04/0.94 % (2990483)Termination reason: Instruction limit
% 3.04/0.94 % (2990483)Termination phase: Finite model building constraint generation
% 3.04/0.94 % (2990483)Time elapsed: 0.395 s
% 3.04/0.94 % (2990483)Peak memory usage: 18 MB
% 3.04/0.94 % (2990483)Instructions burned: 716 (million)
% 3.04/0.94 % TRYING [9]
% 3.04/0.94 % (2990592)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=3223131734:i=1179_2995 on theBenchmark for (2995ds/1179Mi)
% 3.04/0.94 % (2990505)Instruction limit reached!
% 3.04/0.94 % (2990505)------------------------------
% 3.04/0.94 % (2990505)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.04/0.94 % (2990505)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.04/0.94 % (2990505)CaDiCaL version: 2.1.3
% 3.04/0.94 % (2990505)Termination reason: Instruction limit
% 3.04/0.94 % (2990505)Termination phase: Saturation
% 3.04/0.94 % (2990505)Time elapsed: 0.376 s
% 3.04/0.94 % (2990505)Peak memory usage: 17 MB
% 3.04/0.94 % (2990505)Instructions burned: 685 (million)
% 3.04/0.94 % (2990592) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2990455-2990592"...
% 3.04/0.94 % (2990592)...printing done.
% 3.04/0.94 % (2990592)Refutation found. Thanks to Tanya!
% 3.04/0.94 % SZS status Theorem for theBenchmark
% 3.04/0.94 % SZS output start Proof for theBenchmark
% See solution above
% 3.04/0.94 % (2990592)------------------------------
% 3.04/0.94 % (2990592)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.04/0.94 % (2990592)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.04/0.94 % (2990592)CaDiCaL version: 2.1.3
% 3.04/0.94 % (2990592)Termination reason: Refutation
% 3.04/0.94 % (2990592)Time elapsed: 0.010 s
% 3.04/0.94 % (2990592)Peak memory usage: 12 MB
% 3.04/0.94 % (2990592)Instructions burned: 12 (million)
% 3.04/0.94 % (2990455)Success in time 0.532 s
% 3.04/0.94 % Vampire exiting
%------------------------------------------------------------------------------