TSTP Solution File: SWW522_5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWW522_5 : TPTP v8.2.0. Released v6.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n032.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 : Tue May 21 07:01:04 EDT 2024
% Result : Theorem 0.56s 0.74s
% Output : Refutation 0.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 58
% Syntax : Number of formulae : 71 ( 6 unt; 54 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 : 98 ( 34 >; 64 *; 0 +; 0 <<)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-4 aty)
% Number of functors : 36 ( 36 usr; 8 con; 0-10 aty)
% Number of variables : 55 ( 21 !; 8 ?; 55 :)
% ( 26 !>; 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:
!>[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(f181,plain,
$false,
inference(subsumption_resolution,[],[f180,f151]) ).
tff(f151,plain,
p(sK0,sK1),
inference(cnf_transformation,[],[f136]) ).
tff(f136,plain,
( ~ p(sK0,sK2)
& evaln(skip,sK1,n,sK2)
& p(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f123,f135,f134]) ).
tff(f134,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(f135,plain,
( ? [X2: state] :
( ~ p(sK0,X2)
& evaln(skip,sK1,n,X2) )
=> ( ~ p(sK0,sK2)
& evaln(skip,sK1,n,sK2) ) ),
introduced(choice_axiom,[]) ).
tff(f123,plain,
? [X0: a,X1: state] :
( ? [X2: state] :
( ~ p(X0,X2)
& evaln(skip,X1,n,X2) )
& p(X0,X1) ),
inference(ennf_transformation,[],[f105]) ).
tff(f105,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/sandbox2/benchmark/theBenchmark.p',conj_1) ).
tff(f180,plain,
~ p(sK0,sK1),
inference(backward_demodulation,[],[f153,f177]) ).
tff(f177,plain,
sK1 = sK2,
inference(unit_resulting_resolution,[],[f152,f175]) ).
tff(f175,plain,
! [X2: state,X0: state,X1: nat] :
( ( X0 = X2 )
| ~ evaln(skip,X2,X1,X0) ),
inference(cnf_transformation,[],[f133]) ).
tff(f133,plain,
! [X0: state,X1: nat,X2: state] :
( ( X0 = X2 )
| ~ evaln(skip,X2,X1,X0) ),
inference(ennf_transformation,[],[f120]) ).
tff(f120,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/sandbox2/benchmark/theBenchmark.p',fact_1_evaln__elim__cases_I1_J) ).
tff(f152,plain,
evaln(skip,sK1,n,sK2),
inference(cnf_transformation,[],[f136]) ).
tff(f153,plain,
~ p(sK0,sK2),
inference(cnf_transformation,[],[f136]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SWW522_5 : TPTP v8.2.0. Released v6.0.0.
% 0.03/0.12 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.10/0.31 % Computer : n032.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Sat May 18 21:03:37 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.10/0.31 This is a TF1_THM_EQU_NAR problem
% 0.10/0.31 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.56/0.74 % (11627)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on theBenchmark for (2995ds/34Mi)
% 0.56/0.74 % (11630)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2995ds/33Mi)
% 0.56/0.74 % (11629)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.56/0.74 % (11628)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on theBenchmark for (2995ds/51Mi)
% 0.56/0.74 % (11633)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on theBenchmark for (2995ds/83Mi)
% 0.56/0.74 % (11631)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on theBenchmark for (2995ds/34Mi)
% 0.56/0.74 % (11634)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2995ds/56Mi)
% 0.56/0.74 % (11632)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2995ds/45Mi)
% 0.56/0.74 % (11633)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.56/0.74 % (11630)First to succeed.
% 0.56/0.74 % (11630)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-11626"
% 0.56/0.74 % (11633)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.56/0.74 % (11630)Refutation found. Thanks to Tanya!
% 0.56/0.74 % SZS status Theorem for theBenchmark
% 0.56/0.74 % SZS output start Proof for theBenchmark
% See solution above
% 0.56/0.74 % (11630)------------------------------
% 0.56/0.74 % (11630)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.74 % (11630)Termination reason: Refutation
% 0.56/0.74
% 0.56/0.74 % (11630)Memory used [KB]: 1123
% 0.56/0.74 % (11630)Time elapsed: 0.004 s
% 0.56/0.74 % (11630)Instructions burned: 5 (million)
% 0.56/0.74 % (11626)Success in time 0.422 s
% 0.56/0.74 % Vampire---4.8 exiting
%------------------------------------------------------------------------------