HRS union beta 16688 pair #381734593

details

property	value
status	complete
benchmark	prenex.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n026.star.cs.uiowa.edu
space	Mixed_HO_10

run statistics

property	value
solver	sol 37957
configuration	default
runtime (wallclock)	0.218640089035 seconds
cpu usage	0.229788535
max memory	7.1426048E7

stage attributes

key	value
output-size	18769
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files


--------------------------------------------------------------------------------


YES

Check SN using TTT2 (University of Innsbruck)

Problem:
 and(P,forall(Q)) -> forall(and(P,Q))
 or(P,forall(Q)) -> forall(or(P,Q))
 and(forall(Q),P) -> forall(and(Q,P))
 or(forall(Q),P) -> forall(or(Q,P))
 not(forall(Q)) -> exists(not(Q))
 and(P,exists(Q)) -> exists(and(P,Q))
 or(P,exists(Q)) -> exists(or(P,Q))
 and(exists(Q),P) -> exists(and(Q,P))
 or(exists(Q),P) -> exists(or(Q,P))
 not(exists(Q)) -> forall(not(Q))

Proof:
 DP Processor:
  DPs:
   and#(P,forall(Q)) -> and#(P,Q)
   or#(P,forall(Q)) -> or#(P,Q)
   and#(forall(Q),P) -> and#(Q,P)
   or#(forall(Q),P) -> or#(Q,P)
   not#(forall(Q)) -> not#(Q)
   and#(P,exists(Q)) -> and#(P,Q)
   or#(P,exists(Q)) -> or#(P,Q)
   and#(exists(Q),P) -> and#(Q,P)
   or#(exists(Q),P) -> or#(Q,P)
   not#(exists(Q)) -> not#(Q)
  TRS:
   and(P,forall(Q)) -> forall(and(P,Q))
   or(P,forall(Q)) -> forall(or(P,Q))
   and(forall(Q),P) -> forall(and(Q,P))
   or(forall(Q),P) -> forall(or(Q,P))
   not(forall(Q)) -> exists(not(Q))
   and(P,exists(Q)) -> exists(and(P,Q))
   or(P,exists(Q)) -> exists(or(P,Q))
   and(exists(Q),P) -> exists(and(Q,P))
   or(exists(Q),P) -> exists(or(Q,P))
   not(exists(Q)) -> forall(not(Q))
  TDG Processor:
   DPs:
    and#(P,forall(Q)) -> and#(P,Q)
    or#(P,forall(Q)) -> or#(P,Q)
    and#(forall(Q),P) -> and#(Q,P)
    or#(forall(Q),P) -> or#(Q,P)
    not#(forall(Q)) -> not#(Q)
    and#(P,exists(Q)) -> and#(P,Q)
    or#(P,exists(Q)) -> or#(P,Q)
    and#(exists(Q),P) -> and#(Q,P)
    or#(exists(Q),P) -> or#(Q,P)
    not#(exists(Q)) -> not#(Q)
   TRS:
    and(P,forall(Q)) -> forall(and(P,Q))
    or(P,forall(Q)) -> forall(or(P,Q))
    and(forall(Q),P) -> forall(and(Q,P))
    or(forall(Q),P) -> forall(or(Q,P))
    not(forall(Q)) -> exists(not(Q))
    and(P,exists(Q)) -> exists(and(P,Q))
    or(P,exists(Q)) -> exists(or(P,Q))
    and(exists(Q),P) -> exists(and(Q,P))
    or(exists(Q),P) -> exists(or(Q,P))
    not(exists(Q)) -> forall(not(Q))
   graph:
    not#(exists(Q)) -> not#(Q) -> not#(exists(Q)) -> not#(Q)
    not#(exists(Q)) -> not#(Q) -> not#(forall(Q)) -> not#(Q)
    not#(forall(Q)) -> not#(Q) -> not#(exists(Q)) -> not#(Q)
    not#(forall(Q)) -> not#(Q) -> not#(forall(Q)) -> not#(Q)
    or#(exists(Q),P) -> or#(Q,P) -> or#(exists(Q),P) -> or#(Q,P)
    or#(exists(Q),P) -> or#(Q,P) -> or#(P,exists(Q)) -> or#(P,Q)
    or#(exists(Q),P) -> or#(Q,P) -> or#(forall(Q),P) -> or#(Q,P)
    or#(exists(Q),P) -> or#(Q,P) -> or#(P,forall(Q)) -> or#(P,Q)
    or#(forall(Q),P) -> or#(Q,P) -> or#(exists(Q),P) -> or#(Q,P)
    or#(forall(Q),P) -> or#(Q,P) -> or#(P,exists(Q)) -> or#(P,Q)
    or#(forall(Q),P) -> or#(Q,P) -> or#(forall(Q),P) -> or#(Q,P)
    or#(forall(Q),P) -> or#(Q,P) -> or#(P,forall(Q)) -> or#(P,Q)
    or#(P,exists(Q)) -> or#(P,Q) -> or#(exists(Q),P) -> or#(Q,P)
    or#(P,exists(Q)) -> or#(P,Q) -> or#(P,exists(Q)) -> or#(P,Q)
    or#(P,exists(Q)) -> or#(P,Q) -> or#(forall(Q),P) -> or#(Q,P)
    or#(P,exists(Q)) -> or#(P,Q) -> or#(P,forall(Q)) -> or#(P,Q)
    or#(P,forall(Q)) -> or#(P,Q) -> or#(exists(Q),P) -> or#(Q,P)
    or#(P,forall(Q)) -> or#(P,Q) -> or#(P,exists(Q)) -> or#(P,Q)
    or#(P,forall(Q)) -> or#(P,Q) -> or#(forall(Q),P) -> or#(Q,P)
    or#(P,forall(Q)) -> or#(P,Q) -> or#(P,forall(Q)) -> or#(P,Q)
    and#(exists(Q),P) -> and#(Q,P) -> and#(exists(Q),P) -> and#(Q,P)
    and#(exists(Q),P) -> and#(Q,P) -> and#(P,exists(Q)) -> and#(P,Q)
    and#(exists(Q),P) -> and#(Q,P) -> and#(forall(Q),P) -> and#(Q,P)
    and#(exists(Q),P) -> and#(Q,P) -> and#(P,forall(Q)) -> and#(P,Q)
    and#(forall(Q),P) -> and#(Q,P) -> and#(exists(Q),P) -> and#(Q,P)
    and#(forall(Q),P) -> and#(Q,P) -> and#(P,exists(Q)) -> and#(P,Q)
    and#(forall(Q),P) -> and#(Q,P) -> and#(forall(Q),P) -> and#(Q,P)
    and#(forall(Q),P) -> and#(Q,P) -> and#(P,forall(Q)) -> and#(P,Q)
    and#(P,exists(Q)) -> and#(P,Q) -> and#(exists(Q),P) -> and#(Q,P)
    and#(P,exists(Q)) -> and#(P,Q) -> and#(P,exists(Q)) -> and#(P,Q)

popout

output may be truncated. 'popout' for the full output.

job log

popout

actions all output return to HRS union beta 16688