Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Programming pair #487529393
details
property
value
status
complete
benchmark
balance_tree2.pl
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n078.star.cs.uiowa.edu
space
terminweb_old
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.97757601738 seconds
cpu usage
8.28857757
max memory
8.58525696E8
stage attributes
key
value
output-size
228244
starexec-result
MAYBE
output
/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.pl /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- MAYBE proof of /export/starexec/sandbox/benchmark/theBenchmark.pl # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Left Termination of the query pattern balance(a,g) w.r.t. the given Prolog program could not be shown: (0) Prolog (1) PrologToPiTRSProof [SOUND, 0 ms] (2) PiTRS (3) DependencyPairsProof [EQUIVALENT, 3 ms] (4) PiDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) PiDP (7) UsableRulesProof [EQUIVALENT, 0 ms] (8) PiDP (9) PiDPToQDPProof [SOUND, 0 ms] (10) QDP (11) PrologToPiTRSProof [SOUND, 0 ms] (12) PiTRS (13) DependencyPairsProof [EQUIVALENT, 2 ms] (14) PiDP (15) DependencyGraphProof [EQUIVALENT, 0 ms] (16) PiDP (17) UsableRulesProof [EQUIVALENT, 0 ms] (18) PiDP (19) PiDPToQDPProof [SOUND, 7 ms] (20) QDP (21) PrologToTRSTransformerProof [SOUND, 162 ms] (22) QTRS (23) QTRSRRRProof [EQUIVALENT, 312 ms] (24) QTRS (25) PrologToDTProblemTransformerProof [SOUND, 173 ms] (26) TRIPLES (27) TriplesToPiDPProof [SOUND, 47 ms] (28) PiDP (29) DependencyGraphProof [EQUIVALENT, 0 ms] (30) AND (31) PiDP (32) UsableRulesProof [EQUIVALENT, 0 ms] (33) PiDP (34) PiDPToQDPProof [SOUND, 0 ms] (35) QDP (36) PiDP (37) UsableRulesProof [EQUIVALENT, 0 ms] (38) PiDP (39) PrologToIRSwTTransformerProof [SOUND, 168 ms] (40) AND (41) IRSwT (42) IRSwTSimpleDependencyGraphProof [EQUIVALENT, 0 ms] (43) IRSwT (44) IntTRSCompressionProof [EQUIVALENT, 14 ms] (45) IRSwT (46) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (47) IRSwT (48) IRSwTTerminationDigraphProof [EQUIVALENT, 5 ms] (49) IRSwT (50) FilterProof [EQUIVALENT, 0 ms] (51) IntTRS (52) IntTRSPeriodicNontermProof [COMPLETE, 4 ms] (53) NO (54) IRSwT (55) IRSwTSimpleDependencyGraphProof [EQUIVALENT, 0 ms] (56) TRUE ---------------------------------------- (0) Obligation: Clauses: balance(T, TB) :- balance(T, -(I, []), -(.(','(TB, -(I, [])), X), X), -(Rest, []), -(Rest, [])). balance(nil, -(X, X), -(A, B), -(A, B), -(.(','(nil, -(C, C)), T), T)). balance(tree(L, V, R), -(IH, IT), -(.(','(tree(LB, VB, RB), -(A, D)), H), .(','(LB, -(A, .(VB, X))), .(','(RB, -(X, D)), T))), -(HR, TR), -(NH, NT)) :- ','(balance(L, -(IH, .(V, IT1)), -(H, T), -(HR1, TR1), -(NH, NT1)), balance(R, -(IT1, IT), -(HR1, TR1), -(HR, TR), -(NT1, NT))). Query: balance(a,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: balance_in_2: (f,b) balance_in_5: (f,f,f,f,f) Transforming Prolog into the following Term Rewriting System: Pi-finite rewrite system:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic Programming