TSTP Solution File: KRS046+1 by Refute---2015
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Refute---2015
% Problem : KRS046+1 : TPTP v6.4.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : isabelle tptp_refute %d %s
% Computer : n158.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 296.31s
% 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 : KRS046+1 : TPTP v6.4.0. Released v3.1.0.
% 0.00/0.04 % Command : isabelle tptp_refute %d %s
% 0.03/0.23 % Computer : n158.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 11:59:54 CDT 2016
% 0.03/0.23 % CPUTime :
% 6.32/5.84 > val it = (): unit
% 6.52/6.04 Trying to find a model that refutes: True
% 6.92/6.45 Unfolded term: [| ALL X Y. bnd_rf X Y --> bnd_rr X Y;
% 6.92/6.45 bnd_cSatisfiable bnd_i2003_11_14_17_16_25617;
% 6.92/6.45 ALL X Y Z. bnd_rr X Y & bnd_rr Y Z --> bnd_rr X Z;
% 6.92/6.45 ALL X Y. bnd_rinvR X Y = bnd_rr Y X; ALL X Y. bnd_rinvF X Y = bnd_rf Y X;
% 6.92/6.45 ALL X.
% 6.92/6.45 bnd_cowlThing X -->
% 6.92/6.45 (ALL Y0 Y1. bnd_rf X Y0 & bnd_rf X Y1 --> Y0 = Y1);
% 6.92/6.45 ALL X. bnd_ca_Vx2 X = (EX Y. bnd_rinvF X Y & bnd_ca Y);
% 6.92/6.45 ALL X. bnd_caxcomp X = Ex (bnd_ra_Px1 X);
% 6.92/6.45 ALL X. bnd_ca X = (~ Ex (bnd_ra_Px1 X));
% 6.92/6.45 ALL X.
% 6.92/6.45 bnd_cSatisfiable X =
% 6.92/6.45 (((EX Y. bnd_rinvF X Y & bnd_ca Y) & bnd_caxcomp X) &
% 6.92/6.45 (EX Y. bnd_rinvR X Y & bnd_ca_Vx2 Y));
% 6.92/6.45 ALL X. bnd_xsd_string X = (~ bnd_xsd_integer X);
% 6.92/6.45 ALL X. bnd_cowlThing X & ~ bnd_cowlNothing X;
% 6.92/6.45 ALL A B. A = B & bnd_xsd_string A --> bnd_xsd_string B;
% 6.92/6.45 ALL A B. A = B & bnd_xsd_integer A --> bnd_xsd_integer B;
% 6.92/6.45 ALL A B C. A = B & bnd_rr C A --> bnd_rr C B;
% 6.92/6.45 ALL A B C. A = B & bnd_rr A C --> bnd_rr B C;
% 6.92/6.45 ALL A B C. A = B & bnd_rinvR C A --> bnd_rinvR C B;
% 6.92/6.45 ALL A B C. A = B & bnd_rinvR A C --> bnd_rinvR B C;
% 6.92/6.45 ALL A B C. A = B & bnd_rinvF C A --> bnd_rinvF C B;
% 6.92/6.45 ALL A B C. A = B & bnd_rinvF A C --> bnd_rinvF B C;
% 6.92/6.45 ALL A B C. A = B & bnd_rf C A --> bnd_rf C B;
% 6.92/6.45 ALL A B C. A = B & bnd_rf A C --> bnd_rf B C;
% 6.92/6.45 ALL A B C. A = B & bnd_ra_Px1 C A --> bnd_ra_Px1 C B;
% 6.92/6.45 ALL A B C. A = B & bnd_ra_Px1 A C --> bnd_ra_Px1 B C;
% 6.92/6.45 ALL A B. A = B & bnd_cowlThing A --> bnd_cowlThing B;
% 6.92/6.45 ALL A B. A = B & bnd_cowlNothing A --> bnd_cowlNothing B;
% 6.92/6.45 ALL A B. A = B & bnd_caxcomp A --> bnd_caxcomp B;
% 6.92/6.45 ALL A B. A = B & bnd_ca_Vx2 A --> bnd_ca_Vx2 B;
% 6.92/6.45 ALL A B. A = B & bnd_ca A --> bnd_ca B;
% 6.92/6.45 ALL A B. A = B & bnd_cSatisfiable A --> bnd_cSatisfiable B |]
% 6.92/6.45 ==> True
% 6.92/6.45 Adding axioms...
% 6.92/6.46 Typedef.type_definition_def
% 9.53/9.09 ...done.
% 9.63/9.10 Ground types: ?'b, TPTP_Interpret.ind
% 9.63/9.10 Translating term (sizes: 1, 1) ...
% 11.44/10.95 Invoking SAT solver...
% 11.44/10.95 No model exists.
% 11.44/10.95 Translating term (sizes: 2, 1) ...
% 14.23/13.70 Invoking SAT solver...
% 14.23/13.70 No model exists.
% 14.23/13.70 Translating term (sizes: 1, 2) ...
% 21.25/20.78 Invoking SAT solver...
% 21.25/20.78 No model exists.
% 21.25/20.78 Translating term (sizes: 3, 1) ...
% 26.35/25.87 Invoking SAT solver...
% 26.35/25.87 No model exists.
% 26.35/25.87 Translating term (sizes: 2, 2) ...
% 41.08/40.57 Invoking SAT solver...
% 41.08/40.57 No model exists.
% 41.08/40.57 Translating term (sizes: 1, 3) ...
% 59.31/58.79 Invoking SAT solver...
% 59.31/58.79 No model exists.
% 59.31/58.79 Translating term (sizes: 4, 1) ...
% 71.65/71.00 Invoking SAT solver...
% 71.65/71.00 No model exists.
% 71.65/71.00 Translating term (sizes: 3, 2) ...
% 165.99/165.05 Invoking SAT solver...
% 165.99/165.05 No model exists.
% 165.99/165.05 Translating term (sizes: 2, 3) ...
% 225.19/223.98 Invoking SAT solver...
% 225.19/223.98 No model exists.
% 225.19/223.98 Translating term (sizes: 1, 4) ...
% 264.05/262.55 Invoking SAT solver...
% 264.05/262.55 No model exists.
% 264.05/262.55 Translating term (sizes: 5, 1) ...
% 296.31/294.53 Invoking SAT solver...
% 296.31/294.53 No model exists.
% 296.31/294.53 Translating term (sizes: 4, 2) ...
% 300.06/298.22 /export/starexec/sandbox2/solver/lib/scripts/run-polyml-5.5.2: line 82: 34360 CPU time limit exceeded (core dumped) "$ISABELLE_HOME/lib/scripts/feeder" -p -h "$MLTEXT" -t "$MLEXIT" $FEEDER_OPTS
% 300.06/298.22 34361 (core dumped) | { read FPID; "$POLY" -q -i $ML_OPTIONS; RC="$?"; kill -TERM "$FPID"; exit "$RC"; }
% 300.06/298.23 /export/starexec/sandbox2/solver/src/HOL/TPTP/lib/Tools/tptp_refute: line 26: 34283 Exit 152 "$ISABELLE_PROCESS" -q -e "use_thy \"/tmp/$SCRATCH\"; exit 1;" HOL-TPTP
% 300.06/298.23 34284 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.$"
%------------------------------------------------------------------------------