TSTP Solution File: LCL252-1 by Nitpick---2016
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Nitpick---2016
% Problem : LCL252-1 : TPTP v6.4.0. Bugfixed v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : isabelle tptp_nitpick %d %s
% Computer : n035.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:23 EST 2017
% Result : Satisfiable 29.24s
% Output : FiniteModel 29.24s
% 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 : LCL252-1 : TPTP v6.4.0. Bugfixed v2.3.0.
% 0.00/0.04 % Command : isabelle tptp_nitpick %d %s
% 0.03/0.23 % Computer : n035.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:33 CST 2017
% 0.03/0.23 % CPUTime :
% 29.24/16.49 Nitpicking formula...
% 29.24/16.49 Timestamp: 12:17:42
% 29.24/16.49 Using SAT solver "Lingeling_JNI" The following solvers are configured:
% 29.24/16.49 "Lingeling_JNI", "CryptoMiniSat_JNI", "MiniSat_JNI", "SAT4J", "SAT4J_Light"
% 29.24/16.49 Batch 1 of 20: Trying 5 scopes:
% 29.24/16.49 card TPTP_Interpret.ind = 1
% 29.24/16.49 card TPTP_Interpret.ind = 2
% 29.24/16.49 card TPTP_Interpret.ind = 3
% 29.24/16.49 card TPTP_Interpret.ind = 4
% 29.24/16.49 card TPTP_Interpret.ind = 5
% 29.24/16.49 % SZS status Satisfiable % SZS output start FiniteModel
% 29.24/16.49 Nitpick found a model for card TPTP_Interpret.ind = 5:
% 29.24/16.49
% 29.24/16.49 Constants:
% 29.24/16.49 bnd_axiom =
% 29.24/16.49 (\<lambda>x. _)
% 29.24/16.49 (i1 := False, i2 := True, i3 := True, i4 := False, i5 := False)
% 29.24/16.49 bnd_not =
% 29.24/16.49 (\<lambda>x. _)(i1 := i5, i2 := i3, i3 := i1, i4 := i1, i5 := i3)
% 29.24/16.49 bnd_or =
% 29.24/16.49 (\<lambda>x. _)
% 29.24/16.49 (i1 := (\<lambda>x. _)
% 29.24/16.49 (i1 := i1, i2 := i5, i3 := i3, i4 := i3, i5 := i5),
% 29.24/16.49 i2 := (\<lambda>x. _)
% 29.24/16.49 (i1 := i2, i2 := i2, i3 := i3, i4 := i3, i5 := i2),
% 29.24/16.49 i3 := (\<lambda>x. _)
% 29.24/16.49 (i1 := i4, i2 := i3, i3 := i3, i4 := i3, i5 := i3),
% 29.24/16.49 i4 := (\<lambda>x. _)
% 29.24/16.49 (i1 := i3, i2 := i3, i3 := i3, i4 := i3, i5 := i3),
% 29.24/16.49 i5 := (\<lambda>x. _)
% 29.24/16.49 (i1 := i2, i2 := i2, i3 := i3, i4 := i3, i5 := i2))
% 29.24/16.49 bnd_p = i1
% 29.24/16.49 bnd_q = i5
% 29.24/16.49 bnd_r = i4
% 29.24/16.49 bnd_theorem =
% 29.24/16.49 (\<lambda>x. _)
% 29.24/16.49 (i1 := False, i2 := True, i3 := True, i4 := True, i5 := True)
% 29.24/16.49 % SZS output end FiniteModel
% 29.24/16.49 Total time: 7.1 s
%------------------------------------------------------------------------------