%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWV372+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n026.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.10s 1.10s
% Output : Refutation 3.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 12
% Syntax : Number of formulae : 70 ( 15 unt; 3 def)
% Number of atoms : 164 ( 29 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 166 ( 72 ~; 63 |; 17 &)
% ( 7 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 4 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 5 con; 0-3 aty)
% Number of variables : 128 ( 2 sgn 122 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f39,axiom,
! [X0,X1,X2,X3] :
( contains_cpq(triple(X0,X1,X2),X3)
<=> contains_slb(X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax39) ).
fof(f40,axiom,
! [X0,X1] :
( ok(triple(X0,X1,bad))
<=> $false ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax40) ).
fof(f46,axiom,
! [X0,X1] : findmin_cpq_eff(triple(X0,create_slb,X1)) = triple(X0,create_slb,bad),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax46) ).
fof(f47,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/sandbox/benchmark/theBenchmark.p',ax47) ).
fof(f51,axiom,
! [X0,X1,X2,X3] :
( X1 != create_slb
=> findmin_cpq_res(triple(X0,X1,X2)) = findmin_pqp_res(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax51) ).
fof(f62,axiom,
! [X0] :
( phi(X0)
<=> ? [X1] :
( succ_cpq(X0,X1)
& ok(X1)
& check_cpq(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax62) ).
fof(f63,axiom,
! [X0,X1,X2,X3] :
( contains_cpq(triple(X0,X1,X2),X3)
<=> contains_pq(i(triple(X0,X1,X2)),X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l8_li56) ).
fof(f65,axiom,
! [X0,X1,X2] :
( ~ ok(triple(X0,X1,X2))
=> ~ phi(triple(X0,X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l8_lX) ).
fof(f66,conjecture,
! [X0,X1,X2] :
( phi(findmin_cpq_eff(triple(X0,X1,X2)))
=> contains_pq(i(triple(X0,X1,X2)),findmin_cpq_res(triple(X0,X1,X2))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l8_co) ).
fof(f67,negated_conjecture,
~ ! [X0,X1,X2] :
( phi(findmin_cpq_eff(triple(X0,X1,X2)))
=> contains_pq(i(triple(X0,X1,X2)),findmin_cpq_res(triple(X0,X1,X2))) ),
inference(negated_conjecture,[status(cth)],[f66]) ).
fof(f70,plain,
! [X0,X1] : ~ ok(triple(X0,X1,bad)),
inference(true_and_false_elimination,[],[f40]) ).
fof(f71,plain,
! [X0,X1] : ~ ok(triple(X0,X1,bad)),
inference(flattening,[],[f70]) ).
fof(f72,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,[],[f47]) ).
fof(f75,plain,
! [X0,X1,X2] :
( X1 != create_slb
=> findmin_cpq_res(triple(X0,X1,X2)) = findmin_pqp_res(X0) ),
inference(rectify,[],[f51]) ).
fof(f111,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,[],[f72]) ).
fof(f112,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,[],[f111]) ).
fof(f117,plain,
! [X0,X1,X2] :
( findmin_cpq_res(triple(X0,X1,X2)) = findmin_pqp_res(X0)
| create_slb = X1 ),
inference(ennf_transformation,[],[f75]) ).
fof(f119,plain,
! [X0,X1,X2] :
( ~ phi(triple(X0,X1,X2))
| ok(triple(X0,X1,X2)) ),
inference(ennf_transformation,[],[f65]) ).
fof(f120,plain,
? [X0,X1,X2] :
( ~ contains_pq(i(triple(X0,X1,X2)),findmin_cpq_res(triple(X0,X1,X2)))
& phi(findmin_cpq_eff(triple(X0,X1,X2))) ),
inference(ennf_transformation,[],[f67]) ).
fof(f129,plain,
! [X0,X1,X2,X3] :
( ( contains_cpq(triple(X0,X1,X2),X3)
| ~ contains_slb(X1,X3) )
& ( contains_slb(X1,X3)
| ~ contains_cpq(triple(X0,X1,X2),X3) ) ),
inference(nnf_transformation,[],[f39]) ).
fof(f130,plain,
! [X0] :
( ( phi(X0)
| ! [X1] :
( ~ succ_cpq(X0,X1)
| ~ ok(X1)
| ~ check_cpq(X1) ) )
& ( ? [X1] :
( succ_cpq(X0,X1)
& ok(X1)
& check_cpq(X1) )
| ~ phi(X0) ) ),
inference(nnf_transformation,[],[f62]) ).
fof(f131,plain,
! [X0] :
( ( phi(X0)
| ! [X1] :
( ~ succ_cpq(X0,X1)
| ~ ok(X1)
| ~ check_cpq(X1) ) )
& ( ? [X2] :
( succ_cpq(X0,X2)
& ok(X2)
& check_cpq(X2) )
| ~ phi(X0) ) ),
inference(rectify,[],[f130]) ).
fof(f132,plain,
! [X0] :
( ( phi(X0)
| ! [X1] :
( ~ succ_cpq(X0,X1)
| ~ ok(X1)
| ~ check_cpq(X1) ) )
& ( ( succ_cpq(X0,sK1(X0))
& ok(sK1(X0))
& check_cpq(sK1(X0)) )
| ~ phi(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X2,sK1(X0))],[f131]) ).
fof(f133,plain,
! [X0,X1,X2,X3] :
( ( contains_cpq(triple(X0,X1,X2),X3)
| ~ contains_pq(i(triple(X0,X1,X2)),X3) )
& ( contains_pq(i(triple(X0,X1,X2)),X3)
| ~ contains_cpq(triple(X0,X1,X2),X3) ) ),
inference(nnf_transformation,[],[f63]) ).
fof(f134,plain,
( ~ contains_pq(i(triple(sK2,sK3,sK4)),findmin_cpq_res(triple(sK2,sK3,sK4)))
& phi(findmin_cpq_eff(triple(sK2,sK3,sK4))) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3,sK4]),skolemize(X0,sK2),skolemize(X1,sK3),skolemize(X2,sK4)],[f120]) ).
fof(f183,plain,
! [X2,X3,X0,X1] :
( contains_cpq(triple(X0,X1,X2),X3)
| ~ contains_slb(X1,X3) ),
inference(cnf_transformation,[],[f129]) ).
fof(f184,plain,
! [X0,X1] : ~ ok(triple(X0,X1,bad)),
inference(cnf_transformation,[],[f71]) ).
fof(f190,plain,
! [X0,X1] : findmin_cpq_eff(triple(X0,create_slb,X1)) = triple(X0,create_slb,bad),
inference(cnf_transformation,[],[f46]) ).
fof(f191,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,[],[f112]) ).
fof(f195,plain,
! [X2,X0,X1] :
( findmin_pqp_res(X0) = findmin_cpq_res(triple(X0,X1,X2))
| create_slb = X1 ),
inference(cnf_transformation,[],[f117]) ).
fof(f200,plain,
! [X0] :
( check_cpq(sK1(X0))
| ~ phi(X0) ),
inference(cnf_transformation,[],[f132]) ).
fof(f201,plain,
! [X0] :
( ok(sK1(X0))
| ~ phi(X0) ),
inference(cnf_transformation,[],[f132]) ).
fof(f202,plain,
! [X0] :
( succ_cpq(X0,sK1(X0))
| ~ phi(X0) ),
inference(cnf_transformation,[],[f132]) ).
fof(f203,plain,
! [X0,X1] :
( phi(X0)
| ~ succ_cpq(X0,X1)
| ~ ok(X1)
| ~ check_cpq(X1) ),
inference(cnf_transformation,[],[f132]) ).
fof(f204,plain,
! [X2,X3,X0,X1] :
( ~ contains_cpq(triple(X0,X1,X2),X3)
| contains_pq(i(triple(X0,X1,X2)),X3) ),
inference(cnf_transformation,[],[f133]) ).
fof(f207,plain,
! [X2,X0,X1] :
( ~ phi(triple(X0,X1,X2))
| ok(triple(X0,X1,X2)) ),
inference(cnf_transformation,[],[f119]) ).
fof(f208,plain,
phi(findmin_cpq_eff(triple(sK2,sK3,sK4))),
inference(cnf_transformation,[],[f134]) ).
fof(f209,plain,
~ contains_pq(i(triple(sK2,sK3,sK4)),findmin_cpq_res(triple(sK2,sK3,sK4))),
inference(cnf_transformation,[],[f134]) ).
fof(f218,plain,
! [X2,X3,X0,X1] :
( ok(triple(X0,X1,X2))
| ~ succ_cpq(triple(X0,X1,X2),X3)
| ~ ok(X3)
| ~ check_cpq(X3) ),
inference(resolution,[],[f207,f203]) ).
fof(f225,plain,
( ~ contains_pq(i(triple(sK2,sK3,sK4)),findmin_pqp_res(sK2))
| create_slb = sK3 ),
inference(superposition,[],[f209,f195]) ).
fof(f228,definition,
( spl5_1
<=> create_slb = sK3 ),
introduced(definition,[new_symbols(definition,[spl5_1])],[avatar_definition]) ).
fof(f230,plain,
( create_slb = sK3
| ~ spl5_1 ),
inference(avatar_component_clause,[],[f228]) ).
fof(f232,definition,
( spl5_2
<=> contains_pq(i(triple(sK2,sK3,sK4)),findmin_pqp_res(sK2)) ),
introduced(definition,[new_symbols(definition,[spl5_2])],[avatar_definition]) ).
fof(f234,plain,
( ~ contains_pq(i(triple(sK2,sK3,sK4)),findmin_pqp_res(sK2))
| spl5_2 ),
inference(avatar_component_clause,[],[f232]) ).
fof(f235,plain,
( spl5_1
| ~ spl5_2 ),
inference(avatar_split_clause,[],[f225,f232,f228]) ).
fof(f250,plain,
! [X2,X3,X0,X1] :
( ~ contains_slb(X1,X3)
| contains_pq(i(triple(X0,X1,X2)),X3) ),
inference(resolution,[],[f204,f183]) ).
fof(f304,plain,
! [X2,X3,X0,X1,X4] :
( contains_pq(i(triple(X3,X0,X4)),findmin_pqp_res(X1))
| findmin_cpq_eff(triple(X1,X0,X2)) = triple(X1,update_slb(X0,findmin_pqp_res(X1)),bad)
| create_slb = X0 ),
inference(resolution,[],[f191,f250]) ).
fof(f368,plain,
! [X2,X0,X1] :
( ~ ok(X2)
| ~ succ_cpq(triple(X0,X1,bad),X2)
| ~ check_cpq(X2) ),
inference(resolution,[],[f218,f184]) ).
fof(f370,plain,
! [X2,X0,X1] :
( ~ succ_cpq(triple(X0,X1,bad),sK1(X2))
| ~ check_cpq(sK1(X2))
| ~ phi(X2) ),
inference(resolution,[],[f368,f201]) ).
fof(f374,plain,
! [X2,X0,X1] :
( ~ succ_cpq(triple(X0,X1,bad),sK1(X2))
| ~ phi(X2) ),
inference(forward_subsumption_resolution,[],[f370,f200]) ).
fof(f376,plain,
! [X0,X1] :
( ~ phi(triple(X0,X1,bad))
| ~ phi(triple(X0,X1,bad)) ),
inference(resolution,[],[f374,f202]) ).
fof(f378,plain,
! [X0,X1] : ~ phi(triple(X0,X1,bad)),
inference(duplicate_literal_removal,[],[f376]) ).
fof(f1132,plain,
( ! [X0] :
( findmin_cpq_eff(triple(sK2,sK3,X0)) = triple(sK2,update_slb(sK3,findmin_pqp_res(sK2)),bad)
| create_slb = sK3 )
| spl5_2 ),
inference(resolution,[],[f304,f234]) ).
fof(f1138,definition,
( spl5_3
<=> ! [X0] : findmin_cpq_eff(triple(sK2,sK3,X0)) = triple(sK2,update_slb(sK3,findmin_pqp_res(sK2)),bad) ),
introduced(definition,[new_symbols(definition,[spl5_3])],[avatar_definition]) ).
fof(f1139,plain,
( ! [X0] : findmin_cpq_eff(triple(sK2,sK3,X0)) = triple(sK2,update_slb(sK3,findmin_pqp_res(sK2)),bad)
| ~ spl5_3 ),
inference(avatar_component_clause,[],[f1138]) ).
fof(f1140,plain,
( spl5_1
| spl5_3
| spl5_2 ),
inference(avatar_split_clause,[],[f1132,f232,f1138,f228]) ).
fof(f1143,plain,
( phi(findmin_cpq_eff(triple(sK2,create_slb,sK4)))
| ~ spl5_1 ),
inference(superposition,[],[f208,f230]) ).
fof(f1144,plain,
( phi(triple(sK2,create_slb,bad))
| ~ spl5_1 ),
inference(forward_demodulation,[],[f1143,f190]) ).
fof(f1147,plain,
( $false
| ~ spl5_1 ),
inference(forward_subsumption_resolution,[],[f1144,f378]) ).
fof(f1148,plain,
~ spl5_1,
inference(avatar_contradiction_clause,[],[f1147]) ).
fof(f1162,plain,
( ! [X0] : ~ phi(findmin_cpq_eff(triple(sK2,sK3,X0)))
| ~ spl5_3 ),
inference(superposition,[],[f378,f1139]) ).
fof(f1253,plain,
( $false
| ~ spl5_3 ),
inference(resolution,[],[f1162,f208]) ).
fof(f1256,plain,
~ spl5_3,
inference(avatar_contradiction_clause,[],[f1253]) ).
cnf(s1,plain,
( spl5_1
| ~ spl5_2 ),
inference(sat_conversion,[],[f235]) ).
cnf(s2,plain,
( spl5_1
| spl5_2
| spl5_3 ),
inference(sat_conversion,[],[f1140]) ).
cnf(s3,plain,
~ spl5_1,
inference(sat_conversion,[],[f1148]) ).
cnf(s8,plain,
~ spl5_3,
inference(sat_conversion,[],[f1256]) ).
cnf(s9,plain,
spl5_2,
inference(rat,[],[s2,s8,s3]) ).
cnf(s10,plain,
$false,
inference(rat,[],[s1,s9,s3]) ).
fof(f1257,plain,
$false,
inference(avatar_sat_refutation,[],[s10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV372+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.17 % Computer : n026.cluster.edu
% 0.09/0.17 % Model : x86_64 x86_64
% 0.09/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.17 % Memory : 8046.5625MB
% 0.09/0.17 % OS : Linux 6.8.0-71-generic
% 0.09/0.17 % CPULimit : 300
% 0.09/0.17 % WCLimit : 300
% 0.09/0.17 % DateTime : Mon Sep 28 10:47:42 UTC 2026
% 0.09/0.17 % CPUTime :
% 0.09/0.17 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.21 Running first-order theorem proving
% 0.09/0.21 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.10/1.10 % (3773261)Detected formulas, will run a generic FOF schedule.
% 3.10/1.10 % (3773270)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3116782681:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.10/1.10 % (3773271)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1799777521:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.10/1.10 % (3773269)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1489665592:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.10/1.10 % (3773266)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=1864042165:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.10/1.10 % (3773267)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=2286710426:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.10/1.10 % (3773268)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=2349571732:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.10/1.10 % (3773269)Refutation not found, incomplete strategy
% 3.10/1.10 % (3773269)------------------------------
% 3.10/1.10 % (3773269)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.10/1.10 % (3773269)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.10/1.10 % (3773269)CaDiCaL version: 2.1.3
% 3.10/1.10 % (3773269)Termination reason: Refutation not found, incomplete strategy
% 3.10/1.10 % (3773269)Time elapsed: 0.002 s
% 3.10/1.10 % (3773269)Peak memory usage: 88 MB
% 3.10/1.10 % (3773269)Instructions burned: 1 (million)
% 3.10/1.10 % (3773272)dis-21_1_sil=8000:lcm=predicate:random_seed=1439981901: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.10/1.10 % (3773270)Instruction limit reached!
% 3.10/1.10 % (3773270)------------------------------
% 3.10/1.10 % (3773270)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.10/1.10 % (3773270)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.10/1.10 % (3773270)CaDiCaL version: 2.1.3
% 3.10/1.10 % (3773270)Termination reason: Instruction limit
% 3.10/1.10 % (3773270)Termination phase: Saturation
% 3.10/1.10 % (3773270)Time elapsed: 0.036 s
% 3.10/1.10 % (3773270)Peak memory usage: 88 MB
% 3.10/1.10 % (3773270)Instructions burned: 120 (million)
% 3.10/1.10 % (3773271)First to succeed.
% 3.10/1.10 % (3773271)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3773261"
% 3.10/1.10 % (3773272)Instruction limit reached!
% 3.10/1.10 % (3773272)------------------------------
% 3.10/1.10 % (3773272)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.10/1.10 % (3773272)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.10/1.10 % (3773272)CaDiCaL version: 2.1.3
% 3.10/1.10 % (3773272)Termination reason: Instruction limit
% 3.10/1.10 % (3773272)Termination phase: Saturation
% 3.10/1.10 % (3773272)Time elapsed: 0.071 s
% 3.10/1.10 % (3773272)Peak memory usage: 89 MB
% 3.10/1.10 % (3773272)Instructions burned: 130 (million)
% 3.10/1.10 % (3773280)lrs+10_1_sil=8000:sp=occurrence:random_seed=192410945:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 3.10/1.10 % (3773280)Also succeeded, but the first one will report.
% 3.10/1.10 % (3773281)lrs+10_1_sil=32000:urr=on:br=off:random_seed=4111915819:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 3.10/1.10 % (3773269)------------------------------
% 3.10/1.10 % (3773269)------------------------------
% 3.10/1.10 % (3773281)Instruction limit reached!
% 3.10/1.10 % (3773281)------------------------------
% 3.10/1.10 % (3773281)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.10/1.10 % (3773281)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.10/1.10 % (3773281)CaDiCaL version: 2.1.3
% 3.10/1.10 % (3773281)Termination reason: Instruction limit
% 3.10/1.10 % (3773281)Termination phase: Saturation
% 3.10/1.10 % (3773281)Time elapsed: 0.058 s
% 3.10/1.10 % (3773281)Peak memory usage: 89 MB
% 3.10/1.10 % (3773281)Instructions burned: 157 (million)
% 3.10/1.10 % (3773271)Refutation found. Thanks to Tanya!
% 3.10/1.10 % SZS status Theorem for theBenchmark
% 3.10/1.10 % SZS output start Proof for theBenchmark
% See solution above
% 3.74/1.29 % (3773271)------------------------------
% 3.74/1.29 % (3773271)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.74/1.29 % (3773271)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.74/1.29 % (3773271)CaDiCaL version: 2.1.3
% 3.74/1.29 % (3773271)Termination reason: Refutation
% 3.74/1.29 % (3773271)Time elapsed: 0.048 s
% 3.74/1.29 % (3773271)Peak memory usage: 90 MB
% 3.74/1.29 % (3773271)Instructions burned: 69 (million)
% 3.74/1.29 % (3773271)------------------------------
% 3.74/1.29 % (3773271)------------------------------
% 3.74/1.29 % (3773261)Success in time 0.448 s
% 3.74/1.29 % Vampire exiting
%------------------------------------------------------------------------------