%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWV380+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 01:09:04 PM UTC 2026
% Result : Theorem 3.13s 1.11s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 12
% Syntax : Number of formulae : 65 ( 19 unt; 0 def)
% Number of atoms : 152 ( 67 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 138 ( 51 ~; 60 |; 14 &)
% ( 2 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 6 con; 0-3 aty)
% Number of variables : 154 ( 151 !; 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(f29,axiom,
! [X0,X1,X2] :
( ~ ok(triple(X0,X1,X2))
=> X2 = bad ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax41) ).
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(f37,axiom,
! [X0,X1,X2,X3] :
( ( X1 != create_slb
& contains_slb(X1,findmin_pqp_res(X0))
& less_than(lookup_slb(X1,findmin_pqp_res(X0)),findmin_pqp_res(X0)) )
=> findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax49) ).
fof(f38,axiom,
! [X0,X1] : findmin_cpq_res(triple(X0,create_slb,X1)) = bottom,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax50) ).
fof(f40,axiom,
! [X0] : removemin_cpq_eff(X0) = remove_cpq(findmin_cpq_eff(X0),findmin_cpq_res(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax52) ).
fof(f42,axiom,
! [X0,X1,X2,X3] :
( ~ ok(triple(X0,X1,X2))
=> ~ ok(remove_cpq(triple(X0,X1,X2),X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l16_l14) ).
fof(f43,conjecture,
! [X0,X1,X2] :
( ~ ok(triple(X0,X1,X2))
=> ~ ok(removemin_cpq_eff(triple(X0,X1,X2))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l16_co) ).
fof(f44,negated_conjecture,
~ ! [X0,X1,X2] :
( ~ ok(triple(X0,X1,X2))
=> ~ ok(removemin_cpq_eff(triple(X0,X1,X2))) ),
inference(negated_conjecture,[status(cth)],[f43]) ).
fof(f47,plain,
! [X0,X1] : ~ ok(triple(X0,X1,bad)),
inference(true_and_false_elimination,[],[f28]) ).
fof(f48,plain,
! [X0,X1] : ~ ok(triple(X0,X1,bad)),
inference(flattening,[],[f47]) ).
fof(f49,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(f50,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(f51,plain,
! [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)) )
=> findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),X2) ),
inference(rectify,[],[f37]) ).
fof(f53,plain,
! [X0,X1] :
( ( less_than(X0,X1)
& ~ less_than(X1,X0) )
=> strictly_less_than(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f4]) ).
fof(f56,plain,
! [X0,X1] :
( strictly_less_than(X0,X1)
| ~ less_than(X0,X1)
| less_than(X1,X0) ),
inference(ennf_transformation,[],[f53]) ).
fof(f57,plain,
! [X0,X1] :
( strictly_less_than(X0,X1)
| ~ less_than(X0,X1)
| less_than(X1,X0) ),
inference(flattening,[],[f56]) ).
fof(f70,plain,
! [X0,X1,X2] :
( X2 = bad
| ok(triple(X0,X1,X2)) ),
inference(ennf_transformation,[],[f29]) ).
fof(f76,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,[],[f49]) ).
fof(f77,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,[],[f76]) ).
fof(f78,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,[],[f50]) ).
fof(f79,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,[],[f78]) ).
fof(f80,plain,
! [X0,X1,X2] :
( findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),X2)
| create_slb = X1
| ~ contains_slb(X1,findmin_pqp_res(X0))
| ~ less_than(lookup_slb(X1,findmin_pqp_res(X0)),findmin_pqp_res(X0)) ),
inference(ennf_transformation,[],[f51]) ).
fof(f81,plain,
! [X0,X1,X2] :
( findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),X2)
| create_slb = X1
| ~ contains_slb(X1,findmin_pqp_res(X0))
| ~ less_than(lookup_slb(X1,findmin_pqp_res(X0)),findmin_pqp_res(X0)) ),
inference(flattening,[],[f80]) ).
fof(f83,plain,
! [X0,X1,X2,X3] :
( ~ ok(remove_cpq(triple(X0,X1,X2),X3))
| ok(triple(X0,X1,X2)) ),
inference(ennf_transformation,[],[f42]) ).
fof(f84,plain,
? [X0,X1,X2] :
( ok(removemin_cpq_eff(triple(X0,X1,X2)))
& ~ ok(triple(X0,X1,X2)) ),
inference(ennf_transformation,[],[f44]) ).
fof(f91,plain,
( ok(removemin_cpq_eff(triple(sK0,sK1,sK2)))
& ~ ok(triple(sK0,sK1,sK2)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f84]) ).
fof(f93,plain,
! [X0,X1] :
( less_than(X0,X1)
| less_than(X1,X0) ),
inference(cnf_transformation,[],[f2]) ).
fof(f95,plain,
! [X0,X1] :
( strictly_less_than(X0,X1)
| ~ less_than(X0,X1)
| less_than(X1,X0) ),
inference(cnf_transformation,[],[f57]) ).
fof(f126,plain,
! [X0,X1] : ~ ok(triple(X0,X1,bad)),
inference(cnf_transformation,[],[f48]) ).
fof(f127,plain,
! [X2,X0,X1] :
( ok(triple(X0,X1,X2))
| bad = X2 ),
inference(cnf_transformation,[],[f70]) ).
fof(f132,plain,
! [X0,X1] : findmin_cpq_eff(triple(X0,create_slb,X1)) = triple(X0,create_slb,bad),
inference(cnf_transformation,[],[f34]) ).
fof(f133,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,[],[f77]) ).
fof(f134,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,[],[f79]) ).
fof(f135,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)),X2)
| ~ less_than(lookup_slb(X1,findmin_pqp_res(X0)),findmin_pqp_res(X0)) ),
inference(cnf_transformation,[],[f81]) ).
fof(f136,plain,
! [X0,X1] : bottom = findmin_cpq_res(triple(X0,create_slb,X1)),
inference(cnf_transformation,[],[f38]) ).
fof(f138,plain,
! [X0] : removemin_cpq_eff(X0) = remove_cpq(findmin_cpq_eff(X0),findmin_cpq_res(X0)),
inference(cnf_transformation,[],[f40]) ).
fof(f140,plain,
! [X2,X3,X0,X1] :
( ~ ok(remove_cpq(triple(X0,X1,X2),X3))
| ok(triple(X0,X1,X2)) ),
inference(cnf_transformation,[],[f83]) ).
fof(f141,plain,
~ ok(triple(sK0,sK1,sK2)),
inference(cnf_transformation,[],[f91]) ).
fof(f142,plain,
ok(removemin_cpq_eff(triple(sK0,sK1,sK2))),
inference(cnf_transformation,[],[f91]) ).
fof(f146,plain,
bad = sK2,
inference(resolution,[],[f127,f141]) ).
fof(f148,plain,
ok(removemin_cpq_eff(triple(sK0,sK1,bad))),
inference(superposition,[],[f142,f146]) ).
fof(f151,plain,
! [X0,X1] : removemin_cpq_eff(triple(X0,create_slb,X1)) = remove_cpq(triple(X0,create_slb,bad),findmin_cpq_res(triple(X0,create_slb,X1))),
inference(superposition,[],[f138,f132]) ).
fof(f152,plain,
! [X0,X1] : removemin_cpq_eff(triple(X0,create_slb,X1)) = remove_cpq(triple(X0,create_slb,bad),bottom),
inference(forward_demodulation,[],[f151,f136]) ).
fof(f176,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,[],[f134,f133]) ).
fof(f177,plain,
! [X0,X1] :
( less_than(X1,X0)
| strictly_less_than(X0,X1) ),
inference(forward_subsumption_resolution,[],[f95,f93]) ).
fof(f180,plain,
! [X2,X3,X0,X1] :
( create_slb = X0
| findmin_cpq_eff(triple(X1,X0,X2)) = triple(X1,update_slb(X0,findmin_pqp_res(X1)),X2)
| ~ less_than(lookup_slb(X0,findmin_pqp_res(X1)),findmin_pqp_res(X1))
| create_slb = X0
| triple(X1,update_slb(X0,findmin_pqp_res(X1)),bad) = findmin_cpq_eff(triple(X1,X0,X3)) ),
inference(resolution,[],[f135,f133]) ).
fof(f181,plain,
! [X2,X3,X0,X1] :
( ~ less_than(lookup_slb(X0,findmin_pqp_res(X1)),findmin_pqp_res(X1))
| findmin_cpq_eff(triple(X1,X0,X2)) = triple(X1,update_slb(X0,findmin_pqp_res(X1)),X2)
| create_slb = X0
| triple(X1,update_slb(X0,findmin_pqp_res(X1)),bad) = findmin_cpq_eff(triple(X1,X0,X3)) ),
inference(duplicate_literal_removal,[],[f180]) ).
fof(f202,plain,
! [X0,X1] :
( ~ ok(removemin_cpq_eff(triple(X0,create_slb,X1)))
| ok(triple(X0,create_slb,bad)) ),
inference(superposition,[],[f140,f152]) ).
fof(f204,plain,
! [X0,X1] : ~ ok(removemin_cpq_eff(triple(X0,create_slb,X1))),
inference(forward_subsumption_resolution,[],[f202,f126]) ).
fof(f271,plain,
! [X2,X3,X0,X1] :
( findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),X2)
| create_slb = X1
| triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) = findmin_cpq_eff(triple(X0,X1,X3))
| strictly_less_than(findmin_pqp_res(X0),lookup_slb(X1,findmin_pqp_res(X0))) ),
inference(resolution,[],[f181,f177]) ).
fof(f275,plain,
! [X2,X3,X0,X1] :
( findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),X2)
| create_slb = X1
| triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) = findmin_cpq_eff(triple(X0,X1,X3)) ),
inference(forward_subsumption_resolution,[],[f271,f176]) ).
fof(f412,plain,
! [X2,X0,X1] :
( findmin_cpq_eff(triple(X0,X1,X2)) != findmin_cpq_eff(triple(X0,X1,bad))
| create_slb = X1
| findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) ),
inference(equality_factoring,[],[f275]) ).
fof(f588,plain,
! [X0,X1] :
( triple(X1,update_slb(X0,findmin_pqp_res(X1)),bad) = findmin_cpq_eff(triple(X1,X0,bad))
| create_slb = X0 ),
inference(equality_resolution,[],[f412]) ).
fof(f593,plain,
! [X0,X1] :
( ~ ok(findmin_cpq_eff(triple(X0,X1,bad)))
| create_slb = X1 ),
inference(superposition,[],[f126,f588]) ).
fof(f612,plain,
! [X2,X0,X1] :
( ~ ok(remove_cpq(findmin_cpq_eff(triple(X0,X1,bad)),X2))
| ok(findmin_cpq_eff(triple(X0,X1,bad)))
| create_slb = X1 ),
inference(superposition,[],[f140,f588]) ).
fof(f978,plain,
! [X2,X0,X1] :
( ~ ok(remove_cpq(findmin_cpq_eff(triple(X0,X1,bad)),X2))
| create_slb = X1 ),
inference(forward_subsumption_resolution,[],[f612,f593]) ).
fof(f987,plain,
! [X0,X1] :
( ~ ok(removemin_cpq_eff(triple(X0,X1,bad)))
| create_slb = X1 ),
inference(superposition,[],[f978,f138]) ).
fof(f995,plain,
create_slb = sK1,
inference(resolution,[],[f987,f148]) ).
fof(f1008,plain,
ok(removemin_cpq_eff(triple(sK0,create_slb,sK2))),
inference(superposition,[],[f142,f995]) ).
fof(f1011,plain,
$false,
inference(forward_subsumption_resolution,[],[f1008,f204]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV380+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.18 % Computer : n002.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:47:52 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.13/1.11 % (274349)Detected formulas, will run a generic FOF schedule.
% 3.13/1.11 % (274364)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=4052132797:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.13/1.11 % (274361)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=2133851439:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.13/1.11 % (274360)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=4231690713:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.13/1.11 % (274364)Instruction limit reached!
% 3.13/1.11 % (274364)------------------------------
% 3.13/1.11 % (274364)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.13/1.11 % (274364)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.13/1.11 % (274364)CaDiCaL version: 2.1.3
% 3.13/1.11 % (274364)Termination reason: Instruction limit
% 3.13/1.11 % (274364)Termination phase: Saturation
% 3.13/1.11 % (274364)Time elapsed: 0.037 s
% 3.13/1.11 % (274364)Peak memory usage: 88 MB
% 3.13/1.11 % (274364)Instructions burned: 122 (million)
% 3.13/1.11 % (274365)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=547891600:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.13/1.11 % (274362)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=530829302:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.13/1.11 % (274363)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2111629177:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.13/1.11 % (274366)dis-21_1_sil=8000:lcm=predicate:random_seed=2317227608: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.13/1.11 % (274363)Refutation not found, incomplete strategy
% 3.13/1.11 % (274363)------------------------------
% 3.13/1.11 % (274363)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.13/1.11 % (274363)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.13/1.11 % (274363)CaDiCaL version: 2.1.3
% 3.13/1.11 % (274363)Termination reason: Refutation not found, incomplete strategy
% 3.13/1.11 % (274363)Time elapsed: 0.001 s
% 3.13/1.11 % (274363)Peak memory usage: 88 MB
% 3.13/1.11 % (274366)Refutation not found, incomplete strategy
% 3.13/1.11 % (274366)------------------------------
% 3.13/1.11 % (274366)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.13/1.11 % (274366)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.13/1.11 % (274366)CaDiCaL version: 2.1.3
% 3.13/1.11 % (274366)Termination reason: Refutation not found, incomplete strategy
% 3.13/1.11 % (274366)Time elapsed: 0.003 s
% 3.13/1.11 % (274366)Peak memory usage: 88 MB
% 3.13/1.11 % (274366)Instructions burned: 3 (million)
% 3.13/1.11 % (274365)First to succeed.
% 3.13/1.11 % (274365)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-274349"
% 3.13/1.11 % (274370)lrs+10_1_sil=8000:sp=occurrence:random_seed=754968813:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 3.13/1.11 % (274370)Instruction limit reached!
% 3.13/1.11 % (274370)------------------------------
% 3.13/1.11 % (274370)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.13/1.11 % (274370)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.13/1.11 % (274370)CaDiCaL version: 2.1.3
% 3.13/1.11 % (274370)Termination reason: Instruction limit
% 3.13/1.11 % (274370)Termination phase: Saturation
% 3.13/1.11 % (274370)Time elapsed: 0.089 s
% 3.13/1.11 % (274370)Peak memory usage: 90 MB
% 3.13/1.11 % (274370)Instructions burned: 285 (million)
% 3.13/1.11 % (274363)------------------------------
% 3.13/1.11 % (274363)------------------------------
% 3.13/1.11 % (274366)------------------------------
% 3.13/1.11 % (274366)------------------------------
% 3.13/1.11 % (274376)lrs+10_1_sil=32000:urr=on:br=off:random_seed=1821578077:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2996 on theBenchmark for (2996ds/157Mi)
% 3.13/1.11 % (274376)Refutation not found, incomplete strategy
% 3.13/1.11 % (274376)------------------------------
% 3.13/1.11 % (274376)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.13/1.11 % (274376)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.13/1.11 % (274376)CaDiCaL version: 2.1.3
% 3.13/1.11 % (274376)Termination reason: Refutation not found, incomplete strategy
% 3.13/1.11 % (274376)Time elapsed: 0.001 s
% 3.13/1.11 % (274376)Peak memory usage: 89 MB
% 3.13/1.11 % (274376)Instructions burned: 1 (million)
% 3.13/1.11 % (274365)Refutation found. Thanks to Tanya!
% 3.13/1.11 % SZS status Theorem for theBenchmark
% 3.13/1.11 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/1.30 % (274365)------------------------------
% 0.20/1.30 % (274365)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.20/1.30 % (274365)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/1.30 % (274365)CaDiCaL version: 2.1.3
% 0.20/1.30 % (274365)Termination reason: Refutation
% 0.20/1.30 % (274365)Time elapsed: 0.060 s
% 0.20/1.30 % (274365)Peak memory usage: 89 MB
% 0.20/1.30 % (274365)Instructions burned: 86 (million)
% 0.20/1.30 % (274365)------------------------------
% 0.20/1.30 % (274365)------------------------------
% 0.20/1.30 % (274349)Success in time 0.455 s
% 0.20/1.30 % Vampire exiting
%------------------------------------------------------------------------------