TSTP Solution File: KRS033+1 by Refute---2015

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Refute---2015
% Problem  : KRS033+1 : TPTP v6.4.0. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : isabelle tptp_refute %d %s

% Computer : n088.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.10.1.el7.x86_64
% CPULimit : 300s
% DateTime : Tue Apr 12 16:22:02 EDT 2016

% Result   : Timeout 298.63s
% Output   : None 
% Verified : 
% SZS Type : None (Parsing solution fails)
% Syntax   : Number of formulae    : 0

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : KRS033+1 : TPTP v6.4.0. Released v3.1.0.
% 0.00/0.04  % Command  : isabelle tptp_refute %d %s
% 0.03/0.22  % Computer : n088.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.10.1.el7.x86_64
% 0.03/0.22  % CPULimit : 300
% 0.03/0.22  % DateTime : Sun Apr 10 11:55:54 CDT 2016
% 0.03/0.22  % CPUTime  : 
% 6.30/5.83  > val it = (): unit
% 6.50/6.04  Trying to find a model that refutes: True
% 6.90/6.47  Unfolded term: [| bnd_cSatisfiable bnd_i2003_11_14_17_15_37698;
% 6.90/6.47     ALL X. bnd_cp4 X --> ~ bnd_cp5 X;
% 6.90/6.47     ALL X. bnd_cp3 X --> ~ (bnd_cp4 X | bnd_cp5 X);
% 6.90/6.47     ALL X. bnd_cp2 X --> ~ ((bnd_cp4 X | bnd_cp3 X) | bnd_cp5 X);
% 6.90/6.47     ALL X.
% 6.90/6.47        bnd_cp1 X --> ~ (((bnd_cp4 X | bnd_cp3 X) | bnd_cp2 X) | bnd_cp5 X);
% 6.90/6.47     ALL X.
% 6.90/6.47        bnd_cSatisfiable X =
% 6.90/6.47        (((((((((EX Y. (bnd_rr X Y & bnd_cp3 Y) & bnd_cp Y) &
% 6.90/6.47                (EX Y. (bnd_rr X Y & bnd_cp2 Y) & bnd_cp Y)) &
% 6.90/6.47               (EX Y. (bnd_rr X Y & bnd_cp Y) & bnd_cp1 Y)) &
% 6.90/6.47              (ALL Y0 Y1 Y2 Y3 Y4.
% 6.90/6.47                  (((bnd_rr X Y0 & bnd_rr X Y1) & bnd_rr X Y2) &
% 6.90/6.47                   bnd_rr X Y3) &
% 6.90/6.47                  bnd_rr X Y4 -->
% 6.90/6.47                  ((((((((Y0 = Y1 | Y0 = Y2) | Y0 = Y3) | Y0 = Y4) |
% 6.90/6.47                       Y1 = Y2) |
% 6.90/6.47                      Y1 = Y3) |
% 6.90/6.47                     Y1 = Y4) |
% 6.90/6.47                    Y2 = Y3) |
% 6.90/6.47                   Y2 = Y4) |
% 6.90/6.47                  Y3 = Y4)) &
% 6.90/6.47             (EX Y. bnd_rr X Y & bnd_cp4 Y)) &
% 6.90/6.47            (EX Y. bnd_rr X Y & bnd_cp3 Y)) &
% 6.90/6.47           (EX Y. bnd_rr X Y & bnd_cp1 Y)) &
% 6.90/6.47          (EX Y. (bnd_rr X Y & bnd_cp4 Y) & bnd_cp Y)) &
% 6.90/6.47         (EX Y. bnd_rr X Y & bnd_cp2 Y));
% 6.90/6.47     ALL X. bnd_xsd_string X = (~ bnd_xsd_integer X);
% 6.90/6.47     ALL X. bnd_cowlThing X & ~ bnd_cowlNothing X;
% 6.90/6.47     ALL A B. A = B & bnd_xsd_string A --> bnd_xsd_string B;
% 6.90/6.47     ALL A B. A = B & bnd_xsd_integer A --> bnd_xsd_integer B;
% 6.90/6.47     ALL A B C. A = B & bnd_rr C A --> bnd_rr C B;
% 6.90/6.47     ALL A B C. A = B & bnd_rr A C --> bnd_rr B C;
% 6.90/6.47     ALL A B. A = B & bnd_cp5 A --> bnd_cp5 B;
% 6.90/6.47     ALL A B. A = B & bnd_cp4 A --> bnd_cp4 B;
% 6.90/6.47     ALL A B. A = B & bnd_cp3 A --> bnd_cp3 B;
% 6.90/6.47     ALL A B. A = B & bnd_cp2 A --> bnd_cp2 B;
% 6.90/6.47     ALL A B. A = B & bnd_cp1 A --> bnd_cp1 B;
% 6.90/6.47     ALL A B. A = B & bnd_cp A --> bnd_cp B;
% 6.90/6.47     ALL A B. A = B & bnd_cowlThing A --> bnd_cowlThing B;
% 6.90/6.47     ALL A B. A = B & bnd_cowlNothing A --> bnd_cowlNothing B;
% 6.90/6.47     ALL A B. A = B & bnd_cSatisfiable A --> bnd_cSatisfiable B |]
% 6.90/6.47  ==> True
% 6.90/6.47  Adding axioms...
% 6.90/6.48  Typedef.type_definition_def
% 9.21/8.77   ...done.
% 9.21/8.78  Ground types: ?'b, TPTP_Interpret.ind
% 9.21/8.78  Translating term (sizes: 1, 1) ...
% 11.11/10.69  Invoking SAT solver...
% 11.11/10.69  No model exists.
% 11.11/10.69  Translating term (sizes: 2, 1) ...
% 13.72/13.28  Invoking SAT solver...
% 13.72/13.28  No model exists.
% 13.72/13.28  Translating term (sizes: 1, 2) ...
% 28.73/28.28  Invoking SAT solver...
% 28.73/28.28  No model exists.
% 28.73/28.28  Translating term (sizes: 3, 1) ...
% 33.66/33.18  Invoking SAT solver...
% 33.66/33.18  No model exists.
% 33.66/33.18  Translating term (sizes: 2, 2) ...
% 56.39/55.88  Invoking SAT solver...
% 56.39/55.88  No model exists.
% 56.39/55.88  Translating term (sizes: 1, 3) ...
% 183.73/182.77  Invoking SAT solver...
% 183.73/182.77  No model exists.
% 183.73/182.77  Translating term (sizes: 4, 1) ...
% 195.90/194.82  Invoking SAT solver...
% 195.90/194.82  No model exists.
% 195.90/194.82  Translating term (sizes: 3, 2) ...
% 298.63/296.82  Invoking SAT solver...
% 298.63/296.82  No model exists.
% 298.63/296.82  Translating term (sizes: 2, 3) ...
% 300.07/298.23  /export/starexec/sandbox2/solver/lib/scripts/run-polyml-5.5.2: line 82: 23900 CPU time limit exceeded (core dumped) "$ISABELLE_HOME/lib/scripts/feeder" -p -h "$MLTEXT" -t "$MLEXIT" $FEEDER_OPTS
% 300.07/298.23       23901                       (core dumped) | { read FPID; "$POLY" -q -i $ML_OPTIONS; RC="$?"; kill -TERM "$FPID"; exit "$RC"; }
% 300.07/298.24  /export/starexec/sandbox2/solver/src/HOL/TPTP/lib/Tools/tptp_refute: line 26: 23846 Exit 152                "$ISABELLE_PROCESS" -q -e "use_thy \"/tmp/$SCRATCH\"; exit 1;" HOL-TPTP
% 300.07/298.24       23847 CPU time limit exceeded (core dumped) | grep --line-buffered -v "^###\|^PROOF FAILED for depth\|^Failure node\|inferences so far.  Searching to depth\|^val \|^Loading theory\|^Warning-The type of\|^   monotype.$"
%------------------------------------------------------------------------------