%------------------------------------------------------------------------------ % File : Nitpick---2016 % Problem : NLP230+1 : TPTP v6.4.0. Released v2.4.0. % Transfm : none % Format : tptp:raw % Command : isabelle tptp_nitpick %d %s % Computer : n049.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 21:07:45 EST 2017 % Result : CounterSatisfiable 40.91s % Output : FiniteModel 40.91s % 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 : NLP230+1 : TPTP v6.4.0. Released v2.4.0. % 0.02/0.04 % Command : isabelle tptp_nitpick %d %s % 0.03/0.23 % Computer : n049.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 : Sat Jan 14 22:12:48 CST 2017 % 0.03/0.23 % CPUTime : % 40.91/21.13 Nitpicking formula... % 40.91/21.13 Timestamp: 22:12:57 % 40.91/21.13 Using SAT solver "Lingeling_JNI" The following solvers are configured: % 40.91/21.13 "Lingeling_JNI", "CryptoMiniSat_JNI", "MiniSat_JNI", "SAT4J", "SAT4J_Light" % 40.91/21.13 Batch 1 of 20: Trying 5 scopes: % 40.91/21.13 card TPTP_Interpret.ind = 1 % 40.91/21.13 card TPTP_Interpret.ind = 2 % 40.91/21.13 card TPTP_Interpret.ind = 3 % 40.91/21.13 card TPTP_Interpret.ind = 4 % 40.91/21.13 card TPTP_Interpret.ind = 5 % 40.91/21.13 % SZS status CounterSatisfiable % SZS output start FiniteModel % 40.91/21.13 Nitpick found a counterexample for card TPTP_Interpret.ind = 2: % 40.91/21.13 % 40.91/21.13 Skolem constants: % 40.91/21.13 U = i1 % 40.91/21.13 V = i1 % 40.91/21.13 W = i2 % 40.91/21.13 X = i2 % 40.91/21.13 X1 = i2 % 40.91/21.13 \<lambda>X9. X10 = (\<lambda>x. _)(i1 := i1, i2 := i1) % 40.91/21.13 X11 = i1 % 40.91/21.13 X12 = i2 % 40.91/21.13 X13 = i1 % 40.91/21.13 X14 = i2 % 40.91/21.13 X15 = i1 % 40.91/21.13 X16 = i2 % 40.91/21.13 X17 = i1 % 40.91/21.13 X18 = i2 % 40.91/21.13 X19 = i2 % 40.91/21.13 X2 = i2 % 40.91/21.13 X20 = i1 % 40.91/21.13 X21 = i2 % 40.91/21.13 X22 = i2 % 40.91/21.13 X23 = i2 % 40.91/21.13 X24 = i2 % 40.91/21.13 \<lambda>X25. X26 = (\<lambda>x. _)(i1 := i1, i2 := i1) % 40.91/21.13 X27 = i2 % 40.91/21.13 X3 = i2 % 40.91/21.13 X4 = i1 % 40.91/21.13 X5 = i2 % 40.91/21.13 X6 = i1 % 40.91/21.13 X7 = i2 % 40.91/21.13 X8 = i2 % 40.91/21.13 Y = i1 % 40.91/21.13 Z = i1 % 40.91/21.13 Constants: % 40.91/21.13 bnd_accessible_world = % 40.91/21.13 (\<lambda>x. _) % 40.91/21.13 (i1 := (\<lambda>x. _)(i1 := True, i2 := True), % 40.91/21.13 i2 := (\<lambda>x. _)(i1 := True, i2 := True)) % 40.91/21.13 bnd_actual_world = (\<lambda>x. _)(i1 := True, i2 := False) % 40.91/21.13 bnd_agent = % 40.91/21.13 (\<lambda>x. _) % 40.91/21.13 (i1 := (\<lambda>x. _) % 40.91/21.13 (i1 := (\<lambda>x. _)(i1 := False, i2 := True), % 40.91/21.13 i2 := (\<lambda>x. _)(i1 := True, i2 := True)), % 40.91/21.13 i2 := (\<lambda>x. _) % 40.91/21.13 (i1 := (\<lambda>x. _)(i1 := True, i2 := True), % 40.91/21.13 i2 := (\<lambda>x. _)(i1 := False, i2 := True))) % 40.91/21.13 bnd_be = % 40.91/21.13 (\<lambda>x. _) % 40.91/21.13 (i1 := (\<lambda>x. _) % 40.91/21.13 (i1 := (\<lambda>x. _) % 40.91/21.13 (i1 := (\<lambda>x. _)(i1 := False, i2 := True), % 40.91/21.13 i2 := (\<lambda>x. _)(i1 := True, i2 := True)), % 40.91/21.13 i2 := (\<lambda>x. _) % 40.91/21.13 (i1 := (\<lambda>x. _)(i1 := False, i2 := True), % 40.91/21.13 i2 := (\<lambda>x. _)(i1 := True, i2 := False))), % 40.91/21.13 i2 := (\<lambda>x. _) % 40.91/21.13 (i1 := (\<lambda>x. _) % 40.91/21.13 (i1 := (\<lambda>x. _)(i1 := True, i2 := True), % 40.91/21.13 i2 := (\<lambda>x. _)(i1 := True, i2 := True)), % 40.91/21.13 i2 := (\<lambda>x. _) % 40.91/21.13 (i1 := (\<lambda>x. _)(i1 := True, i2 := True), % 40.91/21.13 i2 := (\<lambda>x. _)(i1 := True, i2 := True)))) % 40.91/21.13 bnd_event = % 40.91/21.13 (\<lambda>x. _) % 40.91/21.13 (i1 := (\<lambda>x. _)(i1 := True, i2 := True), % 40.91/21.13 i2 := (\<lambda>x. _)(i1 := True, i2 := True)) % 40.91/21.13 bnd_forename = % 40.91/21.13 (\<lambda>x. _) % 40.91/21.13 (i1 := (\<lambda>x. _)(i1 := True, i2 := True), % 40.91/21.13 i2 := (\<lambda>x. _)(i1 := True, i2 := False)) % 40.91/21.13 bnd_jules_forename = % 40.91/21.13 (\<lambda>x. _) % 40.91/21.13 (i1 := (\<lambda>x. _)(i1 := True, i2 := False), % 40.91/21.13 i2 := (\<lambda>x. _)(i1 := True, i2 := True)) % 40.91/21.13 bnd_man = % 40.91/21.13 (\<lambda>x. _) % 40.91/21.13 (i1 := (\<lambda>x. _)(i1 := True, i2 := True), % 40.91/21.13 i2 := (\<lambda>x. _)(i1 := True, i2 := True)) % 40.91/21.13 bnd_of = % 40.91/21.13 (\<lambda>x. _) % 40.91/21.13 (i1 := (\<lambda>x. _) % 40.91/21.13 (i1 := (\<lambda>x. _)(i1 := False, i2 := True), % 40.91/21.13 i2 := (\<lambda>x. _)(i1 := True, i2 := False)), % 40.91/21.13 i2 := (\<lambda>x. _) % 40.91/21.13 (i1 := (\<lambda>x. _)(i1 := False, i2 := True), % 40.91/21.13 i2 := (\<lambda>x. _)(i1 := True, i2 := True))) % 40.91/21.13 bnd_present = % 40.91/21.13 (\<lambda>x. _) % 40.91/21.13 (i1 := (\<lambda>x. _)(i1 := True, i2 := True), % 40.91/21.13 i2 := (\<lambda>x. _)(i1 := True, i2 := True)) % 40.91/21.13 bnd_proposition = % 40.91/21.13 (\<lambda>x. _) % 40.91/21.13 (i1 := (\<lambda>x. _)(i1 := True, i2 := True), % 40.91/21.13 i2 := (\<lambda>x. _)(i1 := True, i2 := True)) % 40.91/21.13 bnd_smoke = % 40.91/21.13 (\<lambda>x. _) % 40.91/21.13 (i1 := (\<lambda>x. _)(i1 := False, i2 := False), % 40.91/21.13 i2 := (\<lambda>x. _)(i1 := True, i2 := True)) % 40.91/21.13 bnd_state = % 40.91/21.13 (\<lambda>x. _) % 40.91/21.13 (i1 := (\<lambda>x. _)(i1 := True, i2 := False), % 40.91/21.13 i2 := (\<lambda>x. _)(i1 := True, i2 := True)) % 40.91/21.13 bnd_theme = % 40.91/21.13 (\<lambda>x. _) % 40.91/21.13 (i1 := (\<lambda>x. _) % 40.91/21.13 (i1 := (\<lambda>x. _)(i1 := True, i2 := True), % 40.91/21.13 i2 := (\<lambda>x. _)(i1 := True, i2 := True)), % 40.91/21.13 i2 := (\<lambda>x. _) % 40.91/21.13 (i1 := (\<lambda>x. _)(i1 := True, i2 := True), % 40.91/21.13 i2 := (\<lambda>x. _)(i1 := False, i2 := True))) % 40.91/21.13 bnd_think_believe_consider = % 40.91/21.13 (\<lambda>x. _) % 40.91/21.13 (i1 := (\<lambda>x. _)(i1 := True, i2 := True), % 40.91/21.13 i2 := (\<lambda>x. _)(i1 := True, i2 := True)) % 40.91/21.13 bnd_vincent_forename = % 40.91/21.13 (\<lambda>x. _) % 40.91/21.13 (i1 := (\<lambda>x. _)(i1 := False, i2 := True), % 40.91/21.13 i2 := (\<lambda>x. _)(i1 := True, i2 := True)) % 40.91/21.13 % SZS output end FiniteModel % 40.91/21.13 Total time: 12.0 s %------------------------------------------------------------------------------