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

View Problem - Process Solution

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

% Computer : n047.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.02s
% 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  : KRS048+1 : TPTP v6.4.0. Released v3.1.0.
% 0.00/0.04  % Command  : isabelle tptp_refute %d %s
% 0.03/0.23  % Computer : n047.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.10.1.el7.x86_64
% 0.03/0.23  % CPULimit : 300
% 0.03/0.23  % DateTime : Sun Apr 10 12:01:09 CDT 2016
% 0.03/0.23  % CPUTime  : 
% 6.28/5.84  > val it = (): unit
% 6.48/6.06  Trying to find a model that refutes: True
% 7.10/6.61  Unfolded term: [| bnd_cSatisfiable bnd_i2003_11_14_17_16_32989;
% 7.10/6.61     ALL X Y Z. bnd_rr X Y & bnd_rr Y Z --> bnd_rr X Z;
% 7.10/6.61     ALL X Y. bnd_rinvR X Y = bnd_rr Y X; ALL X Y. bnd_rinvF X Y = bnd_rf Y X;
% 7.10/6.61     ALL X.
% 7.10/6.61        bnd_cowlThing X -->
% 7.10/6.61        (ALL Y0 Y1. bnd_rf X Y0 & bnd_rf X Y1 --> Y0 = Y1);
% 7.10/6.61     ALL X. bnd_ca_Vx5 X = (EX Y. bnd_rr X Y & bnd_ca_Ax4 Y);
% 7.10/6.61     ALL X. bnd_ca_Cx3xcomp X = (ALL Y. bnd_rr X Y --> bnd_cp1 Y);
% 7.10/6.61     ALL X. bnd_ca_Cx3xcomp X = Ex (bnd_ra_Px3 X);
% 7.10/6.61     ALL X. bnd_ca_Cx3 X = (~ Ex (bnd_ra_Px3 X));
% 7.10/6.61     ALL X. bnd_ca_Cx2xcomp X = Ex (bnd_ra_Px2 X);
% 7.10/6.61     ALL X. bnd_ca_Cx2xcomp X = (bnd_cp1 X & bnd_ca_Cx3 X);
% 7.10/6.61     ALL X. bnd_ca_Cx2 X = (~ Ex (bnd_ra_Px2 X));
% 7.10/6.61     ALL X.
% 7.10/6.61        bnd_ca_Ax4 X = (bnd_cp1 X & (ALL Y. bnd_rinvR X Y --> bnd_ca_Cx2 Y));
% 7.10/6.61     ALL X. bnd_cp1xcomp X = Ex (bnd_ra_Px1 X);
% 7.10/6.61     ALL X. bnd_cp1 X = (~ Ex (bnd_ra_Px1 X));
% 7.10/6.61     ALL X.
% 7.10/6.61        bnd_cSatisfiable X = (bnd_cp1 X & (EX Y. bnd_rr X Y & bnd_ca_Vx5 Y));
% 7.10/6.61     ALL X. bnd_xsd_string X = (~ bnd_xsd_integer X);
% 7.10/6.61     ALL X. bnd_cowlThing X & ~ bnd_cowlNothing X;
% 7.10/6.61     ALL A B. A = B & bnd_xsd_string A --> bnd_xsd_string B;
% 7.10/6.61     ALL A B. A = B & bnd_xsd_integer A --> bnd_xsd_integer B;
% 7.10/6.61     ALL A B C. A = B & bnd_rr C A --> bnd_rr C B;
% 7.10/6.61     ALL A B C. A = B & bnd_rr A C --> bnd_rr B C;
% 7.10/6.61     ALL A B C. A = B & bnd_rinvR C A --> bnd_rinvR C B;
% 7.10/6.61     ALL A B C. A = B & bnd_rinvR A C --> bnd_rinvR B C;
% 7.10/6.61     ALL A B C. A = B & bnd_rinvF C A --> bnd_rinvF C B;
% 7.10/6.61     ALL A B C. A = B & bnd_rinvF A C --> bnd_rinvF B C;
% 7.10/6.61     ALL A B C. A = B & bnd_rf C A --> bnd_rf C B;
% 7.10/6.61     ALL A B C. A = B & bnd_rf A C --> bnd_rf B C;
% 7.10/6.61     ALL A B C. A = B & bnd_ra_Px3 C A --> bnd_ra_Px3 C B;
% 7.10/6.61     ALL A B C. A = B & bnd_ra_Px3 A C --> bnd_ra_Px3 B C;
% 7.10/6.61     ALL A B C. A = B & bnd_ra_Px2 C A --> bnd_ra_Px2 C B;
% 7.10/6.61     ALL A B C. A = B & bnd_ra_Px2 A C --> bnd_ra_Px2 B C;
% 7.10/6.61     ALL A B C. A = B & bnd_ra_Px1 C A --> bnd_ra_Px1 C B;
% 7.10/6.61     ALL A B C. A = B & bnd_ra_Px1 A C --> bnd_ra_Px1 B C;
% 7.10/6.61     ALL A B. A = B & bnd_cp1xcomp A --> bnd_cp1xcomp B;
% 7.10/6.61     ALL A B. A = B & bnd_cp1 A --> bnd_cp1 B;
% 7.10/6.61     ALL A B. A = B & bnd_cowlThing A --> bnd_cowlThing B;
% 7.10/6.61     ALL A B. A = B & bnd_cowlNothing A --> bnd_cowlNothing B;
% 7.10/6.61     ALL A B. A = B & bnd_ca_Vx5 A --> bnd_ca_Vx5 B;
% 7.10/6.61     ALL A B. A = B & bnd_ca_Cx3xcomp A --> bnd_ca_Cx3xcomp B;
% 7.10/6.61     ALL A B. A = B & bnd_ca_Cx3 A --> bnd_ca_Cx3 B;
% 7.10/6.61     ALL A B. A = B & bnd_ca_Cx2xcomp A --> bnd_ca_Cx2xcomp B;
% 7.10/6.61     ALL A B. A = B & bnd_ca_Cx2 A --> bnd_ca_Cx2 B;
% 7.10/6.61     ALL A B. A = B & bnd_ca_Ax4 A --> bnd_ca_Ax4 B;
% 7.10/6.61     ALL A B. A = B & bnd_cSatisfiable A --> bnd_cSatisfiable B |]
% 7.10/6.61  ==> True
% 7.10/6.61  Adding axioms...
% 7.10/6.63  Typedef.type_definition_def
% 10.88/10.43   ...done.
% 10.88/10.44  Ground types: ?'b, TPTP_Interpret.ind
% 10.88/10.44  Translating term (sizes: 1, 1) ...
% 13.60/13.18  Invoking SAT solver...
% 13.60/13.18  No model exists.
% 13.60/13.18  Translating term (sizes: 2, 1) ...
% 17.10/16.64  Invoking SAT solver...
% 17.10/16.64  No model exists.
% 17.10/16.64  Translating term (sizes: 1, 2) ...
% 26.51/26.07  Invoking SAT solver...
% 26.51/26.07  No model exists.
% 26.51/26.07  Translating term (sizes: 3, 1) ...
% 32.33/31.84  Invoking SAT solver...
% 32.33/31.84  No model exists.
% 32.33/31.84  Translating term (sizes: 2, 2) ...
% 49.55/49.00  Invoking SAT solver...
% 49.55/49.00  No model exists.
% 49.55/49.00  Translating term (sizes: 1, 3) ...
% 74.01/73.40  Invoking SAT solver...
% 74.01/73.40  No model exists.
% 74.01/73.40  Translating term (sizes: 4, 1) ...
% 86.95/86.35  Invoking SAT solver...
% 86.95/86.35  No model exists.
% 86.95/86.35  Translating term (sizes: 3, 2) ...
% 183.70/182.75  Invoking SAT solver...
% 183.70/182.75  No model exists.
% 183.70/182.75  Translating term (sizes: 2, 3) ...
% 249.29/247.95  Invoking SAT solver...
% 249.29/247.95  No model exists.
% 249.29/247.95  Translating term (sizes: 1, 4) ...
% 300.02/298.22  /export/starexec/sandbox/solver/lib/scripts/run-polyml-5.5.2: line 82: 51302 CPU time limit exceeded (core dumped) "$ISABELLE_HOME/lib/scripts/feeder" -p -h "$MLTEXT" -t "$MLEXIT" $FEEDER_OPTS
% 300.02/298.22       51303                       (core dumped) | { read FPID; "$POLY" -q -i $ML_OPTIONS; RC="$?"; kill -TERM "$FPID"; exit "$RC"; }
% 300.02/298.24  /export/starexec/sandbox/solver/src/HOL/TPTP/lib/Tools/tptp_refute: line 26: 51248 Exit 152                "$ISABELLE_PROCESS" -q -e "use_thy \"/tmp/$SCRATCH\"; exit 1;" HOL-TPTP
% 300.02/298.24       51249 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.$"
%------------------------------------------------------------------------------