Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic_Programming 2019-04-02 08.22 pair #434324377
details
property
value
status
complete
benchmark
pl1.1.pl
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n034.star.cs.uiowa.edu
space
talp_plumer
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.44234 seconds
cpu usage
6.26798
user time
5.8842
system time
0.383775
max virtual memory
1.9807904E7
max residence set size
809128.0
stage attributes
key
value
starexec-result
MAYBE
output
6.05/2.36 MAYBE 6.05/2.39 proof of /export/starexec/sandbox/benchmark/theBenchmark.pl 6.05/2.39 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 6.05/2.39 6.05/2.39 6.05/2.39 Left Termination of the query pattern 6.05/2.39 6.05/2.39 append(a,a,a) 6.05/2.39 6.05/2.39 w.r.t. the given Prolog program could not be shown: 6.05/2.39 6.05/2.39 (0) Prolog 6.05/2.39 (1) PrologToTRSTransformerProof [SOUND, 0 ms] 6.05/2.39 (2) QTRS 6.05/2.39 (3) QTRSRRRProof [EQUIVALENT, 27 ms] 6.05/2.39 (4) QTRS 6.05/2.39 (5) QTRSRRRProof [EQUIVALENT, 4 ms] 6.05/2.39 (6) QTRS 6.05/2.39 (7) Overlay + Local Confluence [EQUIVALENT, 0 ms] 6.05/2.39 (8) QTRS 6.05/2.39 (9) DependencyPairsProof [EQUIVALENT, 0 ms] 6.05/2.39 (10) QDP 6.05/2.39 (11) UsableRulesProof [EQUIVALENT, 0 ms] 6.05/2.39 (12) QDP 6.05/2.39 (13) QReductionProof [EQUIVALENT, 0 ms] 6.05/2.39 (14) QDP 6.05/2.39 (15) PrologToPiTRSProof [SOUND, 0 ms] 6.05/2.39 (16) PiTRS 6.05/2.39 (17) DependencyPairsProof [EQUIVALENT, 0 ms] 6.05/2.39 (18) PiDP 6.05/2.39 (19) DependencyGraphProof [EQUIVALENT, 0 ms] 6.05/2.39 (20) PiDP 6.05/2.39 (21) UsableRulesProof [EQUIVALENT, 0 ms] 6.05/2.39 (22) PiDP 6.05/2.39 (23) PiDPToQDPProof [SOUND, 0 ms] 6.05/2.39 (24) QDP 6.05/2.39 (25) PrologToPiTRSProof [SOUND, 0 ms] 6.05/2.39 (26) PiTRS 6.05/2.39 (27) DependencyPairsProof [EQUIVALENT, 0 ms] 6.05/2.39 (28) PiDP 6.05/2.39 (29) DependencyGraphProof [EQUIVALENT, 0 ms] 6.05/2.39 (30) PiDP 6.05/2.39 (31) UsableRulesProof [EQUIVALENT, 0 ms] 6.05/2.39 (32) PiDP 6.05/2.39 (33) PiDPToQDPProof [SOUND, 0 ms] 6.05/2.39 (34) QDP 6.05/2.39 (35) PrologToDTProblemTransformerProof [SOUND, 0 ms] 6.05/2.39 (36) TRIPLES 6.05/2.39 (37) TriplesToPiDPProof [SOUND, 0 ms] 6.05/2.39 (38) PiDP 6.05/2.39 (39) DependencyGraphProof [EQUIVALENT, 0 ms] 6.05/2.39 (40) PiDP 6.05/2.39 (41) PiDPToQDPProof [SOUND, 0 ms] 6.05/2.39 (42) QDP 6.05/2.39 (43) PrologToIRSwTTransformerProof [SOUND, 0 ms] 6.05/2.39 (44) IRSwT 6.05/2.39 (45) IRSwTSimpleDependencyGraphProof [EQUIVALENT, 0 ms] 6.05/2.39 (46) IRSwT 6.05/2.39 (47) IntTRSCompressionProof [EQUIVALENT, 11 ms] 6.05/2.39 (48) IRSwT 6.05/2.39 (49) IRSFormatTransformerProof [EQUIVALENT, 0 ms] 6.05/2.39 (50) IRSwT 6.05/2.39 (51) IRSwTTerminationDigraphProof [EQUIVALENT, 4 ms] 6.05/2.39 (52) IRSwT 6.05/2.39 (53) FilterProof [EQUIVALENT, 0 ms] 6.05/2.39 (54) IntTRS 6.05/2.39 (55) IntTRSNonPeriodicNontermProof [COMPLETE, 7 ms] 6.05/2.39 (56) NO 6.05/2.39 6.05/2.39 6.05/2.39 ---------------------------------------- 6.05/2.39 6.05/2.39 (0) 6.05/2.39 Obligation: 6.05/2.39 Clauses: 6.05/2.39 6.05/2.39 append([], L, L). 6.05/2.39 append(.(H, L1), L2, .(H, L3)) :- append(L1, L2, L3). 6.05/2.39 append1([], L, L). 6.05/2.39 append1(.(H, L1), L2, .(H, L3)) :- append1(L1, L2, L3). 6.05/2.39 6.05/2.39 6.05/2.39 Query: append(a,a,a) 6.05/2.39 ---------------------------------------- 6.05/2.39 6.05/2.39 (1) PrologToTRSTransformerProof (SOUND) 6.05/2.39 Transformed Prolog program to TRS. 6.05/2.39 6.05/2.39 { 6.05/2.39 "root": 7, 6.05/2.39 "program": { 6.05/2.39 "directives": [], 6.05/2.39 "clauses": [ 6.05/2.39 [ 6.05/2.39 "(append ([]) L L)", 6.05/2.39 null 6.05/2.39 ], 6.05/2.39 [ 6.05/2.39 "(append (. H L1) L2 (. H L3))", 6.05/2.39 "(append L1 L2 L3)"
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic_Programming 2019-04-02 08.22