TSTP Solution File: KRS042+1 by Refute---2015
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Refute---2015
% Problem : KRS042+1 : TPTP v6.4.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : isabelle tptp_refute %d %s
% Computer : n039.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 286.52s
% 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 : KRS042+1 : TPTP v6.4.0. Released v3.1.0.
% 0.00/0.04 % Command : isabelle tptp_refute %d %s
% 0.03/0.23 % Computer : n039.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:24 CDT 2016
% 0.03/0.23 % CPUTime :
% 6.32/5.84 > val it = (): unit
% 6.52/6.07 Trying to find a model that refutes: True
% 7.13/6.68 Unfolded term: [| ALL X Y. bnd_rrx4 X Y --> bnd_rrx2 X Y;
% 7.13/6.68 ALL X Y. bnd_rrx4a X Y --> bnd_rrx2a X Y;
% 7.13/6.68 ALL X Y. bnd_rrx3 X Y --> bnd_rrx1 X Y;
% 7.13/6.68 ALL X Y. bnd_rrx3a X Y --> bnd_rrxa X Y;
% 7.13/6.68 ALL X Y. bnd_rrx4a X Y --> bnd_rrxa X Y;
% 7.13/6.68 ALL X Y. bnd_rrx3 X Y --> bnd_rrx X Y;
% 7.13/6.68 ALL X Y. bnd_rrx4 X Y --> bnd_rrx X Y;
% 7.13/6.68 ALL X Y. bnd_rrx3a X Y --> bnd_rrx1a X Y;
% 7.13/6.68 bnd_cSatisfiable bnd_i2003_11_14_17_16_10980;
% 7.13/6.68 ALL X Y Z. bnd_rrx4a X Y & bnd_rrx4a X Z --> Y = Z;
% 7.13/6.68 ALL X Y Z. bnd_rrx4 X Y & bnd_rrx4 X Z --> Y = Z;
% 7.13/6.68 ALL X Y Z. bnd_rrx3a X Y & bnd_rrx3a X Z --> Y = Z;
% 7.13/6.68 ALL X Y Z. bnd_rrx3 X Y & bnd_rrx3 X Z --> Y = Z;
% 7.13/6.68 ALL X Y Z. bnd_rrx X Y & bnd_rrx X Z --> Y = Z;
% 7.13/6.68 ALL X. bnd_ca_Cx1xcomp X = (~ Ex (bnd_ra_Px1 X));
% 7.13/6.68 ALL X. bnd_ca_Cx1xcomp X = (EX Y. bnd_rrx3a X Y & bnd_ca_Ax2 Y);
% 7.13/6.68 ALL X. bnd_ca_Cx1 X = Ex (bnd_ra_Px1 X);
% 7.13/6.68 ALL X. bnd_ca_Ax2 X = (bnd_cc2 X & bnd_cc1 X);
% 7.13/6.68 ALL X.
% 7.13/6.68 bnd_cSatisfiable X =
% 7.13/6.68 (((EX Y. bnd_rrx3a X Y & bnd_cc1 Y) & bnd_ca_Cx1 X) &
% 7.13/6.68 (EX Y. bnd_rrx4a X Y & bnd_cc2 Y));
% 7.13/6.68 ALL X. bnd_xsd_string X = (~ bnd_xsd_integer X);
% 7.13/6.68 ALL X. bnd_cowlThing X & ~ bnd_cowlNothing X;
% 7.13/6.68 ALL A B. A = B & bnd_xsd_string A --> bnd_xsd_string B;
% 7.13/6.68 ALL A B. A = B & bnd_xsd_integer A --> bnd_xsd_integer B;
% 7.13/6.68 ALL A B C. A = B & bnd_rrxa C A --> bnd_rrxa C B;
% 7.13/6.68 ALL A B C. A = B & bnd_rrxa A C --> bnd_rrxa B C;
% 7.13/6.68 ALL A B C. A = B & bnd_rrx4a C A --> bnd_rrx4a C B;
% 7.13/6.68 ALL A B C. A = B & bnd_rrx4a A C --> bnd_rrx4a B C;
% 7.13/6.68 ALL A B C. A = B & bnd_rrx4 C A --> bnd_rrx4 C B;
% 7.13/6.68 ALL A B C. A = B & bnd_rrx4 A C --> bnd_rrx4 B C;
% 7.13/6.68 ALL A B C. A = B & bnd_rrx3a C A --> bnd_rrx3a C B;
% 7.13/6.68 ALL A B C. A = B & bnd_rrx3a A C --> bnd_rrx3a B C;
% 7.13/6.68 ALL A B C. A = B & bnd_rrx3 C A --> bnd_rrx3 C B;
% 7.13/6.68 ALL A B C. A = B & bnd_rrx3 A C --> bnd_rrx3 B C;
% 7.13/6.68 ALL A B C. A = B & bnd_rrx2a C A --> bnd_rrx2a C B;
% 7.13/6.68 ALL A B C. A = B & bnd_rrx2a A C --> bnd_rrx2a B C;
% 7.13/6.68 ALL A B C. A = B & bnd_rrx2 C A --> bnd_rrx2 C B;
% 7.13/6.68 ALL A B C. A = B & bnd_rrx2 A C --> bnd_rrx2 B C;
% 7.13/6.68 ALL A B C. A = B & bnd_rrx1a C A --> bnd_rrx1a C B;
% 7.13/6.68 ALL A B C. A = B & bnd_rrx1a A C --> bnd_rrx1a B C;
% 7.13/6.68 ALL A B C. A = B & bnd_rrx1 C A --> bnd_rrx1 C B;
% 7.13/6.68 ALL A B C. A = B & bnd_rrx1 A C --> bnd_rrx1 B C;
% 7.13/6.68 ALL A B C. A = B & bnd_rrx C A --> bnd_rrx C B;
% 7.13/6.68 ALL A B C. A = B & bnd_rrx A C --> bnd_rrx B C;
% 7.13/6.68 ALL A B C. A = B & bnd_ra_Px1 C A --> bnd_ra_Px1 C B;
% 7.13/6.68 ALL A B C. A = B & bnd_ra_Px1 A C --> bnd_ra_Px1 B C;
% 7.13/6.68 ALL A B. A = B & bnd_cowlThing A --> bnd_cowlThing B;
% 7.13/6.68 ALL A B. A = B & bnd_cowlNothing A --> bnd_cowlNothing B;
% 7.13/6.68 ALL A B. A = B & bnd_cc2 A --> bnd_cc2 B;
% 7.13/6.68 ALL A B. A = B & bnd_cc1 A --> bnd_cc1 B;
% 7.13/6.68 ALL A B. A = B & bnd_ca_Cx1xcomp A --> bnd_ca_Cx1xcomp B;
% 7.13/6.68 ALL A B. A = B & bnd_ca_Cx1 A --> bnd_ca_Cx1 B;
% 7.13/6.68 ALL A B. A = B & bnd_ca_Ax2 A --> bnd_ca_Ax2 B;
% 7.13/6.68 ALL A B. A = B & bnd_cSatisfiable A --> bnd_cSatisfiable B |]
% 7.13/6.68 ==> True
% 7.13/6.68 Adding axioms...
% 7.13/6.68 Typedef.type_definition_def
% 11.93/11.49 ...done.
% 12.03/11.50 Ground types: ?'b, TPTP_Interpret.ind
% 12.03/11.50 Translating term (sizes: 1, 1) ...
% 15.22/14.77 Invoking SAT solver...
% 15.22/14.77 No model exists.
% 15.22/14.77 Translating term (sizes: 2, 1) ...
% 19.24/18.75 Invoking SAT solver...
% 19.24/18.75 No model exists.
% 19.24/18.75 Translating term (sizes: 1, 2) ...
% 32.15/31.70 Invoking SAT solver...
% 32.15/31.70 No model exists.
% 32.15/31.70 Translating term (sizes: 3, 1) ...
% 38.66/38.11 Invoking SAT solver...
% 38.66/38.11 No model exists.
% 38.66/38.11 Translating term (sizes: 2, 2) ...
% 59.31/58.75 Invoking SAT solver...
% 59.31/58.75 No model exists.
% 59.31/58.75 Translating term (sizes: 1, 3) ...
% 95.23/94.57 Invoking SAT solver...
% 95.23/94.57 No model exists.
% 95.23/94.57 Translating term (sizes: 4, 1) ...
% 108.76/108.05 Invoking SAT solver...
% 108.76/108.05 No model exists.
% 108.76/108.05 Translating term (sizes: 3, 2) ...
% 209.21/208.07 Invoking SAT solver...
% 209.21/208.07 No model exists.
% 209.21/208.07 Translating term (sizes: 2, 3) ...
% 286.52/284.80 Invoking SAT solver...
% 286.52/284.80 No model exists.
% 286.52/284.80 Translating term (sizes: 1, 4) ...
% 300.06/298.13 /export/starexec/sandbox/solver/lib/scripts/run-polyml-5.5.2: line 82: 53923 CPU time limit exceeded (core dumped) "$ISABELLE_HOME/lib/scripts/feeder" -p -h "$MLTEXT" -t "$MLEXIT" $FEEDER_OPTS
% 300.06/298.13 53924 (core dumped) | { read FPID; "$POLY" -q -i $ML_OPTIONS; RC="$?"; kill -TERM "$FPID"; exit "$RC"; }
% 300.06/298.14 /export/starexec/sandbox/solver/src/HOL/TPTP/lib/Tools/tptp_refute: line 26: 53869 Exit 152 "$ISABELLE_PROCESS" -q -e "use_thy \"/tmp/$SCRATCH\"; exit 1;" HOL-TPTP
% 300.06/298.14 53870 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.$"
%------------------------------------------------------------------------------