Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Progr 19030 pair #381919951
details
property
value
status
complete
benchmark
inequality1.pl
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n030.star.cs.uiowa.edu
space
AProVE_10_prolog
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.28858089447 seconds
cpu usage
5.690622158
max memory
3.33877248E8
stage attributes
key
value
output-size
16401
starexec-result
MAYBE
output
/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.pl /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- Graph construction failed Graph construction failed Graph construction failed MAYBE proof of /export/starexec/sandbox/benchmark/theBenchmark.pl # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Left Termination of the query pattern q(a,a) w.r.t. the given Prolog program could not be shown: (0) Prolog (1) UndefinedPredicateHandlerProof [SOUND, 0 ms] (2) Prolog (3) PrologToPiTRSProof [SOUND, 0 ms] (4) PiTRS (5) DependencyPairsProof [EQUIVALENT, 0 ms] (6) PiDP (7) DependencyGraphProof [EQUIVALENT, 0 ms] (8) PiDP (9) UsableRulesProof [EQUIVALENT, 0 ms] (10) PiDP (11) PiDPToQDPProof [SOUND, 0 ms] (12) QDP (13) NonTerminationLoopProof [COMPLETE, 0 ms] (14) NO (15) PrologToPiTRSProof [SOUND, 0 ms] (16) PiTRS (17) DependencyPairsProof [EQUIVALENT, 0 ms] (18) PiDP (19) DependencyGraphProof [EQUIVALENT, 0 ms] (20) PiDP (21) UsableRulesProof [EQUIVALENT, 0 ms] (22) PiDP (23) PiDPToQDPProof [SOUND, 0 ms] (24) QDP (25) NonTerminationLoopProof [COMPLETE, 0 ms] (26) NO ---------------------------------------- (0) Obligation: Clauses: q(X, Y) :- ','(\==(X, Y), p(X, Y)). p(X, X) :- p(X, X). p(X, Y). Query: q(a,a) ---------------------------------------- (1) UndefinedPredicateHandlerProof (SOUND) Added facts for all undefined predicates [PROLOG]. ---------------------------------------- (2) Obligation: Clauses: q(X, Y) :- ','(\==(X, Y), p(X, Y)). p(X, X) :- p(X, X). p(X, Y). \==(X0, X1). Query: q(a,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: q_in_2: (f,f) p_in_2: (f,f) Transforming Prolog into the following Term Rewriting System: Pi-finite rewrite system: The TRS R consists of the following rules: q_in_aa(X, Y) -> U1_aa(X, Y, \==_in_aa(X, Y)) \==_in_aa(X0, X1) -> \==_out_aa(X0, X1) U1_aa(X, Y, \==_out_aa(X, Y)) -> U2_aa(X, Y, p_in_aa(X, Y)) p_in_aa(X, X) -> U3_aa(X, p_in_aa(X, X)) p_in_aa(X, Y) -> p_out_aa(X, Y) U3_aa(X, p_out_aa(X, X)) -> p_out_aa(X, X) U2_aa(X, Y, p_out_aa(X, Y)) -> q_out_aa(X, Y)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic Progr 19030