TSTP Solution File: SWW551_5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWW551_5 : TPTP v8.1.2. 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 : n007.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 : Wed May 1 04:19:56 EDT 2024
% Result : Theorem 0.60s 0.82s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 60
% Syntax : Number of formulae : 65 ( 7 unt; 58 typ; 0 def)
% Number of atoms : 7 ( 6 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 1 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of FOOLs : 1 ( 1 fml; 0 var)
% Number of types : 6 ( 5 usr)
% Number of type conns : 63 ( 35 >; 28 *; 0 +; 0 <<)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-5 aty)
% Number of functors : 45 ( 45 usr; 13 con; 0-6 aty)
% Number of variables : 49 ( 0 !; 0 ?; 49 :)
% ( 49 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
exp: $tType > $tType ).
tff(type_def_6,type,
bool: $tType ).
tff(type_def_7,type,
list: $tType > $tType ).
tff(type_def_8,type,
nat: $tType ).
tff(type_def_9,type,
option: $tType > $tType ).
tff(type_def_10,type,
char: $tType ).
tff(type_def_11,type,
ty: $tType ).
tff(type_def_12,type,
val: $tType ).
tff(type_def_13,type,
fun: ( $tType * $tType ) > $tType ).
tff(type_def_14,type,
product_prod: ( $tType * $tType ) > $tType ).
tff(func_def_0,type,
combb:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun(X0,X1) * fun(X2,X0) ) > fun(X2,X1) ) ).
tff(func_def_1,type,
combc:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun(X0,fun(X1,X2)) * X1 ) > fun(X0,X2) ) ).
tff(func_def_2,type,
combk:
!>[X0: $tType,X1: $tType] : ( X0 > fun(X1,X0) ) ).
tff(func_def_3,type,
combs:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun(X0,fun(X1,X2)) * fun(X0,X1) ) > fun(X0,X2) ) ).
tff(func_def_4,type,
start_heap:
!>[X0: $tType] : ( list(product_prod(list(char),product_prod(list(char),product_prod(list(product_prod(list(char),ty)),list(product_prod(list(char),product_prod(list(ty),product_prod(ty,X0)))))))) > fun(nat,option(product_prod(list(char),fun(product_prod(list(char),list(char)),option(val))))) ) ).
tff(func_def_5,type,
new:
!>[X0: $tType] : ( list(char) > exp(X0) ) ).
tff(func_def_6,type,
fun_upd:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 * X1 ) > fun(X0,X1) ) ).
tff(func_def_7,type,
map_comp:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun(X0,option(X1)) * fun(X2,option(X0)) * X2 ) > option(X1) ) ).
tff(func_def_8,type,
ran:
!>[X0: $tType,X1: $tType] : ( fun(X0,option(X1)) > fun(X1,bool) ) ).
tff(func_def_9,type,
init_fields: list(product_prod(product_prod(list(char),list(char)),ty)) > fun(product_prod(list(char),list(char)),option(val)) ).
tff(func_def_10,type,
new_Addr: fun(nat,option(product_prod(list(char),fun(product_prod(list(char),list(char)),option(val))))) > option(nat) ).
tff(func_def_11,type,
bind:
!>[X0: $tType,X1: $tType] : fun(option(X0),fun(fun(X0,option(X1)),option(X1))) ).
tff(func_def_12,type,
map:
!>[X0: $tType,X1: $tType] : ( fun(X0,X1) > fun(option(X0),option(X1)) ) ).
tff(func_def_13,type,
none:
!>[X0: $tType] : option(X0) ).
tff(func_def_14,type,
some:
!>[X0: $tType] : fun(X0,option(X0)) ).
tff(func_def_15,type,
option_case:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,X0) ) > fun(option(X1),X0) ) ).
tff(func_def_16,type,
option_rec:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,X0) * option(X1) ) > X0 ) ).
tff(func_def_17,type,
set:
!>[X0: $tType] : ( option(X0) > fun(X0,bool) ) ).
tff(func_def_18,type,
product_Pair:
!>[X0: $tType,X1: $tType] : ( ( X0 * X1 ) > product_prod(X0,X1) ) ).
tff(func_def_19,type,
product_prod_rec:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun(X0,fun(X1,X2)) * product_prod(X0,X1) ) > X2 ) ).
tff(func_def_20,type,
quickcheck_orelse:
!>[X0: $tType] : ( ( option(X0) * option(X0) ) > option(X0) ) ).
tff(func_def_21,type,
collect:
!>[X0: $tType] : ( fun(X0,bool) > fun(X0,bool) ) ).
tff(func_def_22,type,
insert:
!>[X0: $tType] : ( ( X0 * fun(X0,bool) ) > fun(X0,bool) ) ).
tff(func_def_23,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_24,type,
fFalse: bool ).
tff(func_def_25,type,
fNot: fun(bool,bool) ).
tff(func_def_26,type,
fTrue: bool ).
tff(func_def_27,type,
fdisj: fun(bool,fun(bool,bool)) ).
tff(func_def_28,type,
fequal:
!>[X0: $tType] : fun(X0,fun(X0,bool)) ).
tff(func_def_29,type,
fimplies: fun(bool,fun(bool,bool)) ).
tff(func_def_30,type,
member:
!>[X0: $tType] : fun(X0,fun(fun(X0,bool),bool)) ).
tff(func_def_31,type,
c: list(char) ).
tff(func_def_32,type,
e: fun(list(char),option(ty)) ).
tff(func_def_33,type,
fDTs: list(product_prod(product_prod(list(char),list(char)),ty)) ).
tff(func_def_34,type,
p: list(product_prod(list(char),product_prod(list(char),product_prod(list(product_prod(list(char),ty)),list(product_prod(list(char),product_prod(list(ty),product_prod(ty,product_prod(list(list(char)),exp(list(char))))))))))) ).
tff(func_def_35,type,
t: ty ).
tff(func_def_36,type,
a: nat ).
tff(func_def_37,type,
h_a: fun(nat,option(product_prod(list(char),fun(product_prod(list(char),list(char)),option(val))))) ).
tff(func_def_38,type,
ha: fun(nat,option(product_prod(list(char),fun(product_prod(list(char),list(char)),option(val))))) ).
tff(func_def_39,type,
sK0:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(pred_def_1,type,
hconf:
!>[X0: $tType] : ( ( list(product_prod(list(char),product_prod(list(char),product_prod(list(product_prod(list(char),ty)),list(product_prod(list(char),product_prod(list(ty),product_prod(ty,X0)))))))) * fun(nat,option(product_prod(list(char),fun(product_prod(list(char),list(char)),option(val))))) ) > $o ) ).
tff(pred_def_2,type,
oconf:
!>[X0: $tType] : ( ( list(product_prod(list(char),product_prod(list(char),product_prod(list(product_prod(list(char),ty)),list(product_prod(list(char),product_prod(list(ty),product_prod(ty,X0)))))))) * fun(nat,option(product_prod(list(char),fun(product_prod(list(char),list(char)),option(val))))) * product_prod(list(char),fun(product_prod(list(char),list(char)),option(val))) ) > $o ) ).
tff(pred_def_3,type,
preallocated: fun(nat,option(product_prod(list(char),fun(product_prod(list(char),list(char)),option(val))))) > $o ).
tff(pred_def_4,type,
hext: ( fun(nat,option(product_prod(list(char),fun(product_prod(list(char),list(char)),option(val))))) * fun(nat,option(product_prod(list(char),fun(product_prod(list(char),list(char)),option(val))))) ) > $o ).
tff(pred_def_5,type,
is_none:
!>[X0: $tType] : ( option(X0) > $o ) ).
tff(pred_def_6,type,
fields:
!>[X0: $tType] : ( ( list(product_prod(list(char),product_prod(list(char),product_prod(list(product_prod(list(char),ty)),list(product_prod(list(char),product_prod(list(ty),product_prod(ty,X0)))))))) * list(char) * list(product_prod(product_prod(list(char),list(char)),ty)) ) > $o ) ).
tff(pred_def_7,type,
wTrt: ( list(product_prod(list(char),product_prod(list(char),product_prod(list(product_prod(list(char),ty)),list(product_prod(list(char),product_prod(list(ty),product_prod(ty,product_prod(list(list(char)),exp(list(char))))))))))) * fun(nat,option(product_prod(list(char),fun(product_prod(list(char),list(char)),option(val))))) * fun(list(char),option(ty)) * exp(list(char)) * ty ) > $o ).
tff(pred_def_8,type,
pp: bool > $o ).
tff(f135,plain,
$false,
inference(subsumption_resolution,[],[f130,f128]) ).
tff(f128,plain,
new_Addr(ha) != aa(nat,option(nat),some(nat),a),
inference(cnf_transformation,[],[f119]) ).
tff(f119,plain,
new_Addr(ha) != aa(nat,option(nat),some(nat),a),
inference(flattening,[],[f118]) ).
tff(f118,negated_conjecture,
( ~ new_Addr(ha) = aa(nat,option(nat),some(nat),a) ),
inference(negated_conjecture,[],[f117]) ).
tff(f117,conjecture,
new_Addr(ha) = aa(nat,option(nat),some(nat),a),
file('/export/starexec/sandbox2/tmp/tmp.WYcN7XfzIz/Vampire---4.8_25523',conj_0) ).
tff(f130,plain,
new_Addr(ha) = aa(nat,option(nat),some(nat),a),
inference(cnf_transformation,[],[f1]) ).
tff(f1,axiom,
new_Addr(ha) = aa(nat,option(nat),some(nat),a),
file('/export/starexec/sandbox2/tmp/tmp.WYcN7XfzIz/Vampire---4.8_25523',fact_0_RedNew_I1_J) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : SWW551_5 : TPTP v8.1.2. Released v6.0.0.
% 0.02/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.12/0.33 % Computer : n007.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 : Tue Apr 30 17:44:33 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.12/0.33 This is a TF1_THM_EQU_NAR problem
% 0.12/0.33 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/tmp/tmp.WYcN7XfzIz/Vampire---4.8_25523
% 0.60/0.82 % (25636)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.60/0.82 % (25635)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.60/0.82 % (25634)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 Vampire---4 for (2995ds/51Mi)
% 0.60/0.82 % (25637)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 Vampire---4 for (2995ds/34Mi)
% 0.60/0.82 % (25638)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.60/0.82 % (25639)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 Vampire---4 for (2995ds/83Mi)
% 0.60/0.82 % (25640)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2995ds/56Mi)
% 0.60/0.82 % (25636)First to succeed.
% 0.60/0.82 % (25633)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 Vampire---4 for (2995ds/34Mi)
% 0.60/0.82 % (25639)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.60/0.82 % (25640)Also succeeded, but the first one will report.
% 0.60/0.82 % (25638)Also succeeded, but the first one will report.
% 0.60/0.82 % (25636)Refutation found. Thanks to Tanya!
% 0.60/0.82 % SZS status Theorem for Vampire---4
% 0.60/0.82 % SZS output start Proof for Vampire---4
% See solution above
% 0.60/0.82 % (25636)------------------------------
% 0.60/0.82 % (25636)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.82 % (25636)Termination reason: Refutation
% 0.60/0.82
% 0.60/0.82 % (25636)Memory used [KB]: 1099
% 0.60/0.82 % (25636)Time elapsed: 0.004 s
% 0.60/0.82 % (25636)Instructions burned: 4 (million)
% 0.60/0.82 % (25636)------------------------------
% 0.60/0.82 % (25636)------------------------------
% 0.60/0.82 % (25631)Success in time 0.487 s
% 0.60/0.83 % Vampire---4.8 exiting
%------------------------------------------------------------------------------