%------------------------------------------------------------------------------ % File : Nitpick---2016 % Problem : SEU911^5 : TPTP v6.4.0. Released v4.0.0. % Transfm : none % Format : tptp:raw % Command : isabelle tptp_nitpick %d %s % Computer : n048.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 14:25:04 EST 2017 % Result : CounterSatisfiable 27.33s % Output : FiniteModel 27.33s % 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 : SEU911^5 : TPTP v6.4.0. Released v4.0.0. % 0.00/0.04 % Command : isabelle tptp_nitpick %d %s % 0.03/0.23 % Computer : n048.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.24 % CPULimit : 300 % 0.03/0.24 % DateTime : Sun Jan 15 23:39:48 CST 2017 % 0.03/0.24 % CPUTime : % 27.33/20.34 Nitpicking formula... % 27.33/20.34 Timestamp: 23:39:57 % 27.33/20.34 The type bnd_c passed the monotonicity test; Nitpick might be able to skip % 27.33/20.34 some scopes % 27.33/20.34 Using SAT solver "Lingeling_JNI" The following solvers are configured: % 27.33/20.34 "Lingeling_JNI", "CryptoMiniSat_JNI", "MiniSat_JNI", "SAT4J", "SAT4J_Light" % 27.33/20.34 Skipping 995000 scopes. (Consider using "mono" or "merge_type_vars" to % 27.33/20.34 prevent this.) % 27.33/20.34 Batch 1 of 1000: Trying 5 scopes: % 27.33/20.34 card bnd_c = 1, card bnd_a = 1, and card bnd_b = 1 % 27.33/20.34 card bnd_c = 2, card bnd_a = 2, and card bnd_b = 2 % 27.33/20.34 card bnd_c = 3, card bnd_a = 3, and card bnd_b = 3 % 27.33/20.34 card bnd_c = 4, card bnd_a = 4, and card bnd_b = 4 % 27.33/20.34 card bnd_c = 5, card bnd_a = 5, and card bnd_b = 5 % 27.33/20.34 Limit reached: arity 64 of bound variable too large; skipping scope % 27.33/20.34 % SZS status CounterSatisfiable % SZS output start FiniteModel % 27.33/20.34 Nitpick found a counterexample for card bnd_c = 1, card bnd_a = 1, and % 27.33/20.34 card bnd_b = 1: % 27.33/20.34 % 27.33/20.34 Skolem constant: % 27.33/20.34 Xx = (\<lambda>x. _)(b1 := True) % 27.33/20.34 Constants: % 27.33/20.34 bnd_cA = % 27.33/20.34 (\<lambda>x. _) % 27.33/20.34 ((\<lambda>x. _)(b1 := True) := False, % 27.33/20.34 (\<lambda>x. _)(b1 := False) := True) % 27.33/20.34 bnd_cB = % 27.33/20.34 (\<lambda>x. _) % 27.33/20.34 ((\<lambda>x. _)(b1 := True) := True, % 27.33/20.34 (\<lambda>x. _)(b1 := False) := True) % 27.33/20.34 bnd_cC = % 27.33/20.34 (\<lambda>x. _) % 27.33/20.34 ((\<lambda>x. _)(b1 := True) := True, % 27.33/20.34 (\<lambda>x. _)(b1 := False) := False) % 27.33/20.34 bnd_f = % 27.33/20.34 (\<lambda>x. _) % 27.33/20.34 ((\<lambda>x. _)(b1 := True) := (\<lambda>x. _)(b1 := False), % 27.33/20.34 (\<lambda>x. _)(b1 := False) := (\<lambda>x. _)(b1 := False)) % 27.33/20.34 bnd_g = % 27.33/20.34 (\<lambda>x. _) % 27.33/20.34 ((\<lambda>x. _)(b1 := True) := (\<lambda>x. _)(b1 := False), % 27.33/20.34 (\<lambda>x. _)(b1 := False) := (\<lambda>x. _)(b1 := False)) % 27.33/20.34 % SZS output end FiniteModel % 27.33/20.34 Total time: 8.6 s %------------------------------------------------------------------------------