Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Outer 67415 pair #381918201
details
property
value
status
complete
benchmark
MYNAT_complete_L.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n035.star.cs.uiowa.edu
space
Strategy_outermost_added_08
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.25754499435 seconds
cpu usage
2.909265681
max memory
1.61439744E8
stage attributes
key
value
output-size
2424
starexec-result
NO
output
/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Outermost Termination of the given OTRS could be disproven: (0) OTRS (1) OutermostNonTerminationProof [COMPLETE, 0 ms] (2) NO ---------------------------------------- (0) Obligation: Term rewrite system R: The TRS R consists of the following rules: U41(tt) -> N U51(tt) -> s(plus(N, M)) U71(tt) -> plus(x(N, M), N) and(tt) -> X U11(tt) -> U12(isNat) U12(tt) -> U13(isNat) U13(tt) -> tt U21(tt) -> U22(isNat) U22(tt) -> tt U31(tt) -> U32(isNat) U32(tt) -> U33(isNat) U33(tt) -> tt U61(tt) -> 0 isNat -> tt isNat -> U11(and(isNatKind)) isNat -> U21(isNatKind) isNat -> U31(and(isNatKind)) isNatKind -> tt isNatKind -> and(isNatKind) isNatKind -> isNatKind plus(N, 0) -> U41(and(isNat)) plus(N, s(M)) -> U51(and(and(isNat))) x(N, 0) -> U61(and(isNat)) x(N, s(M)) -> U71(and(and(isNat))) Outermost Strategy. ---------------------------------------- (1) OutermostNonTerminationProof (COMPLETE) Term rewrite system R: The TRS R consists of the following rules: U41(tt) -> N U51(tt) -> s(plus(N, M)) U71(tt) -> plus(x(N, M), N) and(tt) -> X U11(tt) -> U12(isNat) U12(tt) -> U13(isNat) U13(tt) -> tt U21(tt) -> U22(isNat) U22(tt) -> tt U31(tt) -> U32(isNat) U32(tt) -> U33(isNat) U33(tt) -> tt U61(tt) -> 0 isNat -> tt isNat -> U11(and(isNatKind)) isNat -> U21(isNatKind) isNat -> U31(and(isNatKind)) isNatKind -> tt isNatKind -> and(isNatKind) isNatKind -> isNatKind plus(N, 0) -> U41(and(isNat)) plus(N, s(M)) -> U51(and(and(isNat))) x(N, 0) -> U61(and(isNat)) x(N, s(M)) -> U71(and(and(isNat))) Outermost Strategy. ---------- Loop: ---------- U41(tt) -> U41(tt) with rule U41(tt) -> N at position [] and matcher [N / U41(tt)] Now an instance of the first term with Matcher [ ] occurs in the last term at position []. Context: [] We used [THIEMANN_LOOPS_UNDER_STRATEGIES] to show that this Loop is an Outermost-Loop. ----------------------------------------
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Outer 67415