%------------------------------------------------------------------------------ % File : Nitpick---2016 % Problem : PRO013+4 : TPTP v6.4.0. Released v4.0.0. % Transfm : none % Format : tptp:raw % Command : isabelle tptp_nitpick %d %s % Computer : n012.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 11:42:11 EST 2017 % Result : CounterSatisfiable 30.13s % Output : FiniteModel 30.13s % 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 : PRO013+4 : TPTP v6.4.0. Released v4.0.0. % 0.00/0.04 % Command : isabelle tptp_nitpick %d %s % 0.02/0.23 % Computer : n012.star.cs.uiowa.edu % 0.02/0.23 % Model : x86_64 x86_64 % 0.02/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz % 0.02/0.23 % Memory : 32218.75MB % 0.02/0.23 % OS : Linux 3.10.0-327.36.3.el7.x86_64 % 0.02/0.23 % CPULimit : 300 % 0.02/0.23 % DateTime : Sat Jan 14 22:24:33 CST 2017 % 0.02/0.23 % CPUTime : % 30.13/11.39 Nitpicking formula... % 30.13/11.39 Timestamp: 22:24:42 % 30.13/11.39 Using SAT solver "Lingeling_JNI" The following solvers are configured: % 30.13/11.39 "Lingeling_JNI", "CryptoMiniSat_JNI", "MiniSat_JNI", "SAT4J", "SAT4J_Light" % 30.13/11.39 Batch 1 of 20: Trying 5 scopes: % 30.13/11.39 card TPTP_Interpret.ind = 1 % 30.13/11.39 card TPTP_Interpret.ind = 2 % 30.13/11.39 card TPTP_Interpret.ind = 3 % 30.13/11.39 card TPTP_Interpret.ind = 4 % 30.13/11.39 card TPTP_Interpret.ind = 5 % 30.13/11.39 % SZS status CounterSatisfiable % SZS output start FiniteModel % 30.13/11.39 Nitpick found a counterexample for card TPTP_Interpret.ind = 5: % 30.13/11.39 % 30.13/11.39 Skolem constant: % 30.13/11.39 X106 = i1 % 30.13/11.39 Constants: % 30.13/11.39 bnd_activity = % 30.13/11.39 (\<lambda>x. _) % 30.13/11.39 (i1 := True, i2 := True, i3 := True, i4 := True, i5 := True) % 30.13/11.39 bnd_activity_occurrence = % 30.13/11.39 (\<lambda>x. _) % 30.13/11.39 (i1 := True, i2 := True, i3 := True, i4 := True, i5 := True) % 30.13/11.39 bnd_arboreal = % 30.13/11.39 (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := True, i3 := True, i4 := True, i5 := False) % 30.13/11.39 bnd_atocc = % 30.13/11.39 (\<lambda>x. _) % 30.13/11.39 (i1 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, i5 := False), % 30.13/11.39 i2 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := True, i3 := False, i4 := False, i5 := False), % 30.13/11.39 i3 := (\<lambda>x. _) % 30.13/11.39 (i1 := True, i2 := True, i3 := True, i4 := True, i5 := True), % 30.13/11.39 i4 := (\<lambda>x. _) % 30.13/11.39 (i1 := True, i2 := True, i3 := True, i4 := True, i5 := True), % 30.13/11.39 i5 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, i5 := False)) % 30.13/11.39 bnd_atomic = % 30.13/11.39 (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := True, i3 := True, i4 := True, i5 := True) % 30.13/11.39 bnd_earlier = % 30.13/11.39 (\<lambda>x. _) % 30.13/11.39 (i1 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := True, i3 := True, i4 := True, i5 := True), % 30.13/11.39 i2 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := True, i4 := True, i5 := False), % 30.13/11.39 i3 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := True, i5 := False), % 30.13/11.39 i4 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, i5 := False), % 30.13/11.39 i5 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, i5 := False)) % 30.13/11.39 bnd_leaf = % 30.13/11.39 (\<lambda>x. _) % 30.13/11.39 (i1 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, i5 := False), % 30.13/11.39 i2 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := True, i3 := True, i4 := True, i5 := True), % 30.13/11.39 i3 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := True, i5 := False), % 30.13/11.39 i4 := (\<lambda>x. _) % 30.13/11.39 (i1 := True, i2 := False, i3 := False, i4 := True, i5 := True), % 30.13/11.39 i5 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, i5 := False)) % 30.13/11.39 bnd_leaf_occ = % 30.13/11.39 (\<lambda>x. _) % 30.13/11.39 (i1 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, i5 := False), % 30.13/11.39 i2 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, i5 := False), % 30.13/11.39 i3 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, i5 := False), % 30.13/11.39 i4 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, i5 := True), % 30.13/11.39 i5 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, i5 := False)) % 30.13/11.39 bnd_legal = % 30.13/11.39 (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := True, i3 := True, i4 := True, i5 := False) % 30.13/11.39 bnd_min_precedes = % 30.13/11.39 (\<lambda>x. _) % 30.13/11.39 (i1 := (\<lambda>x. _) % 30.13/11.39 (i1 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, % 30.13/11.39 i5 := False), % 30.13/11.39 i2 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, % 30.13/11.39 i5 := False), % 30.13/11.39 i3 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, % 30.13/11.39 i5 := False), % 30.13/11.39 i4 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, % 30.13/11.39 i5 := False), % 30.13/11.39 i5 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, % 30.13/11.39 i5 := False)), % 30.13/11.39 i2 := (\<lambda>x. _) % 30.13/11.39 (i1 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, % 30.13/11.39 i5 := False), % 30.13/11.39 i2 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, % 30.13/11.39 i5 := False), % 30.13/11.39 i3 := (\<lambda>x. _) % 30.13/11.39 (i1 := True, i2 := False, i3 := False, i4 := False, % 30.13/11.39 i5 := False), % 30.13/11.39 i4 := (\<lambda>x. _) % 30.13/11.39 (i1 := True, i2 := False, i3 := False, i4 := False, % 30.13/11.39 i5 := False), % 30.13/11.39 i5 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, % 30.13/11.39 i5 := False)), % 30.13/11.39 i3 := (\<lambda>x. _) % 30.13/11.39 (i1 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, % 30.13/11.39 i5 := False), % 30.13/11.39 i2 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, % 30.13/11.39 i5 := False), % 30.13/11.39 i3 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, % 30.13/11.39 i5 := False), % 30.13/11.39 i4 := (\<lambda>x. _) % 30.13/11.39 (i1 := True, i2 := False, i3 := False, i4 := False, % 30.13/11.39 i5 := False), % 30.13/11.39 i5 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, % 30.13/11.39 i5 := False)), % 30.13/11.39 i4 := (\<lambda>x. _) % 30.13/11.39 (i1 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, % 30.13/11.39 i5 := False), % 30.13/11.39 i2 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, % 30.13/11.39 i5 := False), % 30.13/11.39 i3 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, % 30.13/11.39 i5 := False), % 30.13/11.39 i4 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, % 30.13/11.39 i5 := False), % 30.13/11.39 i5 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, % 30.13/11.39 i5 := False)), % 30.13/11.39 i5 := (\<lambda>x. _) % 30.13/11.39 (i1 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, % 30.13/11.39 i5 := False), % 30.13/11.39 i2 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, % 30.13/11.39 i5 := False), % 30.13/11.39 i3 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, % 30.13/11.39 i5 := False), % 30.13/11.39 i4 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, % 30.13/11.39 i5 := False), % 30.13/11.39 i5 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, % 30.13/11.39 i5 := False))) % 30.13/11.39 bnd_next_subocc = % 30.13/11.39 (\<lambda>x. _) % 30.13/11.39 (i1 := (\<lambda>x. _) % 30.13/11.39 (i1 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, % 30.13/11.39 i5 := False), % 30.13/11.39 i2 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, % 30.13/11.39 i5 := False), % 30.13/11.39 i3 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, % 30.13/11.39 i5 := False), % 30.13/11.39 i4 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, % 30.13/11.39 i5 := False), % 30.13/11.39 i5 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, % 30.13/11.39 i5 := False)), % 30.13/11.39 i2 := (\<lambda>x. _) % 30.13/11.39 (i1 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, % 30.13/11.39 i5 := False), % 30.13/11.39 i2 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, % 30.13/11.39 i5 := False), % 30.13/11.39 i3 := (\<lambda>x. _) % 30.13/11.39 (i1 := True, i2 := False, i3 := False, i4 := False, % 30.13/11.39 i5 := False), % 30.13/11.39 i4 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, % 30.13/11.39 i5 := False), % 30.13/11.39 i5 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, % 30.13/11.39 i5 := False)), % 30.13/11.39 i3 := (\<lambda>x. _) % 30.13/11.39 (i1 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, % 30.13/11.39 i5 := False), % 30.13/11.39 i2 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, % 30.13/11.39 i5 := False), % 30.13/11.39 i3 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, % 30.13/11.39 i5 := False), % 30.13/11.39 i4 := (\<lambda>x. _) % 30.13/11.39 (i1 := True, i2 := False, i3 := False, i4 := False, % 30.13/11.39 i5 := False), % 30.13/11.39 i5 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, % 30.13/11.39 i5 := False)), % 30.13/11.39 i4 := (\<lambda>x. _) % 30.13/11.39 (i1 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, % 30.13/11.39 i5 := False), % 30.13/11.39 i2 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, % 30.13/11.39 i5 := False), % 30.13/11.39 i3 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, % 30.13/11.39 i5 := False), % 30.13/11.39 i4 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, % 30.13/11.39 i5 := False), % 30.13/11.39 i5 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, % 30.13/11.39 i5 := False)), % 30.13/11.39 i5 := (\<lambda>x. _) % 30.13/11.39 (i1 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, % 30.13/11.39 i5 := False), % 30.13/11.39 i2 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, % 30.13/11.39 i5 := False), % 30.13/11.39 i3 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, % 30.13/11.39 i5 := False), % 30.13/11.39 i4 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, % 30.13/11.39 i5 := False), % 30.13/11.39 i5 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, % 30.13/11.39 i5 := False))) % 30.13/11.39 bnd_occurrence_of = % 30.13/11.39 (\<lambda>x. _) % 30.13/11.39 (i1 := (\<lambda>x. _) % 30.13/11.39 (i1 := True, i2 := False, i3 := False, i4 := False, i5 := False), % 30.13/11.39 i2 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, i5 := True), % 30.13/11.39 i3 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := True, i3 := False, i4 := False, i5 := False), % 30.13/11.39 i4 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := True, i4 := False, i5 := False), % 30.13/11.39 i5 := (\<lambda>x. _) % 30.13/11.39 (i1 := True, i2 := False, i3 := False, i4 := False, i5 := False)) % 30.13/11.39 bnd_precedes = % 30.13/11.39 (\<lambda>x. _) % 30.13/11.39 (i1 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := True, i3 := True, i4 := True, i5 := False), % 30.13/11.39 i2 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := True, i4 := True, i5 := False), % 30.13/11.39 i3 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := True, i5 := False), % 30.13/11.39 i4 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, i5 := False), % 30.13/11.39 i5 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, i5 := False)) % 30.13/11.39 bnd_root = % 30.13/11.39 (\<lambda>x. _) % 30.13/11.39 (i1 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, i5 := False), % 30.13/11.39 i2 := (\<lambda>x. _) % 30.13/11.39 (i1 := True, i2 := True, i3 := True, i4 := True, i5 := True), % 30.13/11.39 i3 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := True, i5 := False), % 30.13/11.39 i4 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := True, i5 := True), % 30.13/11.39 i5 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, i5 := False)) % 30.13/11.39 bnd_root_occ = % 30.13/11.39 (\<lambda>x. _) % 30.13/11.39 (i1 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, i5 := False), % 30.13/11.39 i2 := (\<lambda>x. _) % 30.13/11.39 (i1 := True, i2 := False, i3 := False, i4 := False, i5 := True), % 30.13/11.39 i3 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, i5 := False), % 30.13/11.39 i4 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, i5 := False), % 30.13/11.39 i5 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, i5 := False)) % 30.13/11.39 bnd_subactivity = % 30.13/11.39 (\<lambda>x. _) % 30.13/11.39 (i1 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := True, i3 := True, i4 := False, i5 := False), % 30.13/11.39 i2 := (\<lambda>x. _) % 30.13/11.39 (i1 := True, i2 := True, i3 := True, i4 := True, i5 := True), % 30.13/11.39 i3 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := True, i3 := True, i4 := False, i5 := False), % 30.13/11.39 i4 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := True, i3 := True, i4 := False, i5 := False), % 30.13/11.39 i5 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := True, i3 := True, i4 := False, i5 := False)) % 30.13/11.39 bnd_subactivity_occurrence = % 30.13/11.39 (\<lambda>x. _) % 30.13/11.39 (i1 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := False, i4 := False, i5 := False), % 30.13/11.39 i2 := (\<lambda>x. _) % 30.13/11.39 (i1 := True, i2 := False, i3 := False, i4 := False, i5 := True), % 30.13/11.39 i3 := (\<lambda>x. _) % 30.13/11.39 (i1 := True, i2 := True, i3 := False, i4 := False, i5 := True), % 30.13/11.39 i4 := (\<lambda>x. _) % 30.13/11.39 (i1 := False, i2 := False, i3 := True, i4 := True, i5 := True), % 30.13/11.39 i5 := (\<lambda>x. _) % 30.13/11.39 (i1 := True, i2 := True, i3 := True, i4 := True, i5 := True)) % 30.13/11.39 bnd_tptp0 = i1 % 30.13/11.39 bnd_tptp1 = i3 % 30.13/11.39 bnd_tptp2 = i4 % 30.13/11.39 bnd_tptp3 = i5 % 30.13/11.39 bnd_tptp4 = i2 % 30.13/11.39 % SZS output end FiniteModel % 30.13/11.39 Total time: 2.3 s %------------------------------------------------------------------------------