TSTP Solution File: LAT385+1 by Nitpick---2016
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Nitpick---2016
% Problem : LAT385+1 : TPTP v6.4.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : isabelle tptp_nitpick %d %s
% Computer : n040.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 : Tue Jan 17 18:43:58 EST 2017
% Result : CounterSatisfiable 25.06s
% Output : FiniteModel 25.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 : LAT385+1 : TPTP v6.4.0. Released v4.0.0.
% 0.00/0.04 % Command : isabelle tptp_nitpick %d %s
% 0.03/0.24 % Computer : n040.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.75MB
% 0.03/0.24 % OS : Linux 3.10.0-327.36.3.el7.x86_64
% 0.03/0.24 % CPULimit : 300
% 0.03/0.24 % DateTime : Sat Jan 14 11:19:03 CST 2017
% 0.03/0.24 % CPUTime :
% 25.06/13.89 Nitpicking formula...
% 25.06/13.89 Timestamp: 11:19:11
% 25.06/13.89 Using SAT solver "Lingeling_JNI" The following solvers are configured:
% 25.06/13.89 "Lingeling_JNI", "CryptoMiniSat_JNI", "MiniSat_JNI", "SAT4J", "SAT4J_Light"
% 25.06/13.89 Batch 1 of 20: Trying 5 scopes:
% 25.06/13.89 card TPTP_Interpret.ind = 1
% 25.06/13.89 card TPTP_Interpret.ind = 2
% 25.06/13.89 card TPTP_Interpret.ind = 3
% 25.06/13.89 card TPTP_Interpret.ind = 4
% 25.06/13.89 card TPTP_Interpret.ind = 5
% 25.06/13.89 % SZS status CounterSatisfiable % SZS output start FiniteModel
% 25.06/13.89 Nitpick found a counterexample for card TPTP_Interpret.ind = 2:
% 25.06/13.89
% 25.06/13.89 Constants:
% 25.06/13.89 bnd_aElement0 = (\<lambda>x. _)(i1 := True, i2 := True)
% 25.06/13.89 bnd_aElementOf0 =
% 25.06/13.89 (\<lambda>x. _)
% 25.06/13.89 (i1 := (\<lambda>x. _)(i1 := False, i2 := True),
% 25.06/13.89 i2 := (\<lambda>x. _)(i1 := True, i2 := True))
% 25.06/13.89 bnd_aFixedPointOf0 =
% 25.06/13.89 (\<lambda>x. _)
% 25.06/13.89 (i1 := (\<lambda>x. _)(i1 := False, i2 := False),
% 25.06/13.89 i2 := (\<lambda>x. _)(i1 := True, i2 := False))
% 25.06/13.89 bnd_aFunction0 = (\<lambda>x. _)(i1 := True, i2 := False)
% 25.06/13.89 bnd_aInfimumOfIn0 =
% 25.06/13.89 (\<lambda>x. _)
% 25.06/13.89 (i1 := (\<lambda>x. _)
% 25.06/13.89 (i1 := (\<lambda>x. _)(i1 := False, i2 := False),
% 25.06/13.89 i2 := (\<lambda>x. _)(i1 := False, i2 := False)),
% 25.06/13.89 i2 := (\<lambda>x. _)
% 25.06/13.89 (i1 := (\<lambda>x. _)(i1 := True, i2 := True),
% 25.06/13.89 i2 := (\<lambda>x. _)(i1 := False, i2 := False)))
% 25.06/13.89 bnd_aLowerBoundOfIn0 =
% 25.06/13.89 (\<lambda>x. _)
% 25.06/13.89 (i1 := (\<lambda>x. _)
% 25.06/13.89 (i1 := (\<lambda>x. _)(i1 := False, i2 := False),
% 25.06/13.89 i2 := (\<lambda>x. _)(i1 := False, i2 := False)),
% 25.06/13.89 i2 := (\<lambda>x. _)
% 25.06/13.89 (i1 := (\<lambda>x. _)(i1 := True, i2 := True),
% 25.06/13.89 i2 := (\<lambda>x. _)(i1 := False, i2 := False)))
% 25.06/13.89 bnd_aSet0 = (\<lambda>x. _)(i1 := True, i2 := True)
% 25.06/13.89 bnd_aSubsetOf0 =
% 25.06/13.89 (\<lambda>x. _)
% 25.06/13.89 (i1 := (\<lambda>x. _)(i1 := True, i2 := True),
% 25.06/13.89 i2 := (\<lambda>x. _)(i1 := False, i2 := True))
% 25.06/13.89 bnd_aSupremumOfIn0 =
% 25.06/13.89 (\<lambda>x. _)
% 25.06/13.89 (i1 := (\<lambda>x. _)
% 25.06/13.89 (i1 := (\<lambda>x. _)(i1 := False, i2 := False),
% 25.06/13.89 i2 := (\<lambda>x. _)(i1 := False, i2 := False)),
% 25.06/13.89 i2 := (\<lambda>x. _)
% 25.06/13.89 (i1 := (\<lambda>x. _)(i1 := True, i2 := True),
% 25.06/13.89 i2 := (\<lambda>x. _)(i1 := False, i2 := False)))
% 25.06/13.89 bnd_aUpperBoundOfIn0 =
% 25.06/13.89 (\<lambda>x. _)
% 25.06/13.89 (i1 := (\<lambda>x. _)
% 25.06/13.89 (i1 := (\<lambda>x. _)(i1 := False, i2 := False),
% 25.06/13.89 i2 := (\<lambda>x. _)(i1 := False, i2 := False)),
% 25.06/13.89 i2 := (\<lambda>x. _)
% 25.06/13.89 (i1 := (\<lambda>x. _)(i1 := True, i2 := True),
% 25.06/13.89 i2 := (\<lambda>x. _)(i1 := False, i2 := False)))
% 25.06/13.89 bnd_cS1142 = (\<lambda>x. _)(i1 := i1, i2 := i1)
% 25.06/13.89 bnd_cS1241 =
% 25.06/13.89 (\<lambda>x. _)
% 25.06/13.89 (i1 := (\<lambda>x. _)
% 25.06/13.89 (i1 := (\<lambda>x. _)(i1 := i2, i2 := i1),
% 25.06/13.89 i2 := (\<lambda>x. _)(i1 := i1, i2 := i1)),
% 25.06/13.89 i2 := (\<lambda>x. _)
% 25.06/13.89 (i1 := (\<lambda>x. _)(i1 := i1, i2 := i1),
% 25.06/13.89 i2 := (\<lambda>x. _)(i1 := i1, i2 := i1)))
% 25.06/13.89 bnd_isEmpty0 = (\<lambda>x. _)(i1 := False, i2 := False)
% 25.06/13.89 bnd_isMonotone0 = (\<lambda>x. _)(i1 := True, i2 := False)
% 25.06/13.89 bnd_isOn0 =
% 25.06/13.89 (\<lambda>x. _)
% 25.06/13.89 (i1 := (\<lambda>x. _)(i1 := True, i2 := False),
% 25.06/13.89 i2 := (\<lambda>x. _)(i1 := False, i2 := False))
% 25.06/13.89 bnd_sdtlpdtrp0 =
% 25.06/13.89 (\<lambda>x. _)
% 25.06/13.89 (i1 := (\<lambda>x. _)(i1 := i1, i2 := i2),
% 25.06/13.89 i2 := (\<lambda>x. _)(i1 := i1, i2 := i2))
% 25.06/13.89 bnd_sdtlseqdt0 =
% 25.06/13.89 (\<lambda>x. _)
% 25.06/13.89 (i1 := (\<lambda>x. _)(i1 := True, i2 := False),
% 25.06/13.89 i2 := (\<lambda>x. _)(i1 := False, i2 := True))
% 25.06/13.89 bnd_szDzozmdt0 = (\<lambda>x. _)(i1 := i1, i2 := i1)
% 25.06/13.89 bnd_szRzazndt0 = (\<lambda>x. _)(i1 := i1, i2 := i1)
% 25.06/13.89 bnd_xP = i2
% 25.06/13.89 bnd_xS = i1
% 25.06/13.89 bnd_xT = i1
% 25.06/13.89 bnd_xU = i1
% 25.06/13.89 bnd_xf = i1
% 25.06/13.89 % SZS output end FiniteModel
% 25.06/13.89 Total time: 2.9 s
%------------------------------------------------------------------------------