%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWV379+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 : 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.45s 1.16s
% Output : Refutation 3.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 11
% Syntax : Number of formulae : 64 ( 15 unt; 2 def)
% Number of atoms : 152 ( 58 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 141 ( 53 ~; 60 |; 14 &)
% ( 4 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 8 ( 6 usr; 3 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-3 aty)
% Number of variables : 119 ( 3 sgn 116 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] :
( less_than(X0,X1)
| less_than(X1,X0) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',stricly_smaller_definition) ).
fof(f28,axiom,
! [X0,X1] :
( ok(triple(X0,X1,bad))
<=> $false ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax40) ).
fof(f29,axiom,
! [X0,X1,X2] :
( ~ ok(triple(X0,X1,X2))
=> X2 = bad ),
file('/export/starexec/sandbox/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/sandbox/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/sandbox/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/sandbox/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/sandbox/benchmark/theBenchmark.p',ax49) ).
fof(f42,conjecture,
! [X0,X1,X2] :
( ~ ok(triple(X0,X1,X2))
=> ~ ok(findmin_cpq_eff(triple(X0,X1,X2))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l15_co) ).
fof(f43,negated_conjecture,
~ ! [X0,X1,X2] :
( ~ ok(triple(X0,X1,X2))
=> ~ ok(findmin_cpq_eff(triple(X0,X1,X2))) ),
inference(negated_conjecture,[status(cth)],[f42]) ).
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(f49,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(f50,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(f52,plain,
! [X0,X1] :
( ( less_than(X0,X1)
& ~ less_than(X1,X0) )
=> strictly_less_than(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f4]) ).
fof(f55,plain,
! [X0,X1] :
( strictly_less_than(X0,X1)
| ~ less_than(X0,X1)
| less_than(X1,X0) ),
inference(ennf_transformation,[],[f52]) ).
fof(f56,plain,
! [X0,X1] :
( strictly_less_than(X0,X1)
| ~ less_than(X0,X1)
| less_than(X1,X0) ),
inference(flattening,[],[f55]) ).
fof(f69,plain,
! [X0,X1,X2] :
( X2 = bad
| ok(triple(X0,X1,X2)) ),
inference(ennf_transformation,[],[f29]) ).
fof(f75,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(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(flattening,[],[f75]) ).
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))
| ~ strictly_less_than(findmin_pqp_res(X0),lookup_slb(X1,findmin_pqp_res(X0))) ),
inference(ennf_transformation,[],[f49]) ).
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(flattening,[],[f77]) ).
fof(f79,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,[],[f50]) ).
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(flattening,[],[f79]) ).
fof(f82,plain,
? [X0,X1,X2] :
( ok(findmin_cpq_eff(triple(X0,X1,X2)))
& ~ ok(triple(X0,X1,X2)) ),
inference(ennf_transformation,[],[f43]) ).
fof(f89,plain,
( ok(findmin_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)],[f82]) ).
fof(f91,plain,
! [X0,X1] :
( less_than(X0,X1)
| less_than(X1,X0) ),
inference(cnf_transformation,[],[f2]) ).
fof(f93,plain,
! [X0,X1] :
( strictly_less_than(X0,X1)
| ~ less_than(X0,X1)
| less_than(X1,X0) ),
inference(cnf_transformation,[],[f56]) ).
fof(f124,plain,
! [X0,X1] : ~ ok(triple(X0,X1,bad)),
inference(cnf_transformation,[],[f47]) ).
fof(f125,plain,
! [X2,X0,X1] :
( ok(triple(X0,X1,X2))
| bad = X2 ),
inference(cnf_transformation,[],[f69]) ).
fof(f130,plain,
! [X0,X1] : findmin_cpq_eff(triple(X0,create_slb,X1)) = triple(X0,create_slb,bad),
inference(cnf_transformation,[],[f34]) ).
fof(f131,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,[],[f76]) ).
fof(f132,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,[],[f78]) ).
fof(f133,plain,
! [X2,X0,X1] :
( ~ less_than(lookup_slb(X1,findmin_pqp_res(X0)),findmin_pqp_res(X0))
| create_slb = X1
| ~ contains_slb(X1,findmin_pqp_res(X0))
| findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),X2) ),
inference(cnf_transformation,[],[f80]) ).
fof(f138,plain,
~ ok(triple(sK0,sK1,sK2)),
inference(cnf_transformation,[],[f89]) ).
fof(f139,plain,
ok(findmin_cpq_eff(triple(sK0,sK1,sK2))),
inference(cnf_transformation,[],[f89]) ).
fof(f143,plain,
bad = sK2,
inference(resolution,[],[f125,f138]) ).
fof(f145,plain,
ok(findmin_cpq_eff(triple(sK0,sK1,bad))),
inference(superposition,[],[f139,f143]) ).
fof(f170,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,[],[f132,f131]) ).
fof(f172,plain,
! [X0,X1] :
( strictly_less_than(X0,X1)
| less_than(X1,X0) ),
inference(forward_subsumption_resolution,[],[f93,f91]) ).
fof(f176,plain,
! [X2,X0,X1] :
( less_than(lookup_slb(X0,findmin_pqp_res(X1)),findmin_pqp_res(X1))
| create_slb = X0
| findmin_cpq_eff(triple(X1,X0,X2)) = triple(X1,update_slb(X0,findmin_pqp_res(X1)),bad) ),
inference(resolution,[],[f172,f170]) ).
fof(f339,plain,
! [X2,X3,X0,X1] :
( create_slb = X0
| findmin_cpq_eff(triple(X1,X0,X2)) = triple(X1,update_slb(X0,findmin_pqp_res(X1)),bad)
| create_slb = X0
| ~ contains_slb(X0,findmin_pqp_res(X1))
| findmin_cpq_eff(triple(X1,X0,X3)) = triple(X1,update_slb(X0,findmin_pqp_res(X1)),X3) ),
inference(resolution,[],[f176,f133]) ).
fof(f343,plain,
! [X2,X3,X0,X1] :
( create_slb = X0
| findmin_cpq_eff(triple(X1,X0,X2)) = triple(X1,update_slb(X0,findmin_pqp_res(X1)),bad)
| ~ contains_slb(X0,findmin_pqp_res(X1))
| findmin_cpq_eff(triple(X1,X0,X3)) = triple(X1,update_slb(X0,findmin_pqp_res(X1)),X3) ),
inference(duplicate_literal_removal,[],[f339]) ).
fof(f345,plain,
! [X2,X3,X0,X1] :
( findmin_cpq_eff(triple(X1,X0,X3)) = triple(X1,update_slb(X0,findmin_pqp_res(X1)),X3)
| findmin_cpq_eff(triple(X1,X0,X2)) = triple(X1,update_slb(X0,findmin_pqp_res(X1)),bad)
| create_slb = X0 ),
inference(forward_subsumption_resolution,[],[f343,f131]) ).
fof(f496,plain,
! [X2,X0,X1] :
( ~ ok(findmin_cpq_eff(triple(X0,X1,bad)))
| findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad)
| create_slb = X1 ),
inference(superposition,[],[f124,f345]) ).
fof(f719,plain,
! [X0] :
( findmin_cpq_eff(triple(sK0,sK1,X0)) = triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad)
| create_slb = sK1 ),
inference(resolution,[],[f496,f145]) ).
fof(f724,definition,
( spl3_1
<=> create_slb = sK1 ),
introduced(definition,[new_symbols(definition,[spl3_1])],[avatar_definition]) ).
fof(f726,plain,
( create_slb = sK1
| ~ spl3_1 ),
inference(avatar_component_clause,[],[f724]) ).
fof(f728,definition,
( spl3_2
<=> ! [X0] : findmin_cpq_eff(triple(sK0,sK1,X0)) = triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad) ),
introduced(definition,[new_symbols(definition,[spl3_2])],[avatar_definition]) ).
fof(f729,plain,
( ! [X0] : findmin_cpq_eff(triple(sK0,sK1,X0)) = triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad)
| ~ spl3_2 ),
inference(avatar_component_clause,[],[f728]) ).
fof(f730,plain,
( spl3_1
| spl3_2 ),
inference(avatar_split_clause,[],[f719,f728,f724]) ).
fof(f744,plain,
( ! [X0] : ~ ok(findmin_cpq_eff(triple(sK0,sK1,X0)))
| ~ spl3_2 ),
inference(superposition,[],[f124,f729]) ).
fof(f845,plain,
( ok(findmin_cpq_eff(triple(sK0,create_slb,bad)))
| ~ spl3_1 ),
inference(superposition,[],[f145,f726]) ).
fof(f850,plain,
( ok(triple(sK0,create_slb,bad))
| ~ spl3_1 ),
inference(forward_demodulation,[],[f845,f130]) ).
fof(f854,plain,
( $false
| ~ spl3_1 ),
inference(forward_subsumption_resolution,[],[f850,f124]) ).
fof(f855,plain,
~ spl3_1,
inference(avatar_contradiction_clause,[],[f854]) ).
fof(f868,plain,
( $false
| ~ spl3_2 ),
inference(resolution,[],[f744,f139]) ).
fof(f872,plain,
~ spl3_2,
inference(avatar_contradiction_clause,[],[f868]) ).
cnf(s1,plain,
( spl3_1
| spl3_2 ),
inference(sat_conversion,[],[f730]) ).
cnf(s11,plain,
~ spl3_1,
inference(sat_conversion,[],[f855]) ).
cnf(s13,plain,
~ spl3_2,
inference(sat_conversion,[],[f872]) ).
cnf(s14,plain,
$false,
inference(rat,[],[s1,s13,s11]) ).
fof(f873,plain,
$false,
inference(avatar_sat_refutation,[],[s14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWV379+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.08 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.25 % Computer : n002.cluster.edu
% 0.11/0.25 % Model : x86_64 x86_64
% 0.11/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.25 % Memory : 8046.5625MB
% 0.11/0.25 % OS : Linux 6.8.0-71-generic
% 0.11/0.25 % CPULimit : 300
% 0.11/0.25 % WCLimit : 300
% 0.11/0.25 % DateTime : Mon Sep 28 10:48:07 UTC 2026
% 0.11/0.26 % CPUTime :
% 0.11/0.26 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.29 Running first-order theorem proving
% 0.11/0.29 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.45/1.16 % (275100)Detected formulas, will run a generic FOF schedule.
% 3.45/1.16 % (275226)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=365249969:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.45/1.16 % (275226)Refutation not found, incomplete strategy
% 3.45/1.16 % (275226)------------------------------
% 3.45/1.16 % (275226)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.45/1.16 % (275226)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.45/1.16 % (275226)CaDiCaL version: 2.1.3
% 3.45/1.16 % (275226)Termination reason: Refutation not found, incomplete strategy
% 3.45/1.16 % (275226)Time elapsed: 0.001 s
% 3.45/1.16 % (275226)Peak memory usage: 88 MB
% 3.45/1.16 % (275226)Instructions burned: 1 (million)
% 3.45/1.16 % (275220)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=212916790:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.45/1.16 % (275222)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=150893868:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.45/1.16 % (275230)dis-21_1_sil=8000:lcm=predicate:random_seed=1532478023: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.45/1.16 % (275219)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=4052352465:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.45/1.16 % (275228)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3763934826:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.45/1.16 % (275224)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=142263064:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.45/1.16 % (275230)Refutation not found, incomplete strategy
% 3.45/1.16 % (275230)------------------------------
% 3.45/1.16 % (275230)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.45/1.16 % (275230)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.45/1.16 % (275230)CaDiCaL version: 2.1.3
% 3.45/1.16 % (275230)Termination reason: Refutation not found, incomplete strategy
% 3.45/1.16 % (275230)Time elapsed: 0.003 s
% 3.45/1.16 % (275230)Peak memory usage: 88 MB
% 3.45/1.16 % (275230)Instructions burned: 3 (million)
% 3.45/1.16 % (275224)Refutation not found, incomplete strategy
% 3.45/1.16 % (275224)------------------------------
% 3.45/1.16 % (275224)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.45/1.16 % (275224)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.45/1.16 % (275224)CaDiCaL version: 2.1.3
% 3.45/1.16 % (275224)Termination reason: Refutation not found, incomplete strategy
% 3.45/1.16 % (275224)Time elapsed: 0.001 s
% 3.45/1.16 % (275224)Peak memory usage: 88 MB
% 3.45/1.16 % (275228)First to succeed.
% 3.45/1.16 % (275228)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-275100"
% 3.45/1.16 % (275226)------------------------------
% 3.45/1.16 % (275226)------------------------------
% 3.45/1.16 % (275271)lrs+10_1_sil=8000:sp=occurrence:random_seed=2002566685:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 3.45/1.16 % (275230)------------------------------
% 3.45/1.16 % (275230)------------------------------
% 3.45/1.16 % (275224)------------------------------
% 3.45/1.16 % (275224)------------------------------
% 3.45/1.16 % (275271)Instruction limit reached!
% 3.45/1.16 % (275271)------------------------------
% 3.45/1.16 % (275271)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.45/1.16 % (275271)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.45/1.16 % (275271)CaDiCaL version: 2.1.3
% 3.45/1.16 % (275271)Termination reason: Instruction limit
% 3.45/1.16 % (275271)Termination phase: Saturation
% 3.45/1.16 % (275271)Time elapsed: 0.080 s
% 3.45/1.16 % (275271)Peak memory usage: 89 MB
% 3.45/1.16 % (275271)Instructions burned: 286 (million)
% 3.45/1.16 % (275228)Refutation found. Thanks to Tanya!
% 3.45/1.16 % SZS status Theorem for theBenchmark
% 3.45/1.16 % SZS output start Proof for theBenchmark
% See solution above
% 3.75/1.26 % (275228)------------------------------
% 3.75/1.26 % (275228)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.75/1.26 % (275228)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.75/1.26 % (275228)CaDiCaL version: 2.1.3
% 3.75/1.26 % (275228)Termination reason: Refutation
% 3.75/1.26 % (275228)Time elapsed: 0.046 s
% 3.75/1.26 % (275228)Peak memory usage: 90 MB
% 3.75/1.26 % (275228)Instructions burned: 63 (million)
% 3.75/1.26 % (275228)------------------------------
% 3.75/1.26 % (275228)------------------------------
% 3.75/1.26 % (275100)Success in time 0.433 s
% 3.75/1.26 % Vampire exiting
%------------------------------------------------------------------------------