TSTP Solution File: LCL567+1 by Nitpick---2016
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Nitpick---2016
% Problem : LCL567+1 : TPTP v6.4.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : isabelle tptp_nitpick %d %s
% Computer : n055.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 28.33s
% Output : FiniteModel 28.33s
% 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 : LCL567+1 : TPTP v6.4.0. Released v3.3.0.
% 0.00/0.04 % Command : isabelle tptp_nitpick %d %s
% 0.03/0.23 % Computer : n055.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 14:01:48 CST 2017
% 0.03/0.23 % CPUTime :
% 28.33/12.50 Nitpicking formula...
% 28.33/12.50 Timestamp: 14:01:56
% 28.33/12.50 Using SAT solver "Lingeling_JNI" The following solvers are configured:
% 28.33/12.50 "Lingeling_JNI", "CryptoMiniSat_JNI", "MiniSat_JNI", "SAT4J", "SAT4J_Light"
% 28.33/12.50 Batch 1 of 20: Trying 5 scopes:
% 28.33/12.50 card TPTP_Interpret.ind = 1
% 28.33/12.50 card TPTP_Interpret.ind = 2
% 28.33/12.50 card TPTP_Interpret.ind = 3
% 28.33/12.50 card TPTP_Interpret.ind = 4
% 28.33/12.50 card TPTP_Interpret.ind = 5
% 28.33/12.50 % SZS status CounterSatisfiable % SZS output start FiniteModel
% 28.33/12.50 Nitpick found a counterexample for card TPTP_Interpret.ind = 4:
% 28.33/12.50
% 28.33/12.50 Constants:
% 28.33/12.50 bnd_adjunction = True
% 28.33/12.50 bnd_and =
% 28.33/12.50 (\<lambda>x. _)
% 28.33/12.50 (i1 := (\<lambda>x. _)(i1 := i1, i2 := i3, i3 := i3, i4 := i1),
% 28.33/12.50 i2 := (\<lambda>x. _)(i1 := i3, i2 := i2, i3 := i3, i4 := i2),
% 28.33/12.50 i3 := (\<lambda>x. _)(i1 := i3, i2 := i3, i3 := i3, i4 := i3),
% 28.33/12.50 i4 := (\<lambda>x. _)(i1 := i1, i2 := i2, i3 := i3, i4 := i4))
% 28.33/12.50 bnd_axiom_4 = True
% 28.33/12.50 bnd_axiom_5 = False
% 28.33/12.50 bnd_axiom_B = False
% 28.33/12.50 bnd_axiom_K = True
% 28.33/12.50 bnd_axiom_M = True
% 28.33/12.50 bnd_axiom_b = True
% 28.33/12.50 bnd_axiom_m1 = True
% 28.33/12.50 bnd_axiom_m10 = False
% 28.33/12.50 bnd_axiom_m2 = True
% 28.33/12.50 bnd_axiom_m3 = True
% 28.33/12.50 bnd_axiom_m4 = True
% 28.33/12.50 bnd_axiom_m5 = True
% 28.33/12.50 bnd_axiom_m6 = True
% 28.33/12.50 bnd_axiom_m7 = False
% 28.33/12.50 bnd_axiom_m8 = True
% 28.33/12.50 bnd_axiom_m9 = True
% 28.33/12.50 bnd_axiom_s1 = True
% 28.33/12.50 bnd_axiom_s2 = True
% 28.33/12.50 bnd_axiom_s3 = True
% 28.33/12.50 bnd_axiom_s4 = True
% 28.33/12.50 bnd_equiv =
% 28.33/12.50 (\<lambda>x. _)
% 28.33/12.50 (i1 := (\<lambda>x. _)(i1 := i4, i2 := i3, i3 := i2, i4 := i1),
% 28.33/12.50 i2 := (\<lambda>x. _)(i1 := i3, i2 := i4, i3 := i1, i4 := i2),
% 28.33/12.50 i3 := (\<lambda>x. _)(i1 := i2, i2 := i1, i3 := i4, i4 := i3),
% 28.33/12.50 i4 := (\<lambda>x. _)(i1 := i1, i2 := i2, i3 := i3, i4 := i4))
% 28.33/12.50 bnd_implies =
% 28.33/12.50 (\<lambda>x. _)
% 28.33/12.50 (i1 := (\<lambda>x. _)(i1 := i4, i2 := i2, i3 := i2, i4 := i4),
% 28.33/12.50 i2 := (\<lambda>x. _)(i1 := i1, i2 := i4, i3 := i1, i4 := i4),
% 28.33/12.50 i3 := (\<lambda>x. _)(i1 := i4, i2 := i4, i3 := i4, i4 := i4),
% 28.33/12.50 i4 := (\<lambda>x. _)(i1 := i1, i2 := i2, i3 := i3, i4 := i4))
% 28.33/12.50 bnd_is_a_theorem =
% 28.33/12.50 (\<lambda>x. _)(i1 := False, i2 := False, i3 := False, i4 := True)
% 28.33/12.50 bnd_modus_ponens_strict_implies = True
% 28.33/12.50 bnd_necessarily =
% 28.33/12.50 (\<lambda>x. _)(i1 := i3, i2 := i2, i3 := i3, i4 := i4)
% 28.33/12.50 bnd_necessitation = True
% 28.33/12.50 bnd_not = (\<lambda>x. _)(i1 := i2, i2 := i1, i3 := i4, i4 := i3)
% 28.33/12.50 bnd_op_and = False
% 28.33/12.50 bnd_op_equiv = True
% 28.33/12.50 bnd_op_implies = True
% 28.33/12.50 bnd_op_implies_and = True
% 28.33/12.50 bnd_op_implies_or = False
% 28.33/12.50 bnd_op_necessarily = False
% 28.33/12.50 bnd_op_or = True
% 28.33/12.50 bnd_op_possibly = True
% 28.33/12.50 bnd_op_strict_equiv = True
% 28.33/12.50 bnd_op_strict_implies = True
% 28.33/12.50 bnd_or =
% 28.33/12.50 (\<lambda>x. _)
% 28.33/12.50 (i1 := (\<lambda>x. _)(i1 := i1, i2 := i4, i3 := i1, i4 := i4),
% 28.33/12.50 i2 := (\<lambda>x. _)(i1 := i4, i2 := i2, i3 := i2, i4 := i4),
% 28.33/12.50 i3 := (\<lambda>x. _)(i1 := i1, i2 := i2, i3 := i3, i4 := i4),
% 28.33/12.50 i4 := (\<lambda>x. _)(i1 := i4, i2 := i4, i3 := i4, i4 := i4))
% 28.33/12.50 bnd_possibly = (\<lambda>x. _)(i1 := i1, i2 := i4, i3 := i3, i4 := i4)
% 28.33/12.50 bnd_strict_equiv =
% 28.33/12.50 (\<lambda>x. _)
% 28.33/12.50 (i1 := (\<lambda>x. _)(i1 := i4, i2 := i3, i3 := i2, i4 := i3),
% 28.33/12.50 i2 := (\<lambda>x. _)(i1 := i3, i2 := i4, i3 := i3, i4 := i2),
% 28.33/12.50 i3 := (\<lambda>x. _)(i1 := i2, i2 := i3, i3 := i4, i4 := i3),
% 28.33/12.50 i4 := (\<lambda>x. _)(i1 := i3, i2 := i2, i3 := i3, i4 := i4))
% 28.33/12.50 bnd_strict_implies =
% 28.33/12.50 (\<lambda>x. _)
% 28.33/12.50 (i1 := (\<lambda>x. _)(i1 := i4, i2 := i2, i3 := i2, i4 := i4),
% 28.33/12.50 i2 := (\<lambda>x. _)(i1 := i3, i2 := i4, i3 := i3, i4 := i4),
% 28.33/12.50 i3 := (\<lambda>x. _)(i1 := i4, i2 := i4, i3 := i4, i4 := i4),
% 28.33/12.50 i4 := (\<lambda>x. _)(i1 := i3, i2 := i2, i3 := i3, i4 := i4))
% 28.33/12.50 bnd_substitution_of_equivalents = True
% 28.33/12.50 bnd_substitution_strict_equiv = True
% 28.33/12.50 % SZS output end FiniteModel
% 28.33/12.50 Total time: 3.7 s
%------------------------------------------------------------------------------