%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWW525_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 : n004.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:45 PM UTC 2026
% Result : ContradictoryAxioms 2.59s 1.12s
% Output : Refutation 2.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 17 ( 9 unt; 0 typ; 0 def)
% Number of atoms : 28 ( 14 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 25 ( 14 ~; 6 |; 2 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 8 ( 7 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 2 prp; 0-4 aty)
% Number of functors : 22 ( 22 usr; 8 con; 0-10 aty)
% Number of variables : 18 ( 15 !; 3 ?; 18 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
com: $tType ).
tff(type_def_6,type,
loc: $tType ).
tff(type_def_7,type,
pname: $tType ).
tff(type_def_8,type,
state: $tType ).
tff(type_def_9,type,
vname: $tType ).
tff(type_def_10,type,
bool: $tType ).
tff(type_def_11,type,
nat: $tType ).
tff(type_def_12,type,
fun: ( $tType * $tType ) > $tType ).
tff(func_def_0,type,
ass: ( vname * fun(state,nat) ) > com ).
tff(func_def_1,type,
call: ( vname * pname * fun(state,nat) ) > com ).
tff(func_def_2,type,
cond: ( fun(state,bool) * com * com ) > com ).
tff(func_def_3,type,
local: ( loc * fun(state,nat) * com ) > com ).
tff(func_def_4,type,
skip: com ).
tff(func_def_5,type,
semi: ( com * com ) > com ).
tff(func_def_6,type,
while: ( fun(state,bool) * com ) > com ).
tff(func_def_7,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_8,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_9,type,
update: ( state * vname * nat ) > state ).
tff(func_def_10,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_11,type,
fFalse: bool ).
tff(func_def_12,type,
fTrue: bool ).
tff(func_def_13,type,
z: state ).
tff(func_def_14,type,
c: com ).
tff(func_def_15,type,
s: state ).
tff(func_def_16,type,
sK0: state > state ).
tff(func_def_17,type,
sK1: state > state ).
tff(func_def_18,type,
sK2: state ).
tff(func_def_19,type,
sK3: state ).
tff(func_def_20,type,
sK4: ( state * state * com * com ) > state ).
tff(pred_def_1,type,
wt: com > $o ).
tff(pred_def_3,type,
evalc: ( com * state * state ) > $o ).
tff(pred_def_4,type,
evaln: ( com * state * nat * state ) > $o ).
tff(pred_def_5,type,
pp: bool > $o ).
tff(f2,axiom,
( hoare_531836380gleton
=> ! [X0: state] :
~ ! [X1: state] : ( X1 = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_1_single__stateE) ).
tff(f101,axiom,
hoare_531836380gleton,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
tff(f102,axiom,
! [X0: state] :
( ! [X1: state] :
( evalc(c,z,X1)
=> ( X0 = X1 ) )
=> ( X0 = s ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_1) ).
tff(f103,axiom,
~ ? [X0: state] : evalc(c,z,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_2) ).
tff(f108,plain,
! [X0: state] :
( ( X0 = s )
| ? [X1: state] :
( ( X0 != X1 )
& evalc(c,z,X1) ) ),
inference(ennf_transformation,[],[f102]) ).
tff(f109,plain,
! [X0: state] : ~ evalc(c,z,X0),
inference(ennf_transformation,[],[f103]) ).
tff(f110,plain,
( ! [X0: state] :
? [X1: state] : ( X0 != X1 )
| ~ hoare_531836380gleton ),
inference(ennf_transformation,[],[f2]) ).
tff(f117,plain,
! [X0: state] :
( ( X0 = s )
| ( ( sK0(X0) != X0 )
& evalc(c,z,sK0(X0)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X1,sK0(X0))],[f108]) ).
tff(f118,plain,
( ! [X0: state] : ( sK1(X0) != X0 )
| ~ hoare_531836380gleton ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X1,sK1(X0))],[f110]) ).
tff(f131,plain,
hoare_531836380gleton,
inference(cnf_transformation,[],[f101]) ).
tff(f132,plain,
! [X0: state] :
( ( s = X0 )
| evalc(c,z,sK0(X0)) ),
inference(cnf_transformation,[],[f117]) ).
tff(f134,plain,
! [X0: state] : ~ evalc(c,z,X0),
inference(cnf_transformation,[],[f109]) ).
tff(f136,plain,
! [X0: state] :
( ( sK1(X0) != X0 )
| ~ hoare_531836380gleton ),
inference(cnf_transformation,[],[f118]) ).
tff(f188,plain,
! [X0: state] : ( sK1(X0) != X0 ),
inference(forward_subsumption_resolution,[],[f136,f131]) ).
tff(f190,plain,
! [X0: state] : ( s = X0 ),
inference(forward_subsumption_resolution,[],[f132,f134]) ).
tff(f194,plain,
! [X0: state] : ( s != X0 ),
inference(superposition,[],[f188,f190]) ).
tff(f195,plain,
$false,
inference(forward_subsumption_resolution,[],[f194,f190]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWW525_5 : TPTP v9.3.1. Released v6.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.16 % Computer : n004.cluster.edu
% 0.10/0.16 % Model : x86_64 x86_64
% 0.10/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.16 % Memory : 8046.5625MB
% 0.10/0.16 % OS : Linux 6.8.0-71-generic
% 0.10/0.16 % CPULimit : 300
% 0.10/0.16 % WCLimit : 300
% 0.10/0.16 % DateTime : Mon Sep 28 14:17:22 UTC 2026
% 0.10/0.17 % CPUTime :
% 0.10/0.17 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.20 Running first-order theorem proving
% 0.10/0.20 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
% 2.59/1.12 % (375519)Detected formulas, will run a generic FOF schedule.
% 2.59/1.12 % (375528)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=877259037:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.59/1.12 % (375528)First to succeed.
% 2.59/1.12 % (375528)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-375519"
% 2.59/1.12 % (375524)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=972443026:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.59/1.12 % (375530)dis-21_1_sil=8000:lcm=predicate:random_seed=3542253431: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)
% 2.59/1.12 % (375529)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3291470828:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.59/1.12 % (375527)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2477193495:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.59/1.12 % (375525)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=115862293:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.59/1.12 % (375526)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=1692345483:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.59/1.12 % (375527)Also succeeded, but the first one will report.
% 2.59/1.12 % (375526)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 2.59/1.12 % (375529)Also succeeded, but the first one will report.
% 2.59/1.12 % (375530)Also succeeded, but the first one will report.
% 2.59/1.12 % (375528)Refutation found. Thanks to Tanya!
% 2.59/1.12 % SZS status ContradictoryAxioms for theBenchmark
% 2.59/1.12 % SZS output start Proof for theBenchmark
% See solution above
% 2.59/1.12 % (375528)------------------------------
% 2.59/1.12 % (375528)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.59/1.12 % (375528)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.59/1.12 % (375528)CaDiCaL version: 2.1.3
% 2.59/1.12 % (375528)Termination reason: Refutation
% 2.59/1.12 % (375528)Time elapsed: 0.002 s
% 2.59/1.12 % (375528)Peak memory usage: 88 MB
% 2.59/1.12 % (375528)Instructions burned: 3 (million)
% 2.59/1.12 % (375528)------------------------------
% 2.59/1.12 % (375528)------------------------------
% 2.59/1.12 % (375519)Success in time 0.289 s
% 2.59/1.12 % Vampire exiting
%------------------------------------------------------------------------------