TSTP Solution File: RNG110+1 by Nitpick---2016
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Nitpick---2016
% Problem : RNG110+1 : TPTP v6.4.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : isabelle tptp_nitpick %d %s
% Computer : n013.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 Jan 18 12:16:27 EST 2017
% Result : CounterSatisfiable 24.99s
% Output : FiniteModel 24.99s
% 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 : RNG110+1 : TPTP v6.4.0. Released v4.0.0.
% 0.00/0.04 % Command : isabelle tptp_nitpick %d %s
% 0.03/0.23 % Computer : n013.star.cs.uiowa.edu
% 0.03/0.23 % Model : x86_64 x86_64
% 0.03/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.03/0.23 % Memory : 32218.75MB
% 0.03/0.23 % OS : Linux 3.10.0-327.36.3.el7.x86_64
% 0.03/0.23 % CPULimit : 300
% 0.03/0.23 % DateTime : Sun Jan 15 05:32:18 CST 2017
% 0.03/0.23 % CPUTime :
% 24.99/10.38 Nitpicking formula...
% 24.99/10.38 Timestamp: 05:32:26
% 24.99/10.38 Using SAT solver "Lingeling_JNI" The following solvers are configured:
% 24.99/10.38 "Lingeling_JNI", "CryptoMiniSat_JNI", "MiniSat_JNI", "SAT4J", "SAT4J_Light"
% 24.99/10.38 Batch 1 of 20: Trying 5 scopes:
% 24.99/10.38 card TPTP_Interpret.ind = 1
% 24.99/10.38 card TPTP_Interpret.ind = 2
% 24.99/10.38 card TPTP_Interpret.ind = 3
% 24.99/10.38 card TPTP_Interpret.ind = 4
% 24.99/10.38 card TPTP_Interpret.ind = 5
% 24.99/10.38 % SZS status CounterSatisfiable % SZS output start FiniteModel
% 24.99/10.38 Nitpick found a counterexample for card TPTP_Interpret.ind = 2:
% 24.99/10.38
% 24.99/10.38 Skolem constant:
% 24.99/10.38 \<lambda>W0. W1 = (\<lambda>x. _)(i1 := i1, i2 := i2)
% 24.99/10.38 Constants:
% 24.99/10.38 bnd_aDivisorOf0 =
% 24.99/10.38 (\<lambda>x. _)
% 24.99/10.38 (i1 := (\<lambda>x. _)(i1 := True, i2 := False),
% 24.99/10.38 i2 := (\<lambda>x. _)(i1 := True, i2 := True))
% 24.99/10.38 bnd_aElement0 = (\<lambda>x. _)(i1 := True, i2 := True)
% 24.99/10.38 bnd_aElementOf0 =
% 24.99/10.38 (\<lambda>x. _)
% 24.99/10.38 (i1 := (\<lambda>x. _)(i1 := True, i2 := True),
% 24.99/10.38 i2 := (\<lambda>x. _)(i1 := True, i2 := False))
% 24.99/10.38 bnd_aGcdOfAnd0 =
% 24.99/10.38 (\<lambda>x. _)
% 24.99/10.38 (i1 := (\<lambda>x. _)
% 24.99/10.38 (i1 := (\<lambda>x. _)(i1 := True, i2 := False),
% 24.99/10.38 i2 := (\<lambda>x. _)(i1 := False, i2 := False)),
% 24.99/10.38 i2 := (\<lambda>x. _)
% 24.99/10.38 (i1 := (\<lambda>x. _)(i1 := False, i2 := True),
% 24.99/10.38 i2 := (\<lambda>x. _)(i1 := True, i2 := True)))
% 24.99/10.38 bnd_aNaturalNumber0 = (\<lambda>x. _)(i1 := True, i2 := False)
% 24.99/10.38 bnd_aSet0 = (\<lambda>x. _)(i1 := True, i2 := True)
% 24.99/10.38 bnd_doDivides0 =
% 24.99/10.38 (\<lambda>x. _)
% 24.99/10.38 (i1 := (\<lambda>x. _)(i1 := True, i2 := False),
% 24.99/10.38 i2 := (\<lambda>x. _)(i1 := True, i2 := True))
% 24.99/10.38 bnd_iLess0 =
% 24.99/10.38 (\<lambda>x. _)
% 24.99/10.38 (i1 := (\<lambda>x. _)(i1 := True, i2 := False),
% 24.99/10.38 i2 := (\<lambda>x. _)(i1 := False, i2 := False))
% 24.99/10.38 bnd_misRelativelyPrime0 =
% 24.99/10.38 (\<lambda>x. _)
% 24.99/10.38 (i1 := (\<lambda>x. _)(i1 := False, i2 := True),
% 24.99/10.38 i2 := (\<lambda>x. _)(i1 := True, i2 := True))
% 24.99/10.38 bnd_sbrdtbr0 = (\<lambda>x. _)(i1 := i1, i2 := i1)
% 24.99/10.38 bnd_sdtasasdt0 =
% 24.99/10.38 (\<lambda>x. _)
% 24.99/10.38 (i1 := (\<lambda>x. _)(i1 := i1, i2 := i2),
% 24.99/10.38 i2 := (\<lambda>x. _)(i1 := i2, i2 := i2))
% 24.99/10.38 bnd_sdtasdt0 =
% 24.99/10.38 (\<lambda>x. _)
% 24.99/10.38 (i1 := (\<lambda>x. _)(i1 := i1, i2 := i1),
% 24.99/10.38 i2 := (\<lambda>x. _)(i1 := i1, i2 := i2))
% 24.99/10.38 bnd_sdteqdtlpzmzozddtrp0 =
% 24.99/10.38 (\<lambda>x. _)
% 24.99/10.38 (i1 := (\<lambda>x. _)
% 24.99/10.38 (i1 := (\<lambda>x. _)(i1 := True, i2 := True),
% 24.99/10.38 i2 := (\<lambda>x. _)(i1 := True, i2 := False)),
% 24.99/10.38 i2 := (\<lambda>x. _)
% 24.99/10.38 (i1 := (\<lambda>x. _)(i1 := True, i2 := False),
% 24.99/10.38 i2 := (\<lambda>x. _)(i1 := True, i2 := True)))
% 24.99/10.38 bnd_sdtpldt0 =
% 24.99/10.38 (\<lambda>x. _)
% 24.99/10.38 (i1 := (\<lambda>x. _)(i1 := i1, i2 := i2),
% 24.99/10.38 i2 := (\<lambda>x. _)(i1 := i2, i2 := i1))
% 24.99/10.38 bnd_sdtpldt1 =
% 24.99/10.38 (\<lambda>x. _)
% 24.99/10.38 (i1 := (\<lambda>x. _)(i1 := i1, i2 := i1),
% 24.99/10.38 i2 := (\<lambda>x. _)(i1 := i1, i2 := i2))
% 24.99/10.38 bnd_slsdtgt0 = (\<lambda>x. _)(i1 := i2, i2 := i1)
% 24.99/10.38 bnd_smndt0 = (\<lambda>x. _)(i1 := i1, i2 := i2)
% 24.99/10.38 bnd_sz00 = i1
% 24.99/10.38 bnd_sz10 = i2
% 24.99/10.38 bnd_xI = i1
% 24.99/10.38 bnd_xa = i2
% 24.99/10.38 bnd_xb = i1
% 24.99/10.38 bnd_xc = i2
% 24.99/10.38 % SZS output end FiniteModel
% 24.99/10.38 Total time: 1.6 s
%------------------------------------------------------------------------------