%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWV374+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 : n005.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 01:09:03 PM UTC 2026
% Result : Theorem 3.40s 1.28s
% Output : Refutation 3.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 11
% Syntax : Number of formulae : 65 ( 14 unt; 4 def)
% Number of atoms : 156 ( 39 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 140 ( 49 ~; 64 |; 14 &)
% ( 6 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 10 ( 8 usr; 5 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-3 aty)
% Number of variables : 76 ( 2 sgn 73 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] :
( less_than(X0,X1)
| less_than(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',totality) ).
fof(f4,axiom,
! [X0,X1] :
( strictly_less_than(X0,X1)
<=> ( less_than(X0,X1)
& ~ less_than(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',stricly_smaller_definition) ).
fof(f28,axiom,
! [X0,X1] :
( ok(triple(X0,X1,bad))
<=> $false ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax40) ).
fof(f34,axiom,
! [X0,X1] : findmin_cpq_eff(triple(X0,create_slb,X1)) = triple(X0,create_slb,bad),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax46) ).
fof(f35,axiom,
! [X0,X1,X2,X3] :
( ( X1 != create_slb
& ~ contains_slb(X1,findmin_pqp_res(X0)) )
=> findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax47) ).
fof(f36,axiom,
! [X0,X1,X2,X3] :
( ( X1 != create_slb
& contains_slb(X1,findmin_pqp_res(X0))
& strictly_less_than(findmin_pqp_res(X0),lookup_slb(X1,findmin_pqp_res(X0))) )
=> findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax48) ).
fof(f42,conjecture,
! [X0,X1,X2] :
( ok(findmin_cpq_eff(triple(X0,X1,X2)))
=> ( X1 != create_slb
& contains_slb(X1,findmin_pqp_res(X0))
& less_than(lookup_slb(X1,findmin_pqp_res(X0)),findmin_pqp_res(X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l10_co) ).
fof(f43,negated_conjecture,
~ ! [X0,X1,X2] :
( ok(findmin_cpq_eff(triple(X0,X1,X2)))
=> ( X1 != create_slb
& contains_slb(X1,findmin_pqp_res(X0))
& less_than(lookup_slb(X1,findmin_pqp_res(X0)),findmin_pqp_res(X0)) ) ),
inference(negated_conjecture,[status(cth)],[f42]) ).
fof(f45,plain,
! [X0,X1,X2] :
( ( X1 != create_slb
& contains_slb(X1,findmin_pqp_res(X0))
& strictly_less_than(findmin_pqp_res(X0),lookup_slb(X1,findmin_pqp_res(X0))) )
=> findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) ),
inference(rectify,[],[f36]) ).
fof(f46,plain,
! [X0,X1] : ~ ok(triple(X0,X1,bad)),
inference(true_and_false_elimination,[],[f28]) ).
fof(f47,plain,
! [X0,X1] : ~ ok(triple(X0,X1,bad)),
inference(flattening,[],[f46]) ).
fof(f48,plain,
! [X0,X1,X2] :
( ( X1 != create_slb
& ~ contains_slb(X1,findmin_pqp_res(X0)) )
=> findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) ),
inference(rectify,[],[f35]) ).
fof(f52,plain,
! [X0,X1] :
( ( less_than(X0,X1)
& ~ less_than(X1,X0) )
=> strictly_less_than(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f4]) ).
fof(f53,plain,
? [X0,X1,X2] :
( ( create_slb = X1
| ~ contains_slb(X1,findmin_pqp_res(X0))
| ~ less_than(lookup_slb(X1,findmin_pqp_res(X0)),findmin_pqp_res(X0)) )
& ok(findmin_cpq_eff(triple(X0,X1,X2))) ),
inference(ennf_transformation,[],[f43]) ).
fof(f58,plain,
! [X0,X1,X2] :
( findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad)
| create_slb = X1
| ~ contains_slb(X1,findmin_pqp_res(X0))
| ~ strictly_less_than(findmin_pqp_res(X0),lookup_slb(X1,findmin_pqp_res(X0))) ),
inference(ennf_transformation,[],[f45]) ).
fof(f59,plain,
! [X0,X1,X2] :
( findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad)
| create_slb = X1
| ~ contains_slb(X1,findmin_pqp_res(X0))
| ~ strictly_less_than(findmin_pqp_res(X0),lookup_slb(X1,findmin_pqp_res(X0))) ),
inference(flattening,[],[f58]) ).
fof(f67,plain,
! [X0,X1,X2] :
( findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad)
| create_slb = X1
| contains_slb(X1,findmin_pqp_res(X0)) ),
inference(ennf_transformation,[],[f48]) ).
fof(f68,plain,
! [X0,X1,X2] :
( findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad)
| create_slb = X1
| contains_slb(X1,findmin_pqp_res(X0)) ),
inference(flattening,[],[f67]) ).
fof(f74,plain,
! [X0,X1] :
( strictly_less_than(X0,X1)
| ~ less_than(X0,X1)
| less_than(X1,X0) ),
inference(ennf_transformation,[],[f52]) ).
fof(f75,plain,
! [X0,X1] :
( strictly_less_than(X0,X1)
| ~ less_than(X0,X1)
| less_than(X1,X0) ),
inference(flattening,[],[f74]) ).
fof(f83,plain,
( ( create_slb = sK1
| ~ contains_slb(sK1,findmin_pqp_res(sK0))
| ~ less_than(lookup_slb(sK1,findmin_pqp_res(sK0)),findmin_pqp_res(sK0)) )
& ok(findmin_cpq_eff(triple(sK0,sK1,sK2))) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f53]) ).
fof(f87,plain,
ok(findmin_cpq_eff(triple(sK0,sK1,sK2))),
inference(cnf_transformation,[],[f83]) ).
fof(f88,plain,
( create_slb = sK1
| ~ contains_slb(sK1,findmin_pqp_res(sK0))
| ~ less_than(lookup_slb(sK1,findmin_pqp_res(sK0)),findmin_pqp_res(sK0)) ),
inference(cnf_transformation,[],[f83]) ).
fof(f90,plain,
! [X0,X1] :
( less_than(X0,X1)
| less_than(X1,X0) ),
inference(cnf_transformation,[],[f2]) ).
fof(f97,plain,
! [X2,X0,X1] :
( findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad)
| create_slb = X1
| ~ contains_slb(X1,findmin_pqp_res(X0))
| ~ strictly_less_than(findmin_pqp_res(X0),lookup_slb(X1,findmin_pqp_res(X0))) ),
inference(cnf_transformation,[],[f59]) ).
fof(f103,plain,
! [X0,X1] : ~ ok(triple(X0,X1,bad)),
inference(cnf_transformation,[],[f47]) ).
fof(f105,plain,
! [X2,X0,X1] :
( contains_slb(X1,findmin_pqp_res(X0))
| create_slb = X1
| findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) ),
inference(cnf_transformation,[],[f68]) ).
fof(f106,plain,
! [X0,X1] : findmin_cpq_eff(triple(X0,create_slb,X1)) = triple(X0,create_slb,bad),
inference(cnf_transformation,[],[f34]) ).
fof(f113,plain,
! [X0,X1] :
( ~ less_than(X0,X1)
| strictly_less_than(X0,X1)
| less_than(X1,X0) ),
inference(cnf_transformation,[],[f75]) ).
fof(f133,plain,
! [X2,X0,X1] :
( ~ strictly_less_than(findmin_pqp_res(X0),lookup_slb(X1,findmin_pqp_res(X0)))
| create_slb = X1
| findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) ),
inference(forward_subsumption_resolution,[],[f97,f105]) ).
fof(f135,definition,
( spl3_1
<=> less_than(lookup_slb(sK1,findmin_pqp_res(sK0)),findmin_pqp_res(sK0)) ),
introduced(definition,[new_symbols(definition,[spl3_1])],[avatar_definition]) ).
fof(f137,plain,
( ~ less_than(lookup_slb(sK1,findmin_pqp_res(sK0)),findmin_pqp_res(sK0))
| spl3_1 ),
inference(avatar_component_clause,[],[f135]) ).
fof(f139,definition,
( spl3_2
<=> contains_slb(sK1,findmin_pqp_res(sK0)) ),
introduced(definition,[new_symbols(definition,[spl3_2])],[avatar_definition]) ).
fof(f141,plain,
( ~ contains_slb(sK1,findmin_pqp_res(sK0))
| spl3_2 ),
inference(avatar_component_clause,[],[f139]) ).
fof(f143,definition,
( spl3_3
<=> create_slb = sK1 ),
introduced(definition,[new_symbols(definition,[spl3_3])],[avatar_definition]) ).
fof(f144,plain,
( create_slb != sK1
| spl3_3 ),
inference(avatar_component_clause,[],[f143]) ).
fof(f145,plain,
( create_slb = sK1
| ~ spl3_3 ),
inference(avatar_component_clause,[],[f143]) ).
fof(f146,plain,
( ~ spl3_1
| ~ spl3_2
| spl3_3 ),
inference(avatar_split_clause,[],[f88,f143,f139,f135]) ).
fof(f148,plain,
( less_than(findmin_pqp_res(sK0),lookup_slb(sK1,findmin_pqp_res(sK0)))
| spl3_1 ),
inference(resolution,[],[f90,f137]) ).
fof(f165,plain,
( strictly_less_than(findmin_pqp_res(sK0),lookup_slb(sK1,findmin_pqp_res(sK0)))
| less_than(lookup_slb(sK1,findmin_pqp_res(sK0)),findmin_pqp_res(sK0))
| spl3_1 ),
inference(resolution,[],[f113,f148]) ).
fof(f169,plain,
( strictly_less_than(findmin_pqp_res(sK0),lookup_slb(sK1,findmin_pqp_res(sK0)))
| spl3_1 ),
inference(forward_subsumption_resolution,[],[f165,f137]) ).
fof(f484,plain,
( ! [X0] :
( create_slb = sK1
| findmin_cpq_eff(triple(sK0,sK1,X0)) = triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad) )
| spl3_2 ),
inference(resolution,[],[f141,f105]) ).
fof(f487,definition,
( spl3_7
<=> ! [X0] : findmin_cpq_eff(triple(sK0,sK1,X0)) = triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad) ),
introduced(definition,[new_symbols(definition,[spl3_7])],[avatar_definition]) ).
fof(f488,plain,
( ! [X0] : findmin_cpq_eff(triple(sK0,sK1,X0)) = triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad)
| ~ spl3_7 ),
inference(avatar_component_clause,[],[f487]) ).
fof(f489,plain,
( spl3_7
| spl3_3
| spl3_2 ),
inference(avatar_split_clause,[],[f484,f139,f143,f487]) ).
fof(f523,plain,
( ok(findmin_cpq_eff(triple(sK0,create_slb,sK2)))
| ~ spl3_3 ),
inference(superposition,[],[f87,f145]) ).
fof(f533,plain,
( ok(triple(sK0,create_slb,bad))
| ~ spl3_3 ),
inference(forward_demodulation,[],[f523,f106]) ).
fof(f534,plain,
( $false
| ~ spl3_3 ),
inference(forward_subsumption_resolution,[],[f533,f103]) ).
fof(f535,plain,
~ spl3_3,
inference(avatar_contradiction_clause,[],[f534]) ).
fof(f539,plain,
( ! [X0] :
( create_slb = sK1
| findmin_cpq_eff(triple(sK0,sK1,X0)) = triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad) )
| spl3_1 ),
inference(resolution,[],[f133,f169]) ).
fof(f557,plain,
( ! [X0] : ~ ok(findmin_cpq_eff(triple(sK0,sK1,X0)))
| ~ spl3_7 ),
inference(superposition,[],[f103,f488]) ).
fof(f568,plain,
( ! [X0] : findmin_cpq_eff(triple(sK0,sK1,X0)) = triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad)
| spl3_1
| spl3_3 ),
inference(forward_subsumption_resolution,[],[f539,f144]) ).
fof(f570,plain,
( spl3_7
| spl3_1
| spl3_3 ),
inference(avatar_split_clause,[],[f568,f143,f135,f487]) ).
fof(f575,plain,
( $false
| ~ spl3_7 ),
inference(resolution,[],[f557,f87]) ).
fof(f576,plain,
~ spl3_7,
inference(avatar_contradiction_clause,[],[f575]) ).
cnf(s1,plain,
( ~ spl3_1
| ~ spl3_2
| spl3_3 ),
inference(sat_conversion,[],[f146]) ).
cnf(s5,plain,
( spl3_2
| spl3_3
| spl3_7 ),
inference(sat_conversion,[],[f489]) ).
cnf(s7,plain,
~ spl3_3,
inference(sat_conversion,[],[f535]) ).
cnf(s9,plain,
( spl3_1
| spl3_3
| spl3_7 ),
inference(sat_conversion,[],[f570]) ).
cnf(s11,plain,
~ spl3_7,
inference(sat_conversion,[],[f576]) ).
cnf(s12,plain,
( spl3_1
| spl3_3 ),
inference(rat,[],[s9,s11]) ).
cnf(s13,plain,
spl3_1,
inference(rat,[],[s12,s7]) ).
cnf(s14,plain,
spl3_2,
inference(rat,[],[s5,s11,s7]) ).
cnf(s15,plain,
$false,
inference(rat,[],[s1,s7,s14,s13]) ).
fof(f577,plain,
$false,
inference(avatar_sat_refutation,[],[s15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV374+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.09/0.18 % Computer : n005.cluster.edu
% 0.09/0.18 % Model : x86_64 x86_64
% 0.09/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18 % Memory : 8046.5625MB
% 0.09/0.18 % OS : Linux 6.8.0-71-generic
% 0.09/0.18 % CPULimit : 300
% 0.09/0.18 % WCLimit : 300
% 0.09/0.18 % DateTime : Mon Sep 28 10:45:47 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.22 Running first-order theorem proving
% 0.09/0.22 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.06/1.05 % (712333)Detected formulas, will run a generic FOF schedule.
% 3.06/1.05 % (712342)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2881812140:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.06/1.05 % (712342)Instruction limit reached!
% 3.06/1.05 % (712342)------------------------------
% 3.06/1.05 % (712342)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.06/1.05 % (712342)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.06/1.05 % (712342)CaDiCaL version: 2.1.3
% 3.06/1.05 % (712342)Termination reason: Instruction limit
% 3.06/1.05 % (712342)Termination phase: Saturation
% 3.06/1.05 % (712342)Time elapsed: 0.030 s
% 3.06/1.05 % (712342)Peak memory usage: 88 MB
% 3.06/1.05 % (712342)Instructions burned: 120 (million)
% 3.06/1.05 % (712340)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=1667842362:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.06/1.05 % (712339)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=3011330931:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.06/1.05 % (712338)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=2449915104:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.06/1.05 % (712343)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3768160549:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.06/1.05 % (712341)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3347328252:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.06/1.05 % (712344)dis-21_1_sil=8000:lcm=predicate:random_seed=307111281: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.06/1.05 % (712341)Instruction limit reached!
% 3.06/1.05 % (712341)------------------------------
% 3.06/1.05 % (712341)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.06/1.05 % (712341)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.06/1.05 % (712341)CaDiCaL version: 2.1.3
% 3.06/1.05 % (712341)Termination reason: Instruction limit
% 3.06/1.05 % (712341)Termination phase: Saturation
% 3.06/1.05 % (712341)Time elapsed: 0.042 s
% 3.06/1.05 % (712341)Peak memory usage: 88 MB
% 3.06/1.05 % (712341)Instructions burned: 111 (million)
% 3.06/1.05 % (712344)Instruction limit reached!
% 3.06/1.05 % (712344)------------------------------
% 3.06/1.05 % (712344)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.06/1.05 % (712344)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.06/1.05 % (712344)CaDiCaL version: 2.1.3
% 3.06/1.05 % (712344)Termination reason: Instruction limit
% 3.06/1.05 % (712344)Termination phase: Saturation
% 3.06/1.05 % (712344)Time elapsed: 0.054 s
% 3.06/1.05 % (712344)Peak memory usage: 88 MB
% 3.06/1.05 % (712344)Instructions burned: 130 (million)
% 3.06/1.05 % (712343)Instruction limit reached!
% 3.06/1.05 % (712343)------------------------------
% 3.06/1.05 % (712343)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.06/1.05 % (712343)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.06/1.05 % (712343)CaDiCaL version: 2.1.3
% 3.06/1.05 % (712343)Termination reason: Instruction limit
% 3.06/1.05 % (712343)Termination phase: Saturation
% 3.06/1.05 % (712343)Time elapsed: 0.062 s
% 3.06/1.05 % (712343)Peak memory usage: 88 MB
% 3.06/1.05 % (712343)Instructions burned: 139 (million)
% 3.06/1.05 % (712347)lrs+10_1_sil=8000:sp=occurrence:random_seed=3438461638:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 3.06/1.05 % (712347)First to succeed.
% 3.06/1.05 % (712347)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-712333"
% 3.06/1.05 % (712353)lrs+10_1_sil=32000:urr=on:br=off:random_seed=1455628779:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/157Mi)
% 3.06/1.05 % (712354)lrs+1011_1_sil=32000:sp=occurrence:random_seed=1518419925:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 3.06/1.05 % (712355)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=1692555151:s2a=on:i=248:s2at=1.23:gtg=position_2997 on theBenchmark for (2997ds/248Mi)
% 3.40/1.28 % (712347)Refutation found. Thanks to Tanya!
% 3.40/1.28 % SZS status Theorem for theBenchmark
% 3.40/1.28 % SZS output start Proof for theBenchmark
% See solution above
% 3.40/1.28 % (712347)------------------------------
% 3.40/1.28 % (712347)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.40/1.28 % (712347)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.40/1.28 % (712347)CaDiCaL version: 2.1.3
% 3.40/1.28 % (712347)Termination reason: Refutation
% 3.40/1.28 % (712347)Time elapsed: 0.012 s
% 3.40/1.28 % (712347)Peak memory usage: 90 MB
% 3.40/1.28 % (712347)Instructions burned: 34 (million)
% 3.40/1.28 % (712347)------------------------------
% 3.40/1.28 % (712347)------------------------------
% 3.40/1.28 % (712333)Success in time 0.391 s
% 3.40/1.28 % Vampire exiting
%------------------------------------------------------------------------------