%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWW522_5 : TPTP v9.3.1. Released v6.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n003.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:30:44 PM UTC 2026
% Result : Theorem 0.24s 1.20s
% Output : Refutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 2
% Syntax : Number of formulae : 13 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 24 ( 4 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 22 ( 11 ~; 6 |; 4 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 9 ( 8 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 18 ( 16 usr; 1 prp; 0-4 aty)
% Number of functors : 36 ( 36 usr; 8 con; 0-10 aty)
% Number of variables : 18 ( 15 !; 3 ?; 18 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
a: $tType ).
tff(type_def_6,type,
com: $tType ).
tff(type_def_7,type,
loc: $tType ).
tff(type_def_8,type,
pname: $tType ).
tff(type_def_9,type,
state: $tType ).
tff(type_def_10,type,
vname: $tType ).
tff(type_def_11,type,
bool: $tType ).
tff(type_def_12,type,
hoare_28830079triple: $tType > $tType ).
tff(type_def_13,type,
nat: $tType ).
tff(type_def_14,type,
fun: ( $tType * $tType ) > $tType ).
tff(func_def_0,type,
ass: ( vname * fun(state,nat) ) > com ).
tff(func_def_1,type,
cond: ( fun(state,bool) * com * com ) > com ).
tff(func_def_2,type,
local: ( loc * fun(state,nat) * com ) > com ).
tff(func_def_3,type,
skip: com ).
tff(func_def_4,type,
semi: ( com * com ) > com ).
tff(func_def_5,type,
com_case:
!>[X0: $tType] : ( ( X0 * fun(vname,fun(fun(state,nat),X0)) * fun(loc,fun(fun(state,nat),fun(com,X0))) * fun(com,fun(com,X0)) * fun(fun(state,bool),fun(com,fun(com,X0))) * fun(fun(state,bool),fun(com,X0)) * fun(pname,X0) * fun(vname,fun(pname,fun(fun(state,nat),X0))) * com ) > X0 ) ).
tff(func_def_6,type,
com_rec:
!>[X0: $tType] : ( ( X0 * fun(vname,fun(fun(state,nat),X0)) * fun(loc,fun(fun(state,nat),fun(com,fun(X0,X0)))) * fun(com,fun(com,fun(X0,fun(X0,X0)))) * fun(fun(state,bool),fun(com,fun(com,fun(X0,fun(X0,X0))))) * fun(fun(state,bool),fun(com,fun(X0,X0))) * fun(pname,X0) * fun(vname,fun(pname,fun(fun(state,nat),X0))) * com ) > X0 ) ).
tff(func_def_7,type,
com_size: com > nat ).
tff(func_def_8,type,
plus_plus:
!>[X0: $tType] : ( ( X0 * X0 ) > X0 ) ).
tff(func_def_9,type,
zero_zero:
!>[X0: $tType] : X0 ).
tff(func_def_10,type,
hoare_1841697145triple:
!>[X0: $tType] : ( ( fun(X0,fun(state,bool)) * com * fun(X0,fun(state,bool)) ) > hoare_28830079triple(X0) ) ).
tff(func_def_11,type,
hoare_376461865e_case:
!>[X0: $tType,X1: $tType] : ( ( fun(fun(X0,fun(state,bool)),fun(com,fun(fun(X0,fun(state,bool)),X1))) * hoare_28830079triple(X0) ) > X1 ) ).
tff(func_def_12,type,
hoare_678420151le_rec:
!>[X0: $tType,X1: $tType] : ( ( fun(fun(X0,fun(state,bool)),fun(com,fun(fun(X0,fun(state,bool)),X1))) * hoare_28830079triple(X0) ) > X1 ) ).
tff(func_def_13,type,
hoare_47506394e_size:
!>[X0: $tType] : ( ( fun(X0,nat) * hoare_28830079triple(X0) ) > nat ) ).
tff(func_def_14,type,
suc: nat > nat ).
tff(func_def_15,type,
nat_case:
!>[X0: $tType] : ( ( X0 * fun(nat,X0) * nat ) > X0 ) ).
tff(func_def_16,type,
nat_rec:
!>[X0: $tType] : ( ( X0 * fun(nat,fun(X0,X0)) * nat ) > X0 ) ).
tff(func_def_17,type,
semiri532925092at_aux:
!>[X0: $tType] : ( ( fun(X0,X0) * nat * X0 ) > X0 ) ).
tff(func_def_18,type,
size_size:
!>[X0: $tType] : ( X0 > nat ) ).
tff(func_def_19,type,
update: ( state * vname * nat ) > state ).
tff(func_def_20,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_21,type,
fFalse: bool ).
tff(func_def_22,type,
fTrue: bool ).
tff(func_def_23,type,
ga: fun(hoare_28830079triple(a),bool) ).
tff(func_def_24,type,
n: nat ).
tff(func_def_25,type,
sK0: a ).
tff(func_def_26,type,
sK1: state ).
tff(func_def_27,type,
sK2: state ).
tff(func_def_28,type,
sK3:
!>[X0: $tType] : ( ( fun(X0,fun(state,bool)) * com * fun(X0,fun(state,bool)) * nat ) > X0 ) ).
tff(func_def_29,type,
sK4:
!>[X0: $tType] : ( ( fun(X0,fun(state,bool)) * com * fun(X0,fun(state,bool)) * nat ) > state ) ).
tff(func_def_30,type,
sK5:
!>[X0: $tType] : ( ( fun(X0,fun(state,bool)) * com * fun(X0,fun(state,bool)) * nat ) > state ) ).
tff(func_def_31,type,
sK6:
!>[X0: $tType] : ( ( nat * fun(hoare_28830079triple(X0),bool) ) > hoare_28830079triple(X0) ) ).
tff(func_def_32,type,
sK7: ( state * nat * state * com * com ) > state ).
tff(func_def_33,type,
sK8: ( state * state * com * state * state * com ) > nat ).
tff(pred_def_1,type,
zero:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
semiring_1:
!>[X0: $tType] : $o ).
tff(pred_def_3,type,
cancel_semigroup_add:
!>[X0: $tType] : $o ).
tff(pred_def_4,type,
wt: com > $o ).
tff(pred_def_5,type,
hoare_592965047valids:
!>[X0: $tType] : ( ( fun(hoare_28830079triple(X0),bool) * fun(hoare_28830079triple(X0),bool) ) > $o ) ).
tff(pred_def_6,type,
hoare_1633586161_valid:
!>[X0: $tType] : ( ( nat * hoare_28830079triple(X0) ) > $o ) ).
tff(pred_def_7,type,
evaln: ( com * state * nat * state ) > $o ).
tff(pred_def_8,type,
member:
!>[X0: $tType] : ( ( X0 * fun(X0,bool) ) > $o ) ).
tff(pred_def_9,type,
pp: bool > $o ).
tff(pred_def_10,type,
p: ( a * state ) > $o ).
tff(pred_def_11,type,
sP9: com > $o ).
tff(pred_def_12,type,
sP10: com > $o ).
tff(pred_def_13,type,
sP11: com > $o ).
tff(pred_def_14,type,
sP12: com > $o ).
tff(pred_def_15,type,
sP13: com > $o ).
tff(pred_def_16,type,
sP14: com > $o ).
tff(f2,axiom,
! [X0: state,X1: nat,X2: state] :
( evaln(skip,X2,X1,X0)
=> ( X0 = X2 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_1_evaln__elim__cases_I1_J) ).
tff(f102,conjecture,
! [X0: a,X1: state] :
( ~ p(X0,X1)
| ! [X2: state] :
( ~ evaln(skip,X1,n,X2)
| p(X0,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_1) ).
tff(f103,negated_conjecture,
~ ! [X0: a,X1: state] :
( ~ p(X0,X1)
| ! [X2: state] :
( ~ evaln(skip,X1,n,X2)
| p(X0,X2) ) ),
inference(negated_conjecture,[status(cth)],[f102]) ).
tff(f106,plain,
? [X0: a,X1: state] :
( p(X0,X1)
& ? [X2: state] :
( evaln(skip,X1,n,X2)
& ~ p(X0,X2) ) ),
inference(ennf_transformation,[],[f103]) ).
tff(f116,plain,
! [X0: state,X1: nat,X2: state] :
( ( X0 = X2 )
| ~ evaln(skip,X2,X1,X0) ),
inference(ennf_transformation,[],[f2]) ).
tff(f117,plain,
( p(sK0,sK1)
& evaln(skip,sK1,n,sK2)
& ~ p(sK0,sK2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f106]) ).
tff(f127,plain,
~ p(sK0,sK2),
inference(cnf_transformation,[],[f117]) ).
tff(f128,plain,
evaln(skip,sK1,n,sK2),
inference(cnf_transformation,[],[f117]) ).
tff(f129,plain,
p(sK0,sK1),
inference(cnf_transformation,[],[f117]) ).
tff(f151,plain,
! [X2: state,X0: state,X1: nat] :
( ~ evaln(skip,X2,X1,X0)
| ( X0 = X2 ) ),
inference(cnf_transformation,[],[f116]) ).
tff(f165,plain,
sK1 = sK2,
inference(resolution,[],[f128,f151]) ).
tff(f168,plain,
~ p(sK0,sK1),
inference(superposition,[],[f127,f165]) ).
tff(f169,plain,
$false,
inference(forward_subsumption_resolution,[],[f168,f129]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWW522_5 : TPTP v9.3.1. Released v6.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.21 % Computer : n003.cluster.edu
% 0.10/0.21 % Model : x86_64 x86_64
% 0.10/0.21 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.21 % Memory : 8046.5625MB
% 0.10/0.21 % OS : Linux 6.8.0-71-generic
% 0.10/0.21 % CPULimit : 300
% 0.10/0.21 % WCLimit : 300
% 0.10/0.21 % DateTime : Mon Sep 28 14:19:12 UTC 2026
% 0.10/0.22 % CPUTime :
% 0.10/0.22 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.25 Running first-order theorem proving
% 0.10/0.25 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
% 0.24/1.20 % (1614003)Detected formulas, will run a generic FOF schedule.
% 0.24/1.20 % (1614136)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1688771443:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 0.24/1.20 % (1614136)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.24/1.20 % (1614136)First to succeed.
% 0.24/1.20 % (1614136)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1614003"
% 0.24/1.20 % (1614131)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=3663579535:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 0.24/1.20 % (1614135)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=2988452864:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 0.24/1.20 % (1614137)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3147637011:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 0.24/1.20 % (1614139)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3847098637:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 0.24/1.20 % (1614137)Also succeeded, but the first one will report.
% 0.24/1.20 % (1614135)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.24/1.20 % (1614139)Also succeeded, but the first one will report.
% 0.24/1.20 % (1614140)dis-21_1_sil=8000:lcm=predicate:random_seed=603371198: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)
% 0.24/1.20 % (1614133)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=780929092:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 0.24/1.20 % (1614140)Instruction limit reached!
% 0.24/1.20 % (1614140)------------------------------
% 0.24/1.20 % (1614140)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.24/1.20 % (1614140)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.24/1.20 % (1614140)CaDiCaL version: 2.1.3
% 0.24/1.20 % (1614140)Termination reason: Instruction limit
% 0.24/1.20 % (1614140)Termination phase: Saturation
% 0.24/1.20 % (1614140)Time elapsed: 0.075 s
% 0.24/1.20 % (1614140)Peak memory usage: 89 MB
% 0.24/1.20 % (1614140)Instructions burned: 130 (million)
% 0.24/1.20 % (1614136)Refutation found. Thanks to Tanya!
% 0.24/1.20 % SZS status Theorem for theBenchmark
% 0.24/1.20 % SZS output start Proof for theBenchmark
% See solution above
% 0.24/1.20 % (1614136)------------------------------
% 0.24/1.20 % (1614136)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.24/1.20 % (1614136)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.24/1.20 % (1614136)CaDiCaL version: 2.1.3
% 0.24/1.20 % (1614136)Termination reason: Refutation
% 0.24/1.20 % (1614136)Time elapsed: 0.002 s
% 0.24/1.20 % (1614136)Peak memory usage: 88 MB
% 0.24/1.20 % (1614136)Instructions burned: 3 (million)
% 0.24/1.20 % (1614136)------------------------------
% 0.24/1.20 % (1614136)------------------------------
% 0.24/1.20 % (1614003)Success in time 0.3 s
% 0.24/1.20 % Vampire exiting
%------------------------------------------------------------------------------