Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Progr 19030 pair #381919719
details
property
value
status
complete
benchmark
count.pl
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n041.star.cs.uiowa.edu
space
Euler_queensu-cs260
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.71634411812 seconds
cpu usage
3.914644976
max memory
2.4500224E8
stage attributes
key
value
output-size
18000
starexec-result
MAYBE
output
/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.pl /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- Graph construction failed Graph construction failed Graph construction failed YES proof of /export/starexec/sandbox2/benchmark/theBenchmark.pl # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Left Termination of the query pattern count(g,g,a) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) UnifyTransformerProof [EQUIVALENT, 0 ms] (2) Prolog (3) UndefinedPredicateHandlerProof [SOUND, 0 ms] (4) Prolog (5) PrologToPiTRSProof [SOUND, 18 ms] (6) PiTRS (7) DependencyPairsProof [EQUIVALENT, 0 ms] (8) PiDP (9) DependencyGraphProof [EQUIVALENT, 0 ms] (10) PiDP (11) UsableRulesProof [EQUIVALENT, 0 ms] (12) PiDP (13) PiDPToQDPProof [SOUND, 11 ms] (14) QDP (15) QDPSizeChangeProof [EQUIVALENT, 0 ms] (16) YES ---------------------------------------- (0) Obligation: Clauses: count(Item, [], 0). count(Item, .(X, Xs), Result) :- ','(=(Item, X), ','(count(Item, Xs, TailCount), is(Result, +(TailCount, 1)))). count(Item, .(X, Xs), TailCount) :- ','(\=(Item, X), count(Item, Xs, TailCount)). Query: count(g,g,a) ---------------------------------------- (1) UnifyTransformerProof (EQUIVALENT) Added a fact for the built-in = predicate [PROLOG]. ---------------------------------------- (2) Obligation: Clauses: count(Item, [], 0). count(Item, .(X, Xs), Result) :- ','(=(Item, X), ','(count(Item, Xs, TailCount), is(Result, +(TailCount, 1)))). count(Item, .(X, Xs), TailCount) :- ','(\=(Item, X), count(Item, Xs, TailCount)). =(X, X). Query: count(g,g,a) ---------------------------------------- (3) UndefinedPredicateHandlerProof (SOUND) Added facts for all undefined predicates [PROLOG]. ---------------------------------------- (4) Obligation: Clauses: count(Item, [], 0). count(Item, .(X, Xs), Result) :- ','(=(Item, X), ','(count(Item, Xs, TailCount), is(Result, +(TailCount, 1)))). count(Item, .(X, Xs), TailCount) :- ','(\=(Item, X), count(Item, Xs, TailCount)). =(X, X). is(X0, X1). \=(X0, X1). Query: count(g,g,a) ---------------------------------------- (5) PrologToPiTRSProof (SOUND) We use the technique of [TOCL09]. With regard to the inferred argument filtering the predicates were used in the following modes: count_in_3: (b,b,f) Transforming Prolog into the following Term Rewriting System: Pi-finite rewrite system: The TRS R consists of the following rules: count_in_gga(Item, [], 0) -> count_out_gga(Item, [], 0)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic Progr 19030