TSTP Solution File: SEV516+1 by Nitpick---2016
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Nitpick---2016
% Problem : SEV516+1 : TPTP v7.0.0. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : isabelle tptp_nitpick %d %s
% Computer : n122.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 : Wed Jan 18 14:57:26 EST 2017
% Result : CounterSatisfiable 23.40s
% Output : FiniteModel 23.40s
% 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 : SEV516+1 : TPTP v7.0.0. Released v7.0.0.
% 0.00/0.04 % Command : isabelle tptp_nitpick %d %s
% 0.03/0.23 % Computer : n122.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 : Mon Jan 16 00:38:34 CST 2017
% 0.03/0.23 % CPUTime :
% 23.40/9.64 Nitpicking formula...
% 23.40/9.64 Timestamp: 00:38:42
% 23.40/9.64 Using SAT solver "Lingeling_JNI" The following solvers are configured:
% 23.40/9.64 "Lingeling_JNI", "CryptoMiniSat_JNI", "MiniSat_JNI", "SAT4J", "SAT4J_Light"
% 23.40/9.64 Batch 1 of 20: Trying 5 scopes:
% 23.40/9.64 card TPTP_Interpret.ind = 1
% 23.40/9.64 card TPTP_Interpret.ind = 2
% 23.40/9.64 card TPTP_Interpret.ind = 3
% 23.40/9.64 card TPTP_Interpret.ind = 4
% 23.40/9.64 card TPTP_Interpret.ind = 5
% 23.40/9.64 % SZS status CounterSatisfiable % SZS output start FiniteModel
% 23.40/9.64 Nitpick found a counterexample for card TPTP_Interpret.ind = 2:
% 23.40/9.64
% 23.40/9.64 Skolem constants:
% 23.40/9.64 A = i1
% 23.40/9.64 \<lambda>A. B = (\<lambda>x. _)(i1 := i2, i2 := i2)
% 23.40/9.64 \<lambda>A. B = (\<lambda>x. _)(i1 := i1, i2 := i2)
% 23.40/9.64 \<lambda>A B. C =
% 23.40/9.64 (\<lambda>x. _)
% 23.40/9.64 (i1 := (\<lambda>x. _)(i1 := i1, i2 := i2),
% 23.40/9.64 i2 := (\<lambda>x. _)(i1 := i1, i2 := i2))
% 23.40/9.64 \<lambda>B. C = (\<lambda>x. _)(i1 := i1, i2 := i1)
% 23.40/9.64 D = i1
% 23.40/9.64 D = i1
% 23.40/9.64 \<lambda>D. E = (\<lambda>x. _)(i1 := i1, i2 := i1)
% 23.40/9.64 Constants:
% 23.40/9.64 bnd_g_both =
% 23.40/9.64 (\<lambda>x. _)
% 23.40/9.64 (i1 := (\<lambda>x. _)(i1 := False, i2 := False),
% 23.40/9.64 i2 := (\<lambda>x. _)(i1 := False, i2 := True))
% 23.40/9.64 bnd_g_false =
% 23.40/9.64 (\<lambda>x. _)
% 23.40/9.64 (i1 := (\<lambda>x. _)(i1 := False, i2 := True),
% 23.40/9.64 i2 := (\<lambda>x. _)(i1 := False, i2 := True))
% 23.40/9.64 bnd_g_false_only =
% 23.40/9.64 (\<lambda>x. _)
% 23.40/9.64 (i1 := (\<lambda>x. _)(i1 := False, i2 := True),
% 23.40/9.64 i2 := (\<lambda>x. _)(i1 := False, i2 := False))
% 23.40/9.64 bnd_g_true =
% 23.40/9.64 (\<lambda>x. _)
% 23.40/9.64 (i1 := (\<lambda>x. _)(i1 := True, i2 := False),
% 23.40/9.64 i2 := (\<lambda>x. _)(i1 := True, i2 := True))
% 23.40/9.64 bnd_g_true_only =
% 23.40/9.64 (\<lambda>x. _)
% 23.40/9.64 (i1 := (\<lambda>x. _)(i1 := True, i2 := False),
% 23.40/9.64 i2 := (\<lambda>x. _)(i1 := True, i2 := False))
% 23.40/9.64 % SZS output end FiniteModel
% 23.40/9.64 Total time: 885 ms
%------------------------------------------------------------------------------