Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Standard pair #487520026
details
property
value
status
complete
benchmark
z075.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n115.star.cs.uiowa.edu
space
Zantema_04
run statistics
property
value
solver
matchbox-2020-06-25
configuration
tc20-std.sh
runtime (wallclock)
59.4056520462 seconds
cpu usage
236.711963524
max memory
2.568679424E9
stage attributes
key
value
output-size
24237
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_tc20-std.sh /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES ************************************************** summary ************************************************** SRS with 9 rules on 6 letters weights SRS with 8 rules on 6 letters mirror SRS with 8 rules on 6 letters DP SRS with 10 strict rules and 8 weak rules on 10 letters weights SRS with 4 strict rules and 8 weak rules on 10 letters EDG 4 sub-proofs 1 SRS with 1 strict rules and 8 weak rules on 7 letters mirror SRS with 1 strict rules and 8 weak rules on 7 letters Matrix { monotone = Strict, domain = Natural, shape = Full, bits = 3, dim = 2, solver = Minisatapi, verbose = False, tracing = False} SRS with 1 strict rules and 7 weak rules on 7 letters mirror SRS with 1 strict rules and 7 weak rules on 7 letters EDG SRS with 1 strict rules and 7 weak rules on 7 letters Matrix { monotone = Weak, domain = Arctic, shape = Full, bits = 5, dim = 2, solver = Minisatapi, verbose = False, tracing = False} SRS with 0 strict rules and 7 weak rules on 6 letters EDG 2 SRS with 1 strict rules and 8 weak rules on 7 letters mirror SRS with 1 strict rules and 8 weak rules on 7 letters Matrix { monotone = Strict, domain = Natural, shape = Full, bits = 3, dim = 2, solver = Minisatapi, verbose = False, tracing = False} SRS with 1 strict rules and 7 weak rules on 7 letters mirror SRS with 1 strict rules and 7 weak rules on 7 letters EDG SRS with 1 strict rules and 7 weak rules on 7 letters Matrix { monotone = Weak, domain = Arctic, shape = Full, bits = 5, dim = 2, solver = Minisatapi, verbose = False, tracing = False} SRS with 0 strict rules and 7 weak rules on 6 letters EDG 3 SRS with 1 strict rules and 8 weak rules on 7 letters mirror SRS with 1 strict rules and 8 weak rules on 7 letters Matrix { monotone = Strict, domain = Natural, shape = Full, bits = 3, dim = 2, solver = Minisatapi, verbose = False, tracing = False} SRS with 1 strict rules and 7 weak rules on 7 letters mirror SRS with 1 strict rules and 7 weak rules on 7 letters EDG SRS with 1 strict rules and 7 weak rules on 7 letters Matrix { monotone = Weak, domain = Arctic, shape = Full, bits = 5, dim = 2, solver = Minisatapi, verbose = False, tracing = False} SRS with 0 strict rules and 7 weak rules on 6 letters EDG 4 SRS with 1 strict rules and 8 weak rules on 7 letters mirror SRS with 1 strict rules and 8 weak rules on 7 letters Matrix { monotone = Strict, domain = Natural, shape = Full, bits = 3, dim = 2, solver = Minisatapi, verbose = False, tracing = False} SRS with 1 strict rules and 7 weak rules on 7 letters mirror SRS with 1 strict rules and 7 weak rules on 7 letters EDG SRS with 1 strict rules and 7 weak rules on 7 letters Matrix { monotone = Weak, domain = Arctic, shape = Full, bits = 5, dim = 2, solver = Minisatapi, verbose = False, tracing = False} SRS with 0 strict rules and 7 weak rules on 6 letters EDG ************************************************** proof ************************************************** property Termination has value Just True for SRS [t, f] -> [t, c, n] {- Input 0 -} [n, f] -> [f, n] {- Input 1 -} [o, f] -> [f, o] {- Input 2 -} [n, s] -> [f, s] {- Input 3 -} [o, s] -> [f, s] {- Input 4 -} [c, f] -> [f, c] {- Input 5 -} [c, n] -> [n, c] {- Input 6 -} [c, o] -> [o, c] {- Input 7 -} [c, o] -> [o] {- Input 8 -} reason (o, 1/1) property Termination has value Just True for SRS [t, f] -> [t, c, n] {- Input 0 -} [n, f] -> [f, n] {- Input 1 -} [o, f] -> [f, o] {- Input 2 -} [n, s] -> [f, s] {- Input 3 -} [c, f] -> [f, c] {- Input 5 -} [c, n] -> [n, c] {- Input 6 -} [c, o] -> [o, c] {- Input 7 -} [c, o] -> [o] {- Input 8 -} reason mirror property Termination has value Just True for SRS [f, t] -> [n, c, t] {- Mirror (Input 0) -} [f, n] -> [n, f] {- Mirror (Input 1) -} [f, o] -> [o, f] {- Mirror (Input 2) -} [s, n] -> [s, f] {- Mirror (Input 3) -} [f, c] -> [c, f] {- Mirror (Input 5) -} [n, c] -> [c, n] {- Mirror (Input 6) -} [o, c] -> [c, o] {- Mirror (Input 7) -} [o, c] -> [o] {- Mirror (Input 8) -} reason DP property Termination has value Just True for SRS [f, t] ->= [n, c, t] {- DP Nontop (Mirror (Input 0)) -} [f, n] ->= [n, f] {- DP Nontop (Mirror (Input 1)) -} [f, o] ->= [o, f] {- DP Nontop (Mirror (Input 2)) -} [s, n] ->= [s, f] {- DP Nontop (Mirror (Input 3)) -} [f, c] ->= [c, f] {- DP Nontop (Mirror (Input 5)) -} [n, c] ->= [c, n] {- DP Nontop (Mirror (Input 6)) -} [o, c] ->= [c, o] {- DP Nontop (Mirror (Input 7)) -} [o, c] ->= [o] {- DP Nontop (Mirror (Input 8)) -} [f#, t] |-> [n#, c, t] {- DP (Top 0) (Mirror (Input 0)) -} [f#, c] |-> [f#] {- DP (Top 1) (Mirror (Input 5)) -}
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Standard