Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Progr 19030 pair #381919751
details
property
value
status
complete
benchmark
search_tree.pl
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n034.star.cs.uiowa.edu
space
BCGGV05
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.17029595375 seconds
cpu usage
5.538245085
max memory
4.57142272E8
stage attributes
key
value
output-size
34910
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.pl /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox2/benchmark/theBenchmark.pl # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Left Termination of the query pattern search_tree(g) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) PrologToPiTRSProof [SOUND, 0 ms] (2) PiTRS (3) DependencyPairsProof [EQUIVALENT, 0 ms] (4) PiDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) AND (7) PiDP (8) UsableRulesProof [EQUIVALENT, 0 ms] (9) PiDP (10) PiDPToQDPProof [EQUIVALENT, 0 ms] (11) QDP (12) QDPSizeChangeProof [EQUIVALENT, 0 ms] (13) YES (14) PiDP (15) UsableRulesProof [EQUIVALENT, 0 ms] (16) PiDP (17) PiDPToQDPProof [SOUND, 1 ms] (18) QDP (19) QDPSizeChangeProof [EQUIVALENT, 0 ms] (20) YES ---------------------------------------- (0) Obligation: Clauses: search_tree(void). search_tree(T) :- search_tree(T, X1, X2). search_tree(tree(X, void, void), X, X). search_tree(tree(X, void, Right), X, Max) :- ','(search_tree(Right, Min, Max), less(X, Min)). search_tree(tree(X, Left, void), Min, X) :- ','(search_tree(Left, Min, Max), less(Max, X)). search_tree(tree(X, Left, Right), Min1, Max2) :- ','(search_tree(Left, Min1, Max1), ','(less(Max1, X), ','(search_tree(Right, Min2, Max2), less(X, Min2)))). less(0, s(X3)). less(s(X), s(Y)) :- less(X, Y). Query: search_tree(g) ---------------------------------------- (1) PrologToPiTRSProof (SOUND) We use the technique of [TOCL09]. With regard to the inferred argument filtering the predicates were used in the following modes: search_tree_in_1: (b) search_tree_in_3: (b,f,f) less_in_2: (b,b) Transforming Prolog into the following Term Rewriting System: Pi-finite rewrite system: The TRS R consists of the following rules: search_tree_in_g(void) -> search_tree_out_g(void) search_tree_in_g(T) -> U1_g(T, search_tree_in_gaa(T, X1, X2)) search_tree_in_gaa(tree(X, void, void), X, X) -> search_tree_out_gaa(tree(X, void, void), X, X) search_tree_in_gaa(tree(X, void, Right), X, Max) -> U2_gaa(X, Right, Max, search_tree_in_gaa(Right, Min, Max)) search_tree_in_gaa(tree(X, Left, void), Min, X) -> U4_gaa(X, Left, Min, search_tree_in_gaa(Left, Min, Max)) search_tree_in_gaa(tree(X, Left, Right), Min1, Max2) -> U6_gaa(X, Left, Right, Min1, Max2, search_tree_in_gaa(Left, Min1, Max1)) U6_gaa(X, Left, Right, Min1, Max2, search_tree_out_gaa(Left, Min1, Max1)) -> U7_gaa(X, Left, Right, Min1, Max2, Max1, less_in_gg(Max1, X)) less_in_gg(0, s(X3)) -> less_out_gg(0, s(X3)) less_in_gg(s(X), s(Y)) -> U10_gg(X, Y, less_in_gg(X, Y)) U10_gg(X, Y, less_out_gg(X, Y)) -> less_out_gg(s(X), s(Y)) U7_gaa(X, Left, Right, Min1, Max2, Max1, less_out_gg(Max1, X)) -> U8_gaa(X, Left, Right, Min1, Max2, search_tree_in_gaa(Right, Min2, Max2)) U8_gaa(X, Left, Right, Min1, Max2, search_tree_out_gaa(Right, Min2, Max2)) -> U9_gaa(X, Left, Right, Min1, Max2, less_in_gg(X, Min2)) U9_gaa(X, Left, Right, Min1, Max2, less_out_gg(X, Min2)) -> search_tree_out_gaa(tree(X, Left, Right), Min1, Max2) U4_gaa(X, Left, Min, search_tree_out_gaa(Left, Min, Max)) -> U5_gaa(X, Left, Min, less_in_gg(Max, X)) U5_gaa(X, Left, Min, less_out_gg(Max, X)) -> search_tree_out_gaa(tree(X, Left, void), Min, X) U2_gaa(X, Right, Max, search_tree_out_gaa(Right, Min, Max)) -> U3_gaa(X, Right, Max, less_in_gg(X, Min)) U3_gaa(X, Right, Max, less_out_gg(X, Min)) -> search_tree_out_gaa(tree(X, void, Right), X, Max) U1_g(T, search_tree_out_gaa(T, X1, X2)) -> search_tree_out_g(T) The argument filtering Pi contains the following mapping: search_tree_in_g(x1) = search_tree_in_g(x1) void = void search_tree_out_g(x1) = search_tree_out_g(x1) U1_g(x1, x2) = U1_g(x1, x2)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic Progr 19030