TSTP Solution File: NUM448+1 by Mace4---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Mace4---1109a
% Problem : NUM448+1 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : mace4 -t %d -f %s
% Computer : n103.star.cs.uiowa.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory : 32218.625MB
% OS : Linux 3.10.0-693.2.2.el7.x86_64
% CPULimit : 300s
% DateTime : Mon Jan 8 14:41:13 EST 2018
% Result : CounterSatisfiable 0.07s
% Output : FiniteModel 0.07s
% 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.04 % Problem : NUM448+1 : TPTP v7.0.0. Released v4.0.0.
% 0.00/0.04 % Command : mace4 -t %d -f %s
% 0.03/0.24 % Computer : n103.star.cs.uiowa.edu
% 0.03/0.24 % Model : x86_64 x86_64
% 0.03/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.03/0.24 % Memory : 32218.625MB
% 0.03/0.24 % OS : Linux 3.10.0-693.2.2.el7.x86_64
% 0.03/0.24 % CPULimit : 300
% 0.03/0.24 % DateTime : Fri Jan 5 04:10:14 CST 2018
% 0.03/0.24 % CPUTime :
% 0.07/0.48 % SZS status CounterSatisfiable
% 0.07/0.49 ============================== Mace4 =================================
% 0.07/0.49 Mace4 (32) version 2009-11A, November 2009.
% 0.07/0.49 Process 5137 was started by sandbox2 on n103.star.cs.uiowa.edu,
% 0.07/0.49 Fri Jan 5 04:10:15 2018
% 0.07/0.49 The command was "/export/starexec/sandbox2/solver/bin/mace4 -t 300 -f /tmp/Mace4_input_5104_n103.star.cs.uiowa.edu".
% 0.07/0.49 ============================== end of head ===========================
% 0.07/0.49
% 0.07/0.49 ============================== INPUT =================================
% 0.07/0.49
% 0.07/0.49 % Reading from file /tmp/Mace4_input_5104_n103.star.cs.uiowa.edu
% 0.07/0.49
% 0.07/0.49 set(prolog_style_variables).
% 0.07/0.49 set(print_models_tabular).
% 0.07/0.49 % set(print_models_tabular) -> clear(print_models).
% 0.07/0.49
% 0.07/0.49 formulas(sos).
% 0.07/0.49 (all W0 (aInteger0(W0) -> $T)) # label(mIntegers) # label(axiom).
% 0.07/0.49 aInteger0(sz00) # label(mIntZero) # label(axiom).
% 0.07/0.49 aInteger0(sz10) # label(mIntOne) # label(axiom).
% 0.07/0.49 (all W0 (aInteger0(W0) -> aInteger0(smndt0(W0)))) # label(mIntNeg) # label(axiom).
% 0.07/0.49 (all W0 all W1 (aInteger0(W0) & aInteger0(W1) -> aInteger0(sdtpldt0(W0,W1)))) # label(mIntPlus) # label(axiom).
% 0.07/0.49 (all W0 all W1 (aInteger0(W0) & aInteger0(W1) -> aInteger0(sdtasdt0(W0,W1)))) # label(mIntMult) # label(axiom).
% 0.07/0.49 (all W0 all W1 all W2 (aInteger0(W0) & aInteger0(W1) & aInteger0(W2) -> sdtpldt0(W0,sdtpldt0(W1,W2)) = sdtpldt0(sdtpldt0(W0,W1),W2))) # label(mAddAsso) # label(axiom).
% 0.07/0.49 (all W0 all W1 (aInteger0(W0) & aInteger0(W1) -> sdtpldt0(W0,W1) = sdtpldt0(W1,W0))) # label(mAddComm) # label(axiom).
% 0.07/0.49 (all W0 (aInteger0(W0) -> sdtpldt0(W0,sz00) = W0 & W0 = sdtpldt0(sz00,W0))) # label(mAddZero) # label(axiom).
% 0.07/0.49 (all W0 (aInteger0(W0) -> sdtpldt0(W0,smndt0(W0)) = sz00 & sz00 = sdtpldt0(smndt0(W0),W0))) # label(mAddNeg) # label(axiom).
% 0.07/0.49 (all W0 all W1 all W2 (aInteger0(W0) & aInteger0(W1) & aInteger0(W2) -> sdtasdt0(W0,sdtasdt0(W1,W2)) = sdtasdt0(sdtasdt0(W0,W1),W2))) # label(mMulAsso) # label(axiom).
% 0.07/0.49 (all W0 all W1 (aInteger0(W0) & aInteger0(W1) -> sdtasdt0(W0,W1) = sdtasdt0(W1,W0))) # label(mMulComm) # label(axiom).
% 0.07/0.49 (all W0 (aInteger0(W0) -> sdtasdt0(W0,sz10) = W0 & W0 = sdtasdt0(sz10,W0))) # label(mMulOne) # label(axiom).
% 0.07/0.49 (all W0 all W1 all W2 (aInteger0(W0) & aInteger0(W1) & aInteger0(W2) -> sdtasdt0(W0,sdtpldt0(W1,W2)) = sdtpldt0(sdtasdt0(W0,W1),sdtasdt0(W0,W2)) & sdtasdt0(sdtpldt0(W0,W1),W2) = sdtpldt0(sdtasdt0(W0,W2),sdtasdt0(W1,W2)))) # label(mDistrib) # label(axiom).
% 0.07/0.49 (all W0 (aInteger0(W0) -> sdtasdt0(W0,sz00) = sz00 & sz00 = sdtasdt0(sz00,W0))) # label(mMulZero) # label(axiom).
% 0.07/0.49 (all W0 (aInteger0(W0) -> sdtasdt0(smndt0(sz10),W0) = smndt0(W0) & smndt0(W0) = sdtasdt0(W0,smndt0(sz10)))) # label(mMulMinOne) # label(axiom).
% 0.07/0.49 (all W0 all W1 (aInteger0(W0) & aInteger0(W1) -> (sdtasdt0(W0,W1) = sz00 -> W0 = sz00 | W1 = sz00))) # label(mZeroDiv) # label(axiom).
% 0.07/0.49 (all W0 (aInteger0(W0) -> (all W1 (aDivisorOf0(W1,W0) <-> aInteger0(W1) & W1 != sz00 & (exists W2 (aInteger0(W2) & sdtasdt0(W1,W2) = W0)))))) # label(mDivisor) # label(definition).
% 0.07/0.49 (all W0 all W1 all W2 (aInteger0(W0) & aInteger0(W1) & aInteger0(W2) & W2 != sz00 -> (sdteqdtlpzmzozddtrp0(W0,W1,W2) <-> aDivisorOf0(W2,sdtpldt0(W0,smndt0(W1)))))) # label(mEquMod) # label(definition).
% 0.07/0.49 (all W0 all W1 (aInteger0(W0) & aInteger0(W1) & W1 != sz00 -> sdteqdtlpzmzozddtrp0(W0,W0,W1))) # label(mEquModRef) # label(axiom).
% 0.07/0.49 (all W0 all W1 all W2 (aInteger0(W0) & aInteger0(W1) & aInteger0(W2) & W2 != sz00 -> (sdteqdtlpzmzozddtrp0(W0,W1,W2) -> sdteqdtlpzmzozddtrp0(W1,W0,W2)))) # label(mEquModSym) # label(axiom).
% 0.07/0.49 (all W0 all W1 all W2 all W3 (aInteger0(W0) & aInteger0(W1) & aInteger0(W2) & W2 != sz00 & aInteger0(W3) -> (sdteqdtlpzmzozddtrp0(W0,W1,W2) & sdteqdtlpzmzozddtrp0(W1,W3,W2) -> sdteqdtlpzmzozddtrp0(W0,W3,W2)))) # label(mEquModTrn) # label(axiom).
% 0.07/0.49 (all W0 all W1 all W2 all W3 (aInteger0(W0) & aInteger0(W1) & aInteger0(W2) & W2 != sz00 & aInteger0(W3) & W3 != sz00 -> (sdteqdtlpzmzozddtrp0(W0,W1,sdtasdt0(W2,W3)) -> sdteqdtlpzmzozddtrp0(W0,W1,W2) & sdteqdtlpzmzozddtrp0(W0,W1,W3)))) # label(mEquModMul) # label(axiom).
% 0.07/0.49 (all W0 (aInteger0(W0) & W0 != sz00 -> (isPrime0(W0) -> $T))) # label(mPrime) # label(axiom).
% 0.07/0.49 (all W0 (aInteger0(W0) -> ((exists W1 (aDivisorOf0(W1,W0) & isPrime0(W1))) <-> W0 != sz10 & W0 != smndt0(sz10)))) # label(mPrimeDivisor) # label(axiom).
% 0.07/0.49 (all W0 (aSet0(W0) -> $T)) # label(mSets) # label(axiom).
% 0.07/0.49 (all W0 (aSet0(W0) -> (all W1 (aElementOf0(W1,W0) -> $T)))) # label(mElements) # label(axiom).
% 0.07/0.49 (all W0 (aSet0(W0) -> (all W1 (aSubsetOf0(W1,W0) <-> aSet0(W1) & (all W2 (aElementOf0(W2,W1) -> aElementOf0(W2,W0))))))) # label(mSubset) # label(definition).
% 0.07/0.49 (all W0 (aSet0(W0) -> (isFinite0(W0) -> $T))) # label(mFinSet) # label(axiom).
% 0.07/0.49 (all W0 all W1 (aSubsetOf0(W0,cS1395) & aSubsetOf0(W1,cS1395) -> (all W2 (W2 = sdtbsmnsldt0(W0,W1) <-> aSet0(W2) & (all W3 (aElementOf0(W3,W2) <-> aInteger0(W3) & (aElementOf0(W3,W0) | aElementOf0(W3,W1)))))))) # label(mUnion) # label(definition).
% 0.07/0.49 (all W0 all W1 (aSubsetOf0(W0,cS1395) & aSubsetOf0(W1,cS1395) -> (all W2 (W2 = sdtslmnbsdt0(W0,W1) <-> aSet0(W2) & (all W3 (aElementOf0(W3,W2) <-> aInteger0(W3) & aElementOf0(W3,W0) & aElementOf0(W3,W1))))))) # label(mIntersection) # label(definition).
% 0.07/0.49 (all W0 (aSet0(W0) & (all W1 (aElementOf0(W1,W0) -> aSubsetOf0(W1,cS1395))) -> (all W1 (W1 = sbsmnsldt0(W0) <-> aSet0(W1) & (all W2 (aElementOf0(W2,W1) <-> aInteger0(W2) & (exists W3 (aElementOf0(W3,W0) & aElementOf0(W2,W3))))))))) # label(mUnionSet) # label(definition).
% 0.07/0.49 (all W0 (aSubsetOf0(W0,cS1395) -> (all W1 (W1 = stldt0(W0) <-> aSet0(W1) & (all W2 (aElementOf0(W2,W1) <-> aInteger0(W2) & -aElementOf0(W2,W0))))))) # label(mComplement) # label(definition).
% 0.07/0.49 (all W0 all W1 (aInteger0(W0) & aInteger0(W1) & W1 != sz00 -> (all W2 (W2 = szAzrzSzezqlpdtcmdtrp0(W0,W1) <-> aSet0(W2) & (all W3 (aElementOf0(W3,W2) <-> aInteger0(W3) & sdteqdtlpzmzozddtrp0(W3,W0,W1))))))) # label(mArSeq) # label(definition).
% 0.07/0.49 (all W0 (aSubsetOf0(W0,cS1395) -> (isOpen0(W0) <-> (all W1 (aElementOf0(W1,W0) -> (exists W2 (aInteger0(W2) & W2 != sz00 & aSubsetOf0(szAzrzSzezqlpdtcmdtrp0(W1,W2),W0)))))))) # label(mOpen) # label(definition).
% 0.07/0.49 (all W0 (aSubsetOf0(W0,cS1395) -> (isClosed0(W0) <-> isOpen0(stldt0(W0))))) # label(mClosed) # label(definition).
% 0.07/0.49 (all W0 (aSet0(W0) & (all W1 (aElementOf0(W1,W0) -> aSubsetOf0(W1,cS1395) & isOpen0(W1))) -> isOpen0(sbsmnsldt0(W0)))) # label(mUnionOpen) # label(axiom).
% 0.07/0.49 (all W0 all W1 (aSubsetOf0(W0,cS1395) & aSubsetOf0(W1,cS1395) & isOpen0(W0) & isOpen0(W1) -> isOpen0(sdtslmnbsdt0(W0,W1)))) # label(mInterOpen) # label(axiom).
% 0.07/0.49 (all W0 all W1 (aSubsetOf0(W0,cS1395) & aSubsetOf0(W1,cS1395) & isClosed0(W0) & isClosed0(W1) -> isClosed0(sdtbsmnsldt0(W0,W1)))) # label(mUnionClosed) # label(axiom).
% 0.07/0.49 (all W0 (aSet0(W0) & isFinite0(W0) & (all W1 (aElementOf0(W1,W0) -> aSubsetOf0(W1,cS1395) & isClosed0(W1))) -> isClosed0(sbsmnsldt0(W0)))) # label(mUnionSClosed) # label(axiom).
% 0.07/0.49 (all W0 all W1 (aInteger0(W0) & aInteger0(W1) & W1 != sz00 -> aSubsetOf0(szAzrzSzezqlpdtcmdtrp0(W0,W1),cS1395) & isClosed0(szAzrzSzezqlpdtcmdtrp0(W0,W1)))) # label(mArSeqClosed) # label(axiom).
% 0.07/0.49 xS = cS2043 # label(m__2046) # label(hypothesis).
% 0.07/0.49 -((all W0 (aInteger0(W0) -> (aElementOf0(W0,sbsmnsldt0(xS)) <-> (exists W1 (aDivisorOf0(W1,W0) & isPrime0(W1)))))) -> stldt0(sbsmnsldt0(xS)) = cS2076) # label(m__) # label(negated_conjecture).
% 0.07/0.49 end_of_list.
% 0.07/0.49
% 0.07/0.49 % From the command line: assign(max_seconds, 300).
% 0.07/0.49
% 0.07/0.49 ============================== end of input ==========================
% 0.07/0.49
% 0.07/0.49 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.07/0.49
% 0.07/0.49 % Formulas that are not ordinary clauses:
% 0.07/0.49 1 (all W0 (aInteger0(W0) -> $T)) # label(mIntegers) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.49 2 (all W0 (aInteger0(W0) -> aInteger0(smndt0(W0)))) # label(mIntNeg) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.49 3 (all W0 all W1 (aInteger0(W0) & aInteger0(W1) -> aInteger0(sdtpldt0(W0,W1)))) # label(mIntPlus) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.49 4 (all W0 all W1 (aInteger0(W0) & aInteger0(W1) -> aInteger0(sdtasdt0(W0,W1)))) # label(mIntMult) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.49 5 (all W0 all W1 all W2 (aInteger0(W0) & aInteger0(W1) & aInteger0(W2) -> sdtpldt0(W0,sdtpldt0(W1,W2)) = sdtpldt0(sdtpldt0(W0,W1),W2))) # label(mAddAsso) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.49 6 (all W0 all W1 (aInteger0(W0) & aInteger0(W1) -> sdtpldt0(W0,W1) = sdtpldt0(W1,W0))) # label(mAddComm) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.49 7 (all W0 (aInteger0(W0) -> sdtpldt0(W0,sz00) = W0 & W0 = sdtpldt0(sz00,W0))) # label(mAddZero) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.49 8 (all W0 (aInteger0(W0) -> sdtpldt0(W0,smndt0(W0)) = sz00 & sz00 = sdtpldt0(smndt0(W0),W0))) # label(mAddNeg) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.49 9 (all W0 all W1 all W2 (aInteger0(W0) & aInteger0(W1) & aInteger0(W2) -> sdtasdt0(W0,sdtasdt0(W1,W2)) = sdtasdt0(sdtasdt0(W0,W1),W2))) # label(mMulAsso) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.49 10 (all W0 all W1 (aInteger0(W0) & aInteger0(W1) -> sdtasdt0(W0,W1) = sdtasdt0(W1,W0))) # label(mMulComm) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.49 11 (all W0 (aInteger0(W0) -> sdtasdt0(W0,sz10) = W0 & W0 = sdtasdt0(sz10,W0))) # label(mMulOne) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.49 12 (all W0 all W1 all W2 (aInteger0(W0) & aInteger0(W1) & aInteger0(W2) -> sdtasdt0(W0,sdtpldt0(W1,W2)) = sdtpldt0(sdtasdt0(W0,W1),sdtasdt0(W0,W2)) & sdtasdt0(sdtpldt0(W0,W1),W2) = sdtpldt0(sdtasdt0(W0,W2),sdtasdt0(W1,W2)))) # label(mDistrib) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.49 13 (all W0 (aInteger0(W0) -> sdtasdt0(W0,sz00) = sz00 & sz00 = sdtasdt0(sz00,W0))) # label(mMulZero) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.49 14 (all W0 (aInteger0(W0) -> sdtasdt0(smndt0(sz10),W0) = smndt0(W0) & smndt0(W0) = sdtasdt0(W0,smndt0(sz10)))) # label(mMulMinOne) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.49 15 (all W0 all W1 (aInteger0(W0) & aInteger0(W1) -> (sdtasdt0(W0,W1) = sz00 -> W0 = sz00 | W1 = sz00))) # label(mZeroDiv) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.49 16 (all W0 (aInteger0(W0) -> (all W1 (aDivisorOf0(W1,W0) <-> aInteger0(W1) & W1 != sz00 & (exists W2 (aInteger0(W2) & sdtasdt0(W1,W2) = W0)))))) # label(mDivisor) # label(definition) # label(non_clause). [assumption].
% 0.07/0.49 17 (all W0 all W1 all W2 (aInteger0(W0) & aInteger0(W1) & aInteger0(W2) & W2 != sz00 -> (sdteqdtlpzmzozddtrp0(W0,W1,W2) <-> aDivisorOf0(W2,sdtpldt0(W0,smndt0(W1)))))) # label(mEquMod) # label(definition) # label(non_clause). [assumption].
% 0.07/0.49 18 (all W0 all W1 (aInteger0(W0) & aInteger0(W1) & W1 != sz00 -> sdteqdtlpzmzozddtrp0(W0,W0,W1))) # label(mEquModRef) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.49 19 (all W0 all W1 all W2 (aInteger0(W0) & aInteger0(W1) & aInteger0(W2) & W2 != sz00 -> (sdteqdtlpzmzozddtrp0(W0,W1,W2) -> sdteqdtlpzmzozddtrp0(W1,W0,W2)))) # label(mEquModSym) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.49 20 (all W0 all W1 all W2 all W3 (aInteger0(W0) & aInteger0(W1) & aInteger0(W2) & W2 != sz00 & aInteger0(W3) -> (sdteqdtlpzmzozddtrp0(W0,W1,W2) & sdteqdtlpzmzozddtrp0(W1,W3,W2) -> sdteqdtlpzmzozddtrp0(W0,W3,W2)))) # label(mEquModTrn) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.49 21 (all W0 all W1 all W2 all W3 (aInteger0(W0) & aInteger0(W1) & aInteger0(W2) & W2 != sz00 & aInteger0(W3) & W3 != sz00 -> (sdteqdtlpzmzozddtrp0(W0,W1,sdtasdt0(W2,W3)) -> sdteqdtlpzmzozddtrp0(W0,W1,W2) & sdteqdtlpzmzozddtrp0(W0,W1,W3)))) # label(mEquModMul) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.49 22 (all W0 (aInteger0(W0) & W0 != sz00 -> (isPrime0(W0) -> $T))) # label(mPrime) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.49 23 (all W0 (aInteger0(W0) -> ((exists W1 (aDivisorOf0(W1,W0) & isPrime0(W1))) <-> W0 != sz10 & W0 != smndt0(sz10)))) # label(mPrimeDivisor) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.49 24 (all W0 (aSet0(W0) -> $T)) # label(mSets) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.49 25 (all W0 (aSet0(W0) -> (all W1 (aElementOf0(W1,W0) -> $T)))) # label(mElements) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.49 26 (all W0 (aSet0(W0) -> (all W1 (aSubsetOf0(W1,W0) <-> aSet0(W1) & (all W2 (aElementOf0(W2,W1) -> aElementOf0(W2,W0))))))) # label(mSubset) # label(definition) # label(non_clause). [assumption].
% 0.07/0.49 27 (all W0 (aSet0(W0) -> (isFinite0(W0) -> $T))) # label(mFinSet) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.49 28 (all W0 all W1 (aSubsetOf0(W0,cS1395) & aSubsetOf0(W1,cS1395) -> (all W2 (W2 = sdtbsmnsldt0(W0,W1) <-> aSet0(W2) & (all W3 (aElementOf0(W3,W2) <-> aInteger0(W3) & (aElementOf0(W3,W0) | aElementOf0(W3,W1)))))))) # label(mUnion) # label(definition) # label(non_clause). [assumption].
% 0.07/0.49 29 (all W0 all W1 (aSubsetOf0(W0,cS1395) & aSubsetOf0(W1,cS1395) -> (all W2 (W2 = sdtslmnbsdt0(W0,W1) <-> aSet0(W2) & (all W3 (aElementOf0(W3,W2) <-> aInteger0(W3) & aElementOf0(W3,W0) & aElementOf0(W3,W1))))))) # label(mIntersection) # label(definition) # label(non_clause). [assumption].
% 0.07/0.49 30 (all W0 (aSet0(W0) & (all W1 (aElementOf0(W1,W0) -> aSubsetOf0(W1,cS1395))) -> (all W1 (W1 = sbsmnsldt0(W0) <-> aSet0(W1) & (all W2 (aElementOf0(W2,W1) <-> aInteger0(W2) & (exists W3 (aElementOf0(W3,W0) & aElementOf0(W2,W3))))))))) # label(mUnionSet) # label(definition) # label(non_clause). [assumption].
% 0.07/0.49 31 (all W0 (aSubsetOf0(W0,cS1395) -> (all W1 (W1 = stldt0(W0) <-> aSet0(W1) & (all W2 (aElementOf0(W2,W1) <-> aInteger0(W2) & -aElementOf0(W2,W0))))))) # label(mComplement) # label(definition) # label(non_clause). [assumption].
% 0.07/0.49 32 (all W0 all W1 (aInteger0(W0) & aInteger0(W1) & W1 != sz00 -> (all W2 (W2 = szAzrzSzezqlpdtcmdtrp0(W0,W1) <-> aSet0(W2) & (all W3 (aElementOf0(W3,W2) <-> aInteger0(W3) & sdteqdtlpzmzozddtrp0(W3,W0,W1))))))) # label(mArSeq) # label(definition) # label(non_clause). [assumption].
% 0.07/0.49 33 (all W0 (aSubsetOf0(W0,cS1395) -> (isOpen0(W0) <-> (all W1 (aElementOf0(W1,W0) -> (exists W2 (aInteger0(W2) & W2 != sz00 & aSubsetOf0(szAzrzSzezqlpdtcmdtrp0(W1,W2),W0)))))))) # label(mOpen) # label(definition) # label(non_clause). [assumption].
% 0.07/0.49 34 (all W0 (aSubsetOf0(W0,cS1395) -> (isClosed0(W0) <-> isOpen0(stldt0(W0))))) # label(mClosed) # label(definition) # label(non_clause). [assumption].
% 0.07/0.49 35 (all W0 (aSet0(W0) & (all W1 (aElementOf0(W1,W0) -> aSubsetOf0(W1,cS1395) & isOpen0(W1))) -> isOpen0(sbsmnsldt0(W0)))) # label(mUnionOpen) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.49 36 (all W0 all W1 (aSubsetOf0(W0,cS1395) & aSubsetOf0(W1,cS1395) & isOpen0(W0) & isOpen0(W1) -> isOpen0(sdtslmnbsdt0(W0,W1)))) # label(mInterOpen) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.49 37 (all W0 all W1 (aSubsetOf0(W0,cS1395) & aSubsetOf0(W1,cS1395) & isClosed0(W0) & isClosed0(W1) -> isClosed0(sdtbsmnsldt0(W0,W1)))) # label(mUnionClosed) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.49 38 (all W0 (aSet0(W0) & isFinite0(W0) & (all W1 (aElementOf0(W1,W0) -> aSubsetOf0(W1,cS1395) & isClosed0(W1))) -> isClosed0(sbsmnsldt0(W0)))) # label(mUnionSClosed) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.49 39 (all W0 all W1 (aInteger0(W0) & aInteger0(W1) & W1 != sz00 -> aSubsetOf0(szAzrzSzezqlpdtcmdtrp0(W0,W1),cS1395) & isClosed0(szAzrzSzezqlpdtcmdtrp0(W0,W1)))) # label(mArSeqClosed) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.49 40 -((all W0 (aInteger0(W0) -> (aElementOf0(W0,sbsmnsldt0(xS)) <-> (exists W1 (aDivisorOf0(W1,W0) & isPrime0(W1)))))) -> stldt0(sbsmnsldt0(xS)) = cS2076) # label(m__) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.07/0.49
% 0.07/0.49 ============================== end of process non-clausal formulas ===
% 0.07/0.49
% 0.07/0.49 ============================== CLAUSES FOR SEARCH ====================
% 0.07/0.49
% 0.07/0.49 formulas(mace4_clauses).
% 0.07/0.49 aInteger0(sz00) # label(mIntZero) # label(axiom).
% 0.07/0.49 aInteger0(sz10) # label(mIntOne) # label(axiom).
% 0.07/0.49 -aInteger0(A) | aInteger0(smndt0(A)) # label(mIntNeg) # label(axiom).
% 0.07/0.49 -aInteger0(A) | -aInteger0(B) | aInteger0(sdtpldt0(A,B)) # label(mIntPlus) # label(axiom).
% 0.07/0.49 -aInteger0(A) | -aInteger0(B) | aInteger0(sdtasdt0(A,B)) # label(mIntMult) # label(axiom).
% 0.07/0.49 -aInteger0(A) | -aInteger0(B) | -aInteger0(C) | sdtpldt0(sdtpldt0(A,B),C) = sdtpldt0(A,sdtpldt0(B,C)) # label(mAddAsso) # label(axiom).
% 0.07/0.49 -aInteger0(A) | -aInteger0(B) | sdtpldt0(B,A) = sdtpldt0(A,B) # label(mAddComm) # label(axiom).
% 0.07/0.49 -aInteger0(A) | sdtpldt0(A,sz00) = A # label(mAddZero) # label(axiom).
% 0.07/0.49 -aInteger0(A) | sdtpldt0(sz00,A) = A # label(mAddZero) # label(axiom).
% 0.07/0.49 -aInteger0(A) | sdtpldt0(A,smndt0(A)) = sz00 # label(mAddNeg) # label(axiom).
% 0.07/0.49 -aInteger0(A) | sdtpldt0(smndt0(A),A) = sz00 # label(mAddNeg) # label(axiom).
% 0.07/0.49 -aInteger0(A) | -aInteger0(B) | -aInteger0(C) | sdtasdt0(sdtasdt0(A,B),C) = sdtasdt0(A,sdtasdt0(B,C)) # label(mMulAsso) # label(axiom).
% 0.07/0.49 -aInteger0(A) | -aInteger0(B) | sdtasdt0(B,A) = sdtasdt0(A,B) # label(mMulComm) # label(axiom).
% 0.07/0.49 -aInteger0(A) | sdtasdt0(A,sz10) = A # label(mMulOne) # label(axiom).
% 0.07/0.49 -aInteger0(A) | sdtasdt0(sz10,A) = A # label(mMulOne) # label(axiom).
% 0.07/0.49 -aInteger0(A) | -aInteger0(B) | -aInteger0(C) | sdtasdt0(A,sdtpldt0(B,C)) = sdtpldt0(sdtasdt0(A,B),sdtasdt0(A,C)) # label(mDistrib) # label(axiom).
% 0.07/0.49 -aInteger0(A) | -aInteger0(B) | -aInteger0(C) | sdtasdt0(sdtpldt0(A,B),C) = sdtpldt0(sdtasdt0(A,C),sdtasdt0(B,C)) # label(mDistrib) # label(axiom).
% 0.07/0.49 -aInteger0(A) | sdtasdt0(A,sz00) = sz00 # label(mMulZero) # label(axiom).
% 0.07/0.49 -aInteger0(A) | sdtasdt0(sz00,A) = sz00 # label(mMulZero) # label(axiom).
% 0.07/0.49 -aInteger0(A) | sdtasdt0(smndt0(sz10),A) = smndt0(A) # label(mMulMinOne) # label(axiom).
% 0.07/0.49 -aInteger0(A) | sdtasdt0(A,smndt0(sz10)) = smndt0(A) # label(mMulMinOne) # label(axiom).
% 0.07/0.49 -aInteger0(A) | -aInteger0(B) | sdtasdt0(A,B) != sz00 | sz00 = A | B = sz00 # label(mZeroDiv) # label(axiom).
% 0.07/0.49 -aInteger0(A) | -aDivisorOf0(B,A) | aInteger0(B) # label(mDivisor) # label(definition).
% 0.07/0.49 -aInteger0(A) | -aDivisorOf0(B,A) | B != sz00 # label(mDivisor) # label(definition).
% 0.07/0.49 -aInteger0(A) | -aDivisorOf0(B,A) | aInteger0(f1(A,B)) # label(mDivisor) # label(definition).
% 0.07/0.49 -aInteger0(A) | -aDivisorOf0(B,A) | sdtasdt0(B,f1(A,B)) = A # label(mDivisor) # label(definition).
% 0.07/0.49 -aInteger0(A) | aDivisorOf0(B,A) | -aInteger0(B) | B = sz00 | -aInteger0(C) | sdtasdt0(B,C) != A # label(mDivisor) # label(definition).
% 0.07/0.49 -aInteger0(A) | -aInteger0(B) | -aInteger0(C) | C = sz00 | -sdteqdtlpzmzozddtrp0(A,B,C) | aDivisorOf0(C,sdtpldt0(A,smndt0(B))) # label(mEquMod) # label(definition).
% 0.07/0.49 -aInteger0(A) | -aInteger0(B) | -aInteger0(C) | C = sz00 | sdteqdtlpzmzozddtrp0(A,B,C) | -aDivisorOf0(C,sdtpldt0(A,smndt0(B))) # label(mEquMod) # label(definition).
% 0.07/0.49 -aInteger0(A) | -aInteger0(B) | B = sz00 | sdteqdtlpzmzozddtrp0(A,A,B) # label(mEquModRef) # label(axiom).
% 0.07/0.49 -aInteger0(A) | -aInteger0(B) | -aInteger0(C) | C = sz00 | -sdteqdtlpzmzozddtrp0(A,B,C) | sdteqdtlpzmzozddtrp0(B,A,C) # label(mEquModSym) # label(axiom).
% 0.07/0.49 -aInteger0(A) | -aInteger0(B) | -aInteger0(C) | C = sz00 | -aInteger0(D) | -sdteqdtlpzmzozddtrp0(A,B,C) | -sdteqdtlpzmzozddtrp0(B,D,C) | sdteqdtlpzmzozddtrp0(A,D,C) # label(mEquModTrn) # label(axiom).
% 0.07/0.49 -aInteger0(A) | -aInteger0(B) | -aInteger0(C) | C = sz00 | -aInteger0(D) | D = sz00 | -sdteqdtlpzmzozddtrp0(A,B,sdtasdt0(C,D)) | sdteqdtlpzmzozddtrp0(A,B,C) # label(mEquModMul) # label(axiom).
% 0.07/0.49 -aInteger0(A) | -aInteger0(B) | -aInteger0(C) | C = sz00 | -aInteger0(D) | D = sz00 | -sdteqdtlpzmzozddtrp0(A,B,sdtasdt0(C,D)) | sdteqdtlpzmzozddtrp0(A,B,D) # label(mEquModMul) # label(axiom).
% 0.07/0.49 -aInteger0(A) | -aDivisorOf0(B,A) | -isPrime0(B) | sz10 != A # label(mPrimeDivisor) # label(axiom).
% 0.07/0.49 -aInteger0(A) | -aDivisorOf0(B,A) | -isPrime0(B) | smndt0(sz10) != A # label(mPrimeDivisor) # label(axiom).
% 0.07/0.49 -aInteger0(A) | aDivisorOf0(f2(A),A) | sz10 = A | smndt0(sz10) = A # label(mPrimeDivisor) # label(axiom).
% 0.07/0.49 -aInteger0(A) | isPrime0(f2(A)) | sz10 = A | smndt0(sz10) = A # label(mPrimeDivisor) # label(axiom).
% 0.07/0.49 -aSet0(A) | -aSubsetOf0(B,A) | aSet0(B) # label(mSubset) # label(definition).
% 0.07/0.49 -aSet0(A) | -aSubsetOf0(B,A) | -aElementOf0(C,B) | aElementOf0(C,A) # label(mSubset) # label(definition).
% 0.07/0.49 -aSet0(A) | aSubsetOf0(B,A) | -aSet0(B) | aElementOf0(f3(A,B),B) # label(mSubset) # label(definition).
% 0.07/0.49 -aSet0(A) | aSubsetOf0(B,A) | -aSet0(B) | -aElementOf0(f3(A,B),A) # label(mSubset) # label(definition).
% 0.07/0.49 -aSubsetOf0(A,cS1395) | -aSubsetOf0(B,cS1395) | sdtbsmnsldt0(A,B) != C | aSet0(C) # label(mUnion) # label(definition).
% 0.07/0.49 -aSubsetOf0(A,cS1395) | -aSubsetOf0(B,cS1395) | sdtbsmnsldt0(A,B) != C | -aElementOf0(D,C) | aInteger0(D) # label(mUnion) # label(definition).
% 0.07/0.49 -aSubsetOf0(A,cS1395) | -aSubsetOf0(B,cS1395) | sdtbsmnsldt0(A,B) != C | -aElementOf0(D,C) | aElementOf0(D,A) | aElementOf0(D,B) # label(mUnion) # label(definition).
% 0.07/0.49 -aSubsetOf0(A,cS1395) | -aSubsetOf0(B,cS1395) | sdtbsmnsldt0(A,B) != C | aElementOf0(D,C) | -aInteger0(D) | -aElementOf0(D,A) # label(mUnion) # label(definition).
% 0.07/0.49 -aSubsetOf0(A,cS1395) | -aSubsetOf0(B,cS1395) | sdtbsmnsldt0(A,B) != C | aElementOf0(D,C) | -aInteger0(D) | -aElementOf0(D,B) # label(mUnion) # label(definition).
% 0.07/0.49 -aSubsetOf0(A,cS1395) | -aSubsetOf0(B,cS1395) | sdtbsmnsldt0(A,B) = C | -aSet0(C) | aElementOf0(f4(A,B,C),C) | aInteger0(f4(A,B,C)) # label(mUnion) # label(definition).
% 0.07/0.49 -aSubsetOf0(A,cS1395) | -aSubsetOf0(B,cS1395) | sdtbsmnsldt0(A,B) = C | -aSet0(C) | aElementOf0(f4(A,B,C),C) | aElementOf0(f4(A,B,C),A) | aElementOf0(f4(A,B,C),B) # label(mUnion) # label(definition).
% 0.07/0.49 -aSubsetOf0(A,cS1395) | -aSubsetOf0(B,cS1395) | sdtbsmnsldt0(A,B) = C | -aSet0(C) | -aElementOf0(f4(A,B,C),C) | -aInteger0(f4(A,B,C)) | -aElementOf0(f4(A,B,C),A) # label(mUnion) # label(definition).
% 0.07/0.49 -aSubsetOf0(A,cS1395) | -aSubsetOf0(B,cS1395) | sdtbsmnsldt0(A,B) = C | -aSet0(C) | -aElementOf0(f4(A,B,C),C) | -aInteger0(f4(A,B,C)) | -aElementOf0(f4(A,B,C),B) # label(mUnion) # label(definition).
% 0.07/0.49 -aSubsetOf0(A,cS1395) | -aSubsetOf0(B,cS1395) | sdtslmnbsdt0(A,B) != C | aSet0(C) # label(mIntersection) # label(definition).
% 0.07/0.49 -aSubsetOf0(A,cS1395) | -aSubsetOf0(B,cS1395) | sdtslmnbsdt0(A,B) != C | -aElementOf0(D,C) | aInteger0(D) # label(mIntersection) # label(definition).
% 0.07/0.49 -aSubsetOf0(A,cS1395) | -aSubsetOf0(B,cS1395) | sdtslmnbsdt0(A,B) != C | -aElementOf0(D,C) | aElementOf0(D,A) # label(mIntersection) # label(definition).
% 0.07/0.49 -aSubsetOf0(A,cS1395) | -aSubsetOf0(B,cS1395) | sdtslmnbsdt0(A,B) != C | -aElementOf0(D,C) | aElementOf0(D,B) # label(mIntersection) # label(definition).
% 0.07/0.49 -aSubsetOf0(A,cS1395) | -aSubsetOf0(B,cS1395) | sdtslmnbsdt0(A,B) != C | aElementOf0(D,C) | -aInteger0(D) | -aElementOf0(D,A) | -aElementOf0(D,B) # label(mIntersection) # label(definition).
% 0.07/0.49 -aSubsetOf0(A,cS1395) | -aSubsetOf0(B,cS1395) | sdtslmnbsdt0(A,B) = C | -aSet0(C) | aElementOf0(f5(A,B,C),C) | aInteger0(f5(A,B,C)) # label(mIntersection) # label(definition).
% 0.07/0.49 -aSubsetOf0(A,cS1395) | -aSubsetOf0(B,cS1395) | sdtslmnbsdt0(A,B) = C | -aSet0(C) | aElementOf0(f5(A,B,C),C) | aElementOf0(f5(A,B,C),A) # label(mIntersection) # label(definition).
% 0.07/0.49 -aSubsetOf0(A,cS1395) | -aSubsetOf0(B,cS1395) | sdtslmnbsdt0(A,B) = C | -aSet0(C) | aElementOf0(f5(A,B,C),C) | aElementOf0(f5(A,B,C),B) # label(mIntersection) # label(definition).
% 0.07/0.49 -aSubsetOf0(A,cS1395) | -aSubsetOf0(B,cS1395) | sdtslmnbsdt0(A,B) = C | -aSet0(C) | -aElementOf0(f5(A,B,C),C) | -aInteger0(f5(A,B,C)) | -aElementOf0(f5(A,B,C),A) | -aElementOf0(f5(A,B,C),B) # label(mIntersection) # label(definition).
% 0.07/0.49 -aSet0(A) | aElementOf0(f6(A),A) | sbsmnsldt0(A) != B | aSet0(B) # label(mUnionSet) # label(definition).
% 0.07/0.49 -aSet0(A) | aElementOf0(f6(A),A) | sbsmnsldt0(A) != B | -aElementOf0(C,B) | aInteger0(C) # label(mUnionSet) # label(definition).
% 0.07/0.49 -aSet0(A) | aElementOf0(f6(A),A) | sbsmnsldt0(A) != B | -aElementOf0(C,B) | aElementOf0(f7(A,B,C),A) # label(mUnionSet) # label(definition).
% 0.07/0.49 -aSet0(A) | aElementOf0(f6(A),A) | sbsmnsldt0(A) != B | -aElementOf0(C,B) | aElementOf0(C,f7(A,B,C)) # label(mUnionSet) # label(definition).
% 0.07/0.49 -aSet0(A) | aElementOf0(f6(A),A) | sbsmnsldt0(A) != B | aElementOf0(C,B) | -aInteger0(C) | -aElementOf0(D,A) | -aElementOf0(C,D) # label(mUnionSet) # label(definition).
% 0.07/0.49 -aSet0(A) | aElementOf0(f6(A),A) | sbsmnsldt0(A) = B | -aSet0(B) | aElementOf0(f8(A,B),B) | aInteger0(f8(A,B)) # label(mUnionSet) # label(definition).
% 0.07/0.49 -aSet0(A) | aElementOf0(f6(A),A) | sbsmnsldt0(A) = B | -aSet0(B) | aElementOf0(f8(A,B),B) | aElementOf0(f9(A,B),A) # label(mUnionSet) # label(definition).
% 0.07/0.49 -aSet0(A) | aElementOf0(f6(A),A) | sbsmnsldt0(A) = B | -aSet0(B) | aElementOf0(f8(A,B),B) | aElementOf0(f8(A,B),f9(A,B)) # label(mUnionSet) # label(definition).
% 0.07/0.49 -aSet0(A) | aElementOf0(f6(A),A) | sbsmnsldt0(A) = B | -aSet0(B) | -aElementOf0(f8(A,B),B) | -aInteger0(f8(A,B)) | -aElementOf0(C,A) | -aElementOf0(f8(A,B),C) # label(mUnionSet) # label(definition).
% 0.07/0.49 -aSet0(A) | -aSubsetOf0(f6(A),cS1395) | sbsmnsldt0(A) != B | aSet0(B) # label(mUnionSet) # label(definition).
% 0.07/0.49 -aSet0(A) | -aSubsetOf0(f6(A),cS1395) | sbsmnsldt0(A) != B | -aElementOf0(C,B) | aInteger0(C) # label(mUnionSet) # label(definition).
% 0.07/0.49 -aSet0(A) | -aSubsetOf0(f6(A),cS1395) | sbsmnsldt0(A) != B | -aElementOf0(C,B) | aElementOf0(f7(A,B,C),A) # label(mUnionSet) # label(definition).
% 0.07/0.49 -aSet0(A) | -aSubsetOf0(f6(A),cS1395) | sbsmnsldt0(A) != B | -aElementOf0(C,B) | aElementOf0(C,f7(A,B,C)) # label(mUnionSet) # label(definition).
% 0.07/0.49 -aSet0(A) | -aSubsetOf0(f6(A),cS1395) | sbsmnsldt0(A) != B | aElementOf0(C,B) | -aInteger0(C) | -aElementOf0(D,A) | -aElementOf0(C,D) # label(mUnionSet) # label(definition).
% 0.07/0.49 -aSet0(A) | -aSubsetOf0(f6(A),cS1395) | sbsmnsldt0(A) = B | -aSet0(B) | aElementOf0(f8(A,B),B) | aInteger0(f8(A,B)) # label(mUnionSet) # label(definition).
% 0.07/0.49 -aSet0(A) | -aSubsetOf0(f6(A),cS1395) | sbsmnsldt0(A) = B | -aSet0(B) | aElementOf0(f8(A,B),B) | aElementOf0(f9(A,B),A) # label(mUnionSet) # label(definition).
% 0.07/0.49 -aSet0(A) | -aSubsetOf0(f6(A),cS1395) | sbsmnsldt0(A) = B | -aSet0(B) | aElementOf0(f8(A,B),B) | aElementOf0(f8(A,B),f9(A,B)) # label(mUnionSet) # label(definition).
% 0.07/0.49 -aSet0(A) | -aSubsetOf0(f6(A),cS1395) | sbsmnsldt0(A) = B | -aSet0(B) | -aElementOf0(f8(A,B),B) | -aInteger0(f8(A,B)) | -aElementOf0(C,A) | -aElementOf0(f8(A,B),C) # label(mUnionSet) # label(definition).
% 0.07/0.49 -aSubsetOf0(A,cS1395) | stldt0(A) != B | aSet0(B) # label(mComplement) # label(definition).
% 0.07/0.49 -aSubsetOf0(A,cS1395) | stldt0(A) != B | -aElementOf0(C,B) | aInteger0(C) # label(mComplement) # label(definition).
% 0.07/0.49 -aSubsetOf0(A,cS1395) | stldt0(A) != B | -aElementOf0(C,B) | -aElementOf0(C,A) # label(mComplement) # label(definition).
% 0.07/0.49 -aSubsetOf0(A,cS1395) | stldt0(A) != B | aElementOf0(C,B) | -aInteger0(C) | aElementOf0(C,A) # label(mComplement) # label(definition).
% 0.07/0.49 -aSubsetOf0(A,cS1395) | stldt0(A) = B | -aSet0(B) | aElementOf0(f10(A,B),B) | aInteger0(f10(A,B)) # label(mComplement) # label(definition).
% 0.07/0.49 -aSubsetOf0(A,cS1395) | stldt0(A) = B | -aSet0(B) | aElementOf0(f10(A,B),B) | -aElementOf0(f10(A,B),A) # label(mComplement) # label(definition).
% 0.07/0.49 -aSubsetOf0(A,cS1395) | stldt0(A) = B | -aSet0(B) | -aElementOf0(f10(A,B),B) | -aInteger0(f10(A,B)) | aElementOf0(f10(A,B),A) # label(mComplement) # label(definition).
% 0.07/0.49 -aInteger0(A) | -aInteger0(B) | B = sz00 | szAzrzSzezqlpdtcmdtrp0(A,B) != C | aSet0(C) # label(mArSeq) # label(definition).
% 0.07/0.49 -aInteger0(A) | -aInteger0(B) | B = sz00 | szAzrzSzezqlpdtcmdtrp0(A,B) != C | -aElementOf0(D,C) | aInteger0(D) # label(mArSeq) # label(definition).
% 0.07/0.49 -aInteger0(A) | -aInteger0(B) | B = sz00 | szAzrzSzezqlpdtcmdtrp0(A,B) != C | -aElementOf0(D,C) | sdteqdtlpzmzozddtrp0(D,A,B) # label(mArSeq) # label(definition).
% 0.07/0.49 -aInteger0(A) | -aInteger0(B) | B = sz00 | szAzrzSzezqlpdtcmdtrp0(A,B) != C | aElementOf0(D,C) | -aInteger0(D) | -sdteqdtlpzmzozddtrp0(D,A,B) # label(mArSeq) # label(definition).
% 0.07/0.49 -aInteger0(A) | -aInteger0(B) | B = sz00 | szAzrzSzezqlpdtcmdtrp0(A,B) = C | -aSet0(C) | aElementOf0(f11(A,B,C),C) | aInteger0(f11(A,B,C)) # label(mArSeq) # label(definition).
% 0.07/0.49 -aInteger0(A) | -aInteger0(B) | B = sz00 | szAzrzSzezqlpdtcmdtrp0(A,B) = C | -aSet0(C) | aElementOf0(f11(A,B,C),C) | sdteqdtlpzmzozddtrp0(f11(A,B,C),A,B) # label(mArSeq) # label(definition).
% 0.07/0.49 -aInteger0(A) | -aInteger0(B) | B = sz00 | szAzrzSzezqlpdtcmdtrp0(A,B) = C | -aSet0(C) | -aElementOf0(f11(A,B,C),C) | -aInteger0(f11(A,B,C)) | -sdteqdtlpzmzozddtrp0(f11(A,B,C),A,B) # label(mArSeq) # label(definition).
% 0.07/0.49 -aSubsetOf0(A,cS1395) | -isOpen0(A) | -aElementOf0(B,A) | aInteger0(f12(A,B)) # label(mOpen) # label(definition).
% 0.07/0.49 -aSubsetOf0(A,cS1395) | -isOpen0(A) | -aElementOf0(B,A) | f12(A,B) != sz00 # label(mOpen) # label(definition).
% 0.07/0.49 -aSubsetOf0(A,cS1395) | -isOpen0(A) | -aElementOf0(B,A) | aSubsetOf0(szAzrzSzezqlpdtcmdtrp0(B,f12(A,B)),A) # label(mOpen) # label(definition).
% 0.07/0.49 -aSubsetOf0(A,cS1395) | isOpen0(A) | aElementOf0(f13(A),A) # label(mOpen) # label(definition).
% 0.07/0.49 -aSubsetOf0(A,cS1395) | isOpen0(A) | -aInteger0(B) | B = sz00 | -aSubsetOf0(szAzrzSzezqlpdtcmdtrp0(f13(A),B),A) # label(mOpen) # label(definition).
% 0.07/0.49 -aSubsetOf0(A,cS1395) | -isClosed0(A) | isOpen0(stldt0(A)) # label(mClosed) # label(definition).
% 0.07/0.49 -aSubsetOf0(A,cS1395) | isClosed0(A) | -isOpen0(stldt0(A)) # label(mClosed) # label(definition).
% 0.07/0.49 -aSet0(A) | aElementOf0(f14(A),A) | isOpen0(sbsmnsldt0(A)) # label(mUnionOpen) # label(axiom).
% 0.07/0.49 -aSet0(A) | -aSubsetOf0(f14(A),cS1395) | -isOpen0(f14(A)) | isOpen0(sbsmnsldt0(A)) # label(mUnionOpen) # label(axiom).
% 0.07/0.49 -aSubsetOf0(A,cS1395) | -aSubsetOf0(B,cS1395) | -isOpen0(A) | -isOpen0(B) | isOpen0(sdtslmnbsdt0(A,B)) # label(mInterOpen) # label(axiom).
% 0.07/0.49 -aSubsetOf0(A,cS1395) | -aSubsetOf0(B,cS1395) | -isClosed0(A) | -isClosed0(B) | isClosed0(sdtbsmnsldt0(A,B)) # label(mUnionClosed) # label(axiom).
% 0.07/0.49 -aSet0(A) | -isFinite0(A) | aElementOf0(f15(A),A) | isClosed0(sbsmnsldt0(A)) # label(mUnionSClosed) # label(axiom).
% 0.07/0.49 -aSet0(A) | -isFinite0(A) | -aSubsetOf0(f15(A),cS1395) | -isClosed0(f15(A)) | isClosed0(sbsmnsldt0(A)) # label(mUnionSClosed) # label(axiom).
% 0.07/0.49 -aInteger0(A) | -aInteger0(B) | B = sz00 | aSubsetOf0(szAzrzSzezqlpdtcmdtrp0(A,B),cS1395) # label(mArSeqClosed) # label(axiom).
% 0.07/0.49 -aInteger0(A) | -aInteger0(B) | B = sz00 | isClosed0(szAzrzSzezqlpdtcmdtrp0(A,B)) # label(mArSeqClosed) # label(axiom).
% 0.07/0.49 xS = cS2043 # label(m__2046) # label(hypothesis).
% 0.07/0.49 -aInteger0(A) | -aElementOf0(A,sbsmnsldt0(xS)) | aDivisorOf0(f16(A),A) # label(m__) # label(negated_conjecture).
% 0.07/0.49 -aInteger0(A) | -aElementOf0(A,sbsmnsldt0(xS)) | isPrime0(f16(A)) # label(m__) # label(negated_conjecture).
% 0.07/0.49 -aInteger0(A) | aElementOf0(A,sbsmnsldt0(xS)) | -aDivisorOf0(B,A) | -isPrime0(B) # label(m__) # label(negated_conjecture).
% 0.07/0.49 stldt0(sbsmnsldt0(xS)) != cS2076 # label(m__) # label(negated_conjecture).
% 0.07/0.49 end_of_list.
% 0.07/0.49
% 0.07/0.49 ============================== end of clauses for search =============
% 0.07/0.49 % SZS output start FiniteModel
% 0.07/0.49
% 0.07/0.49 % There are no natural numbers in the input.
% 0.07/0.49
% 0.07/0.49 cS1395 : 0
% 0.07/0.49
% 0.07/0.49 cS2043 : 0
% 0.07/0.49
% 0.07/0.49 cS2076 : 0
% 0.07/0.49
% 0.07/0.49 sz00 : 0
% 0.07/0.49
% 0.07/0.49 sz10 : 0
% 0.07/0.49
% 0.07/0.49 xS : 0
% 0.07/0.49
% 0.07/0.49 sbsmnsldt0 :
% 0.07/0.49 0 1
% 0.07/0.49 -------
% 0.07/0.49 0 0
% 0.07/0.49
% 0.07/0.49 smndt0 :
% 0.07/0.49 0 1
% 0.07/0.49 -------
% 0.07/0.49 0 0
% 0.07/0.49
% 0.07/0.49 stldt0 :
% 0.07/0.49 0 1
% 0.07/0.49 -------
% 0.07/0.49 1 0
% 0.07/0.49
% 0.07/0.49 f2 :
% 0.07/0.49 0 1
% 0.07/0.49 -------
% 0.07/0.49 0 0
% 0.07/0.49
% 0.07/0.49 f6 :
% 0.07/0.49 0 1
% 0.07/0.49 -------
% 0.07/0.49 0 0
% 0.07/0.49
% 0.07/0.49 f13 :
% 0.07/0.49 0 1
% 0.07/0.49 -------
% 0.07/0.49 0 0
% 0.07/0.49
% 0.07/0.49 f14 :
% 0.07/0.49 0 1
% 0.07/0.49 -------
% 0.07/0.49 0 0
% 0.07/0.49
% 0.07/0.49 f15 :
% 0.07/0.49 0 1
% 0.07/0.49 -------
% 0.07/0.49 0 0
% 0.07/0.49
% 0.07/0.49 f16 :
% 0.07/0.49 0 1
% 0.07/0.49 -------
% 0.07/0.49 0 0
% 0.07/0.49
% 0.07/0.49 sdtasdt0 :
% 0.07/0.49 | 0 1
% 0.07/0.49 --+----
% 0.07/0.49 0 | 0 0
% 0.07/0.49 1 | 0 0
% 0.07/0.49
% 0.07/0.49 sdtbsmnsldt0 :
% 0.07/0.49 | 0 1
% 0.07/0.49 --+----
% 0.07/0.49 0 | 0 0
% 0.07/0.49 1 | 0 0
% 0.07/0.49
% 0.07/0.49 sdtpldt0 :
% 0.07/0.49 | 0 1
% 0.07/0.49 --+----
% 0.07/0.49 0 | 0 0
% 0.07/0.49 1 | 0 0
% 0.07/0.49
% 0.07/0.49 sdtslmnbsdt0 :
% 0.07/0.49 | 0 1
% 0.07/0.49 --+----
% 0.07/0.49 0 | 0 0
% 0.07/0.49 1 | 0 0
% 0.07/0.49
% 0.07/0.49 szAzrzSzezqlpdtcmdtrp0 :
% 0.07/0.49 | 0 1
% 0.07/0.49 --+----
% 0.07/0.49 0 | 0 0
% 0.07/0.49 1 | 0 0
% 0.07/0.49
% 0.07/0.49 f1 :
% 0.07/0.49 | 0 1
% 0.07/0.49 --+----
% 0.07/0.49 0 | 0 0
% 0.07/0.49 1 | 0 0
% 0.07/0.49
% 0.07/0.49 f3 :
% 0.07/0.49 | 0 1
% 0.07/0.49 --+----
% 0.07/0.49 0 | 0 0
% 0.07/0.49 1 | 0 0
% 0.07/0.49
% 0.07/0.49 f8 :
% 0.07/0.49 | 0 1
% 0.07/0.49 --+----
% 0.07/0.49 0 | 0 0
% 0.07/0.49 1 | 0 0
% 0.07/0.49
% 0.07/0.49 f9 :
% 0.07/0.49 | 0 1
% 0.07/0.49 --+----
% 0.07/0.49 0 | 0 0
% 0.07/0.49 1 | 0 0
% 0.07/0.49
% 0.07/0.49 f10 :
% 0.07/0.49 | 0 1
% 0.07/0.49 --+----
% 0.07/0.49 0 | 0 0
% 0.07/0.49 1 | 0 0
% 0.07/0.49
% 0.07/0.49 f12 :
% 0.07/0.49 | 0 1
% 0.07/0.49 --+----
% 0.07/0.49 0 | 0 0
% 0.07/0.49 1 | 0 0
% 0.07/0.49 f4(0,0,0) = 0.
% 0.07/0.49 f4(0,0,1) = 0.
% 0.07/0.49 f4(0,1,0) = 0.
% 0.07/0.49 f4(0,1,1) = 0.
% 0.07/0.49 f4(1,0,0) = 0.
% 0.07/0.49 f4(1,0,1) = 0.
% 0.07/0.49 f4(1,1,0) = 0.
% 0.07/0.49 f4(1,1,1) = 0.
% 0.07/0.49 f5(0,0,0) = 0.
% 0.07/0.49 f5(0,0,1) = 0.
% 0.07/0.49 f5(0,1,0) = 0.
% 0.07/0.49 f5(0,1,1) = 0.
% 0.07/0.49 f5(1,0,0) = 0.
% 0.07/0.49 f5(1,0,1) = 0.
% 0.07/0.49 f5(1,1,0) = 0.
% 0.07/0.49 f5(1,1,1) = 0.
% 0.07/0.49 f7(0,0,0) = 0.
% 0.07/0.49 f7(0,0,1) = 0.
% 0.07/0.49 f7(0,1,0) = 0.
% 0.07/0.49 f7(0,1,1) = 0.
% 0.07/0.49 f7(1,0,0) = 0.
% 0.07/0.49 f7(1,0,1) = 0.
% 0.07/0.49 f7(1,1,0) = 0.
% 0.07/0.49 f7(1,1,1) = 0.
% 0.07/0.49 f11(0,0,0) = 0.
% 0.07/0.49 f11(0,0,1) = 0.
% 0.07/0.49 f11(0,1,0) = 0.
% 0.07/0.49 f11(0,1,1) = 0.
% 0.07/0.49 f11(1,0,0) = 0.
% 0.07/0.49 f11(1,0,1) = 0.
% 0.07/0.49 f11(1,1,0) = 0.
% 0.07/0.49 f11(1,1,1) = 0.
% 0.07/0.49
% 0.07/0.49 aInteger0 :
% 0.07/0.49 0 1
% 0.07/0.49 -------
% 0.07/0.49 1 0
% 0.07/0.49
% 0.07/0.49 aSet0 :
% 0.07/0.49 0 1
% 0.07/0.49 -------
% 0.07/0.49 0 0
% 0.07/0.49
% 0.07/0.49 isClosed0 :
% 0.07/0.49 0 1
% 0.07/0.49 -------
% 0.07/0.49 0 0
% 0.07/0.49
% 0.07/0.49 isFinite0 :
% 0.07/0.49 0 1
% 0.07/0.49 -------
% 0.07/0.49 0 0
% 0.07/0.49
% 0.07/0.49 isOpen0 :
% 0.07/0.49 0 1
% 0.07/0.49 -------
% 0.07/0.49 0 0
% 0.07/0.49
% 0.07/0.49 isPrime0 :
% 0.07/0.49 0 1
% 0.07/0.49 -------
% 0.07/0.49 0 0
% 0.07/0.49
% 0.07/0.49 aDivisorOf0 :
% 0.07/0.49 | 0 1
% 0.07/0.49 --+----
% 0.07/0.49 0 | 0 0
% 0.07/0.49 1 | 0 0
% 0.07/0.49
% 0.07/0.49 aElementOf0 :
% 0.07/0.49 | 0 1
% 0.07/0.49 --+----
% 0.07/0.49 0 | 0 0
% 0.07/0.49 1 | 0 0
% 0.07/0.49
% 0.07/0.49 aSubsetOf0 :
% 0.07/0.49 | 0 1
% 0.07/0.49 --+----
% 0.07/0.49 0 | 0 0
% 0.07/0.49 1 | 0 0
% 0.07/0.49 sdteqdtlpzmzozddtrp0(0,0,0) = 0.
% 0.07/0.49 sdteqdtlpzmzozddtrp0(0,0,1) = 0.
% 0.07/0.49 sdteqdtlpzmzozddtrp0(0,1,0) = 0.
% 0.07/0.49 sdteqdtlpzmzozddtrp0(0,1,1) = 0.
% 0.07/0.49 sdteqdtlpzmzozddtrp0(1,0,0) = 0.
% 0.07/0.49 sdteqdtlpzmzozddtrp0(1,0,1) = 0.
% 0.07/0.49 sdteqdtlpzmzozddtrp0(1,1,0) = 0.
% 0.07/0.49 sdteqdtlpzmzozddtrp0(1,1,1) = 0.
% 0.07/0.49
% 0.07/0.49 % SZS output end FiniteModel
% 0.07/0.49 ------ process 5137 exit (max_models) ------
% 0.07/0.49
% 0.07/0.49 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.07/0.49
% 0.07/0.49 Exiting with 1 model.
% 0.07/0.49
% 0.07/0.49 Process 5137 exit (max_models) Fri Jan 5 04:10:15 2018
% 0.07/0.49 The process finished Fri Jan 5 04:10:15 2018
% 0.07/0.49 Mace4 ended
%------------------------------------------------------------------------------