TSTP Solution File: KRS043+1 by Refute---2015
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Refute---2015
% Problem : KRS043+1 : TPTP v6.4.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : isabelle tptp_refute %d %s
% Computer : n095.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.05s
% Output : None
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.03 % Problem : KRS043+1 : TPTP v6.4.0. Released v3.1.0.
% 0.02/0.04 % Command : isabelle tptp_refute %d %s
% 0.03/0.23 % Computer : n095.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:02:09 CDT 2016
% 0.03/0.23 % CPUTime :
% 6.29/5.84 > val it = (): unit
% 6.50/6.09 Trying to find a model that refutes: True
% 7.30/6.84 Unfolded term: [| bnd_cSatisfiable bnd_i2003_11_14_17_16_14536;
% 7.30/6.84 ALL X Y. bnd_rinvR X Y = bnd_rr Y X;
% 7.30/6.84 ALL X. bnd_ca_Cx3xcomp X = Ex (bnd_ra_Px3 X);
% 7.30/6.84 ALL X. bnd_ca_Cx3 X = (~ Ex (bnd_ra_Px3 X));
% 7.30/6.84 ALL X. bnd_ca_Cx3 X = (bnd_cp5xcomp X & bnd_cp4xcomp X);
% 7.30/6.84 ALL X. bnd_ca_Cx2xcomp X = Ex (bnd_ra_Px2 X);
% 7.30/6.84 ALL X.
% 7.30/6.84 bnd_ca_Cx2 X = ((bnd_cp5xcomp X & bnd_cp3xcomp X) & bnd_cp4xcomp X);
% 7.30/6.84 ALL X. bnd_ca_Cx2 X = (~ Ex (bnd_ra_Px2 X));
% 7.30/6.84 ALL X. bnd_ca_Cx1xcomp X = (~ Ex (bnd_ra_Px1 X));
% 7.30/6.84 ALL X.
% 7.30/6.84 bnd_ca_Cx1 X =
% 7.30/6.84 (((bnd_cp5xcomp X & bnd_cp2xcomp X) & bnd_cp3xcomp X) &
% 7.30/6.84 bnd_cp4xcomp X);
% 7.30/6.84 ALL X. bnd_ca_Cx1 X = Ex (bnd_ra_Px1 X);
% 7.30/6.84 ALL X.
% 7.30/6.84 bnd_ca_Ax14 X =
% 7.30/6.84 ((EX Y. bnd_rr X Y & bnd_cp1 Y) &
% 7.30/6.84 (ALL Y0 Y1. bnd_rr X Y0 & bnd_rr X Y1 --> Y0 = Y1));
% 7.30/6.84 ALL X. bnd_cp5xcomp X = Ex (bnd_ra_Px4 X);
% 7.30/6.84 ALL X. bnd_cp5 X = (~ Ex (bnd_ra_Px4 X));
% 7.30/6.84 ALL X. bnd_cp4xcomp X = Ex (bnd_ra_Px7 X);
% 7.30/6.84 ALL X. bnd_cp4 X --> bnd_cp5xcomp X;
% 7.30/6.84 ALL X. bnd_cp4 X = (~ Ex (bnd_ra_Px7 X));
% 7.30/6.84 ALL X. bnd_cp3xcomp X = (~ Ex (bnd_ra_Px6 X));
% 7.30/6.84 ALL X. bnd_cp3 X --> bnd_ca_Cx3 X; ALL X. bnd_cp3 X = Ex (bnd_ra_Px6 X);
% 7.30/6.84 ALL X. bnd_cp2xcomp X = (~ Ex (bnd_ra_Px5 X));
% 7.30/6.84 ALL X. bnd_cp2 X --> bnd_ca_Cx2 X; ALL X. bnd_cp2 X = Ex (bnd_ra_Px5 X);
% 7.30/6.84 ALL X. bnd_cp1 X --> bnd_ca_Cx1 X;
% 7.30/6.84 ALL X. bnd_cSatisfiable X = (EX Y. bnd_rinvR X Y & bnd_ca_Ax14 Y);
% 7.30/6.84 ALL X. bnd_xsd_string X = (~ bnd_xsd_integer X);
% 7.30/6.84 ALL X. bnd_cowlThing X & ~ bnd_cowlNothing X;
% 7.30/6.84 ALL A B. A = B & bnd_xsd_string A --> bnd_xsd_string B;
% 7.30/6.84 ALL A B. A = B & bnd_xsd_integer A --> bnd_xsd_integer B;
% 7.30/6.84 ALL A B C. A = B & bnd_rr C A --> bnd_rr C B;
% 7.30/6.84 ALL A B C. A = B & bnd_rr A C --> bnd_rr B C;
% 7.30/6.84 ALL A B C. A = B & bnd_rinvR C A --> bnd_rinvR C B;
% 7.30/6.84 ALL A B C. A = B & bnd_rinvR A C --> bnd_rinvR B C;
% 7.30/6.84 ALL A B C. A = B & bnd_ra_Px7 C A --> bnd_ra_Px7 C B;
% 7.30/6.84 ALL A B C. A = B & bnd_ra_Px7 A C --> bnd_ra_Px7 B C;
% 7.30/6.84 ALL A B C. A = B & bnd_ra_Px6 C A --> bnd_ra_Px6 C B;
% 7.30/6.84 ALL A B C. A = B & bnd_ra_Px6 A C --> bnd_ra_Px6 B C;
% 7.30/6.84 ALL A B C. A = B & bnd_ra_Px5 C A --> bnd_ra_Px5 C B;
% 7.30/6.84 ALL A B C. A = B & bnd_ra_Px5 A C --> bnd_ra_Px5 B C;
% 7.30/6.84 ALL A B C. A = B & bnd_ra_Px4 C A --> bnd_ra_Px4 C B;
% 7.30/6.84 ALL A B C. A = B & bnd_ra_Px4 A C --> bnd_ra_Px4 B C;
% 7.30/6.84 ALL A B C. A = B & bnd_ra_Px3 C A --> bnd_ra_Px3 C B;
% 7.30/6.84 ALL A B C. A = B & bnd_ra_Px3 A C --> bnd_ra_Px3 B C;
% 7.30/6.84 ALL A B C. A = B & bnd_ra_Px2 C A --> bnd_ra_Px2 C B;
% 7.30/6.84 ALL A B C. A = B & bnd_ra_Px2 A C --> bnd_ra_Px2 B C;
% 7.30/6.84 ALL A B C. A = B & bnd_ra_Px1 C A --> bnd_ra_Px1 C B;
% 7.30/6.84 ALL A B C. A = B & bnd_ra_Px1 A C --> bnd_ra_Px1 B C;
% 7.30/6.84 ALL A B. A = B & bnd_cp5xcomp A --> bnd_cp5xcomp B;
% 7.30/6.84 ALL A B. A = B & bnd_cp5 A --> bnd_cp5 B;
% 7.30/6.84 ALL A B. A = B & bnd_cp4xcomp A --> bnd_cp4xcomp B;
% 7.30/6.84 ALL A B. A = B & bnd_cp4 A --> bnd_cp4 B;
% 7.30/6.84 ALL A B. A = B & bnd_cp3xcomp A --> bnd_cp3xcomp B;
% 7.30/6.84 ALL A B. A = B & bnd_cp3 A --> bnd_cp3 B;
% 7.30/6.84 ALL A B. A = B & bnd_cp2xcomp A --> bnd_cp2xcomp B;
% 7.30/6.84 ALL A B. A = B & bnd_cp2 A --> bnd_cp2 B;
% 7.30/6.84 ALL A B. A = B & bnd_cp1 A --> bnd_cp1 B;
% 7.30/6.84 ALL A B. A = B & bnd_cowlThing A --> bnd_cowlThing B;
% 7.30/6.84 ALL A B. A = B & bnd_cowlNothing A --> bnd_cowlNothing B;
% 7.30/6.84 ALL A B. A = B & bnd_ca_Cx3xcomp A --> bnd_ca_Cx3xcomp B;
% 7.30/6.84 ALL A B. A = B & bnd_ca_Cx3 A --> bnd_ca_Cx3 B;
% 7.30/6.84 ALL A B. A = B & bnd_ca_Cx2xcomp A --> bnd_ca_Cx2xcomp B;
% 7.30/6.84 ALL A B. A = B & bnd_ca_Cx2 A --> bnd_ca_Cx2 B;
% 7.30/6.84 ALL A B. A = B & bnd_ca_Cx1xcomp A --> bnd_ca_Cx1xcomp B;
% 7.30/6.84 ALL A B. A = B & bnd_ca_Cx1 A --> bnd_ca_Cx1 B;
% 7.30/6.84 ALL A B. A = B & bnd_ca_Ax14 A --> bnd_ca_Ax14 B;
% 7.30/6.84 ALL A B. A = B & bnd_cSatisfiable A --> bnd_cSatisfiable B |]
% 7.30/6.84 ==> True
% 7.30/6.84 Adding axioms...
% 7.30/6.86 Typedef.type_definition_def
% 12.51/12.03 ...done.
% 12.51/12.04 Ground types: ?'b, TPTP_Interpret.ind
% 12.51/12.04 Translating term (sizes: 1, 1) ...
% 16.20/15.76 Invoking SAT solver...
% 16.20/15.76 No model exists.
% 16.20/15.76 Translating term (sizes: 2, 1) ...
% 20.72/20.21 Invoking SAT solver...
% 20.72/20.21 No model exists.
% 20.72/20.21 Translating term (sizes: 1, 2) ...
% 32.64/32.19 Invoking SAT solver...
% 32.64/32.19 No model exists.
% 32.64/32.19 Translating term (sizes: 3, 1) ...
% 39.55/39.07 Invoking SAT solver...
% 39.55/39.07 No model exists.
% 39.55/39.07 Translating term (sizes: 2, 2) ...
% 59.40/58.81 Invoking SAT solver...
% 59.40/58.81 No model exists.
% 59.40/58.81 Translating term (sizes: 1, 3) ...
% 89.59/88.96 Invoking SAT solver...
% 89.59/88.96 No model exists.
% 89.59/88.96 Translating term (sizes: 4, 1) ...
% 103.64/102.94 Invoking SAT solver...
% 103.64/102.94 No model exists.
% 103.64/102.94 Translating term (sizes: 3, 2) ...
% 203.36/202.28 Invoking SAT solver...
% 203.36/202.28 No model exists.
% 203.36/202.28 Translating term (sizes: 2, 3) ...
% 274.90/273.27 Invoking SAT solver...
% 274.90/273.27 No model exists.
% 274.90/273.27 Translating term (sizes: 1, 4) ...
% 300.05/298.13 /export/starexec/sandbox/solver/lib/scripts/run-polyml-5.5.2: line 82: 12685 CPU time limit exceeded (core dumped) "$ISABELLE_HOME/lib/scripts/feeder" -p -h "$MLTEXT" -t "$MLEXIT" $FEEDER_OPTS
% 300.05/298.13 12686 (core dumped) | { read FPID; "$POLY" -q -i $ML_OPTIONS; RC="$?"; kill -TERM "$FPID"; exit "$RC"; }
% 300.05/298.14 /export/starexec/sandbox/solver/src/HOL/TPTP/lib/Tools/tptp_refute: line 26: 12631 Exit 152 "$ISABELLE_PROCESS" -q -e "use_thy \"/tmp/$SCRATCH\"; exit 1;" HOL-TPTP
% 300.05/298.14 12632 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.$"
%------------------------------------------------------------------------------