Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Progr 19030 pair #381919617
details
property
value
status
complete
benchmark
serialize.pl
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n056.star.cs.uiowa.edu
space
talp_maria
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
4.07314991951 seconds
cpu usage
12.790215783
max memory
1.26783488E9
stage attributes
key
value
output-size
159805
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 serialize0(g,a) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) PrologToIRSwTTransformerProof [SOUND, 113 ms] (2) AND (3) IRSwT (4) IRSwTSimpleDependencyGraphProof [EQUIVALENT, 0 ms] (5) TRUE (6) IRSwT (7) IRSwTSimpleDependencyGraphProof [EQUIVALENT, 0 ms] (8) TRUE (9) IRSwT (10) IRSwTSimpleDependencyGraphProof [EQUIVALENT, 0 ms] (11) TRUE (12) IRSwT (13) IRSwTSimpleDependencyGraphProof [EQUIVALENT, 0 ms] (14) TRUE (15) IRSwT (16) IRSwTSimpleDependencyGraphProof [EQUIVALENT, 0 ms] (17) IRSwT (18) IntTRSCompressionProof [EQUIVALENT, 35 ms] (19) IRSwT (20) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (21) IRSwT (22) IRSwTTerminationDigraphProof [EQUIVALENT, 7 ms] (23) IRSwT (24) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 4 ms] (25) IRSwT (26) TempFilterProof [SOUND, 3 ms] (27) IRSwT (28) IRSwTToQDPProof [SOUND, 0 ms] (29) QDP (30) QDPSizeChangeProof [EQUIVALENT, 0 ms] (31) YES ---------------------------------------- (0) Obligation: Clauses: serialize0(L, R) :- ','(pairlists(L, R, A), ','(arrange0(A, T), numbered(T, 1, N))). pairlists(.(X, L), .(Y, R), .(pair(X, Y), A)) :- pairlists(L, R, A). pairlists([], [], []). arrange0(.(X, L), tree(T1, X, T2)) :- ','(split0(L, X, L1, L2), ','(arrange0(L1, T1), arrange0(L2, T2))). arrange0([], void). split0(.(pair(X1, N1), L), pair(X2, Y2), .(pair(X1, N1), L1), L2) :- ','(<(X1, X2), ','(!, split0(L, pair(X2, Y2), L1, L2))). split0(.(pair(X1, N1), L), pair(X2, N2), L1, L2) :- ','(=:=(X1, X2), ','(=(N1, N2), ','(!, split0(L, pair(X2, N2), L1, L2)))). split0(.(pair(X1, N1), L), pair(X2, Y2), L1, .(pair(X1, N1), L2)) :- ','(>(X1, X2), ','(!, split0(L, pair(X2, Y2), L1, L2))). split0([], X3, [], []). numbered(tree(T1, pair(X, N1), T2), N0, N) :- ','(numbered(T1, N0, N1), ','(is(N2, +(N1, 1)), numbered(T2, N2, N))). numbered(void, N, N). palin(.(65, .(66, .(76, .(69, .(32, .(87, .(65, .(83, .(32, .(73, .(32, .(69, .(82, .(69, .(32, .(73, .(32, .(83, .(65, .(87, .(32, .(69, .(76, .(66, .(65, [])))))))))))))))))))))))))). go(T, S) :- ','(time(X4), ','(palin(X), ','(serialize0(X, S), time(T)))). time(T) :- statistics(runtime, .(X5, .(T, []))). Query: serialize0(g,a) ---------------------------------------- (1) PrologToIRSwTTransformerProof (SOUND) Transformed Prolog program to IRSwT according to method in Master Thesis of A. Weinert { "root": 4, "program": { "directives": [], "clauses": [ [ "(serialize0 L R)", "(',' (pairlists L R A) (',' (arrange0 A T) (numbered T (1) N)))" ], [ "(pairlists (. X L) (. Y R) (. (pair X Y) A))", "(pairlists L R A)" ], [ "(pairlists ([]) ([]) ([]))", null ], [ "(arrange0 (. X L) (tree T1 X T2))", "(',' (split0 L X L1 L2) (',' (arrange0 L1 T1) (arrange0 L2 T2)))" ],
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic Progr 19030