%------------------------------------------------------------------------------
% File     : Nitpick---2016
% Problem  : LCL909+1 : TPTP v6.4.0. Released v6.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : isabelle tptp_nitpick %d %s

% Computer : n105.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:34:30 EST 2017

% Result   : Satisfiable 24.49s
% Output   : FiniteModel 24.49s
% 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  : LCL909+1 : TPTP v6.4.0. Released v6.4.0.
% 0.00/0.04  % Command  : isabelle tptp_nitpick %d %s
% 0.02/0.23  % Computer : n105.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 16:35:04 CST 2017
% 0.02/0.23  % CPUTime  : 
% 24.49/10.40  Nitpicking formula...
% 24.49/10.40  Timestamp: 16:35:12
% 24.49/10.40  Using SAT solver "Lingeling_JNI" The following solvers are configured:
% 24.49/10.40  "Lingeling_JNI", "CryptoMiniSat_JNI", "MiniSat_JNI", "SAT4J", "SAT4J_Light"
% 24.49/10.40  Batch 1 of 20: Trying 5 scopes:
% 24.49/10.40    card TPTP_Interpret.ind = 1
% 24.49/10.40    card TPTP_Interpret.ind = 2
% 24.49/10.40    card TPTP_Interpret.ind = 3
% 24.49/10.40    card TPTP_Interpret.ind = 4
% 24.49/10.40    card TPTP_Interpret.ind = 5
% 24.49/10.40  % SZS status Satisfiable % SZS output start FiniteModel
% 24.49/10.40  Nitpick found a model for card TPTP_Interpret.ind = 1:
% 24.49/10.40  
% 24.49/10.40    Constants:
% 24.49/10.40      bnd_and = (\<lambda>x. _)(i1 := (\<lambda>x. _)(i1 := i1))
% 24.49/10.40      bnd_and_1 = True
% 24.49/10.40      bnd_and_2 = True
% 24.49/10.40      bnd_and_3 = True
% 24.49/10.40      bnd_cn1 = True
% 24.49/10.40      bnd_cn2 = True
% 24.49/10.40      bnd_cn3 = True
% 24.49/10.40      bnd_equiv = (\<lambda>x. _)(i1 := (\<lambda>x. _)(i1 := i1))
% 24.49/10.40      bnd_equivalence_1 = True
% 24.49/10.40      bnd_equivalence_2 = True
% 24.49/10.40      bnd_equivalence_3 = True
% 24.49/10.40      bnd_implies = (\<lambda>x. _)(i1 := (\<lambda>x. _)(i1 := i1))
% 24.49/10.40      bnd_implies_1 = True
% 24.49/10.40      bnd_implies_2 = True
% 24.49/10.40      bnd_implies_3 = True
% 24.49/10.40      bnd_is_a_theorem = (\<lambda>x. _)(i1 := True)
% 24.49/10.40      bnd_kn1 = True
% 24.49/10.40      bnd_kn2 = True
% 24.49/10.40      bnd_kn3 = True
% 24.49/10.40      bnd_modus_ponens = True
% 24.49/10.40      bnd_modus_tollens = True
% 24.49/10.40      bnd_not = (\<lambda>x. _)(i1 := i1)
% 24.49/10.40      bnd_op_and = True
% 24.49/10.40      bnd_op_equiv = True
% 24.49/10.40      bnd_op_implies_and = False
% 24.49/10.40      bnd_op_implies_or = True
% 24.49/10.40      bnd_op_or = False
% 24.49/10.40      bnd_or = (\<lambda>x. _)(i1 := (\<lambda>x. _)(i1 := i1))
% 24.49/10.40      bnd_or_1 = True
% 24.49/10.40      bnd_or_2 = True
% 24.49/10.40      bnd_or_3 = True
% 24.49/10.40      bnd_r1 = True
% 24.49/10.40      bnd_r2 = True
% 24.49/10.40      bnd_r3 = True
% 24.49/10.40      bnd_r4 = True
% 24.49/10.40      bnd_r5 = True
% 24.49/10.40      bnd_substitution_of_equivalents = True
% 24.49/10.40  % SZS output end FiniteModel
% 24.49/10.40  Total time: 1.5 s
%------------------------------------------------------------------------------