TSTP Solution File: NLP248+1 by Nitpick---2016
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Nitpick---2016
% Problem : NLP248+1 : TPTP v6.4.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : isabelle tptp_nitpick %d %s
% Computer : n057.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:51 EST 2017
% Result : CounterSatisfiable 29.48s
% Output : FiniteModel 29.48s
% 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 : NLP248+1 : TPTP v6.4.0. Released v2.4.0.
% 0.00/0.04 % Command : isabelle tptp_nitpick %d %s
% 0.03/0.23 % Computer : n057.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 22:15:33 CST 2017
% 0.03/0.23 % CPUTime :
% 29.48/14.10 Nitpicking formula...
% 29.48/14.10 Timestamp: 22:15:42
% 29.48/14.10 The type TPTP_Interpret.ind passed the monotonicity test; Nitpick might be
% 29.48/14.10 able to skip some scopes
% 29.48/14.10 Using SAT solver "Lingeling_JNI" The following solvers are configured:
% 29.48/14.10 "Lingeling_JNI", "CryptoMiniSat_JNI", "MiniSat_JNI", "SAT4J", "SAT4J_Light"
% 29.48/14.10 Batch 1 of 20: Trying 5 scopes:
% 29.48/14.10 card TPTP_Interpret.ind = 1
% 29.48/14.10 card TPTP_Interpret.ind = 2
% 29.48/14.10 card TPTP_Interpret.ind = 3
% 29.48/14.10 card TPTP_Interpret.ind = 4
% 29.48/14.10 card TPTP_Interpret.ind = 5
% 29.48/14.10 % SZS status CounterSatisfiable % SZS output start FiniteModel
% 29.48/14.10 Nitpick found a counterexample for card TPTP_Interpret.ind = 3:
% 29.48/14.10
% 29.48/14.10 Skolem constants:
% 29.48/14.10 U = i1
% 29.48/14.10 V = i2
% 29.48/14.10 W = i2
% 29.48/14.10 X = i1
% 29.48/14.10 X1 = i2
% 29.48/14.10 X2 = i2
% 29.48/14.10 X3 = i1
% 29.48/14.10 X4 = i3
% 29.48/14.10 X5 = i3
% 29.48/14.10 X6 = i2
% 29.48/14.10 \<lambda>X7. X8 = (\<lambda>x. _)(i1 := i3, i2 := i2, i3 := i2)
% 29.48/14.10 X9 = i3
% 29.48/14.10 Y = i2
% 29.48/14.10 Z = i3
% 29.48/14.10 Constants:
% 29.48/14.10 bnd_abstraction =
% 29.48/14.10 (\<lambda>x. _)
% 29.48/14.10 (i1 := (\<lambda>x. _)(i1 := False, i2 := True, i3 := False),
% 29.48/14.10 i2 := (\<lambda>x. _)(i1 := False, i2 := True, i3 := False),
% 29.48/14.10 i3 := (\<lambda>x. _)(i1 := False, i2 := True, i3 := False))
% 29.48/14.10 bnd_accessible_world =
% 29.48/14.10 (\<lambda>x. _)
% 29.48/14.10 (i1 := (\<lambda>x. _)(i1 := False, i2 := True, i3 := True),
% 29.48/14.10 i2 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False),
% 29.48/14.10 i3 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False))
% 29.48/14.10 bnd_actual_world = (\<lambda>x. _)(i1 := True, i2 := True, i3 := False)
% 29.48/14.10 bnd_agent =
% 29.48/14.10 (\<lambda>x. _)
% 29.48/14.10 (i1 := (\<lambda>x. _)
% 29.48/14.10 (i1 := (\<lambda>x. _)(i1 := True, i2 := True, i3 := True),
% 29.48/14.10 i2 := (\<lambda>x. _)(i1 := True, i2 := True, i3 := True),
% 29.48/14.10 i3 := (\<lambda>x. _)(i1 := True, i2 := True, i3 := True)),
% 29.48/14.10 i2 := (\<lambda>x. _)
% 29.48/14.10 (i1 := (\<lambda>x. _)(i1 := True, i2 := True, i3 := True),
% 29.48/14.10 i2 := (\<lambda>x. _)(i1 := True, i2 := True, i3 := True),
% 29.48/14.10 i3 := (\<lambda>x. _)(i1 := True, i2 := True, i3 := True)),
% 29.48/14.10 i3 := (\<lambda>x. _)
% 29.48/14.10 (i1 := (\<lambda>x. _)(i1 := True, i2 := True, i3 := True),
% 29.48/14.10 i2 := (\<lambda>x. _)(i1 := True, i2 := True, i3 := True),
% 29.48/14.10 i3 := (\<lambda>x. _)(i1 := True, i2 := True, i3 := True)))
% 29.48/14.10 bnd_animate =
% 29.48/14.10 (\<lambda>x. _)
% 29.48/14.10 (i1 := (\<lambda>x. _)(i1 := True, i2 := False, i3 := False),
% 29.48/14.10 i2 := (\<lambda>x. _)(i1 := True, i2 := False, i3 := False),
% 29.48/14.10 i3 := (\<lambda>x. _)(i1 := True, i2 := False, i3 := False))
% 29.48/14.10 bnd_be =
% 29.48/14.10 (\<lambda>x. _)
% 29.48/14.10 (i1 := (\<lambda>x. _)
% 29.48/14.10 (i1 := (\<lambda>x. _)
% 29.48/14.10 (i1 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False),
% 29.48/14.10 i2 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False),
% 29.48/14.10 i3 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False)),
% 29.48/14.10 i2 := (\<lambda>x. _)
% 29.48/14.10 (i1 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False),
% 29.48/14.10 i2 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False),
% 29.48/14.10 i3 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False)),
% 29.48/14.10 i3 := (\<lambda>x. _)
% 29.48/14.10 (i1 := (\<lambda>x. _)(i1 := True, i2 := False, i3 := False),
% 29.48/14.10 i2 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False),
% 29.48/14.10 i3 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False))),
% 29.48/14.10 i2 := (\<lambda>x. _)
% 29.48/14.10 (i1 := (\<lambda>x. _)
% 29.48/14.10 (i1 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False),
% 29.48/14.10 i2 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False),
% 29.48/14.10 i3 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False)),
% 29.48/14.10 i2 := (\<lambda>x. _)
% 29.48/14.10 (i1 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False),
% 29.48/14.10 i2 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False),
% 29.48/14.10 i3 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False)),
% 29.48/14.10 i3 := (\<lambda>x. _)
% 29.48/14.10 (i1 := (\<lambda>x. _)(i1 := True, i2 := False, i3 := False),
% 29.48/14.10 i2 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False),
% 29.48/14.10 i3 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False))),
% 29.48/14.10 i3 := (\<lambda>x. _)
% 29.48/14.10 (i1 := (\<lambda>x. _)
% 29.48/14.10 (i1 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False),
% 29.48/14.10 i2 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False),
% 29.48/14.10 i3 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False)),
% 29.48/14.10 i2 := (\<lambda>x. _)
% 29.48/14.10 (i1 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False),
% 29.48/14.10 i2 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False),
% 29.48/14.10 i3 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False)),
% 29.48/14.10 i3 := (\<lambda>x. _)
% 29.48/14.10 (i1 := (\<lambda>x. _)(i1 := True, i2 := False, i3 := False),
% 29.48/14.10 i2 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False),
% 29.48/14.10 i3 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False))))
% 29.48/14.10 bnd_entity =
% 29.48/14.10 (\<lambda>x. _)
% 29.48/14.10 (i1 := (\<lambda>x. _)(i1 := True, i2 := False, i3 := False),
% 29.48/14.10 i2 := (\<lambda>x. _)(i1 := True, i2 := False, i3 := False),
% 29.48/14.10 i3 := (\<lambda>x. _)(i1 := True, i2 := False, i3 := False))
% 29.48/14.10 bnd_event =
% 29.48/14.10 (\<lambda>x. _)
% 29.48/14.10 (i1 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := True),
% 29.48/14.10 i2 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := True),
% 29.48/14.10 i3 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := True))
% 29.48/14.10 bnd_eventuality =
% 29.48/14.10 (\<lambda>x. _)
% 29.48/14.10 (i1 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := True),
% 29.48/14.10 i2 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := True),
% 29.48/14.10 i3 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := True))
% 29.48/14.10 bnd_existent =
% 29.48/14.10 (\<lambda>x. _)
% 29.48/14.10 (i1 := (\<lambda>x. _)(i1 := True, i2 := False, i3 := False),
% 29.48/14.10 i2 := (\<lambda>x. _)(i1 := True, i2 := True, i3 := False),
% 29.48/14.10 i3 := (\<lambda>x. _)(i1 := True, i2 := True, i3 := False))
% 29.48/14.10 bnd_forename =
% 29.48/14.10 (\<lambda>x. _)
% 29.48/14.10 (i1 := (\<lambda>x. _)(i1 := False, i2 := True, i3 := False),
% 29.48/14.10 i2 := (\<lambda>x. _)(i1 := False, i2 := True, i3 := False),
% 29.48/14.10 i3 := (\<lambda>x. _)(i1 := False, i2 := True, i3 := False))
% 29.48/14.10 bnd_general =
% 29.48/14.10 (\<lambda>x. _)
% 29.48/14.10 (i1 := (\<lambda>x. _)(i1 := False, i2 := True, i3 := False),
% 29.48/14.10 i2 := (\<lambda>x. _)(i1 := False, i2 := True, i3 := False),
% 29.48/14.10 i3 := (\<lambda>x. _)(i1 := False, i2 := True, i3 := False))
% 29.48/14.10 bnd_human =
% 29.48/14.10 (\<lambda>x. _)
% 29.48/14.10 (i1 := (\<lambda>x. _)(i1 := True, i2 := False, i3 := False),
% 29.48/14.10 i2 := (\<lambda>x. _)(i1 := True, i2 := False, i3 := True),
% 29.48/14.10 i3 := (\<lambda>x. _)(i1 := True, i2 := False, i3 := True))
% 29.48/14.10 bnd_human_person =
% 29.48/14.10 (\<lambda>x. _)
% 29.48/14.10 (i1 := (\<lambda>x. _)(i1 := True, i2 := False, i3 := False),
% 29.48/14.10 i2 := (\<lambda>x. _)(i1 := True, i2 := False, i3 := False),
% 29.48/14.10 i3 := (\<lambda>x. _)(i1 := True, i2 := False, i3 := False))
% 29.48/14.10 bnd_impartial =
% 29.48/14.10 (\<lambda>x. _)
% 29.48/14.10 (i1 := (\<lambda>x. _)(i1 := True, i2 := False, i3 := False),
% 29.48/14.10 i2 := (\<lambda>x. _)(i1 := True, i2 := False, i3 := False),
% 29.48/14.10 i3 := (\<lambda>x. _)(i1 := True, i2 := False, i3 := False))
% 29.48/14.10 bnd_jules_forename =
% 29.48/14.10 (\<lambda>x. _)
% 29.48/14.10 (i1 := (\<lambda>x. _)(i1 := False, i2 := True, i3 := False),
% 29.48/14.10 i2 := (\<lambda>x. _)(i1 := False, i2 := True, i3 := False),
% 29.48/14.10 i3 := (\<lambda>x. _)(i1 := False, i2 := True, i3 := False))
% 29.48/14.10 bnd_living =
% 29.48/14.10 (\<lambda>x. _)
% 29.48/14.10 (i1 := (\<lambda>x. _)(i1 := True, i2 := False, i3 := False),
% 29.48/14.10 i2 := (\<lambda>x. _)(i1 := True, i2 := False, i3 := False),
% 29.48/14.10 i3 := (\<lambda>x. _)(i1 := True, i2 := False, i3 := False))
% 29.48/14.10 bnd_male =
% 29.48/14.10 (\<lambda>x. _)
% 29.48/14.10 (i1 := (\<lambda>x. _)(i1 := True, i2 := False, i3 := False),
% 29.48/14.10 i2 := (\<lambda>x. _)(i1 := True, i2 := False, i3 := False),
% 29.48/14.10 i3 := (\<lambda>x. _)(i1 := True, i2 := False, i3 := False))
% 29.48/14.10 bnd_man =
% 29.48/14.10 (\<lambda>x. _)
% 29.48/14.10 (i1 := (\<lambda>x. _)(i1 := True, i2 := False, i3 := False),
% 29.48/14.10 i2 := (\<lambda>x. _)(i1 := True, i2 := False, i3 := False),
% 29.48/14.10 i3 := (\<lambda>x. _)(i1 := True, i2 := False, i3 := False))
% 29.48/14.10 bnd_nonexistent =
% 29.48/14.10 (\<lambda>x. _)
% 29.48/14.10 (i1 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := True),
% 29.48/14.10 i2 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := True),
% 29.48/14.10 i3 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := True))
% 29.48/14.10 bnd_nonhuman =
% 29.48/14.10 (\<lambda>x. _)
% 29.48/14.10 (i1 := (\<lambda>x. _)(i1 := False, i2 := True, i3 := False),
% 29.48/14.10 i2 := (\<lambda>x. _)(i1 := False, i2 := True, i3 := False),
% 29.48/14.10 i3 := (\<lambda>x. _)(i1 := False, i2 := True, i3 := False))
% 29.48/14.10 bnd_of =
% 29.48/14.10 (\<lambda>x. _)
% 29.48/14.10 (i1 := (\<lambda>x. _)
% 29.48/14.10 (i1 := (\<lambda>x. _)(i1 := True, i2 := True, i3 := True),
% 29.48/14.10 i2 := (\<lambda>x. _)(i1 := True, i2 := True, i3 := True),
% 29.48/14.10 i3 := (\<lambda>x. _)(i1 := True, i2 := True, i3 := True)),
% 29.48/14.10 i2 := (\<lambda>x. _)
% 29.48/14.10 (i1 := (\<lambda>x. _)(i1 := True, i2 := True, i3 := True),
% 29.48/14.10 i2 := (\<lambda>x. _)(i1 := True, i2 := True, i3 := True),
% 29.48/14.10 i3 := (\<lambda>x. _)(i1 := True, i2 := True, i3 := True)),
% 29.48/14.10 i3 := (\<lambda>x. _)
% 29.48/14.10 (i1 := (\<lambda>x. _)(i1 := True, i2 := True, i3 := True),
% 29.48/14.10 i2 := (\<lambda>x. _)(i1 := True, i2 := True, i3 := True),
% 29.48/14.10 i3 := (\<lambda>x. _)(i1 := True, i2 := True, i3 := True)))
% 29.48/14.10 bnd_organism =
% 29.48/14.10 (\<lambda>x. _)
% 29.48/14.10 (i1 := (\<lambda>x. _)(i1 := True, i2 := False, i3 := False),
% 29.48/14.10 i2 := (\<lambda>x. _)(i1 := True, i2 := False, i3 := False),
% 29.48/14.10 i3 := (\<lambda>x. _)(i1 := True, i2 := False, i3 := False))
% 29.48/14.10 bnd_present =
% 29.48/14.10 (\<lambda>x. _)
% 29.48/14.10 (i1 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := True),
% 29.48/14.10 i2 := (\<lambda>x. _)(i1 := True, i2 := True, i3 := True),
% 29.48/14.10 i3 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := True))
% 29.48/14.10 bnd_proposition =
% 29.48/14.10 (\<lambda>x. _)
% 29.48/14.10 (i1 := (\<lambda>x. _)(i1 := False, i2 := True, i3 := False),
% 29.48/14.10 i2 := (\<lambda>x. _)(i1 := False, i2 := True, i3 := False),
% 29.48/14.10 i3 := (\<lambda>x. _)(i1 := False, i2 := True, i3 := False))
% 29.48/14.10 bnd_relation =
% 29.48/14.10 (\<lambda>x. _)
% 29.48/14.10 (i1 := (\<lambda>x. _)(i1 := False, i2 := True, i3 := False),
% 29.48/14.10 i2 := (\<lambda>x. _)(i1 := False, i2 := True, i3 := False),
% 29.48/14.10 i3 := (\<lambda>x. _)(i1 := False, i2 := True, i3 := False))
% 29.48/14.10 bnd_relname =
% 29.48/14.10 (\<lambda>x. _)
% 29.48/14.10 (i1 := (\<lambda>x. _)(i1 := False, i2 := True, i3 := False),
% 29.48/14.10 i2 := (\<lambda>x. _)(i1 := False, i2 := True, i3 := False),
% 29.48/14.10 i3 := (\<lambda>x. _)(i1 := False, i2 := True, i3 := False))
% 29.48/14.10 bnd_singleton =
% 29.48/14.10 (\<lambda>x. _)
% 29.48/14.10 (i1 := (\<lambda>x. _)(i1 := True, i2 := True, i3 := True),
% 29.48/14.10 i2 := (\<lambda>x. _)(i1 := True, i2 := True, i3 := True),
% 29.48/14.10 i3 := (\<lambda>x. _)(i1 := True, i2 := True, i3 := True))
% 29.48/14.10 bnd_smoke =
% 29.48/14.10 (\<lambda>x. _)
% 29.48/14.10 (i1 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := True),
% 29.48/14.10 i2 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := True),
% 29.48/14.10 i3 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := True))
% 29.48/14.10 bnd_specific =
% 29.48/14.10 (\<lambda>x. _)
% 29.48/14.10 (i1 := (\<lambda>x. _)(i1 := True, i2 := False, i3 := True),
% 29.48/14.10 i2 := (\<lambda>x. _)(i1 := True, i2 := False, i3 := True),
% 29.48/14.10 i3 := (\<lambda>x. _)(i1 := True, i2 := False, i3 := True))
% 29.48/14.10 bnd_state =
% 29.48/14.10 (\<lambda>x. _)
% 29.48/14.10 (i1 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := True),
% 29.48/14.10 i2 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := True),
% 29.48/14.10 i3 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := True))
% 29.48/14.10 bnd_theme =
% 29.48/14.10 (\<lambda>x. _)
% 29.48/14.10 (i1 := (\<lambda>x. _)
% 29.48/14.10 (i1 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False),
% 29.48/14.10 i2 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := False),
% 29.48/14.10 i3 := (\<lambda>x. _)(i1 := False, i2 := True, i3 := False)),
% 29.48/14.10 i2 := (\<lambda>x. _)
% 29.48/14.10 (i1 := (\<lambda>x. _)(i1 := True, i2 := True, i3 := True),
% 29.48/14.10 i2 := (\<lambda>x. _)(i1 := True, i2 := True, i3 := True),
% 29.48/14.10 i3 := (\<lambda>x. _)(i1 := False, i2 := True, i3 := False)),
% 29.48/14.10 i3 := (\<lambda>x. _)
% 29.48/14.10 (i1 := (\<lambda>x. _)(i1 := True, i2 := True, i3 := True),
% 29.48/14.10 i2 := (\<lambda>x. _)(i1 := True, i2 := True, i3 := True),
% 29.48/14.10 i3 := (\<lambda>x. _)(i1 := False, i2 := True, i3 := True)))
% 29.48/14.10 bnd_thing =
% 29.48/14.10 (\<lambda>x. _)
% 29.48/14.10 (i1 := (\<lambda>x. _)(i1 := True, i2 := True, i3 := True),
% 29.48/14.10 i2 := (\<lambda>x. _)(i1 := True, i2 := True, i3 := True),
% 29.48/14.10 i3 := (\<lambda>x. _)(i1 := True, i2 := True, i3 := True))
% 29.48/14.10 bnd_think_believe_consider =
% 29.48/14.10 (\<lambda>x. _)
% 29.48/14.10 (i1 := (\<lambda>x. _)(i1 := False, i2 := False, i3 := True),
% 29.48/14.10 i2 := (\<lambda>x. _)(i1 := True, i2 := True, i3 := True),
% 29.48/14.10 i3 := (\<lambda>x. _)(i1 := True, i2 := True, i3 := True))
% 29.48/14.10 bnd_unisex =
% 29.48/14.10 (\<lambda>x. _)
% 29.48/14.10 (i1 := (\<lambda>x. _)(i1 := False, i2 := True, i3 := True),
% 29.48/14.10 i2 := (\<lambda>x. _)(i1 := False, i2 := True, i3 := True),
% 29.48/14.10 i3 := (\<lambda>x. _)(i1 := False, i2 := True, i3 := True))
% 29.48/14.10 bnd_vincent_forename =
% 29.48/14.10 (\<lambda>x. _)
% 29.48/14.10 (i1 := (\<lambda>x. _)(i1 := False, i2 := True, i3 := False),
% 29.48/14.10 i2 := (\<lambda>x. _)(i1 := False, i2 := True, i3 := False),
% 29.48/14.10 i3 := (\<lambda>x. _)(i1 := False, i2 := True, i3 := False))
% 29.48/14.10 % SZS output end FiniteModel
% 29.48/14.10 Total time: 5.2 s
%------------------------------------------------------------------------------