%------------------------------------------------------------------------------ % File : Nitpick---2016 % Problem : LCL578+1 : TPTP v6.4.0. Released v3.3.0. % Transfm : none % Format : tptp:raw % Command : isabelle tptp_nitpick %d %s % Computer : n116.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 19:33:08 EST 2017 % Result : CounterSatisfiable 26.50s % Output : FiniteModel 26.50s % 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 : LCL578+1 : TPTP v6.4.0. Released v3.3.0. % 0.00/0.04 % Command : isabelle tptp_nitpick %d %s % 0.02/0.24 % Computer : n116.star.cs.uiowa.edu % 0.02/0.24 % Model : x86_64 x86_64 % 0.02/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz % 0.02/0.24 % Memory : 32218.75MB % 0.02/0.24 % OS : Linux 3.10.0-327.36.3.el7.x86_64 % 0.02/0.24 % CPULimit : 300 % 0.02/0.24 % DateTime : Sat Jan 14 14:05:34 CST 2017 % 0.02/0.24 % CPUTime : % 26.50/10.47 Nitpicking formula... % 26.50/10.47 Timestamp: 14:05:42 % 26.50/10.47 Using SAT solver "Lingeling_JNI" The following solvers are configured: % 26.50/10.47 "Lingeling_JNI", "CryptoMiniSat_JNI", "MiniSat_JNI", "SAT4J", "SAT4J_Light" % 26.50/10.47 Batch 1 of 20: Trying 5 scopes: % 26.50/10.47 card TPTP_Interpret.ind = 1 % 26.50/10.47 card TPTP_Interpret.ind = 2 % 26.50/10.47 card TPTP_Interpret.ind = 3 % 26.50/10.47 card TPTP_Interpret.ind = 4 % 26.50/10.47 card TPTP_Interpret.ind = 5 % 26.50/10.47 % SZS status CounterSatisfiable % SZS output start FiniteModel % 26.50/10.47 Nitpick found a counterexample for card TPTP_Interpret.ind = 3: % 26.50/10.47 % 26.50/10.47 Constants: % 26.50/10.47 bnd_adjunction = True % 26.50/10.47 bnd_and = % 26.50/10.47 (\<lambda>x. _) % 26.50/10.47 (i1 := (\<lambda>x. _)(i1 := i1, i2 := i1, i3 := i1), % 26.50/10.47 i2 := (\<lambda>x. _)(i1 := i1, i2 := i2, i3 := i1), % 26.50/10.47 i3 := (\<lambda>x. _)(i1 := i1, i2 := i1, i3 := i3)) % 26.50/10.47 bnd_axiom_4 = False % 26.50/10.47 bnd_axiom_5 = False % 26.50/10.47 bnd_axiom_B = False % 26.50/10.47 bnd_axiom_K = False % 26.50/10.47 bnd_axiom_M = False % 26.50/10.47 bnd_axiom_m1 = True % 26.50/10.47 bnd_axiom_m10 = True % 26.50/10.47 bnd_axiom_m2 = True % 26.50/10.47 bnd_axiom_m3 = True % 26.50/10.47 bnd_axiom_m4 = True % 26.50/10.47 bnd_axiom_m5 = True % 26.50/10.47 bnd_axiom_m6 = False % 26.50/10.47 bnd_axiom_m7 = False % 26.50/10.47 bnd_axiom_m8 = False % 26.50/10.47 bnd_axiom_m9 = False % 26.50/10.47 bnd_axiom_s1 = False % 26.50/10.47 bnd_axiom_s2 = False % 26.50/10.47 bnd_axiom_s3 = False % 26.50/10.47 bnd_axiom_s4 = True % 26.50/10.47 bnd_equiv = % 26.50/10.47 (\<lambda>x. _) % 26.50/10.47 (i1 := (\<lambda>x. _)(i1 := i1, i2 := i1, i3 := i1), % 26.50/10.47 i2 := (\<lambda>x. _)(i1 := i1, i2 := i1, i3 := i1), % 26.50/10.47 i3 := (\<lambda>x. _)(i1 := i1, i2 := i1, i3 := i1)) % 26.50/10.47 bnd_implies = % 26.50/10.47 (\<lambda>x. _) % 26.50/10.47 (i1 := (\<lambda>x. _)(i1 := i1, i2 := i1, i3 := i1), % 26.50/10.47 i2 := (\<lambda>x. _)(i1 := i2, i2 := i1, i3 := i1), % 26.50/10.47 i3 := (\<lambda>x. _)(i1 := i2, i2 := i2, i3 := i1)) % 26.50/10.47 bnd_is_a_theorem = (\<lambda>x. _)(i1 := False, i2 := False, i3 := True) % 26.50/10.47 bnd_modus_ponens_strict_implies = True % 26.50/10.47 bnd_necessarily = (\<lambda>x. _)(i1 := i3, i2 := i2, i3 := i3) % 26.50/10.47 bnd_necessitation = True % 26.50/10.47 bnd_not = (\<lambda>x. _)(i1 := i2, i2 := i3, i3 := i1) % 26.50/10.47 bnd_op_and = False % 26.50/10.47 bnd_op_equiv = True % 26.50/10.47 bnd_op_implies = True % 26.50/10.47 bnd_op_implies_and = False % 26.50/10.47 bnd_op_implies_or = False % 26.50/10.47 bnd_op_necessarily = False % 26.50/10.47 bnd_op_or = True % 26.50/10.47 bnd_op_possibly = True % 26.50/10.47 bnd_op_strict_equiv = True % 26.50/10.47 bnd_op_strict_implies = True % 26.50/10.47 bnd_or = % 26.50/10.47 (\<lambda>x. _) % 26.50/10.47 (i1 := (\<lambda>x. _)(i1 := i3, i2 := i2, i3 := i2), % 26.50/10.47 i2 := (\<lambda>x. _)(i1 := i2, i2 := i1, i3 := i2), % 26.50/10.47 i3 := (\<lambda>x. _)(i1 := i2, i2 := i2, i3 := i2)) % 26.50/10.47 bnd_possibly = (\<lambda>x. _)(i1 := i3, i2 := i1, i3 := i1) % 26.50/10.47 bnd_strict_equiv = % 26.50/10.47 (\<lambda>x. _) % 26.50/10.47 (i1 := (\<lambda>x. _)(i1 := i3, i2 := i1, i3 := i1), % 26.50/10.47 i2 := (\<lambda>x. _)(i1 := i1, i2 := i3, i3 := i1), % 26.50/10.47 i3 := (\<lambda>x. _)(i1 := i1, i2 := i1, i3 := i3)) % 26.50/10.47 bnd_strict_implies = % 26.50/10.47 (\<lambda>x. _) % 26.50/10.47 (i1 := (\<lambda>x. _)(i1 := i3, i2 := i3, i3 := i3), % 26.50/10.47 i2 := (\<lambda>x. _)(i1 := i2, i2 := i3, i3 := i3), % 26.50/10.47 i3 := (\<lambda>x. _)(i1 := i2, i2 := i2, i3 := i3)) % 26.50/10.47 bnd_substitution_strict_equiv = True % 26.50/10.47 % SZS output end FiniteModel % 26.50/10.47 Total time: 1.5 s %------------------------------------------------------------------------------