Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Progr 19030 pair #381919630
details
property
value
status
complete
benchmark
inequality2.pl
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n050.star.cs.uiowa.edu
space
AProVE_10_prolog
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.94246912003 seconds
cpu usage
8.225468093
max memory
6.67004928E8
stage attributes
key
value
output-size
24313
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) TransformationProof [EQUIVALENT, 0 ms] (14) QDP (15) UsableRulesProof [EQUIVALENT, 0 ms] (16) QDP (17) QReductionProof [EQUIVALENT, 0 ms] (18) QDP (19) NonTerminationLoopProof [COMPLETE, 0 ms] (20) NO (21) PrologToPiTRSProof [SOUND, 0 ms] (22) PiTRS (23) DependencyPairsProof [EQUIVALENT, 0 ms] (24) PiDP (25) DependencyGraphProof [EQUIVALENT, 0 ms] (26) PiDP (27) UsableRulesProof [EQUIVALENT, 0 ms] (28) PiDP (29) PiDPToQDPProof [SOUND, 0 ms] (30) QDP (31) TransformationProof [EQUIVALENT, 0 ms] (32) QDP (33) UsableRulesProof [EQUIVALENT, 0 ms] (34) QDP (35) QReductionProof [EQUIVALENT, 0 ms] (36) QDP (37) NonTerminationLoopProof [COMPLETE, 0 ms] (38) NO ---------------------------------------- (0) Obligation: Clauses: q(X, Y) :- ','(\==(X, Y), p(X, Y)). p(X, Y) :- ','(==(X, Y), p(X, Y)). 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, Y) :- ','(==(X, Y), p(X, Y)). p(X, Y). \==(X0, X1). ==(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)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic Progr 19030