%------------------------------------------------------------------------------ % File : Nitpick---2016 % Problem : NLP228+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:44 EST 2017 % Result : CounterSatisfiable 31.20s % Output : FiniteModel 31.20s % 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 : NLP228+1 : TPTP v6.4.0. Released v2.4.0. % 0.00/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:18 CST 2017 % 0.03/0.23 % CPUTime : % 31.20/12.99 Nitpicking formula... % 31.20/12.99 Timestamp: 22:12:27 % 31.20/12.99 Using SAT solver "Lingeling_JNI" The following solvers are configured: % 31.20/12.99 "Lingeling_JNI", "CryptoMiniSat_JNI", "MiniSat_JNI", "SAT4J", "SAT4J_Light" % 31.20/12.99 Batch 1 of 20: Trying 5 scopes: % 31.20/12.99 card TPTP_Interpret.ind = 1 % 31.20/12.99 card TPTP_Interpret.ind = 2 % 31.20/12.99 card TPTP_Interpret.ind = 3 % 31.20/12.99 card TPTP_Interpret.ind = 4 % 31.20/12.99 card TPTP_Interpret.ind = 5 % 31.20/12.99 % SZS status CounterSatisfiable % SZS output start FiniteModel % 31.20/12.99 Nitpick found a counterexample for card TPTP_Interpret.ind = 3: % 31.20/12.99 % 31.20/12.99 Skolem constants: % 31.20/12.99 U = i1 % 31.20/12.99 V = i2 % 31.20/12.99 W = i3 % 31.20/12.99 X = i1 % 31.20/12.99 \<lambda>Z. X1 = (\<lambda>x. _)(i1 := i1, i2 := i1, i3 := i1) % 31.20/12.99 Y = i3 % 31.20/12.99 Constants: % 31.20/12.99 bnd_abstraction = % 31.20/12.99 (\<lambda>x. _) % 31.20/12.99 (i1 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := True), % 31.20/12.99 i2 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False), % 31.20/12.99 i3 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := True)) % 31.20/12.99 bnd_accessible_world = % 31.20/12.99 (\<lambda>x. _) % 31.20/12.99 (i1 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := True), % 31.20/12.99 i2 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False), % 31.20/12.99 i3 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False)) % 31.20/12.99 bnd_actual_world = (\<lambda>x. _)(i1 := True, i2 := False, i3 := True) % 31.20/12.99 bnd_agent = % 31.20/12.99 (\<lambda>x. _) % 31.20/12.99 (i1 := (\<lambda>x. _) % 31.20/12.99 (i1 := (\<lambda>x. _)(i1 := True, i2 := True, i3 := True), % 31.20/12.99 i2 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False), % 31.20/12.99 i3 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False)), % 31.20/12.99 i2 := (\<lambda>x. _) % 31.20/12.99 (i1 := (\<lambda>x. _)(i1 := True, i2 := True, i3 := True), % 31.20/12.99 i2 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False), % 31.20/12.99 i3 := (\<lambda>x. _)(i1 := True, i2 := True, i3 := True)), % 31.20/12.99 i3 := (\<lambda>x. _) % 31.20/12.99 (i1 := (\<lambda>x. _)(i1 := True, i2 := True, i3 := True), % 31.20/12.99 i2 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False), % 31.20/12.99 i3 := (\<lambda>x. _)(i1 := True, i2 := True, i3 := True))) % 31.20/12.99 bnd_animate = % 31.20/12.99 (\<lambda>x. _) % 31.20/12.99 (i1 := (\<lambda>x. _)(i1 := False, i2 := True, i3 := False), % 31.20/12.99 i2 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False), % 31.20/12.99 i3 := (\<lambda>x. _)(i1 := False, i2 := True, i3 := False)) % 31.20/12.99 bnd_be = % 31.20/12.99 (\<lambda>x. _) % 31.20/12.99 (i1 := (\<lambda>x. _) % 31.20/12.99 (i1 := (\<lambda>x. _) % 31.20/12.99 (i1 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False), % 31.20/12.99 i2 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False), % 31.20/12.99 i3 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False)), % 31.20/12.99 i2 := (\<lambda>x. _) % 31.20/12.99 (i1 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False), % 31.20/12.99 i2 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False), % 31.20/12.99 i3 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False)), % 31.20/12.99 i3 := (\<lambda>x. _) % 31.20/12.99 (i1 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False), % 31.20/12.99 i2 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False), % 31.20/12.99 i3 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False))), % 31.20/12.99 i2 := (\<lambda>x. _) % 31.20/12.99 (i1 := (\<lambda>x. _) % 31.20/12.99 (i1 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False), % 31.20/12.99 i2 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False), % 31.20/12.99 i3 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False)), % 31.20/12.99 i2 := (\<lambda>x. _) % 31.20/12.99 (i1 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False), % 31.20/12.99 i2 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False), % 31.20/12.99 i3 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False)), % 31.20/12.99 i3 := (\<lambda>x. _) % 31.20/12.99 (i1 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False), % 31.20/12.99 i2 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False), % 31.20/12.99 i3 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False))), % 31.20/12.99 i3 := (\<lambda>x. _) % 31.20/12.99 (i1 := (\<lambda>x. _) % 31.20/12.99 (i1 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False), % 31.20/12.99 i2 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False), % 31.20/12.99 i3 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False)), % 31.20/12.99 i2 := (\<lambda>x. _) % 31.20/12.99 (i1 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False), % 31.20/12.99 i2 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False), % 31.20/12.99 i3 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False)), % 31.20/12.99 i3 := (\<lambda>x. _) % 31.20/12.99 (i1 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False), % 31.20/12.99 i2 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False), % 31.20/12.99 i3 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False)))) % 31.20/12.99 bnd_entity = % 31.20/12.99 (\<lambda>x. _) % 31.20/12.99 (i1 := (\<lambda>x. _)(i1 := False, i2 := True, i3 := False), % 31.20/12.99 i2 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False), % 31.20/12.99 i3 := (\<lambda>x. _)(i1 := False, i2 := True, i3 := False)) % 31.20/12.99 bnd_event = % 31.20/12.99 (\<lambda>x. _) % 31.20/12.99 (i1 := (\<lambda>x. _)(i1 := True, i2 := False, i3 := False), % 31.20/12.99 i2 := (\<lambda>x. _)(i1 := True, i2 := False, i3 := True), % 31.20/12.99 i3 := (\<lambda>x. _)(i1 := True, i2 := False, i3 := False)) % 31.20/12.99 bnd_eventuality = % 31.20/12.99 (\<lambda>x. _) % 31.20/12.99 (i1 := (\<lambda>x. _)(i1 := True, i2 := False, i3 := False), % 31.20/12.99 i2 := (\<lambda>x. _)(i1 := True, i2 := False, i3 := True), % 31.20/12.99 i3 := (\<lambda>x. _)(i1 := True, i2 := False, i3 := False)) % 31.20/12.99 bnd_existent = % 31.20/12.99 (\<lambda>x. _) % 31.20/12.99 (i1 := (\<lambda>x. _)(i1 := False, i2 := True, i3 := False), % 31.20/12.99 i2 := (\<lambda>x. _)(i1 := False, i2 := True, i3 := False), % 31.20/12.99 i3 := (\<lambda>x. _)(i1 := False, i2 := True, i3 := True)) % 31.20/12.99 bnd_forename = % 31.20/12.99 (\<lambda>x. _) % 31.20/12.99 (i1 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := True), % 31.20/12.99 i2 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False), % 31.20/12.99 i3 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := True)) % 31.20/12.99 bnd_general = % 31.20/12.99 (\<lambda>x. _) % 31.20/12.99 (i1 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := True), % 31.20/12.99 i2 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False), % 31.20/12.99 i3 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := True)) % 31.20/12.99 bnd_human = % 31.20/12.99 (\<lambda>x. _) % 31.20/12.99 (i1 := (\<lambda>x. _)(i1 := False, i2 := True, i3 := False), % 31.20/12.99 i2 := (\<lambda>x. _)(i1 := True, i2 := True, i3 := True), % 31.20/12.99 i3 := (\<lambda>x. _)(i1 := True, i2 := True, i3 := False)) % 31.20/12.99 bnd_human_person = % 31.20/12.99 (\<lambda>x. _) % 31.20/12.99 (i1 := (\<lambda>x. _)(i1 := False, i2 := True, i3 := False), % 31.20/12.99 i2 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False), % 31.20/12.99 i3 := (\<lambda>x. _)(i1 := False, i2 := True, i3 := False)) % 31.20/12.99 bnd_impartial = % 31.20/12.99 (\<lambda>x. _) % 31.20/12.99 (i1 := (\<lambda>x. _)(i1 := False, i2 := True, i3 := False), % 31.20/12.99 i2 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False), % 31.20/12.99 i3 := (\<lambda>x. _)(i1 := False, i2 := True, i3 := False)) % 31.20/12.99 bnd_jules_forename = % 31.20/12.99 (\<lambda>x. _) % 31.20/12.99 (i1 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False), % 31.20/12.99 i2 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False), % 31.20/12.99 i3 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False)) % 31.20/12.99 bnd_living = % 31.20/12.99 (\<lambda>x. _) % 31.20/12.99 (i1 := (\<lambda>x. _)(i1 := False, i2 := True, i3 := False), % 31.20/12.99 i2 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False), % 31.20/12.99 i3 := (\<lambda>x. _)(i1 := False, i2 := True, i3 := False)) % 31.20/12.99 bnd_male = % 31.20/12.99 (\<lambda>x. _) % 31.20/12.99 (i1 := (\<lambda>x. _)(i1 := False, i2 := True, i3 := False), % 31.20/12.99 i2 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False), % 31.20/12.99 i3 := (\<lambda>x. _)(i1 := False, i2 := True, i3 := False)) % 31.20/12.99 bnd_man = % 31.20/12.99 (\<lambda>x. _) % 31.20/12.99 (i1 := (\<lambda>x. _)(i1 := False, i2 := True, i3 := False), % 31.20/12.99 i2 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False), % 31.20/12.99 i3 := (\<lambda>x. _)(i1 := False, i2 := True, i3 := False)) % 31.20/12.99 bnd_nonexistent = % 31.20/12.99 (\<lambda>x. _) % 31.20/12.99 (i1 := (\<lambda>x. _)(i1 := True, i2 := False, i3 := False), % 31.20/12.99 i2 := (\<lambda>x. _)(i1 := True, i2 := False, i3 := True), % 31.20/12.99 i3 := (\<lambda>x. _)(i1 := True, i2 := False, i3 := False)) % 31.20/12.99 bnd_nonhuman = % 31.20/12.99 (\<lambda>x. _) % 31.20/12.99 (i1 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := True), % 31.20/12.99 i2 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False), % 31.20/12.99 i3 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := True)) % 31.20/12.99 bnd_of = % 31.20/12.99 (\<lambda>x. _) % 31.20/12.99 (i1 := (\<lambda>x. _) % 31.20/12.99 (i1 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False), % 31.20/12.99 i2 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False), % 31.20/12.99 i3 := (\<lambda>x. _)(i1 := False, i2 := True, i3 := False)), % 31.20/12.99 i2 := (\<lambda>x. _) % 31.20/12.99 (i1 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False), % 31.20/12.99 i2 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False), % 31.20/12.99 i3 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False)), % 31.20/12.99 i3 := (\<lambda>x. _) % 31.20/12.99 (i1 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False), % 31.20/12.99 i2 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False), % 31.20/12.99 i3 := (\<lambda>x. _)(i1 := False, i2 := True, i3 := False))) % 31.20/12.99 bnd_organism = % 31.20/12.99 (\<lambda>x. _) % 31.20/12.99 (i1 := (\<lambda>x. _)(i1 := False, i2 := True, i3 := False), % 31.20/12.99 i2 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False), % 31.20/12.99 i3 := (\<lambda>x. _)(i1 := False, i2 := True, i3 := False)) % 31.20/12.99 bnd_present = % 31.20/12.99 (\<lambda>x. _) % 31.20/12.99 (i1 := (\<lambda>x. _)(i1 := True, i2 := False, i3 := False), % 31.20/12.99 i2 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False), % 31.20/12.99 i3 := (\<lambda>x. _)(i1 := True, i2 := True, i3 := True)) % 31.20/12.99 bnd_proposition = % 31.20/12.99 (\<lambda>x. _) % 31.20/12.99 (i1 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := True), % 31.20/12.99 i2 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False), % 31.20/12.99 i3 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := True)) % 31.20/12.99 bnd_relation = % 31.20/12.99 (\<lambda>x. _) % 31.20/12.99 (i1 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := True), % 31.20/12.99 i2 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False), % 31.20/12.99 i3 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := True)) % 31.20/12.99 bnd_relname = % 31.20/12.99 (\<lambda>x. _) % 31.20/12.99 (i1 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := True), % 31.20/12.99 i2 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False), % 31.20/12.99 i3 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := True)) % 31.20/12.99 bnd_singleton = % 31.20/12.99 (\<lambda>x. _) % 31.20/12.99 (i1 := (\<lambda>x. _)(i1 := True, i2 := True, i3 := True), % 31.20/12.99 i2 := (\<lambda>x. _)(i1 := True, i2 := False, i3 := True), % 31.20/12.99 i3 := (\<lambda>x. _)(i1 := True, i2 := True, i3 := True)) % 31.20/12.99 bnd_smoke = % 31.20/12.99 (\<lambda>x. _) % 31.20/12.99 (i1 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False), % 31.20/12.99 i2 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := True), % 31.20/12.99 i3 := (\<lambda>x. _)(i1 := True, i2 := False, i3 := False)) % 31.20/12.99 bnd_specific = % 31.20/12.99 (\<lambda>x. _) % 31.20/12.99 (i1 := (\<lambda>x. _)(i1 := True, i2 := True, i3 := False), % 31.20/12.99 i2 := (\<lambda>x. _)(i1 := True, i2 := True, i3 := True), % 31.20/12.99 i3 := (\<lambda>x. _)(i1 := True, i2 := True, i3 := False)) % 31.20/12.99 bnd_state = % 31.20/12.99 (\<lambda>x. _) % 31.20/12.99 (i1 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False), % 31.20/12.99 i2 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False), % 31.20/12.99 i3 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False)) % 31.20/12.99 bnd_theme = % 31.20/12.99 (\<lambda>x. _) % 31.20/12.99 (i1 := (\<lambda>x. _) % 31.20/12.99 (i1 := (\<lambda>x. _)(i1 := False, i2 := True, i3 := True), % 31.20/12.99 i2 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False), % 31.20/12.99 i3 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False)), % 31.20/12.99 i2 := (\<lambda>x. _) % 31.20/12.99 (i1 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False), % 31.20/12.99 i2 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False), % 31.20/12.99 i3 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False)), % 31.20/12.99 i3 := (\<lambda>x. _) % 31.20/12.99 (i1 := (\<lambda>x. _)(i1 := False, i2 := True, i3 := True), % 31.20/12.99 i2 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False), % 31.20/12.99 i3 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False))) % 31.20/12.99 bnd_thing = % 31.20/12.99 (\<lambda>x. _) % 31.20/12.99 (i1 := (\<lambda>x. _)(i1 := True, i2 := True, i3 := True), % 31.20/12.99 i2 := (\<lambda>x. _)(i1 := True, i2 := False, i3 := True), % 31.20/12.99 i3 := (\<lambda>x. _)(i1 := True, i2 := True, i3 := True)) % 31.20/12.99 bnd_think_believe_consider = % 31.20/12.99 (\<lambda>x. _) % 31.20/12.99 (i1 := (\<lambda>x. _)(i1 := True, i2 := False, i3 := False), % 31.20/12.99 i2 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False), % 31.20/12.99 i3 := (\<lambda>x. _)(i1 := True, i2 := False, i3 := False)) % 31.20/12.99 bnd_unisex = % 31.20/12.99 (\<lambda>x. _) % 31.20/12.99 (i1 := (\<lambda>x. _)(i1 := True, i2 := False, i3 := True), % 31.20/12.99 i2 := (\<lambda>x. _)(i1 := True, i2 := True, i3 := True), % 31.20/12.99 i3 := (\<lambda>x. _)(i1 := True, i2 := False, i3 := True)) % 31.20/12.99 bnd_vincent_forename = % 31.20/12.99 (\<lambda>x. _) % 31.20/12.99 (i1 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := True), % 31.20/12.99 i2 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False), % 31.20/12.99 i3 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := True)) % 31.20/12.99 % SZS output end FiniteModel % 31.20/12.99 Total time: 3.6 s %------------------------------------------------------------------------------