TSTP Solution File: NLP138+1 by Nitpick---2016

View Problem - Process Solution

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

% Computer : n124.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 21:07:12 EST 2017

% Result   : CounterSatisfiable 25.43s
% Output   : FiniteModel 25.43s
% 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  : NLP138+1 : TPTP v6.4.0. Released v2.4.0.
% 0.00/0.04  % Command  : isabelle tptp_nitpick %d %s
% 0.03/0.22  % Computer : n124.star.cs.uiowa.edu
% 0.03/0.22  % Model    : x86_64 x86_64
% 0.03/0.22  % CPU      : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.03/0.22  % Memory   : 32218.75MB
% 0.03/0.22  % OS       : Linux 3.10.0-327.36.3.el7.x86_64
% 0.03/0.22  % CPULimit : 300
% 0.03/0.22  % DateTime : Sat Jan 14 21:53:48 CST 2017
% 0.03/0.23  % CPUTime  : 
% 25.43/10.13  Nitpicking formula...
% 25.43/10.13  Timestamp: 21:53:57
% 25.43/10.13  Using SAT solver "Lingeling_JNI" The following solvers are configured:
% 25.43/10.13  "Lingeling_JNI", "CryptoMiniSat_JNI", "MiniSat_JNI", "SAT4J", "SAT4J_Light"
% 25.43/10.13  Batch 1 of 20: Trying 5 scopes:
% 25.43/10.13    card TPTP_Interpret.ind = 1
% 25.43/10.13    card TPTP_Interpret.ind = 2
% 25.43/10.13    card TPTP_Interpret.ind = 3
% 25.43/10.13    card TPTP_Interpret.ind = 4
% 25.43/10.13    card TPTP_Interpret.ind = 5
% 25.43/10.13  % SZS status CounterSatisfiable % SZS output start FiniteModel
% 25.43/10.13  Nitpick found a counterexample for card TPTP_Interpret.ind = 2:
% 25.43/10.13  
% 25.43/10.13    Skolem constants:
% 25.43/10.13      U = i1
% 25.43/10.13      V = i2
% 25.43/10.13      W = i1
% 25.43/10.13      X = i1
% 25.43/10.13      X1 = i1
% 25.43/10.13      X10 = i1
% 25.43/10.13      X11 = i1
% 25.43/10.13      \<lambda>X12. X13 = (\<lambda>x. _)(i1 := i1, i2 := i1)
% 25.43/10.13      \<lambda>X12. X14 = (\<lambda>x. _)(i1 := i1, i2 := i1)
% 25.43/10.13      \<lambda>X2. X3 = (\<lambda>x. _)(i1 := i1, i2 := i1)
% 25.43/10.13      \<lambda>X2. X4 = (\<lambda>x. _)(i1 := i1, i2 := i1)
% 25.43/10.13      X6 = i1
% 25.43/10.13      X7 = i1
% 25.43/10.13      X8 = i1
% 25.43/10.13      X9 = i1
% 25.43/10.13      Y = i1
% 25.43/10.13      Z = i1
% 25.43/10.13    Constants:
% 25.43/10.13      bnd_actual_world = (\<lambda>x. _)(i1 := True, i2 := False)
% 25.43/10.13      bnd_agent =
% 25.43/10.13        (\<lambda>x. _)
% 25.43/10.13        (i1 := (\<lambda>x. _)
% 25.43/10.13           (i1 := (\<lambda>x. _)(i1 := True, i2 := False),
% 25.43/10.13            i2 := (\<lambda>x. _)(i1 := False, i2 := False)),
% 25.43/10.13         i2 := (\<lambda>x. _)
% 25.43/10.13           (i1 := (\<lambda>x. _)(i1 := False, i2 := False),
% 25.43/10.13            i2 := (\<lambda>x. _)(i1 := False, i2 := False)))
% 25.43/10.13      bnd_barrel =
% 25.43/10.13        (\<lambda>x. _)
% 25.43/10.13        (i1 := (\<lambda>x. _)(i1 := True, i2 := False),
% 25.43/10.13         i2 := (\<lambda>x. _)(i1 := False, i2 := False))
% 25.43/10.13      bnd_be =
% 25.43/10.13        (\<lambda>x. _)
% 25.43/10.13        (i1 := (\<lambda>x. _)
% 25.43/10.13           (i1 := (\<lambda>x. _)
% 25.43/10.13              (i1 := (\<lambda>x. _)(i1 := True, i2 := False),
% 25.43/10.13               i2 := (\<lambda>x. _)(i1 := True, i2 := True)),
% 25.43/10.13            i2 := (\<lambda>x. _)
% 25.43/10.13              (i1 := (\<lambda>x. _)(i1 := True, i2 := False),
% 25.43/10.13               i2 := (\<lambda>x. _)(i1 := True, i2 := True))),
% 25.43/10.13         i2 := (\<lambda>x. _)
% 25.43/10.13           (i1 := (\<lambda>x. _)
% 25.43/10.13              (i1 := (\<lambda>x. _)(i1 := True, i2 := True),
% 25.43/10.13               i2 := (\<lambda>x. _)(i1 := True, i2 := True)),
% 25.43/10.13            i2 := (\<lambda>x. _)
% 25.43/10.13              (i1 := (\<lambda>x. _)(i1 := True, i2 := True),
% 25.43/10.13               i2 := (\<lambda>x. _)(i1 := True, i2 := True))))
% 25.43/10.13      bnd_chevy =
% 25.43/10.13        (\<lambda>x. _)
% 25.43/10.13        (i1 := (\<lambda>x. _)(i1 := True, i2 := False),
% 25.43/10.13         i2 := (\<lambda>x. _)(i1 := False, i2 := False))
% 25.43/10.13      bnd_city =
% 25.43/10.13        (\<lambda>x. _)
% 25.43/10.13        (i1 := (\<lambda>x. _)(i1 := False, i2 := True),
% 25.43/10.13         i2 := (\<lambda>x. _)(i1 := False, i2 := False))
% 25.43/10.13      bnd_dirty =
% 25.43/10.13        (\<lambda>x. _)
% 25.43/10.13        (i1 := (\<lambda>x. _)(i1 := True, i2 := False),
% 25.43/10.13         i2 := (\<lambda>x. _)(i1 := False, i2 := False))
% 25.43/10.13      bnd_down =
% 25.43/10.13        (\<lambda>x. _)
% 25.43/10.13        (i1 := (\<lambda>x. _)
% 25.43/10.13           (i1 := (\<lambda>x. _)(i1 := True, i2 := False),
% 25.43/10.13            i2 := (\<lambda>x. _)(i1 := False, i2 := False)),
% 25.43/10.13         i2 := (\<lambda>x. _)
% 25.43/10.13           (i1 := (\<lambda>x. _)(i1 := False, i2 := False),
% 25.43/10.13            i2 := (\<lambda>x. _)(i1 := False, i2 := False)))
% 25.43/10.13      bnd_event =
% 25.43/10.13        (\<lambda>x. _)
% 25.43/10.13        (i1 := (\<lambda>x. _)(i1 := True, i2 := False),
% 25.43/10.13         i2 := (\<lambda>x. _)(i1 := False, i2 := False))
% 25.43/10.13      bnd_fellow =
% 25.43/10.13        (\<lambda>x. _)
% 25.43/10.13        (i1 := (\<lambda>x. _)(i1 := True, i2 := True),
% 25.43/10.13         i2 := (\<lambda>x. _)(i1 := True, i2 := True))
% 25.43/10.13      bnd_frontseat =
% 25.43/10.13        (\<lambda>x. _)
% 25.43/10.13        (i1 := (\<lambda>x. _)(i1 := True, i2 := False),
% 25.43/10.13         i2 := (\<lambda>x. _)(i1 := False, i2 := False))
% 25.43/10.13      bnd_group =
% 25.43/10.13        (\<lambda>x. _)
% 25.43/10.13        (i1 := (\<lambda>x. _)(i1 := True, i2 := False),
% 25.43/10.13         i2 := (\<lambda>x. _)(i1 := False, i2 := False))
% 25.43/10.13      bnd_hollywood_placename =
% 25.43/10.13        (\<lambda>x. _)
% 25.43/10.13        (i1 := (\<lambda>x. _)(i1 := True, i2 := False),
% 25.43/10.13         i2 := (\<lambda>x. _)(i1 := False, i2 := False))
% 25.43/10.13      bnd_in =
% 25.43/10.13        (\<lambda>x. _)
% 25.43/10.13        (i1 := (\<lambda>x. _)
% 25.43/10.13           (i1 := (\<lambda>x. _)(i1 := False, i2 := True),
% 25.43/10.13            i2 := (\<lambda>x. _)(i1 := True, i2 := False)),
% 25.43/10.13         i2 := (\<lambda>x. _)
% 25.43/10.13           (i1 := (\<lambda>x. _)(i1 := False, i2 := False),
% 25.43/10.13            i2 := (\<lambda>x. _)(i1 := True, i2 := True)))
% 25.43/10.13      bnd_lonely =
% 25.43/10.13        (\<lambda>x. _)
% 25.43/10.13        (i1 := (\<lambda>x. _)(i1 := True, i2 := False),
% 25.43/10.13         i2 := (\<lambda>x. _)(i1 := False, i2 := False))
% 25.43/10.13      bnd_member =
% 25.43/10.13        (\<lambda>x. _)
% 25.43/10.13        (i1 := (\<lambda>x. _)
% 25.43/10.13           (i1 := (\<lambda>x. _)(i1 := False, i2 := True),
% 25.43/10.13            i2 := (\<lambda>x. _)(i1 := False, i2 := False)),
% 25.43/10.13         i2 := (\<lambda>x. _)
% 25.43/10.13           (i1 := (\<lambda>x. _)(i1 := False, i2 := True),
% 25.43/10.13            i2 := (\<lambda>x. _)(i1 := False, i2 := False)))
% 25.43/10.13      bnd_of =
% 25.43/10.13        (\<lambda>x. _)
% 25.43/10.13        (i1 := (\<lambda>x. _)
% 25.43/10.13           (i1 := (\<lambda>x. _)(i1 := False, i2 := True),
% 25.43/10.13            i2 := (\<lambda>x. _)(i1 := False, i2 := False)),
% 25.43/10.13         i2 := (\<lambda>x. _)
% 25.43/10.13           (i1 := (\<lambda>x. _)(i1 := False, i2 := False),
% 25.43/10.13            i2 := (\<lambda>x. _)(i1 := False, i2 := False)))
% 25.43/10.13      bnd_old =
% 25.43/10.13        (\<lambda>x. _)
% 25.43/10.13        (i1 := (\<lambda>x. _)(i1 := True, i2 := False),
% 25.43/10.13         i2 := (\<lambda>x. _)(i1 := False, i2 := False))
% 25.43/10.13      bnd_placename =
% 25.43/10.13        (\<lambda>x. _)
% 25.43/10.13        (i1 := (\<lambda>x. _)(i1 := True, i2 := False),
% 25.43/10.13         i2 := (\<lambda>x. _)(i1 := False, i2 := False))
% 25.43/10.13      bnd_present =
% 25.43/10.13        (\<lambda>x. _)
% 25.43/10.13        (i1 := (\<lambda>x. _)(i1 := True, i2 := False),
% 25.43/10.13         i2 := (\<lambda>x. _)(i1 := False, i2 := False))
% 25.43/10.13      bnd_state =
% 25.43/10.13        (\<lambda>x. _)
% 25.43/10.13        (i1 := (\<lambda>x. _)(i1 := True, i2 := True),
% 25.43/10.13         i2 := (\<lambda>x. _)(i1 := False, i2 := False))
% 25.43/10.13      bnd_street =
% 25.43/10.13        (\<lambda>x. _)
% 25.43/10.13        (i1 := (\<lambda>x. _)(i1 := True, i2 := False),
% 25.43/10.13         i2 := (\<lambda>x. _)(i1 := False, i2 := False))
% 25.43/10.13      bnd_two =
% 25.43/10.13        (\<lambda>x. _)
% 25.43/10.13        (i1 := (\<lambda>x. _)(i1 := True, i2 := False),
% 25.43/10.13         i2 := (\<lambda>x. _)(i1 := False, i2 := False))
% 25.43/10.13      bnd_white =
% 25.43/10.13        (\<lambda>x. _)
% 25.43/10.13        (i1 := (\<lambda>x. _)(i1 := True, i2 := False),
% 25.43/10.13         i2 := (\<lambda>x. _)(i1 := False, i2 := False))
% 25.43/10.13      bnd_young =
% 25.43/10.13        (\<lambda>x. _)
% 25.43/10.13        (i1 := (\<lambda>x. _)(i1 := False, i2 := False),
% 25.43/10.13         i2 := (\<lambda>x. _)(i1 := False, i2 := False))
% 25.43/10.13  % SZS output end FiniteModel
% 25.43/10.13  Total time: 1.4 s
%------------------------------------------------------------------------------