TSTP Solution File: SWW522_5 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SWW522_5 : TPTP v8.1.2. Released v6.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n026.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 11:41:15 EDT 2024
% Result : Theorem 0.12s 0.36s
% Output : Refutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 68
% Syntax : Number of formulae : 81 ( 6 unt; 64 typ; 0 def)
% Number of atoms : 39 ( 5 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 40 ( 18 ~; 8 |; 10 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 9 ( 8 usr)
% Number of type conns : 113 ( 44 >; 69 *; 0 +; 0 <<)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-4 aty)
% Number of functors : 46 ( 46 usr; 8 con; 0-10 aty)
% Number of variables : 62 ( 21 !; 8 ?; 62 :)
% ( 33 !>; 0 ?*; 0 @-; 0 @+)
% 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: nat > nat ).
tff(func_def_29,type,
sK4: nat > nat ).
tff(func_def_30,type,
sK5: fun(nat,bool) > nat ).
tff(func_def_31,type,
sK6: fun(nat,bool) > nat ).
tff(func_def_32,type,
sK7:
!>[X0: $tType] : ( hoare_28830079triple(X0) > fun(X0,fun(state,bool)) ) ).
tff(func_def_33,type,
sK8:
!>[X0: $tType] : ( hoare_28830079triple(X0) > com ) ).
tff(func_def_34,type,
sK9:
!>[X0: $tType] : ( hoare_28830079triple(X0) > fun(X0,fun(state,bool)) ) ).
tff(func_def_35,type,
sK10:
!>[X0: $tType] : ( ( nat * fun(hoare_28830079triple(X0),bool) ) > hoare_28830079triple(X0) ) ).
tff(func_def_36,type,
sK11:
!>[X0: $tType] : ( ( fun(nat,fun(X0,X0)) * X0 * fun(nat,X0) ) > nat ) ).
tff(func_def_37,type,
sK12:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_38,type,
sK13: ( state * nat * state * com * com ) > state ).
tff(func_def_39,type,
sK14:
!>[X0: $tType] : ( ( fun(nat,fun(X0,X0)) * X0 * fun(nat,X0) ) > nat ) ).
tff(func_def_40,type,
sK15:
!>[X0: $tType] : ( ( fun(X0,fun(state,bool)) * com * fun(X0,fun(state,bool)) * nat ) > X0 ) ).
tff(func_def_41,type,
sK16:
!>[X0: $tType] : ( ( fun(X0,fun(state,bool)) * com * fun(X0,fun(state,bool)) * nat ) > state ) ).
tff(func_def_42,type,
sK17:
!>[X0: $tType] : ( ( fun(X0,fun(state,bool)) * com * fun(X0,fun(state,bool)) * nat ) > state ) ).
tff(func_def_43,type,
sK18: ( 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(f460,plain,
$false,
inference(subsumption_resolution,[],[f459,f289]) ).
tff(f289,plain,
p(sK0,sK1),
inference(cnf_transformation,[],[f244]) ).
tff(f244,plain,
( ~ p(sK0,sK2)
& evaln(skip,sK1,n,sK2)
& p(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f199,f243,f242]) ).
tff(f242,plain,
( ? [X0: a,X1: state] :
( ? [X2: state] :
( ~ p(X0,X2)
& evaln(skip,X1,n,X2) )
& p(X0,X1) )
=> ( ? [X2: state] :
( ~ p(sK0,X2)
& evaln(skip,sK1,n,X2) )
& p(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
tff(f243,plain,
( ? [X2: state] :
( ~ p(sK0,X2)
& evaln(skip,sK1,n,X2) )
=> ( ~ p(sK0,sK2)
& evaln(skip,sK1,n,sK2) ) ),
introduced(choice_axiom,[]) ).
tff(f199,plain,
? [X0: a,X1: state] :
( ? [X2: state] :
( ~ p(X0,X2)
& evaln(skip,X1,n,X2) )
& p(X0,X1) ),
inference(ennf_transformation,[],[f104]) ).
tff(f104,plain,
~ ! [X0: a,X1: state] :
( ! [X2: state] :
( p(X0,X2)
| ~ evaln(skip,X1,n,X2) )
| ~ p(X0,X1) ),
inference(rectify,[],[f103]) ).
tff(f103,negated_conjecture,
~ ! [X95: a,X96: state] :
( ! [X97: state] :
( p(X95,X97)
| ~ evaln(skip,X96,n,X97) )
| ~ p(X95,X96) ),
inference(negated_conjecture,[],[f102]) ).
tff(f102,conjecture,
! [X95: a,X96: state] :
( ! [X97: state] :
( p(X95,X97)
| ~ evaln(skip,X96,n,X97) )
| ~ p(X95,X96) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_1) ).
tff(f459,plain,
~ p(sK0,sK1),
inference(superposition,[],[f291,f456]) ).
tff(f456,plain,
sK1 = sK2,
inference(resolution,[],[f350,f290]) ).
tff(f290,plain,
evaln(skip,sK1,n,sK2),
inference(cnf_transformation,[],[f244]) ).
tff(f350,plain,
! [X2: state,X0: state,X1: nat] :
( ~ evaln(skip,X2,X1,X0)
| ( X0 = X2 ) ),
inference(cnf_transformation,[],[f223]) ).
tff(f223,plain,
! [X0: state,X1: nat,X2: state] :
( ( X0 = X2 )
| ~ evaln(skip,X2,X1,X0) ),
inference(ennf_transformation,[],[f148]) ).
tff(f148,plain,
! [X0: state,X1: nat,X2: state] :
( evaln(skip,X2,X1,X0)
=> ( X0 = X2 ) ),
inference(rectify,[],[f2]) ).
tff(f2,axiom,
! [X5: state,X3: nat,X4: state] :
( evaln(skip,X4,X3,X5)
=> ( X4 = X5 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_1_evaln__elim__cases_I1_J) ).
tff(f291,plain,
~ p(sK0,sK2),
inference(cnf_transformation,[],[f244]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SWW522_5 : TPTP v8.1.2. Released v6.0.0.
% 0.10/0.12 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.12/0.33 % Computer : n026.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Fri May 3 19:42:23 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.12/0.33 % (5164)Running in auto input_syntax mode. Trying TPTP
% 0.12/0.35 % (5167)WARNING: value z3 for option sas not known
% 0.12/0.35 % (5168)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.12/0.35 % (5171)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.12/0.35 % (5165)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.12/0.35 % (5169)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.12/0.35 % (5170)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.12/0.35 % (5166)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.12/0.36 % (5167)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.12/0.36 % (5171)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.12/0.36 % Exception at run slice level
% 0.12/0.36 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.12/0.36 % Exception at run slice level
% 0.12/0.36 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.12/0.36 % Exception at run slice level
% 0.12/0.36 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.12/0.36 % (5167)First to succeed.
% 0.12/0.36 % (5170)Also succeeded, but the first one will report.
% 0.12/0.36 % (5167)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-5164"
% 0.12/0.36 % (5167)Refutation found. Thanks to Tanya!
% 0.12/0.36 % SZS status Theorem for theBenchmark
% 0.12/0.36 % SZS output start Proof for theBenchmark
% See solution above
% 0.12/0.36 % (5167)------------------------------
% 0.12/0.36 % (5167)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.12/0.36 % (5167)Termination reason: Refutation
% 0.12/0.36
% 0.12/0.36 % (5167)Memory used [KB]: 1093
% 0.12/0.36 % (5167)Time elapsed: 0.010 s
% 0.12/0.36 % (5167)Instructions burned: 15 (million)
% 0.12/0.36 % (5164)Success in time 0.028 s
%------------------------------------------------------------------------------