TSTP Solution File: ANA006-2 by Refute---2015
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Refute---2015
% Problem : ANA006-2 : TPTP v6.4.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : isabelle tptp_refute %d %s
% Computer : n156.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 11:31:15 EDT 2016
% Result : Timeout 300.04s
% 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 : ANA006-2 : TPTP v6.4.0. Released v2.5.0.
% 0.00/0.04 % Command : isabelle tptp_refute %d %s
% 0.03/0.23 % Computer : n156.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 : Sat Apr 9 03:27:54 CDT 2016
% 0.03/0.23 % CPUTime :
% 6.29/6.86 > val it = (): unit
% 6.49/7.05 Trying to find a model that refutes: True
% 6.99/7.59 Unfolded term: [| !!X Y. ~ X = Y | bnd_less_or_equal X Y;
% 6.99/7.59 !!X Y Z.
% 6.99/7.59 bnd_less_or_equal (bnd_add X (bnd_add Y Z)) (bnd_add (bnd_add X Y) Z);
% 6.99/7.59 !!X Y Z.
% 6.99/7.59 bnd_less_or_equal (bnd_add (bnd_add X Y) Z) (bnd_add X (bnd_add Y Z));
% 6.99/7.59 !!X Y Z. bnd_add (bnd_add X Y) Z = bnd_add X (bnd_add Y Z);
% 6.99/7.59 !!X Y. bnd_less_or_equal (bnd_add X Y) (bnd_add Y X);
% 6.99/7.59 !!X Y. bnd_add X Y = bnd_add Y X;
% 6.99/7.59 !!X Y Z.
% 6.99/7.59 (~ bnd_less_or_equal X Y | ~ bnd_less_or_equal Y Z) |
% 6.99/7.59 bnd_less_or_equal X Z;
% 6.99/7.59 !!X Y. bnd_less_or_equal X Y | bnd_less_or_equal Y X;
% 6.99/7.59 !!X Y Z W.
% 6.99/7.59 (~ bnd_less_or_equal X Y | ~ bnd_less_or_equal Z W) |
% 6.99/7.59 bnd_less_or_equal (bnd_add X Z) (bnd_add Y W);
% 6.99/7.59 !!X Y Z.
% 6.99/7.59 ~ bnd_less_or_equal X Y |
% 6.99/7.59 bnd_less_or_equal (bnd_add X Z) (bnd_add Y Z);
% 6.99/7.59 !!X. bnd_less_or_equal X bnd_n0 |
% 6.99/7.59 ~ bnd_less_or_equal (bnd_half X) bnd_n0;
% 6.99/7.59 !!X Z Y.
% 6.99/7.59 (~ bnd_less_or_equal X (bnd_half Z) |
% 6.99/7.59 ~ bnd_less_or_equal Y (bnd_half Z)) |
% 6.99/7.59 bnd_less_or_equal (bnd_add X Y) Z;
% 6.99/7.59 !!X. bnd_less_or_equal X (bnd_add (bnd_half X) (bnd_half X));
% 6.99/7.59 !!X. bnd_less_or_equal (bnd_add (bnd_half X) (bnd_half X)) X;
% 6.99/7.59 !!X. bnd_add (bnd_half X) (bnd_half X) = X;
% 6.99/7.59 !!X Y.
% 6.99/7.59 (bnd_less_or_equal X bnd_n0 | bnd_less_or_equal Y bnd_n0) |
% 6.99/7.59 ~ bnd_less_or_equal (bnd_minimum X Y) bnd_n0;
% 6.99/7.59 !!Y X. ~ bnd_less_or_equal Y X | bnd_less_or_equal Y (bnd_minimum X Y);
% 6.99/7.59 !!Z X Y. ~ bnd_less_or_equal Z (bnd_minimum X Y) | bnd_less_or_equal Z Y;
% 6.99/7.59 !!X Y. bnd_less_or_equal (bnd_minimum X Y) Y;
% 6.99/7.59 !!Y X. ~ bnd_less_or_equal Y X | bnd_minimum X Y = Y;
% 6.99/7.59 !!X Y. ~ bnd_less_or_equal X Y | bnd_less_or_equal X (bnd_minimum X Y);
% 6.99/7.59 !!Z X Y. ~ bnd_less_or_equal Z (bnd_minimum X Y) | bnd_less_or_equal Z X;
% 6.99/7.59 !!X Y. bnd_less_or_equal (bnd_minimum X Y) X;
% 6.99/7.59 !!X Y. ~ bnd_less_or_equal X Y | bnd_minimum X Y = X;
% 6.99/7.59 !!X Y Z.
% 6.99/7.59 ~ bnd_less_or_equal (bnd_add (bnd_absolute X) (bnd_absolute Y)) Z |
% 6.99/7.59 bnd_less_or_equal (bnd_absolute (bnd_add X Y)) Z;
% 6.99/7.59 !!X Y.
% 6.99/7.59 bnd_less_or_equal (bnd_absolute (bnd_add X Y))
% 6.99/7.59 (bnd_add (bnd_absolute X) (bnd_absolute Y)) |]
% 6.99/7.59 ==> True
% 6.99/7.59 Adding axioms...
% 6.99/7.60 Typedef.type_definition_def
% 9.99/10.57 ...done.
% 9.99/10.58 Ground types: ?'b, TPTP_Interpret.ind
% 9.99/10.58 Translating term (sizes: 1, 1) ...
% 12.29/12.80 Invoking SAT solver...
% 12.29/12.80 No model exists.
% 12.29/12.80 Translating term (sizes: 2, 1) ...
% 15.20/15.71 Invoking SAT solver...
% 15.20/15.71 No model exists.
% 15.20/15.71 Translating term (sizes: 1, 2) ...
% 25.83/26.35 Invoking SAT solver...
% 25.83/26.35 No model exists.
% 25.83/26.35 Translating term (sizes: 3, 1) ...
% 31.03/31.58 Invoking SAT solver...
% 31.03/31.58 No model exists.
% 31.03/31.58 Translating term (sizes: 2, 2) ...
% 49.36/49.88 Invoking SAT solver...
% 49.36/49.88 No model exists.
% 49.36/49.88 Translating term (sizes: 1, 3) ...
% 82.25/82.61 Invoking SAT solver...
% 82.25/82.61 No model exists.
% 82.25/82.61 Translating term (sizes: 4, 1) ...
% 94.59/94.96 Invoking SAT solver...
% 94.59/94.96 No model exists.
% 94.59/94.96 Translating term (sizes: 3, 2) ...
% 193.00/192.91 Invoking SAT solver...
% 193.00/192.91 No model exists.
% 193.00/192.91 Translating term (sizes: 2, 3) ...
% 267.22/266.64 Invoking SAT solver...
% 267.22/266.64 No model exists.
% 267.22/266.64 Translating term (sizes: 1, 4) ...
% 300.04/299.13 /export/starexec/sandbox/solver/lib/scripts/run-polyml-5.5.2: line 82: 3331 CPU time limit exceeded (core dumped) "$ISABELLE_HOME/lib/scripts/feeder" -p -h "$MLTEXT" -t "$MLEXIT" $FEEDER_OPTS
% 300.04/299.13 3332 (core dumped) | { read FPID; "$POLY" -q -i $ML_OPTIONS; RC="$?"; kill -TERM "$FPID"; exit "$RC"; }
% 300.04/299.14 /export/starexec/sandbox/solver/src/HOL/TPTP/lib/Tools/tptp_refute: line 26: 3277 Exit 152 "$ISABELLE_PROCESS" -q -e "use_thy \"/tmp/$SCRATCH\"; exit 1;" HOL-TPTP
% 300.04/299.14 3278 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.$"
%------------------------------------------------------------------------------