TSTP Solution File: SWW551_5 by Vampire---4.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.9
% Problem : SWW551_5 : TPTP v8.2.0. Released v6.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire %s %d THM
% 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 : Mon Jun 24 18:33:30 EDT 2024
% Result : Theorem 0.17s 0.39s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 10 ( 10 unt; 0 typ; 0 def)
% Number of atoms : 10 ( 6 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 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 : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-5 aty)
% Number of functors : 48 ( 48 usr; 13 con; 0-6 aty)
% Number of variables : 0 ( 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(func_def_40,type,
sK1:
!>[X0: $tType] : ( option(X0) > X0 ) ).
tff(func_def_41,type,
sK2:
!>[X0: $tType] : ( option(X0) > X0 ) ).
tff(func_def_42,type,
sK3:
!>[X0: $tType] : ( option(X0) > X0 ) ).
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(pred_def_9,type,
sP4: option(nat) > $o ).
tff(f166,plain,
$false,
inference(resolution,[],[f162,f158]) ).
tff(f158,plain,
sP4(new_Addr(ha)),
inference(inequality_splitting,[],[f144,f157]) ).
tff(f157,plain,
~ sP4(aa(nat,option(nat),some(nat),a)),
introduced(inequality_splitting_name_introduction,[new_symbols(naming,[sP4])]) ).
tff(f144,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/benchmark/theBenchmark.p',unknown) ).
tff(f162,plain,
~ sP4(new_Addr(ha)),
inference(superposition,[],[f157,f146]) ).
tff(f146,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/benchmark/theBenchmark.p',unknown) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : SWW551_5 : TPTP v8.2.0. Released v6.0.0.
% 0.03/0.10 % Command : run_vampire %s %d THM
% 0.10/0.30 % Computer : n032.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Wed Jun 19 04:28:24 EDT 2024
% 0.10/0.30 % CPUTime :
% 0.16/0.32 This is a TF1_THM_EQU_NAR problem
% 0.16/0.32 Running first-order theorem proving
% 0.16/0.32 Running /export/starexec/sandbox2/solver/bin/vampire --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.39 % (2813)Running in auto input_syntax mode. Trying TPTP
% 0.17/0.39 % (2820)dis+1010_159245:1048576_to=lpo:sil=2000:etr=on:sp=unary_frequency:spb=goal:rnwc=on:nwc=10.9066:st=2:i=124:sd=1:nm=3:av=off:ss=axioms:rawr=on:drc=encompass:foolp=on:sgt=5:cond=fast:er=filter:erape=on:erml=2:s2a=on_0 on theBenchmark for (2999ds/124Mi)
% 0.17/0.39 % (2813)Running in auto input_syntax mode. Trying TPTP
% 0.17/0.39 % (2818)dis+1011_3:1_sil=256000:tgt=ground:sac=on:i=109:sd=1:ss=included_0 on theBenchmark for (2999ds/109Mi)
% 0.17/0.39 % (2813)Running in auto input_syntax mode. Trying TPTP
% 0.17/0.39 % (2817)lrs+10_1:3_drc=off:sil=256000:sp=unary_first:lwlo=on:i=216875:kws=precedence:ins=3:rawr=on:nwc=10.0_0 on theBenchmark for (2999ds/216875Mi)
% 0.17/0.39 % (2813)Running in auto input_syntax mode. Trying TPTP
% 0.17/0.39 % (2816)lrs+1010_2201:262144_anc=all:drc=encompass:sil=256000:sims=off:sp=frequency:spb=goal_then_units:rp=on:lwlo=on:st=3.0:i=179501:bs=unit_only:nm=6:ins=2:fsd=on:ss=axioms:sgt=16:afr=on:tgt=ground:awrs=decay:awrsf=200:acc=on:ccuc=first_0 on theBenchmark for (2999ds/179501Mi)
% 0.17/0.39 % (2813)Running in auto input_syntax mode. Trying TPTP
% 0.17/0.39 % (2815)dis+11_1:1_nwc=5.0:s2a=on:i=66616:s2at=3.0:sil=128000:bd=off_0 on theBenchmark for (2999ds/66616Mi)
% 0.17/0.39 % (2813)Running in auto input_syntax mode. Trying TPTP
% 0.17/0.39 % (2814)lrs+1011_1:12_anc=none:drc=off:sil=64000:sims=off:sp=unary_first:spb=goal_then_units:lsd=20:rnwc=on:nwc=2.0:i=53554:add=off:awrs=converge:bd=off:uhcvi=on:tgt=ground:afp=300:afq=1.63_0 on theBenchmark for (2999ds/53554Mi)
% 0.17/0.39 % (2813)Running in auto input_syntax mode. Trying TPTP
% 0.17/0.39 % (2819)dis+1010_1:1_sil=2000:nwc=3.0:s2a=on:i=132:ins=5:fsr=off:ss=axioms:sd=2:fd=off_0 on theBenchmark for (2999ds/132Mi)
% 0.17/0.39 % (2819)First to succeed.
% 0.17/0.39 % (2819)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2813"
% 0.17/0.39 % (2820)Also succeeded, but the first one will report.
% 0.17/0.39 % (2813)Running in auto input_syntax mode. Trying TPTP
% 0.17/0.39 % (2819)Refutation found. Thanks to Tanya!
% 0.17/0.39 % SZS status Theorem for theBenchmark
% 0.17/0.39 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.39 % (2819)------------------------------
% 0.17/0.39 % (2819)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.17/0.39 % (2819)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.17/0.39 % (2819)Termination reason: Refutation
% 0.17/0.39
% 0.17/0.39 % (2819)Memory used [KB]: 1201
% 0.17/0.39 % (2819)Time elapsed: 0.005 s
% 0.17/0.39 % (2819)Instructions burned: 5 (million)
% 0.17/0.39 % (2819)------------------------------
% 0.17/0.39 % (2819)------------------------------
% 0.17/0.39 % (2813)Success in time 0.058 s
%------------------------------------------------------------------------------