TSTP Solution File: LCL219-1 by Nitpick---2016
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Nitpick---2016
% Problem : LCL219-1 : TPTP v6.4.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : isabelle tptp_nitpick %d %s
% Computer : n037.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:13 EST 2017
% Result : Satisfiable 28.95s
% Output : FiniteModel 28.95s
% 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 : LCL219-1 : TPTP v6.4.0. Released v1.1.0.
% 0.00/0.04 % Command : isabelle tptp_nitpick %d %s
% 0.03/0.24 % Computer : n037.star.cs.uiowa.edu
% 0.03/0.24 % Model : x86_64 x86_64
% 0.03/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.03/0.24 % Memory : 32218.75MB
% 0.03/0.24 % OS : Linux 3.10.0-327.36.3.el7.x86_64
% 0.03/0.24 % CPULimit : 300
% 0.03/0.24 % DateTime : Sat Jan 14 13:17:04 CST 2017
% 0.03/0.24 % CPUTime :
% 28.95/14.47 Nitpicking formula...
% 28.95/14.47 Timestamp: 13:17:14
% 28.95/14.47 Using SAT solver "Lingeling_JNI" The following solvers are configured:
% 28.95/14.47 "Lingeling_JNI", "CryptoMiniSat_JNI", "MiniSat_JNI", "SAT4J", "SAT4J_Light"
% 28.95/14.47 Batch 1 of 20: Trying 5 scopes:
% 28.95/14.47 card TPTP_Interpret.ind = 1
% 28.95/14.47 card TPTP_Interpret.ind = 2
% 28.95/14.47 card TPTP_Interpret.ind = 3
% 28.95/14.47 card TPTP_Interpret.ind = 4
% 28.95/14.47 card TPTP_Interpret.ind = 5
% 28.95/14.47 % SZS status Satisfiable % SZS output start FiniteModel
% 28.95/14.47 Nitpick found a model for card TPTP_Interpret.ind = 5:
% 28.95/14.47
% 28.95/14.47 Constants:
% 28.95/14.47 bnd_axiom =
% 28.95/14.47 (\<lambda>x. _)
% 28.95/14.47 (i1 := False, i2 := False, i3 := False, i4 := True, i5 := True)
% 28.95/14.47 bnd_not =
% 28.95/14.47 (\<lambda>x. _)(i1 := i3, i2 := i1, i3 := i2, i4 := i2, i5 := i1)
% 28.95/14.47 bnd_or =
% 28.95/14.47 (\<lambda>x. _)
% 28.95/14.47 (i1 := (\<lambda>x. _)
% 28.95/14.47 (i1 := i1, i2 := i5, i3 := i3, i4 := i3, i5 := i5),
% 28.95/14.47 i2 := (\<lambda>x. _)
% 28.95/14.47 (i1 := i2, i2 := i2, i3 := i5, i4 := i5, i5 := i5),
% 28.95/14.47 i3 := (\<lambda>x. _)
% 28.95/14.47 (i1 := i4, i2 := i5, i3 := i4, i4 := i4, i5 := i5),
% 28.95/14.47 i4 := (\<lambda>x. _)
% 28.95/14.47 (i1 := i4, i2 := i5, i3 := i4, i4 := i3, i5 := i5),
% 28.95/14.47 i5 := (\<lambda>x. _)
% 28.95/14.47 (i1 := i2, i2 := i5, i3 := i5, i4 := i5, i5 := i5))
% 28.95/14.47 bnd_p = i1
% 28.95/14.47 bnd_q = i1
% 28.95/14.47 bnd_theorem =
% 28.95/14.47 (\<lambda>x. _)
% 28.95/14.47 (i1 := False, i2 := True, i3 := True, i4 := True, i5 := True)
% 28.95/14.47 % SZS output end FiniteModel
% 28.95/14.47 Total time: 4.3 s
%------------------------------------------------------------------------------