Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #516964914
details
property
value
status
complete
benchmark
#3.13.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n089.star.cs.uiowa.edu
space
Applicative_first_order_05
run statistics
property
value
solver
ttt2-1.20
configuration
ttt2
runtime (wallclock)
2.77865099907 seconds
cpu usage
8.890249548
max memory
1.230864384E9
stage attributes
key
value
output-size
70126
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_ttt2 /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Problem: app(app(eq(),0()),0()) -> true() app(app(eq(),0()),app(s(),x)) -> false() app(app(eq(),app(s(),x)),0()) -> false() app(app(eq(),app(s(),x)),app(s(),y)) -> app(app(eq(),x),y) app(app(or(),true()),y) -> true() app(app(or(),false()),y) -> y app(app(union(),empty()),h) -> h app(app(union(),app(app(app(edge(),x),y),i)),h) -> app(app(app(edge(),x),y),app(app(union(),i),h)) app(app(app(app(reach(),x),y),empty()),h) -> false() app(app(app(app(reach(),x),y),app(app(app(edge(),u),v),i)),h) -> app(app(app(app(app(if_reach_1(),app(app(eq(),x),u)),x),y),app(app(app(edge(),u),v),i)),h) app(app(app(app(app(if_reach_1(),true()),x),y),app(app(app(edge(),u),v),i)),h) -> app(app(app(app(app(if_reach_2(),app(app(eq(),y),v)),x),y),app(app(app(edge(),u),v),i)),h) app(app(app(app(app(if_reach_1(),false()),x),y),app(app(app(edge(),u),v),i)),h) -> app(app(app(app(reach(),x),y),i),app(app(app(edge(),u),v),h)) app(app(app(app(app(if_reach_2(),true()),x),y),app(app(app(edge(),u),v),i)),h) -> true() app(app(app(app(app(if_reach_2(),false()),x),y),app(app(app(edge(),u),v),i)),h) -> app(app(or(),app(app(app(app(reach(),x),y),i),h)),app(app(app(app(reach(),v),y), app(app(union(),i),h)), empty())) app(app(map(),f),nil()) -> nil() app(app(map(),f),app(app(cons(),x),xs)) -> app(app(cons(),app(f,x)),app(app(map(),f),xs)) app(app(filter(),f),nil()) -> nil() app(app(filter(),f),app(app(cons(),x),xs)) -> app(app(app(app(filter2(),app(f,x)),f),x),xs) app(app(app(app(filter2(),true()),f),x),xs) -> app(app(cons(),x),app(app(filter(),f),xs)) app(app(app(app(filter2(),false()),f),x),xs) -> app(app(filter(),f),xs) Proof: Extended Uncurrying Processor: application symbol: app symbol table: filter2 ==> filter20/0 filter21/1 filter22/2 filter23/3 filter24/4 filter ==> filter0/0 filter1/1 filter2/2 cons ==> cons0/0 cons1/1 cons2/2 nil ==> nil0/0 map ==> map0/0 map1/1 map2/2 if_reach_2 ==> if_reach_20/0 if_reach_21/1 if_reach_22/2 if_reach_23/3 if_reach_24/4 if_reach_25/5 if_reach_1 ==> if_reach_10/0 if_reach_11/1 if_reach_12/2 if_reach_13/3 if_reach_14/4 if_reach_15/5 reach ==> reach0/0 reach1/1 reach2/2 reach3/3 reach4/4 edge ==> edge0/0 edge1/1 edge2/2 edge3/3 empty ==> empty0/0 union ==> union0/0 union1/1 union2/2 or ==> or0/0 or1/1 or2/2 false ==> false0/0 s ==> s0/0 s1/1 true ==> true0/0 0 ==> 00/0 eq ==> eq0/0 eq1/1 eq2/2 uncurry-rules: app(eq1(x8),x9) -> eq2(x8,x9) app(eq0(),x8) -> eq1(x8) app(s0(),x13) -> s1(x13) app(or1(x16),x17) -> or2(x16,x17) app(or0(),x16) -> or1(x16) app(union1(x19),x20) -> union2(x19,x20) app(union0(),x19) -> union1(x19) app(edge2(x23,x24),x25) -> edge3(x23,x24,x25) app(edge1(x23),x24) -> edge2(x23,x24) app(edge0(),x23) -> edge1(x23) app(reach3(x27,x28,x29),x30) -> reach4(x27,x28,x29,x30) app(reach2(x27,x28),x29) -> reach3(x27,x28,x29) app(reach1(x27),x28) -> reach2(x27,x28) app(reach0(),x27) -> reach1(x27) app(if_reach_14(x32,x33,x34,x35),x36) -> if_reach_15(x32,x33,x34,x35,x36) app(if_reach_13(x32,x33,x34),x35) -> if_reach_14(x32,x33,x34,x35) app(if_reach_12(x32,x33),x34) -> if_reach_13(x32,x33,x34) app(if_reach_11(x32),x33) -> if_reach_12(x32,x33) app(if_reach_10(),x32) -> if_reach_11(x32) app(if_reach_24(x38,x39,x40,x41),x42) -> if_reach_25(x38,x39,x40,x41,x42) app(if_reach_23(x38,x39,x40),x41) -> if_reach_24(x38,x39,x40,x41) app(if_reach_22(x38,x39),x40) -> if_reach_23(x38,x39,x40) app(if_reach_21(x38),x39) -> if_reach_22(x38,x39) app(if_reach_20(),x38) -> if_reach_21(x38) app(map1(x44),x45) -> map2(x44,x45) app(map0(),x44) -> map1(x44) app(cons1(x48),x49) -> cons2(x48,x49) app(cons0(),x48) -> cons1(x48) app(filter1(x51),x52) -> filter2(x51,x52) app(filter0(),x51) -> filter1(x51) app(filter23(x54,x55,x56),x57) -> filter24(x54,x55,x56,x57) app(filter22(x54,x55),x56) -> filter23(x54,x55,x56) app(filter21(x54),x55) -> filter22(x54,x55) app(filter20(),x54) -> filter21(x54) eta-rules: problem: eq2(00(),00()) -> true0() eq2(00(),s1(x)) -> false0()
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard