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

View Problem - Process Solution

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

% Computer : n112.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:03 EDT 2016

% Result   : Timeout 300.04s
% 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  : KRS045+1 : TPTP v6.4.0. Released v3.1.0.
% 0.00/0.04  % Command  : isabelle tptp_refute %d %s
% 0.02/0.23  % Computer : n112.star.cs.uiowa.edu
% 0.02/0.23  % Model    : x86_64 x86_64
% 0.02/0.23  % CPU      : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/0.23  % Memory   : 32218.75MB
% 0.02/0.23  % OS       : Linux 3.10.0-327.10.1.el7.x86_64
% 0.02/0.23  % CPULimit : 300
% 0.02/0.23  % DateTime : Sun Apr 10 11:59:54 CDT 2016
% 0.02/0.23  % CPUTime  : 
% 6.30/5.85  > val it = (): unit
% 6.51/6.05  Trying to find a model that refutes: True
% 6.91/6.40  Unfolded term: [| ALL X Y. bnd_rr X Y --> bnd_rf2 X Y; ALL X Y. bnd_rr X Y --> bnd_rf1 X Y;
% 6.91/6.40     bnd_cSatisfiable bnd_i2003_11_14_17_16_21280;
% 6.91/6.40     ALL X.
% 6.91/6.40        bnd_cowlThing X -->
% 6.91/6.40        (ALL Y0 Y1. bnd_rf2 X Y0 & bnd_rf2 X Y1 --> Y0 = Y1);
% 6.91/6.40     ALL X.
% 6.91/6.40        bnd_cowlThing X -->
% 6.91/6.40        (ALL Y0 Y1. bnd_rf1 X Y0 & bnd_rf1 X Y1 --> Y0 = Y1);
% 6.91/6.40     ALL X. bnd_cp2xcomp X = Ex (bnd_ra_Px1 X);
% 6.91/6.40     ALL X. bnd_cp2 X = (~ Ex (bnd_ra_Px1 X));
% 6.91/6.40     ALL X. bnd_cp1 X --> bnd_cp2xcomp X;
% 6.91/6.40     ALL X.
% 6.91/6.40        bnd_cSatisfiable X =
% 6.91/6.40        ((EX Y. bnd_rf2 X Y & bnd_cp2 Y) & (EX Y. bnd_rf1 X Y & bnd_cp1 Y));
% 6.91/6.40     ALL X. bnd_xsd_string X = (~ bnd_xsd_integer X);
% 6.91/6.40     ALL X. bnd_cowlThing X & ~ bnd_cowlNothing X;
% 6.91/6.40     ALL A B. A = B & bnd_xsd_string A --> bnd_xsd_string B;
% 6.91/6.40     ALL A B. A = B & bnd_xsd_integer A --> bnd_xsd_integer B;
% 6.91/6.40     ALL A B C. A = B & bnd_rr C A --> bnd_rr C B;
% 6.91/6.40     ALL A B C. A = B & bnd_rr A C --> bnd_rr B C;
% 6.91/6.40     ALL A B C. A = B & bnd_rf2 C A --> bnd_rf2 C B;
% 6.91/6.40     ALL A B C. A = B & bnd_rf2 A C --> bnd_rf2 B C;
% 6.91/6.40     ALL A B C. A = B & bnd_rf1 C A --> bnd_rf1 C B;
% 6.91/6.40     ALL A B C. A = B & bnd_rf1 A C --> bnd_rf1 B C;
% 6.91/6.40     ALL A B C. A = B & bnd_ra_Px1 C A --> bnd_ra_Px1 C B;
% 6.91/6.40     ALL A B C. A = B & bnd_ra_Px1 A C --> bnd_ra_Px1 B C;
% 6.91/6.40     ALL A B. A = B & bnd_cp2xcomp A --> bnd_cp2xcomp B;
% 6.91/6.40     ALL A B. A = B & bnd_cp2 A --> bnd_cp2 B;
% 6.91/6.40     ALL A B. A = B & bnd_cp1 A --> bnd_cp1 B;
% 6.91/6.40     ALL A B. A = B & bnd_cowlThing A --> bnd_cowlThing B;
% 6.91/6.40     ALL A B. A = B & bnd_cowlNothing A --> bnd_cowlNothing B;
% 6.91/6.40     ALL A B. A = B & bnd_cSatisfiable A --> bnd_cSatisfiable B |]
% 6.91/6.40  ==> True
% 6.91/6.40  Adding axioms...
% 6.91/6.41  Typedef.type_definition_def
% 9.21/8.74   ...done.
% 9.21/8.74  Ground types: ?'b, TPTP_Interpret.ind
% 9.21/8.74  Translating term (sizes: 1, 1) ...
% 10.81/10.38  Invoking SAT solver...
% 10.81/10.38  No model exists.
% 10.81/10.38  Translating term (sizes: 2, 1) ...
% 13.32/12.87  Invoking SAT solver...
% 13.32/12.87  No model exists.
% 13.32/12.87  Translating term (sizes: 1, 2) ...
% 19.42/18.96  Invoking SAT solver...
% 19.42/18.96  No model exists.
% 19.42/18.96  Translating term (sizes: 3, 1) ...
% 24.34/23.85  Invoking SAT solver...
% 24.34/23.85  No model exists.
% 24.34/23.85  Translating term (sizes: 2, 2) ...
% 38.08/37.57  Invoking SAT solver...
% 38.08/37.57  No model exists.
% 38.08/37.57  Translating term (sizes: 1, 3) ...
% 53.51/52.91  Invoking SAT solver...
% 53.51/52.91  No model exists.
% 53.51/52.91  Translating term (sizes: 4, 1) ...
% 65.43/64.87  Invoking SAT solver...
% 65.43/64.87  No model exists.
% 65.43/64.87  Translating term (sizes: 3, 2) ...
% 158.64/157.71  Invoking SAT solver...
% 158.64/157.71  No model exists.
% 158.64/157.71  Translating term (sizes: 2, 3) ...
% 214.83/213.64  Invoking SAT solver...
% 214.83/213.64  No model exists.
% 214.83/213.64  Translating term (sizes: 1, 4) ...
% 247.17/245.74  Invoking SAT solver...
% 247.17/245.74  No model exists.
% 247.17/245.74  Translating term (sizes: 5, 1) ...
% 278.94/277.29  Invoking SAT solver...
% 278.94/277.29  No model exists.
% 278.94/277.29  Translating term (sizes: 4, 2) ...
% 300.04/298.13  /export/starexec/sandbox/solver/lib/scripts/run-polyml-5.5.2: line 82: 13793 CPU time limit exceeded (core dumped) "$ISABELLE_HOME/lib/scripts/feeder" -p -h "$MLTEXT" -t "$MLEXIT" $FEEDER_OPTS
% 300.04/298.13       13794                       (core dumped) | { read FPID; "$POLY" -q -i $ML_OPTIONS; RC="$?"; kill -TERM "$FPID"; exit "$RC"; }
% 300.04/298.14  /export/starexec/sandbox/solver/src/HOL/TPTP/lib/Tools/tptp_refute: line 26: 13739 Exit 152                "$ISABELLE_PROCESS" -q -e "use_thy \"/tmp/$SCRATCH\"; exit 1;" HOL-TPTP
% 300.04/298.14       13740 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.$"
%------------------------------------------------------------------------------