TSTP Solution File: LAT386+1 by Mace4---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Mace4---1109a
% Problem : LAT386+1 : TPTP v6.4.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : mace4 -t %d -f %s
% Computer : n114.star.cs.uiowa.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory : 32218.75MB
% OS : Linux 3.10.0-327.36.3.el7.x86_64
% CPULimit : 300s
% DateTime : Wed Feb 8 09:57:18 EST 2017
% Result : CounterSatisfiable 0.06s
% Output : FiniteModel 0.06s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LAT386+1 : TPTP v6.4.0. Released v4.0.0.
% 0.00/0.04 % Command : mace4 -t %d -f %s
% 0.02/0.23 % Computer : n114.star.cs.uiowa.edu
% 0.02/0.23 % Model : x86_64 x86_64
% 0.02/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/0.23 % Memory : 32218.75MB
% 0.02/0.23 % OS : Linux 3.10.0-327.36.3.el7.x86_64
% 0.02/0.23 % CPULimit : 300
% 0.02/0.23 % DateTime : Tue Feb 7 19:03:16 CST 2017
% 0.02/0.23 % CPUTime :
% 0.06/0.52 % SZS status CounterSatisfiable
% 0.06/0.53 ============================== Mace4 =================================
% 0.06/0.53 Mace4 (32) version 2009-11A, November 2009.
% 0.06/0.53 Process 19529 was started by sandbox2 on n114.star.cs.uiowa.edu,
% 0.06/0.53 Tue Feb 7 19:03:16 2017
% 0.06/0.53 The command was "/export/starexec/sandbox2/solver/bin/mace4 -t 300 -f /tmp/Mace4_input_19495_n114.star.cs.uiowa.edu".
% 0.06/0.53 ============================== end of head ===========================
% 0.06/0.53
% 0.06/0.53 ============================== INPUT =================================
% 0.06/0.53
% 0.06/0.53 % Reading from file /tmp/Mace4_input_19495_n114.star.cs.uiowa.edu
% 0.06/0.53
% 0.06/0.53 set(prolog_style_variables).
% 0.06/0.53 set(print_models_tabular).
% 0.06/0.53 % set(print_models_tabular) -> clear(print_models).
% 0.06/0.53
% 0.06/0.53 formulas(sos).
% 0.06/0.53 (all W0 (aSet0(W0) -> $T)) # label(mSetSort) # label(axiom).
% 0.06/0.53 (all W0 (aElement0(W0) -> $T)) # label(mElmSort) # label(axiom).
% 0.06/0.53 (all W0 (aSet0(W0) -> (all W1 (aElementOf0(W1,W0) -> aElement0(W1))))) # label(mEOfElem) # label(axiom).
% 0.06/0.53 (all W0 (aSet0(W0) -> (isEmpty0(W0) <-> -(exists W1 aElementOf0(W1,W0))))) # label(mDefEmpty) # label(definition).
% 0.06/0.53 (all W0 (aSet0(W0) -> (all W1 (aSubsetOf0(W1,W0) <-> aSet0(W1) & (all W2 (aElementOf0(W2,W1) -> aElementOf0(W2,W0))))))) # label(mDefSub) # label(definition).
% 0.06/0.53 (all W0 all W1 (aElement0(W0) & aElement0(W1) -> (sdtlseqdt0(W0,W1) -> $T))) # label(mLessRel) # label(axiom).
% 0.06/0.53 (all W0 (aElement0(W0) -> sdtlseqdt0(W0,W0))) # label(mARefl) # label(axiom).
% 0.06/0.53 (all W0 all W1 (aElement0(W0) & aElement0(W1) -> (sdtlseqdt0(W0,W1) & sdtlseqdt0(W1,W0) -> W0 = W1))) # label(mASymm) # label(axiom).
% 0.06/0.53 (all W0 all W1 all W2 (aElement0(W0) & aElement0(W1) & aElement0(W2) -> (sdtlseqdt0(W0,W1) & sdtlseqdt0(W1,W2) -> sdtlseqdt0(W0,W2)))) # label(mTrans) # label(axiom).
% 0.06/0.53 (all W0 (aSet0(W0) -> (all W1 (aSubsetOf0(W1,W0) -> (all W2 (aLowerBoundOfIn0(W2,W1,W0) <-> aElementOf0(W2,W0) & (all W3 (aElementOf0(W3,W1) -> sdtlseqdt0(W2,W3))))))))) # label(mDefLB) # label(definition).
% 0.06/0.53 (all W0 (aSet0(W0) -> (all W1 (aSubsetOf0(W1,W0) -> (all W2 (aUpperBoundOfIn0(W2,W1,W0) <-> aElementOf0(W2,W0) & (all W3 (aElementOf0(W3,W1) -> sdtlseqdt0(W3,W2))))))))) # label(mDefUB) # label(definition).
% 0.06/0.53 (all W0 (aSet0(W0) -> (all W1 (aSubsetOf0(W1,W0) -> (all W2 (aInfimumOfIn0(W2,W1,W0) <-> aElementOf0(W2,W0) & aLowerBoundOfIn0(W2,W1,W0) & (all W3 (aLowerBoundOfIn0(W3,W1,W0) -> sdtlseqdt0(W3,W2))))))))) # label(mDefInf) # label(definition).
% 0.06/0.53 (all W0 (aSet0(W0) -> (all W1 (aSubsetOf0(W1,W0) -> (all W2 (aSupremumOfIn0(W2,W1,W0) <-> aElementOf0(W2,W0) & aUpperBoundOfIn0(W2,W1,W0) & (all W3 (aUpperBoundOfIn0(W3,W1,W0) -> sdtlseqdt0(W2,W3))))))))) # label(mDefSup) # label(definition).
% 0.06/0.53 (all W0 (aSet0(W0) -> (all W1 (aSubsetOf0(W1,W0) -> (all W2 all W3 (aSupremumOfIn0(W2,W1,W0) & aSupremumOfIn0(W3,W1,W0) -> W2 = W3)))))) # label(mSupUn) # label(axiom).
% 0.06/0.53 (all W0 (aSet0(W0) -> (all W1 (aSubsetOf0(W1,W0) -> (all W2 all W3 (aInfimumOfIn0(W2,W1,W0) & aInfimumOfIn0(W3,W1,W0) -> W2 = W3)))))) # label(mInfUn) # label(axiom).
% 0.06/0.53 (all W0 (aCompleteLattice0(W0) <-> aSet0(W0) & (all W1 (aSubsetOf0(W1,W0) -> (exists W2 (aInfimumOfIn0(W2,W1,W0) & (exists W3 aSupremumOfIn0(W3,W1,W0)))))))) # label(mDefCLat) # label(definition).
% 0.06/0.53 (all W0 (aFunction0(W0) -> $T)) # label(mConMap) # label(axiom).
% 0.06/0.53 (all W0 (aFunction0(W0) -> aSet0(szDzozmdt0(W0)))) # label(mDomSort) # label(axiom).
% 0.06/0.53 (all W0 (aFunction0(W0) -> aSet0(szRzazndt0(W0)))) # label(mRanSort) # label(axiom).
% 0.06/0.53 (all W0 all W1 (aFunction0(W0) & aSet0(W1) -> (isOn0(W0,W1) <-> szDzozmdt0(W0) = szRzazndt0(W0) & szRzazndt0(W0) = W1))) # label(mDefDom) # label(definition).
% 0.06/0.53 (all W0 (aFunction0(W0) -> (all W1 (aElementOf0(W1,szDzozmdt0(W0)) -> aElementOf0(sdtlpdtrp0(W0,W1),szRzazndt0(W0)))))) # label(mImgSort) # label(axiom).
% 0.06/0.53 (all W0 (aFunction0(W0) -> (all W1 (aFixedPointOf0(W1,W0) <-> aElementOf0(W1,szDzozmdt0(W0)) & sdtlpdtrp0(W0,W1) = W1)))) # label(mDefFix) # label(definition).
% 0.06/0.53 (all W0 (aFunction0(W0) -> (isMonotone0(W0) <-> (all W1 all W2 (aElementOf0(W1,szDzozmdt0(W0)) & aElementOf0(W2,szDzozmdt0(W0)) -> (sdtlseqdt0(W1,W2) -> sdtlseqdt0(sdtlpdtrp0(W0,W1),sdtlpdtrp0(W0,W2)))))))) # label(mDefMonot) # label(definition).
% 0.06/0.53 aCompleteLattice0(xU) # label(m__1123_AndLHS) # label(hypothesis).
% 0.06/0.53 aFunction0(xf) # label(m__1123_AndRHS_AndLHS) # label(hypothesis).
% 0.06/0.53 isMonotone0(xf) # label(m__1123_AndRHS_AndRHS_AndLHS) # label(hypothesis).
% 0.06/0.53 isOn0(xf,xU) # label(m__1123_AndRHS_AndRHS_AndRHS) # label(hypothesis).
% 0.06/0.53 xS = cS1142(xf) # label(m__1144) # label(hypothesis).
% 0.06/0.53 aSubsetOf0(xT,xS) # label(m__1173) # label(hypothesis).
% 0.06/0.53 xP = cS1241(xU,xf,xT) # label(m__1244) # label(hypothesis).
% 0.06/0.53 aInfimumOfIn0(xp,xP,xU) # label(m__1261) # label(hypothesis).
% 0.06/0.53 -(aLowerBoundOfIn0(sdtlpdtrp0(xf,xp),xP,xU) & aUpperBoundOfIn0(sdtlpdtrp0(xf,xp),xT,xU)) # label(m__) # label(negated_conjecture).
% 0.06/0.53 end_of_list.
% 0.06/0.53
% 0.06/0.53 % From the command line: assign(max_seconds, 300).
% 0.06/0.53
% 0.06/0.53 ============================== end of input ==========================
% 0.06/0.53
% 0.06/0.53 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.06/0.53
% 0.06/0.53 % Formulas that are not ordinary clauses:
% 0.06/0.53 1 (all W0 (aSet0(W0) -> $T)) # label(mSetSort) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.53 2 (all W0 (aElement0(W0) -> $T)) # label(mElmSort) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.53 3 (all W0 (aSet0(W0) -> (all W1 (aElementOf0(W1,W0) -> aElement0(W1))))) # label(mEOfElem) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.53 4 (all W0 (aSet0(W0) -> (isEmpty0(W0) <-> -(exists W1 aElementOf0(W1,W0))))) # label(mDefEmpty) # label(definition) # label(non_clause). [assumption].
% 0.06/0.53 5 (all W0 (aSet0(W0) -> (all W1 (aSubsetOf0(W1,W0) <-> aSet0(W1) & (all W2 (aElementOf0(W2,W1) -> aElementOf0(W2,W0))))))) # label(mDefSub) # label(definition) # label(non_clause). [assumption].
% 0.06/0.53 6 (all W0 all W1 (aElement0(W0) & aElement0(W1) -> (sdtlseqdt0(W0,W1) -> $T))) # label(mLessRel) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.53 7 (all W0 (aElement0(W0) -> sdtlseqdt0(W0,W0))) # label(mARefl) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.53 8 (all W0 all W1 (aElement0(W0) & aElement0(W1) -> (sdtlseqdt0(W0,W1) & sdtlseqdt0(W1,W0) -> W0 = W1))) # label(mASymm) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.53 9 (all W0 all W1 all W2 (aElement0(W0) & aElement0(W1) & aElement0(W2) -> (sdtlseqdt0(W0,W1) & sdtlseqdt0(W1,W2) -> sdtlseqdt0(W0,W2)))) # label(mTrans) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.53 10 (all W0 (aSet0(W0) -> (all W1 (aSubsetOf0(W1,W0) -> (all W2 (aLowerBoundOfIn0(W2,W1,W0) <-> aElementOf0(W2,W0) & (all W3 (aElementOf0(W3,W1) -> sdtlseqdt0(W2,W3))))))))) # label(mDefLB) # label(definition) # label(non_clause). [assumption].
% 0.06/0.53 11 (all W0 (aSet0(W0) -> (all W1 (aSubsetOf0(W1,W0) -> (all W2 (aUpperBoundOfIn0(W2,W1,W0) <-> aElementOf0(W2,W0) & (all W3 (aElementOf0(W3,W1) -> sdtlseqdt0(W3,W2))))))))) # label(mDefUB) # label(definition) # label(non_clause). [assumption].
% 0.06/0.53 12 (all W0 (aSet0(W0) -> (all W1 (aSubsetOf0(W1,W0) -> (all W2 (aInfimumOfIn0(W2,W1,W0) <-> aElementOf0(W2,W0) & aLowerBoundOfIn0(W2,W1,W0) & (all W3 (aLowerBoundOfIn0(W3,W1,W0) -> sdtlseqdt0(W3,W2))))))))) # label(mDefInf) # label(definition) # label(non_clause). [assumption].
% 0.06/0.53 13 (all W0 (aSet0(W0) -> (all W1 (aSubsetOf0(W1,W0) -> (all W2 (aSupremumOfIn0(W2,W1,W0) <-> aElementOf0(W2,W0) & aUpperBoundOfIn0(W2,W1,W0) & (all W3 (aUpperBoundOfIn0(W3,W1,W0) -> sdtlseqdt0(W2,W3))))))))) # label(mDefSup) # label(definition) # label(non_clause). [assumption].
% 0.06/0.53 14 (all W0 (aSet0(W0) -> (all W1 (aSubsetOf0(W1,W0) -> (all W2 all W3 (aSupremumOfIn0(W2,W1,W0) & aSupremumOfIn0(W3,W1,W0) -> W2 = W3)))))) # label(mSupUn) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.53 15 (all W0 (aSet0(W0) -> (all W1 (aSubsetOf0(W1,W0) -> (all W2 all W3 (aInfimumOfIn0(W2,W1,W0) & aInfimumOfIn0(W3,W1,W0) -> W2 = W3)))))) # label(mInfUn) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.53 16 (all W0 (aCompleteLattice0(W0) <-> aSet0(W0) & (all W1 (aSubsetOf0(W1,W0) -> (exists W2 (aInfimumOfIn0(W2,W1,W0) & (exists W3 aSupremumOfIn0(W3,W1,W0)))))))) # label(mDefCLat) # label(definition) # label(non_clause). [assumption].
% 0.06/0.53 17 (all W0 (aFunction0(W0) -> $T)) # label(mConMap) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.53 18 (all W0 (aFunction0(W0) -> aSet0(szDzozmdt0(W0)))) # label(mDomSort) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.53 19 (all W0 (aFunction0(W0) -> aSet0(szRzazndt0(W0)))) # label(mRanSort) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.53 20 (all W0 all W1 (aFunction0(W0) & aSet0(W1) -> (isOn0(W0,W1) <-> szDzozmdt0(W0) = szRzazndt0(W0) & szRzazndt0(W0) = W1))) # label(mDefDom) # label(definition) # label(non_clause). [assumption].
% 0.06/0.53 21 (all W0 (aFunction0(W0) -> (all W1 (aElementOf0(W1,szDzozmdt0(W0)) -> aElementOf0(sdtlpdtrp0(W0,W1),szRzazndt0(W0)))))) # label(mImgSort) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.53 22 (all W0 (aFunction0(W0) -> (all W1 (aFixedPointOf0(W1,W0) <-> aElementOf0(W1,szDzozmdt0(W0)) & sdtlpdtrp0(W0,W1) = W1)))) # label(mDefFix) # label(definition) # label(non_clause). [assumption].
% 0.06/0.53 23 (all W0 (aFunction0(W0) -> (isMonotone0(W0) <-> (all W1 all W2 (aElementOf0(W1,szDzozmdt0(W0)) & aElementOf0(W2,szDzozmdt0(W0)) -> (sdtlseqdt0(W1,W2) -> sdtlseqdt0(sdtlpdtrp0(W0,W1),sdtlpdtrp0(W0,W2)))))))) # label(mDefMonot) # label(definition) # label(non_clause). [assumption].
% 0.06/0.53 24 -(aLowerBoundOfIn0(sdtlpdtrp0(xf,xp),xP,xU) & aUpperBoundOfIn0(sdtlpdtrp0(xf,xp),xT,xU)) # label(m__) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.06/0.53
% 0.06/0.53 ============================== end of process non-clausal formulas ===
% 0.06/0.53
% 0.06/0.53 ============================== CLAUSES FOR SEARCH ====================
% 0.06/0.53
% 0.06/0.53 formulas(mace4_clauses).
% 0.06/0.53 -aSet0(A) | -aElementOf0(B,A) | aElement0(B) # label(mEOfElem) # label(axiom).
% 0.06/0.53 -aSet0(A) | -isEmpty0(A) | -aElementOf0(B,A) # label(mDefEmpty) # label(definition).
% 0.06/0.53 -aSet0(A) | isEmpty0(A) | aElementOf0(f1(A),A) # label(mDefEmpty) # label(definition).
% 0.06/0.53 -aSet0(A) | -aSubsetOf0(B,A) | aSet0(B) # label(mDefSub) # label(definition).
% 0.06/0.53 -aSet0(A) | -aSubsetOf0(B,A) | -aElementOf0(C,B) | aElementOf0(C,A) # label(mDefSub) # label(definition).
% 0.06/0.53 -aSet0(A) | aSubsetOf0(B,A) | -aSet0(B) | aElementOf0(f2(A,B),B) # label(mDefSub) # label(definition).
% 0.06/0.53 -aSet0(A) | aSubsetOf0(B,A) | -aSet0(B) | -aElementOf0(f2(A,B),A) # label(mDefSub) # label(definition).
% 0.06/0.53 -aElement0(A) | sdtlseqdt0(A,A) # label(mARefl) # label(axiom).
% 0.06/0.53 -aElement0(A) | -aElement0(B) | -sdtlseqdt0(A,B) | -sdtlseqdt0(B,A) | B = A # label(mASymm) # label(axiom).
% 0.06/0.53 -aElement0(A) | -aElement0(B) | -aElement0(C) | -sdtlseqdt0(A,B) | -sdtlseqdt0(B,C) | sdtlseqdt0(A,C) # label(mTrans) # label(axiom).
% 0.06/0.53 -aSet0(A) | -aSubsetOf0(B,A) | -aLowerBoundOfIn0(C,B,A) | aElementOf0(C,A) # label(mDefLB) # label(definition).
% 0.06/0.53 -aSet0(A) | -aSubsetOf0(B,A) | -aLowerBoundOfIn0(C,B,A) | -aElementOf0(D,B) | sdtlseqdt0(C,D) # label(mDefLB) # label(definition).
% 0.06/0.53 -aSet0(A) | -aSubsetOf0(B,A) | aLowerBoundOfIn0(C,B,A) | -aElementOf0(C,A) | aElementOf0(f3(A,B,C),B) # label(mDefLB) # label(definition).
% 0.06/0.53 -aSet0(A) | -aSubsetOf0(B,A) | aLowerBoundOfIn0(C,B,A) | -aElementOf0(C,A) | -sdtlseqdt0(C,f3(A,B,C)) # label(mDefLB) # label(definition).
% 0.06/0.53 -aSet0(A) | -aSubsetOf0(B,A) | -aUpperBoundOfIn0(C,B,A) | aElementOf0(C,A) # label(mDefUB) # label(definition).
% 0.06/0.53 -aSet0(A) | -aSubsetOf0(B,A) | -aUpperBoundOfIn0(C,B,A) | -aElementOf0(D,B) | sdtlseqdt0(D,C) # label(mDefUB) # label(definition).
% 0.06/0.53 -aSet0(A) | -aSubsetOf0(B,A) | aUpperBoundOfIn0(C,B,A) | -aElementOf0(C,A) | aElementOf0(f4(A,B,C),B) # label(mDefUB) # label(definition).
% 0.06/0.53 -aSet0(A) | -aSubsetOf0(B,A) | aUpperBoundOfIn0(C,B,A) | -aElementOf0(C,A) | -sdtlseqdt0(f4(A,B,C),C) # label(mDefUB) # label(definition).
% 0.06/0.53 -aSet0(A) | -aSubsetOf0(B,A) | -aInfimumOfIn0(C,B,A) | aElementOf0(C,A) # label(mDefInf) # label(definition).
% 0.06/0.53 -aSet0(A) | -aSubsetOf0(B,A) | -aInfimumOfIn0(C,B,A) | aLowerBoundOfIn0(C,B,A) # label(mDefInf) # label(definition).
% 0.06/0.53 -aSet0(A) | -aSubsetOf0(B,A) | -aInfimumOfIn0(C,B,A) | -aLowerBoundOfIn0(D,B,A) | sdtlseqdt0(D,C) # label(mDefInf) # label(definition).
% 0.06/0.53 -aSet0(A) | -aSubsetOf0(B,A) | aInfimumOfIn0(C,B,A) | -aElementOf0(C,A) | -aLowerBoundOfIn0(C,B,A) | aLowerBoundOfIn0(f5(A,B,C),B,A) # label(mDefInf) # label(definition).
% 0.06/0.53 -aSet0(A) | -aSubsetOf0(B,A) | aInfimumOfIn0(C,B,A) | -aElementOf0(C,A) | -aLowerBoundOfIn0(C,B,A) | -sdtlseqdt0(f5(A,B,C),C) # label(mDefInf) # label(definition).
% 0.06/0.53 -aSet0(A) | -aSubsetOf0(B,A) | -aSupremumOfIn0(C,B,A) | aElementOf0(C,A) # label(mDefSup) # label(definition).
% 0.06/0.53 -aSet0(A) | -aSubsetOf0(B,A) | -aSupremumOfIn0(C,B,A) | aUpperBoundOfIn0(C,B,A) # label(mDefSup) # label(definition).
% 0.06/0.53 -aSet0(A) | -aSubsetOf0(B,A) | -aSupremumOfIn0(C,B,A) | -aUpperBoundOfIn0(D,B,A) | sdtlseqdt0(C,D) # label(mDefSup) # label(definition).
% 0.06/0.53 -aSet0(A) | -aSubsetOf0(B,A) | aSupremumOfIn0(C,B,A) | -aElementOf0(C,A) | -aUpperBoundOfIn0(C,B,A) | aUpperBoundOfIn0(f6(A,B,C),B,A) # label(mDefSup) # label(definition).
% 0.06/0.53 -aSet0(A) | -aSubsetOf0(B,A) | aSupremumOfIn0(C,B,A) | -aElementOf0(C,A) | -aUpperBoundOfIn0(C,B,A) | -sdtlseqdt0(C,f6(A,B,C)) # label(mDefSup) # label(definition).
% 0.06/0.53 -aSet0(A) | -aSubsetOf0(B,A) | -aSupremumOfIn0(C,B,A) | -aSupremumOfIn0(D,B,A) | D = C # label(mSupUn) # label(axiom).
% 0.06/0.53 -aSet0(A) | -aSubsetOf0(B,A) | -aInfimumOfIn0(C,B,A) | -aInfimumOfIn0(D,B,A) | D = C # label(mInfUn) # label(axiom).
% 0.06/0.53 -aCompleteLattice0(A) | aSet0(A) # label(mDefCLat) # label(definition).
% 0.06/0.53 -aCompleteLattice0(A) | -aSubsetOf0(B,A) | aInfimumOfIn0(f7(A,B),B,A) # label(mDefCLat) # label(definition).
% 0.06/0.53 -aCompleteLattice0(A) | -aSubsetOf0(B,A) | aSupremumOfIn0(f8(A,B),B,A) # label(mDefCLat) # label(definition).
% 0.06/0.53 aCompleteLattice0(A) | -aSet0(A) | aSubsetOf0(f9(A),A) # label(mDefCLat) # label(definition).
% 0.06/0.53 aCompleteLattice0(A) | -aSet0(A) | -aInfimumOfIn0(B,f9(A),A) | -aSupremumOfIn0(C,f9(A),A) # label(mDefCLat) # label(definition).
% 0.06/0.53 -aFunction0(A) | aSet0(szDzozmdt0(A)) # label(mDomSort) # label(axiom).
% 0.06/0.53 -aFunction0(A) | aSet0(szRzazndt0(A)) # label(mRanSort) # label(axiom).
% 0.06/0.53 -aFunction0(A) | -aSet0(B) | -isOn0(A,B) | szRzazndt0(A) = szDzozmdt0(A) # label(mDefDom) # label(definition).
% 0.06/0.53 -aFunction0(A) | -aSet0(B) | -isOn0(A,B) | szRzazndt0(A) = B # label(mDefDom) # label(definition).
% 0.06/0.53 -aFunction0(A) | -aSet0(B) | isOn0(A,B) | szRzazndt0(A) != szDzozmdt0(A) | szRzazndt0(A) != B # label(mDefDom) # label(definition).
% 0.06/0.53 -aFunction0(A) | -aElementOf0(B,szDzozmdt0(A)) | aElementOf0(sdtlpdtrp0(A,B),szRzazndt0(A)) # label(mImgSort) # label(axiom).
% 0.06/0.53 -aFunction0(A) | -aFixedPointOf0(B,A) | aElementOf0(B,szDzozmdt0(A)) # label(mDefFix) # label(definition).
% 0.06/0.53 -aFunction0(A) | -aFixedPointOf0(B,A) | sdtlpdtrp0(A,B) = B # label(mDefFix) # label(definition).
% 0.06/0.53 -aFunction0(A) | aFixedPointOf0(B,A) | -aElementOf0(B,szDzozmdt0(A)) | sdtlpdtrp0(A,B) != B # label(mDefFix) # label(definition).
% 0.06/0.53 -aFunction0(A) | -isMonotone0(A) | -aElementOf0(B,szDzozmdt0(A)) | -aElementOf0(C,szDzozmdt0(A)) | -sdtlseqdt0(B,C) | sdtlseqdt0(sdtlpdtrp0(A,B),sdtlpdtrp0(A,C)) # label(mDefMonot) # label(definition).
% 0.06/0.53 -aFunction0(A) | isMonotone0(A) | aElementOf0(f10(A),szDzozmdt0(A)) # label(mDefMonot) # label(definition).
% 0.06/0.53 -aFunction0(A) | isMonotone0(A) | aElementOf0(f11(A),szDzozmdt0(A)) # label(mDefMonot) # label(definition).
% 0.06/0.53 -aFunction0(A) | isMonotone0(A) | sdtlseqdt0(f10(A),f11(A)) # label(mDefMonot) # label(definition).
% 0.06/0.53 -aFunction0(A) | isMonotone0(A) | -sdtlseqdt0(sdtlpdtrp0(A,f10(A)),sdtlpdtrp0(A,f11(A))) # label(mDefMonot) # label(definition).
% 0.06/0.53 aCompleteLattice0(xU) # label(m__1123_AndLHS) # label(hypothesis).
% 0.06/0.53 aFunction0(xf) # label(m__1123_AndRHS_AndLHS) # label(hypothesis).
% 0.06/0.53 isMonotone0(xf) # label(m__1123_AndRHS_AndRHS_AndLHS) # label(hypothesis).
% 0.06/0.53 isOn0(xf,xU) # label(m__1123_AndRHS_AndRHS_AndRHS) # label(hypothesis).
% 0.06/0.53 xS = cS1142(xf) # label(m__1144) # label(hypothesis).
% 0.06/0.53 aSubsetOf0(xT,xS) # label(m__1173) # label(hypothesis).
% 0.06/0.53 xP = cS1241(xU,xf,xT) # label(m__1244) # label(hypothesis).
% 0.06/0.53 aInfimumOfIn0(xp,xP,xU) # label(m__1261) # label(hypothesis).
% 0.06/0.53 -aLowerBoundOfIn0(sdtlpdtrp0(xf,xp),xP,xU) | -aUpperBoundOfIn0(sdtlpdtrp0(xf,xp),xT,xU) # label(m__) # label(negated_conjecture).
% 0.06/0.53 end_of_list.
% 0.06/0.53
% 0.06/0.53 ============================== end of clauses for search =============
% 0.06/0.53 % SZS output start FiniteModel
% 0.06/0.53
% 0.06/0.53 % There are no natural numbers in the input.
% 0.06/0.53
% 0.06/0.53 xP : 0
% 0.06/0.53
% 0.06/0.53 xS : 0
% 0.06/0.53
% 0.06/0.53 xT : 0
% 0.06/0.53
% 0.06/0.53 xU : 0
% 0.06/0.53
% 0.06/0.53 xf : 0
% 0.06/0.53
% 0.06/0.53 xp : 0
% 0.06/0.53
% 0.06/0.53 cS1142 :
% 0.06/0.53 0 1
% 0.06/0.53 -------
% 0.06/0.53 0 0
% 0.06/0.53
% 0.06/0.53 szDzozmdt0 :
% 0.06/0.53 0 1
% 0.06/0.53 -------
% 0.06/0.53 0 0
% 0.06/0.53
% 0.06/0.53 szRzazndt0 :
% 0.06/0.53 0 1
% 0.06/0.53 -------
% 0.06/0.53 0 0
% 0.06/0.53
% 0.06/0.53 f1 :
% 0.06/0.53 0 1
% 0.06/0.53 -------
% 0.06/0.53 0 0
% 0.06/0.53
% 0.06/0.53 f9 :
% 0.06/0.53 0 1
% 0.06/0.53 -------
% 0.06/0.53 0 0
% 0.06/0.53
% 0.06/0.53 f10 :
% 0.06/0.53 0 1
% 0.06/0.53 -------
% 0.06/0.53 0 0
% 0.06/0.53
% 0.06/0.53 f11 :
% 0.06/0.53 0 1
% 0.06/0.53 -------
% 0.06/0.53 0 0
% 0.06/0.53
% 0.06/0.53 sdtlpdtrp0 :
% 0.06/0.53 | 0 1
% 0.06/0.53 --+----
% 0.06/0.53 0 | 0 0
% 0.06/0.53 1 | 0 0
% 0.06/0.53
% 0.06/0.53 f2 :
% 0.06/0.53 | 0 1
% 0.06/0.53 --+----
% 0.06/0.53 0 | 0 0
% 0.06/0.53 1 | 0 0
% 0.06/0.53
% 0.06/0.53 f7 :
% 0.06/0.53 | 0 1
% 0.06/0.53 --+----
% 0.06/0.53 0 | 0 0
% 0.06/0.53 1 | 0 0
% 0.06/0.53
% 0.06/0.53 f8 :
% 0.06/0.53 | 0 1
% 0.06/0.53 --+----
% 0.06/0.53 0 | 1 0
% 0.06/0.53 1 | 0 0
% 0.06/0.53 cS1241(0,0,0) = 0.
% 0.06/0.53 cS1241(0,0,1) = 0.
% 0.06/0.53 cS1241(0,1,0) = 0.
% 0.06/0.53 cS1241(0,1,1) = 0.
% 0.06/0.53 cS1241(1,0,0) = 0.
% 0.06/0.53 cS1241(1,0,1) = 0.
% 0.06/0.53 cS1241(1,1,0) = 0.
% 0.06/0.53 cS1241(1,1,1) = 0.
% 0.06/0.53 f3(0,0,0) = 0.
% 0.06/0.53 f3(0,0,1) = 0.
% 0.06/0.53 f3(0,1,0) = 0.
% 0.06/0.53 f3(0,1,1) = 0.
% 0.06/0.53 f3(1,0,0) = 0.
% 0.06/0.53 f3(1,0,1) = 0.
% 0.06/0.53 f3(1,1,0) = 0.
% 0.06/0.53 f3(1,1,1) = 0.
% 0.06/0.53 f4(0,0,0) = 1.
% 0.06/0.53 f4(0,0,1) = 0.
% 0.06/0.53 f4(0,1,0) = 0.
% 0.06/0.53 f4(0,1,1) = 0.
% 0.06/0.53 f4(1,0,0) = 0.
% 0.06/0.53 f4(1,0,1) = 0.
% 0.06/0.53 f4(1,1,0) = 0.
% 0.06/0.53 f4(1,1,1) = 0.
% 0.06/0.53 f5(0,0,0) = 0.
% 0.06/0.53 f5(0,0,1) = 0.
% 0.06/0.53 f5(0,1,0) = 0.
% 0.06/0.53 f5(0,1,1) = 0.
% 0.06/0.53 f5(1,0,0) = 0.
% 0.06/0.53 f5(1,0,1) = 0.
% 0.06/0.53 f5(1,1,0) = 0.
% 0.06/0.53 f5(1,1,1) = 0.
% 0.06/0.53 f6(0,0,0) = 0.
% 0.06/0.53 f6(0,0,1) = 0.
% 0.06/0.53 f6(0,1,0) = 0.
% 0.06/0.53 f6(0,1,1) = 0.
% 0.06/0.53 f6(1,0,0) = 0.
% 0.06/0.53 f6(1,0,1) = 0.
% 0.06/0.53 f6(1,1,0) = 0.
% 0.06/0.53 f6(1,1,1) = 0.
% 0.06/0.53
% 0.06/0.53 aCompleteLattice0 :
% 0.06/0.53 0 1
% 0.06/0.53 -------
% 0.06/0.53 1 0
% 0.06/0.53
% 0.06/0.53 aElement0 :
% 0.06/0.53 0 1
% 0.06/0.53 -------
% 0.06/0.53 1 1
% 0.06/0.53
% 0.06/0.53 aFunction0 :
% 0.06/0.53 0 1
% 0.06/0.53 -------
% 0.06/0.53 1 0
% 0.06/0.53
% 0.06/0.53 aSet0 :
% 0.06/0.53 0 1
% 0.06/0.53 -------
% 0.06/0.53 1 0
% 0.06/0.53
% 0.06/0.53 isEmpty0 :
% 0.06/0.53 0 1
% 0.06/0.53 -------
% 0.06/0.53 0 0
% 0.06/0.53
% 0.06/0.53 isMonotone0 :
% 0.06/0.53 0 1
% 0.06/0.53 -------
% 0.06/0.53 1 0
% 0.06/0.53
% 0.06/0.53 aElementOf0 :
% 0.06/0.53 | 0 1
% 0.06/0.53 --+----
% 0.06/0.53 0 | 1 0
% 0.06/0.53 1 | 1 0
% 0.06/0.53
% 0.06/0.53 aFixedPointOf0 :
% 0.06/0.53 | 0 1
% 0.06/0.53 --+----
% 0.06/0.53 0 | 1 0
% 0.06/0.53 1 | 0 0
% 0.06/0.53
% 0.06/0.53 aSubsetOf0 :
% 0.06/0.53 | 0 1
% 0.06/0.53 --+----
% 0.06/0.53 0 | 1 0
% 0.06/0.53 1 | 0 0
% 0.06/0.53
% 0.06/0.53 isOn0 :
% 0.06/0.53 | 0 1
% 0.06/0.53 --+----
% 0.06/0.53 0 | 1 0
% 0.06/0.53 1 | 0 0
% 0.06/0.53
% 0.06/0.53 sdtlseqdt0 :
% 0.06/0.53 | 0 1
% 0.06/0.53 --+----
% 0.06/0.53 0 | 1 1
% 0.06/0.53 1 | 0 1
% 0.06/0.53 aInfimumOfIn0(0,0,0) = 1.
% 0.06/0.53 aInfimumOfIn0(0,0,1) = 0.
% 0.06/0.53 aInfimumOfIn0(0,1,0) = 0.
% 0.06/0.53 aInfimumOfIn0(0,1,1) = 0.
% 0.06/0.53 aInfimumOfIn0(1,0,0) = 0.
% 0.06/0.53 aInfimumOfIn0(1,0,1) = 0.
% 0.06/0.53 aInfimumOfIn0(1,1,0) = 0.
% 0.06/0.53 aInfimumOfIn0(1,1,1) = 0.
% 0.06/0.53 aLowerBoundOfIn0(0,0,0) = 1.
% 0.06/0.53 aLowerBoundOfIn0(0,0,1) = 0.
% 0.06/0.53 aLowerBoundOfIn0(0,1,0) = 0.
% 0.06/0.53 aLowerBoundOfIn0(0,1,1) = 0.
% 0.06/0.53 aLowerBoundOfIn0(1,0,0) = 0.
% 0.06/0.53 aLowerBoundOfIn0(1,0,1) = 0.
% 0.06/0.53 aLowerBoundOfIn0(1,1,0) = 0.
% 0.06/0.53 aLowerBoundOfIn0(1,1,1) = 0.
% 0.06/0.53 aSupremumOfIn0(0,0,0) = 0.
% 0.06/0.53 aSupremumOfIn0(0,0,1) = 0.
% 0.06/0.53 aSupremumOfIn0(0,1,0) = 0.
% 0.06/0.53 aSupremumOfIn0(0,1,1) = 0.
% 0.06/0.53 aSupremumOfIn0(1,0,0) = 1.
% 0.06/0.53 aSupremumOfIn0(1,0,1) = 0.
% 0.06/0.53 aSupremumOfIn0(1,1,0) = 0.
% 0.06/0.53 aSupremumOfIn0(1,1,1) = 0.
% 0.06/0.53 aUpperBoundOfIn0(0,0,0) = 0.
% 0.06/0.53 aUpperBoundOfIn0(0,0,1) = 0.
% 0.06/0.53 aUpperBoundOfIn0(0,1,0) = 0.
% 0.06/0.53 aUpperBoundOfIn0(0,1,1) = 0.
% 0.06/0.53 aUpperBoundOfIn0(1,0,0) = 1.
% 0.06/0.53 aUpperBoundOfIn0(1,0,1) = 0.
% 0.06/0.53 aUpperBoundOfIn0(1,1,0) = 0.
% 0.06/0.53 aUpperBoundOfIn0(1,1,1) = 0.
% 0.06/0.53
% 0.06/0.53 % SZS output end FiniteModel
% 0.06/0.53 ------ process 19529 exit (max_models) ------
% 0.06/0.53
% 0.06/0.53 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.06/0.53
% 0.06/0.53 Exiting with 1 model.
% 0.06/0.53
% 0.06/0.53 Process 19529 exit (max_models) Tue Feb 7 19:03:16 2017
% 0.06/0.53 The process finished Tue Feb 7 19:03:16 2017
% 0.06/0.53 Mace4 ended
%------------------------------------------------------------------------------