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