Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Progr 19030 pair #381919683
details
property
value
status
complete
benchmark
grammar2.pl
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n042.star.cs.uiowa.edu
space
talp_maria
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.72757315636 seconds
cpu usage
3.897290091
max memory
2.57204224E8
stage attributes
key
value
output-size
21485
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 parse(g,a) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) UnifyTransformerProof [EQUIVALENT, 0 ms] (2) Prolog (3) PrologToPiTRSProof [SOUND, 0 ms] (4) PiTRS (5) DependencyPairsProof [EQUIVALENT, 0 ms] (6) PiDP (7) DependencyGraphProof [EQUIVALENT, 0 ms] (8) TRUE ---------------------------------------- (0) Obligation: Clauses: goal :- ','(np(S1, S2, S), verb(S2, S3, S)). parse(S0, Meaning) :- ','(np(S0, S1, Meaning), verb(S1, [], Meaning)). parse(S0, Meaning) :- ','(np(S0, S1, Meaning), ','(verb(S1, S2, Meaning), =(S2, []))). np(Si, So, S) :- ','(det(Si, St, T), ','(noun(St, So, N), comb(T, N, S))). comb(a, -(N, s), s(s, N, V)). comb(the, -(N, P), s(P, N, V)). det(.(a, S), S, a). det(.(the, S), S, the). noun(.(book, S), S, -(book, s)). noun(.(books, S), S, -(book, p)). noun(.(box, S), S, -(box, s)). noun(.(boxes, S), S, -(box, p)). verb(.(falls, So), So, s(s, N, fall)). verb(.(fall, So), So, s(p, N, fall)). verb(.(flies, So), So, s(s, N, fly)). verb(.(fly, So), So, s(p, N, fly)). Query: parse(g,a) ---------------------------------------- (1) UnifyTransformerProof (EQUIVALENT) Added a fact for the built-in = predicate [PROLOG]. ---------------------------------------- (2) Obligation: Clauses: goal :- ','(np(S1, S2, S), verb(S2, S3, S)). parse(S0, Meaning) :- ','(np(S0, S1, Meaning), verb(S1, [], Meaning)). parse(S0, Meaning) :- ','(np(S0, S1, Meaning), ','(verb(S1, S2, Meaning), =(S2, []))). np(Si, So, S) :- ','(det(Si, St, T), ','(noun(St, So, N), comb(T, N, S))). comb(a, -(N, s), s(s, N, V)). comb(the, -(N, P), s(P, N, V)). det(.(a, S), S, a). det(.(the, S), S, the). noun(.(book, S), S, -(book, s)). noun(.(books, S), S, -(book, p)). noun(.(box, S), S, -(box, s)). noun(.(boxes, S), S, -(box, p)). verb(.(falls, So), So, s(s, N, fall)). verb(.(fall, So), So, s(p, N, fall)). verb(.(flies, So), So, s(s, N, fly)). verb(.(fly, So), So, s(p, N, fly)). =(X, X). Query: parse(g,a) ---------------------------------------- (3) PrologToPiTRSProof (SOUND) We use the technique of [TOCL09]. With regard to the inferred argument filtering the predicates were used in the following modes: parse_in_2: (b,f) np_in_3: (b,f,f) Transforming Prolog into the following Term Rewriting System: Pi-finite rewrite system: The TRS R consists of the following rules: parse_in_ga(S0, Meaning) -> U3_ga(S0, Meaning, np_in_gaa(S0, S1, Meaning)) np_in_gaa(Si, So, S) -> U7_gaa(Si, So, S, det_in_gaa(Si, St, T)) det_in_gaa(.(a, S), S, a) -> det_out_gaa(.(a, S), S, a)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic Progr 19030