%------------------------------------------------------------------------------
% File : Refute---2015
% Problem : NUM374+3 : TPTP v6.4.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : isabelle tptp_refute %d %s
% Computer : n007.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.06s
% 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+3 : TPTP v6.4.0. Released v3.2.0.
% 0.02/0.04 % Command : isabelle tptp_refute %d %s
% 0.02/0.24 % Computer : n007.star.cs.uiowa.edu
% 0.02/0.24 % Model : x86_64 x86_64
% 0.02/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/0.24 % Memory : 16091.75MB
% 0.02/0.24 % OS : Linux 3.10.0-327.10.1.el7.x86_64
% 0.02/0.24 % CPULimit : 300
% 0.02/0.24 % DateTime : Wed Apr 6 02:23:39 CDT 2016
% 0.02/0.24 % CPUTime :
% 6.23/5.89 > val it = (): unit
% 6.43/6.08 Trying to find a model that refutes: (((C = bnd_product bnd_n0 bnd_n0 & P = bnd_sum bnd_n1 bnd_n0) &
% 6.43/6.08 Q = bnd_sum P C) &
% 6.43/6.08 R = bnd_sum bnd_n1 (bnd_product bnd_n0 C)) &
% 6.43/6.08 S = bnd_sum (bnd_sum bnd_n1 C) (bnd_product C C) -->
% 6.43/6.08 bnd_product
% 6.43/6.08 (bnd_exponent (bnd_sum (bnd_exponent P bnd_n0) (bnd_exponent Q bnd_n0)) B)
% 6.43/6.08 (bnd_exponent (bnd_sum (bnd_exponent R B) (bnd_exponent S B)) bnd_n0) =
% 6.43/6.08 bnd_product
% 6.43/6.08 (bnd_exponent (bnd_sum (bnd_exponent P B) (bnd_exponent Q B)) bnd_n0)
% 6.43/6.08 (bnd_exponent (bnd_sum (bnd_exponent R bnd_n0) (bnd_exponent S bnd_n0)) B)
% 6.94/6.54 Unfolded term: [| ~ bnd_n0 = bnd_n1;
% 6.94/6.54 ALL X Y Z.
% 6.94/6.54 bnd_exponent (bnd_exponent X Y) Z = bnd_exponent X (bnd_product Y Z);
% 6.94/6.54 ALL X Y Z.
% 6.94/6.54 bnd_exponent (bnd_product X Y) Z =
% 6.94/6.54 bnd_product (bnd_exponent X Z) (bnd_exponent Y Z);
% 6.94/6.54 ALL X Y Z.
% 6.94/6.54 bnd_exponent X (bnd_sum Y Z) =
% 6.94/6.54 bnd_product (bnd_exponent X Y) (bnd_exponent X Z);
% 6.94/6.54 ALL X. bnd_exponent X bnd_n1 = X; ALL X. bnd_exponent bnd_n1 X = bnd_n1;
% 6.94/6.54 ALL X Y Z.
% 6.94/6.54 bnd_product X (bnd_sum Y Z) =
% 6.94/6.54 bnd_sum (bnd_product X Y) (bnd_product X Z);
% 6.94/6.54 ALL X Y Z.
% 6.94/6.54 bnd_product X (bnd_product Y Z) = bnd_product (bnd_product X Y) Z;
% 6.94/6.54 ALL X Y. bnd_product X Y = bnd_product Y X;
% 6.94/6.54 ALL X. bnd_product X bnd_n1 = X;
% 6.94/6.54 ALL X Y Z. bnd_sum X (bnd_sum Y Z) = bnd_sum (bnd_sum X Y) Z;
% 6.94/6.54 ALL X Y. bnd_sum X Y = bnd_sum Y X |]
% 6.94/6.54 ==> (((C = bnd_product bnd_n0 bnd_n0 & P = bnd_sum bnd_n1 bnd_n0) &
% 6.94/6.54 Q = bnd_sum P C) &
% 6.94/6.54 R = bnd_sum bnd_n1 (bnd_product bnd_n0 C)) &
% 6.94/6.54 S = bnd_sum (bnd_sum bnd_n1 C) (bnd_product C C) -->
% 6.94/6.54 bnd_product
% 6.94/6.54 (bnd_exponent (bnd_sum (bnd_exponent P bnd_n0) (bnd_exponent Q bnd_n0))
% 6.94/6.54 B)
% 6.94/6.54 (bnd_exponent (bnd_sum (bnd_exponent R B) (bnd_exponent S B)) bnd_n0) =
% 6.94/6.54 bnd_product
% 6.94/6.54 (bnd_exponent (bnd_sum (bnd_exponent P B) (bnd_exponent Q B)) bnd_n0)
% 6.94/6.54 (bnd_exponent (bnd_sum (bnd_exponent R bnd_n0) (bnd_exponent S bnd_n0))
% 6.94/6.54 B)
% 6.94/6.54 Adding axioms...
% 6.94/6.55 Typedef.type_definition_def
% 9.93/9.52 ...done.
% 9.93/9.53 Ground types: ?'b, TPTP_Interpret.ind
% 9.93/9.53 Translating term (sizes: 1, 1) ...
% 11.35/10.98 Invoking SAT solver...
% 11.35/10.98 No model exists.
% 11.35/10.98 Translating term (sizes: 2, 1) ...
% 13.44/13.05 Invoking SAT solver...
% 13.44/13.05 No model exists.
% 13.44/13.05 Translating term (sizes: 1, 2) ...
% 17.95/17.55 Invoking SAT solver...
% 18.14/17.79 No model exists.
% 18.14/17.79 Translating term (sizes: 3, 1) ...
% 22.77/22.39 Invoking SAT solver...
% 22.77/22.39 No model exists.
% 22.77/22.39 Translating term (sizes: 2, 2) ...
% 35.10/34.64 Invoking SAT solver...
% 35.30/34.88 No model exists.
% 35.30/34.88 Translating term (sizes: 1, 3) ...
% 47.33/46.82 Invoking SAT solver...
% 300.06/284.42 /export/starexec/sandbox/solver/lib/scripts/run-polyml-5.5.2: line 82: 48017 CPU time limit exceeded (core dumped) "$ISABELLE_HOME/lib/scripts/feeder" -p -h "$MLTEXT" -t "$MLEXIT" $FEEDER_OPTS
% 300.06/284.42 48018 (core dumped) | { read FPID; "$POLY" -q -i $ML_OPTIONS; RC="$?"; kill -TERM "$FPID"; exit "$RC"; }
% 300.06/284.43 /export/starexec/sandbox/solver/src/HOL/TPTP/lib/Tools/tptp_refute: line 26: 47963 Exit 152 "$ISABELLE_PROCESS" -q -e "use_thy \"/tmp/$SCRATCH\"; exit 1;" HOL-TPTP
% 300.06/284.43 47964 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.$"
%------------------------------------------------------------------------------