%------------------------------------------------------------------------------
% File     : Nitpick---2016
% Problem  : LCL242-1 : TPTP v6.4.0. Bugfixed v2.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : isabelle tptp_nitpick %d %s

% Computer : n136.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:32:20 EST 2017

% Result   : Satisfiable 32.06s
% Output   : FiniteModel 32.06s
% Verified : 
% SZS Type : None (Parsing solution fails)
% Syntax   : Number of formulae    : 0

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.03  % Problem  : LCL242-1 : TPTP v6.4.0. Bugfixed v2.3.0.
% 0.02/0.04  % Command  : isabelle tptp_nitpick %d %s
% 0.03/0.23  % Computer : n136.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 12:17:04 CST 2017
% 0.03/0.23  % CPUTime  : 
% 32.06/14.44  Nitpicking formula...
% 32.06/14.44  Timestamp: 12:17:13
% 32.06/14.44  Using SAT solver "Lingeling_JNI" The following solvers are configured:
% 32.06/14.44  "Lingeling_JNI", "CryptoMiniSat_JNI", "MiniSat_JNI", "SAT4J", "SAT4J_Light"
% 32.06/14.44  Batch 1 of 20: Trying 5 scopes:
% 32.06/14.44    card TPTP_Interpret.ind = 1
% 32.06/14.44    card TPTP_Interpret.ind = 2
% 32.06/14.44    card TPTP_Interpret.ind = 3
% 32.06/14.44    card TPTP_Interpret.ind = 4
% 32.06/14.44    card TPTP_Interpret.ind = 5
% 32.06/14.44  % SZS status Satisfiable % SZS output start FiniteModel
% 32.06/14.44  Nitpick found a model for card TPTP_Interpret.ind = 5:
% 32.06/14.44  
% 32.06/14.44    Constants:
% 32.06/14.44      bnd_axiom =
% 32.06/14.44        (\<lambda>x. _)
% 32.06/14.44        (i1 := False, i2 := False, i3 := True, i4 := False, i5 := True)
% 32.06/14.44      bnd_not =
% 32.06/14.44        (\<lambda>x. _)(i1 := i3, i2 := i4, i3 := i4, i4 := i1, i5 := i1)
% 32.06/14.44      bnd_or =
% 32.06/14.44        (\<lambda>x. _)
% 32.06/14.44        (i1 := (\<lambda>x. _)
% 32.06/14.44           (i1 := i1, i2 := i2, i3 := i2, i4 := i5, i5 := i5),
% 32.06/14.44         i2 := (\<lambda>x. _)
% 32.06/14.44           (i1 := i3, i2 := i2, i3 := i3, i4 := i5, i5 := i5),
% 32.06/14.44         i3 := (\<lambda>x. _)
% 32.06/14.44           (i1 := i3, i2 := i3, i3 := i3, i4 := i5, i5 := i5),
% 32.06/14.44         i4 := (\<lambda>x. _)
% 32.06/14.44           (i1 := i4, i2 := i5, i3 := i5, i4 := i4, i5 := i5),
% 32.06/14.44         i5 := (\<lambda>x. _)
% 32.06/14.44           (i1 := i5, i2 := i5, i3 := i5, i4 := i5, i5 := i5))
% 32.06/14.44      bnd_p = i5
% 32.06/14.44      bnd_q = i4
% 32.06/14.44      bnd_r = i1
% 32.06/14.44      bnd_theorem =
% 32.06/14.44        (\<lambda>x. _)
% 32.06/14.44        (i1 := False, i2 := True, i3 := True, i4 := True, i5 := True)
% 32.06/14.44  % SZS output end FiniteModel
% 32.06/14.44  Total time: 5.0 s
%------------------------------------------------------------------------------