TSTP Solution File: ANA004-2 by Refute---2015
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Refute---2015
% Problem : ANA004-2 : TPTP v6.4.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : isabelle tptp_refute %d %s
% Computer : n071.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:14 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 : ANA004-2 : TPTP v6.4.0. Released v1.0.0.
% 0.00/0.04 % Command : isabelle tptp_refute %d %s
% 0.03/0.23 % Computer : n071.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:26:39 CDT 2016
% 0.03/0.23 % CPUTime :
% 6.30/5.85 > val it = (): unit
% 6.50/6.06 Trying to find a model that refutes: True
% 7.10/6.64 Unfolded term: [| !!X. ~ bnd_less_than bnd_n0 X |
% 7.10/6.64 ~ bnd_less_than
% 7.10/6.64 (bnd_absolute
% 7.10/6.64 (bnd_add (bnd_add (bnd_f (bnd_fp33 X)) (bnd_minus bnd_l1))
% 7.10/6.64 (bnd_add (bnd_g (bnd_fp33 X)) (bnd_minus bnd_l2))))
% 7.10/6.64 bnd_b;
% 7.10/6.64 !!X. ~ bnd_less_than bnd_n0 X |
% 7.10/6.64 bnd_less_than
% 7.10/6.64 (bnd_absolute (bnd_add (bnd_fp33 X) (bnd_minus bnd_a))) X;
% 7.10/6.64 bnd_less_than bnd_n0 bnd_b;
% 7.10/6.64 !!X Y.
% 7.10/6.64 (~ bnd_less_than bnd_n0 X |
% 7.10/6.64 ~ bnd_less_than (bnd_absolute (bnd_add Y (bnd_minus bnd_a)))
% 7.10/6.64 (bnd_fp32 X)) |
% 7.10/6.64 bnd_less_than (bnd_absolute (bnd_add (bnd_g Y) (bnd_minus bnd_l2))) X;
% 7.10/6.64 !!X. ~ bnd_less_than bnd_n0 X | bnd_less_than bnd_n0 (bnd_fp32 X);
% 7.10/6.64 !!X Y.
% 7.10/6.64 (~ bnd_less_than bnd_n0 X |
% 7.10/6.64 ~ bnd_less_than (bnd_absolute (bnd_add Y (bnd_minus bnd_a)))
% 7.10/6.64 (bnd_fp31 X)) |
% 7.10/6.64 bnd_less_than (bnd_absolute (bnd_add (bnd_f Y) (bnd_minus bnd_l1))) X;
% 7.10/6.64 !!X. ~ bnd_less_than bnd_n0 X | bnd_less_than bnd_n0 (bnd_fp31 X);
% 7.10/6.64 !!Xa. ~ bnd_less_than bnd_n0 Xa | bnd_less_than bnd_n0 (bnd_half Xa);
% 7.10/6.64 !!X Xa Y.
% 7.10/6.64 (~ bnd_less_than X (bnd_half Xa) | ~ bnd_less_than Y (bnd_half Xa)) |
% 7.10/6.64 bnd_less_than (bnd_add X Y) Xa;
% 7.10/6.64 !!X Y.
% 7.10/6.64 (~ bnd_less_than bnd_n0 X | ~ bnd_less_than bnd_n0 Y) |
% 7.10/6.64 bnd_less_than (bnd_minimum X Y) Y;
% 7.10/6.64 !!X Y.
% 7.10/6.64 (~ bnd_less_than bnd_n0 X | ~ bnd_less_than bnd_n0 Y) |
% 7.10/6.64 bnd_less_than (bnd_minimum X Y) X;
% 7.10/6.64 !!X Y.
% 7.10/6.64 (~ bnd_less_than bnd_n0 X | ~ bnd_less_than bnd_n0 Y) |
% 7.10/6.64 bnd_less_than bnd_n0 (bnd_minimum X Y);
% 7.10/6.64 !!X Y Z. (~ bnd_less_than X Y | ~ bnd_less_than Y Z) | bnd_less_than X Z;
% 7.10/6.64 !!X. ~ bnd_less_than X X; !!X. bnd_equalish (bnd_add bnd_n0 X) X;
% 7.10/6.64 !!X. bnd_equalish (bnd_add X bnd_n0) X |]
% 7.10/6.64 ==> True
% 7.10/6.64 Adding axioms...
% 7.10/6.65 Typedef.type_definition_def
% 9.49/9.05 ...done.
% 9.49/9.05 Ground types: ?'b, TPTP_Interpret.ind
% 9.49/9.05 Translating term (sizes: 1, 1) ...
% 11.41/10.92 Invoking SAT solver...
% 11.41/10.92 No model exists.
% 11.41/10.92 Translating term (sizes: 2, 1) ...
% 13.91/13.43 Invoking SAT solver...
% 13.91/13.43 No model exists.
% 13.91/13.43 Translating term (sizes: 1, 2) ...
% 19.51/19.01 Invoking SAT solver...
% 19.51/19.01 No model exists.
% 19.51/19.01 Translating term (sizes: 3, 1) ...
% 24.42/23.91 Invoking SAT solver...
% 24.42/23.91 No model exists.
% 24.42/23.91 Translating term (sizes: 2, 2) ...
% 37.74/37.28 Invoking SAT solver...
% 37.74/37.28 No model exists.
% 37.74/37.28 Translating term (sizes: 1, 3) ...
% 50.27/49.76 Invoking SAT solver...
% 50.27/49.76 No model exists.
% 50.27/49.76 Translating term (sizes: 4, 1) ...
% 62.30/61.76 Invoking SAT solver...
% 62.30/61.76 No model exists.
% 62.30/61.76 Translating term (sizes: 3, 2) ...
% 155.45/154.52 Invoking SAT solver...
% 155.45/154.52 No model exists.
% 155.45/154.52 Translating term (sizes: 2, 3) ...
% 208.99/207.80 Invoking SAT solver...
% 208.99/207.80 No model exists.
% 208.99/207.80 Translating term (sizes: 1, 4) ...
% 233.09/231.61 Invoking SAT solver...
% 233.09/231.61 No model exists.
% 233.09/231.61 Translating term (sizes: 5, 1) ...
% 265.36/263.61 Invoking SAT solver...
% 265.36/263.61 No model exists.
% 265.36/263.61 Translating term (sizes: 4, 2) ...
% 300.11/298.03 /export/starexec/sandbox/solver/lib/scripts/run-polyml-5.5.2: line 82: 4263 CPU time limit exceeded (core dumped) "$ISABELLE_HOME/lib/scripts/feeder" -p -h "$MLTEXT" -t "$MLEXIT" $FEEDER_OPTS
% 300.11/298.03 4264 (core dumped) | { read FPID; "$POLY" -q -i $ML_OPTIONS; RC="$?"; kill -TERM "$FPID"; exit "$RC"; }
% 300.11/298.04 /export/starexec/sandbox/solver/src/HOL/TPTP/lib/Tools/tptp_refute: line 26: 4209 Exit 152 "$ISABELLE_PROCESS" -q -e "use_thy \"/tmp/$SCRATCH\"; exit 1;" HOL-TPTP
% 300.11/298.04 4210 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.$"
%------------------------------------------------------------------------------