TSTP Solution File: NUM374+4 by Refute---2015
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Refute---2015
% Problem : NUM374+4 : TPTP v6.4.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : isabelle tptp_refute %d %s
% Computer : n024.star.cs.uiowa.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory : 16091.75MB
% OS : Linux 3.10.0-327.10.1.el7.x86_64
% CPULimit : 300s
% DateTime : Thu Apr 14 01:55:22 EDT 2016
% Result : Timeout 300.11s
% 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 : NUM374+4 : TPTP v6.4.0. Released v3.2.0.
% 0.03/0.04 % Command : isabelle tptp_refute %d %s
% 0.03/0.24 % Computer : n024.star.cs.uiowa.edu
% 0.03/0.24 % Model : x86_64 x86_64
% 0.03/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.03/0.24 % Memory : 16091.75MB
% 0.03/0.24 % OS : Linux 3.10.0-327.10.1.el7.x86_64
% 0.03/0.24 % CPULimit : 300
% 0.03/0.24 % DateTime : Wed Apr 6 02:24:09 CDT 2016
% 0.03/0.25 % CPUTime :
% 6.31/5.92 > val it = (): unit
% 6.52/6.12 Trying to find a model that refutes: ((((C = bnd_product bnd_n0 bnd_n0 & P = bnd_sum bnd_n1 bnd_n0) &
% 6.52/6.12 Q = bnd_sum P C) &
% 6.52/6.12 R = bnd_sum bnd_n1 (bnd_product bnd_n0 C)) &
% 6.52/6.12 S = bnd_sum (bnd_sum bnd_n1 C) (bnd_product C C)) &
% 6.52/6.12 bnd_lemmas C P Q R S B -->
% 6.52/6.12 bnd_product
% 6.52/6.12 (bnd_exponent (bnd_sum (bnd_exponent P bnd_n0) (bnd_exponent Q bnd_n0)) B)
% 6.52/6.12 (bnd_exponent (bnd_sum (bnd_exponent R B) (bnd_exponent S B)) bnd_n0) =
% 6.52/6.12 bnd_product
% 6.52/6.12 (bnd_exponent (bnd_sum (bnd_exponent P B) (bnd_exponent Q B)) bnd_n0)
% 6.52/6.12 (bnd_exponent (bnd_sum (bnd_exponent R bnd_n0) (bnd_exponent S bnd_n0)) B)
% 7.31/6.95 Unfolded term: [| ~ bnd_n1 = bnd_n2; ~ bnd_n0 = bnd_n2; ~ bnd_n0 = bnd_n1;
% 7.31/6.95 ALL C P Q R S B.
% 7.31/6.95 bnd_lemmas C P Q R S B =
% 7.31/6.95 (((((((((((((((((((((((((bnd_n2 = bnd_sum bnd_n1 bnd_n1 &
% 7.31/6.95 ~ B = bnd_n0) &
% 7.31/6.95 ~ B = bnd_n1) &
% 7.31/6.95 ~ B = bnd_n2) &
% 7.31/6.95 (ALL X. ~ B = bnd_product bnd_n0 X)) &
% 7.31/6.95 (ALL X. ~ P = bnd_product Q X)) &
% 7.31/6.95 (ALL X. ~ Q = bnd_product P X)) &
% 7.31/6.95 (ALL X. ~ R = bnd_product S X)) &
% 7.31/6.95 (ALL X. ~ S = bnd_product R X)) &
% 7.31/6.95 ~ bnd_sum bnd_n1 bnd_n0 = bnd_n1) &
% 7.31/6.95 ~ bnd_sum bnd_n2 bnd_n0 = bnd_n1) &
% 7.31/6.95 ~ bnd_sum bnd_n0 bnd_n0 = bnd_n1) &
% 7.31/6.95 ~ C = bnd_n1) &
% 7.31/6.95 ~ bnd_sum bnd_n1 C = bnd_n1) &
% 7.31/6.95 ~ bnd_product C bnd_n0 = bnd_n1) &
% 7.31/6.95 ~ bnd_sum bnd_n1 bnd_n0 = bnd_n0) &
% 7.31/6.95 ~ bnd_sum bnd_n2 bnd_n0 = bnd_n0) &
% 7.31/6.95 ~ bnd_sum bnd_n0 bnd_n0 = bnd_n0) &
% 7.31/6.95 ~ C = bnd_n0) &
% 7.31/6.95 ~ bnd_sum bnd_n1 C = bnd_n0) &
% 7.31/6.95 ~ bnd_sum bnd_n2 bnd_n0 = bnd_sum bnd_n1 bnd_n0) &
% 7.31/6.95 ~ C = bnd_sum bnd_n1 bnd_n0) &
% 7.31/6.95 ~ bnd_product C bnd_n0 = bnd_sum bnd_n1 bnd_n0) &
% 7.31/6.95 ~ C = bnd_sum bnd_n2 bnd_n0) &
% 7.31/6.95 ~ C = bnd_sum bnd_n0 bnd_n0) &
% 7.31/6.95 ~ bnd_sum bnd_n1 C = C);
% 7.31/6.95 ALL X Y Z.
% 7.31/6.95 bnd_exponent (bnd_exponent X Y) Z = bnd_exponent X (bnd_product Y Z);
% 7.31/6.95 ALL X Y Z.
% 7.31/6.95 bnd_exponent (bnd_product X Y) Z =
% 7.31/6.95 bnd_product (bnd_exponent X Z) (bnd_exponent Y Z);
% 7.31/6.95 ALL X Y Z.
% 7.31/6.95 bnd_exponent X (bnd_sum Y Z) =
% 7.31/6.95 bnd_product (bnd_exponent X Y) (bnd_exponent X Z);
% 7.31/6.95 ALL X. bnd_exponent X bnd_n1 = X; ALL X. bnd_exponent bnd_n1 X = bnd_n1;
% 7.31/6.95 ALL X Y Z.
% 7.31/6.95 bnd_product X (bnd_sum Y Z) =
% 7.31/6.95 bnd_sum (bnd_product X Y) (bnd_product X Z);
% 7.31/6.95 ALL X Y Z.
% 7.31/6.95 bnd_product X (bnd_product Y Z) = bnd_product (bnd_product X Y) Z;
% 7.31/6.95 ALL X Y. bnd_product X Y = bnd_product Y X;
% 7.31/6.95 ALL X. bnd_product X bnd_n1 = X;
% 7.31/6.95 ALL X Y Z. bnd_sum X (bnd_sum Y Z) = bnd_sum (bnd_sum X Y) Z;
% 7.31/6.95 ALL X Y. bnd_sum X Y = bnd_sum Y X |]
% 7.31/6.95 ==> ((((C = bnd_product bnd_n0 bnd_n0 & P = bnd_sum bnd_n1 bnd_n0) &
% 7.31/6.95 Q = bnd_sum P C) &
% 7.31/6.95 R = bnd_sum bnd_n1 (bnd_product bnd_n0 C)) &
% 7.31/6.95 S = bnd_sum (bnd_sum bnd_n1 C) (bnd_product C C)) &
% 7.31/6.95 bnd_lemmas C P Q R S B -->
% 7.31/6.95 bnd_product
% 7.31/6.95 (bnd_exponent (bnd_sum (bnd_exponent P bnd_n0) (bnd_exponent Q bnd_n0))
% 7.31/6.95 B)
% 7.31/6.95 (bnd_exponent (bnd_sum (bnd_exponent R B) (bnd_exponent S B)) bnd_n0) =
% 7.31/6.95 bnd_product
% 7.31/6.95 (bnd_exponent (bnd_sum (bnd_exponent P B) (bnd_exponent Q B)) bnd_n0)
% 7.31/6.95 (bnd_exponent (bnd_sum (bnd_exponent R bnd_n0) (bnd_exponent S bnd_n0))
% 7.31/6.95 B)
% 7.31/6.95 Adding axioms...
% 7.31/6.96 Typedef.type_definition_def
% 12.44/12.04 ...done.
% 12.44/12.05 Ground types: ?'b, TPTP_Interpret.ind
% 12.44/12.05 Translating term (sizes: 1, 1) ...
% 14.92/14.58 Invoking SAT solver...
% 14.92/14.58 No model exists.
% 14.92/14.58 Translating term (sizes: 2, 1) ...
% 18.23/17.81 Invoking SAT solver...
% 18.23/17.81 No model exists.
% 18.23/17.81 Translating term (sizes: 1, 2) ...
% 91.42/90.85 Invoking SAT solver...
% 91.78/91.16 No model exists.
% 91.78/91.16 Translating term (sizes: 3, 1) ...
% 97.40/96.79 Invoking SAT solver...
% 97.40/96.79 No model exists.
% 97.40/96.79 Translating term (sizes: 2, 2) ...
% 178.47/177.46 Invoking SAT solver...
% 178.79/177.76 No model exists.
% 178.79/177.76 Translating term (sizes: 1, 3) ...
% 300.11/298.04 /export/starexec/sandbox2/solver/lib/scripts/run-polyml-5.5.2: line 82: 35615 CPU time limit exceeded (core dumped) "$ISABELLE_HOME/lib/scripts/feeder" -p -h "$MLTEXT" -t "$MLEXIT" $FEEDER_OPTS
% 300.11/298.04 35616 (core dumped) | { read FPID; "$POLY" -q -i $ML_OPTIONS; RC="$?"; kill -TERM "$FPID"; exit "$RC"; }
% 300.11/298.06 /export/starexec/sandbox2/solver/src/HOL/TPTP/lib/Tools/tptp_refute: line 26: 35561 Exit 152 "$ISABELLE_PROCESS" -q -e "use_thy \"/tmp/$SCRATCH\"; exit 1;" HOL-TPTP
% 300.11/298.06 35562 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.$"
%------------------------------------------------------------------------------