TSTP Solution File: ANA001-1 by Refute---2015
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Refute---2015
% Problem : ANA001-1 : TPTP v6.4.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : isabelle tptp_refute %d %s
% Computer : n096.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:13 EDT 2016
% Result : Timeout 300.08s
% 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 : ANA001-1 : TPTP v6.4.0. Released v1.0.0.
% 0.02/0.04 % Command : isabelle tptp_refute %d %s
% 0.03/0.23 % Computer : n096.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:25:24 CDT 2016
% 0.03/0.23 % CPUTime :
% 6.29/5.85 > val it = (): unit
% 6.48/6.05 Trying to find a model that refutes: True
% 7.00/6.60 Unfolded term: [| !!X. ~ bnd_less_than_or_equal (bnd_f X) (bnd_f (bnd_k X)) |
% 7.00/6.60 ~ bnd_in_interval bnd_lower_bound X bnd_upper_bound;
% 7.00/6.60 !!X. ~ bnd_in_interval bnd_lower_bound X bnd_upper_bound |
% 7.00/6.60 bnd_less_than_or_equal (bnd_k X) bnd_upper_bound;
% 7.00/6.60 !!X. ~ bnd_in_interval bnd_lower_bound X bnd_upper_bound |
% 7.00/6.60 bnd_less_than_or_equal bnd_lower_bound (bnd_k X);
% 7.00/6.60 !!X Y.
% 7.00/6.60 ((bnd_less_than_or_equal (bnd_h X) Y |
% 7.00/6.60 ~ bnd_in_interval bnd_lower_bound X bnd_upper_bound) |
% 7.00/6.60 ~ bnd_in_interval bnd_lower_bound Y bnd_upper_bound) |
% 7.00/6.60 ~ bnd_less_than_or_equal (bnd_f Y) (bnd_f X);
% 7.00/6.60 !!X. bnd_less_than_or_equal (bnd_f (bnd_h X)) (bnd_f X) |
% 7.00/6.60 ~ bnd_in_interval bnd_lower_bound X bnd_upper_bound;
% 7.00/6.60 !!X. bnd_less_than_or_equal (bnd_h X) bnd_upper_bound |
% 7.00/6.60 ~ bnd_in_interval bnd_lower_bound X bnd_upper_bound;
% 7.00/6.60 !!X. bnd_less_than_or_equal bnd_lower_bound (bnd_h X) |
% 7.00/6.60 ~ bnd_in_interval bnd_lower_bound X bnd_upper_bound;
% 7.00/6.60 !!X. (bnd_less_than_or_equal X bnd_extreme_point |
% 7.00/6.60 ~ bnd_in_interval bnd_lower_bound X bnd_upper_bound) |
% 7.00/6.60 bnd_less_than_or_equal (bnd_q X) X;
% 7.00/6.60 !!X. (bnd_less_than_or_equal X bnd_extreme_point |
% 7.00/6.60 ~ bnd_in_interval bnd_lower_bound X bnd_upper_bound) |
% 7.00/6.60 ~ bnd_less_than_or_equal (bnd_f X) (bnd_q X);
% 7.00/6.60 !!X. (bnd_less_than_or_equal X bnd_extreme_point |
% 7.00/6.60 ~ bnd_in_interval bnd_lower_bound X bnd_upper_bound) |
% 7.00/6.60 bnd_less_than_or_equal bnd_lower_bound (bnd_q X);
% 7.00/6.60 !!X. bnd_less_than_or_equal (bnd_f bnd_extreme_point) (bnd_f X) |
% 7.00/6.60 ~ bnd_in_interval bnd_lower_bound X bnd_extreme_point;
% 7.00/6.60 bnd_less_than_or_equal bnd_extreme_point bnd_upper_bound;
% 7.00/6.60 bnd_less_than_or_equal bnd_lower_bound bnd_extreme_point;
% 7.00/6.60 !!Lower X Upper.
% 7.00/6.60 (bnd_in_interval Lower X Upper | ~ bnd_less_than_or_equal Lower X) |
% 7.00/6.60 ~ bnd_less_than_or_equal X Upper;
% 7.00/6.60 !!X Y.
% 7.00/6.60 (bnd_less_than_or_equal (bnd_f X) (bnd_f Y) |
% 7.00/6.60 ~ bnd_less_than_or_equal X Y) |
% 7.00/6.60 ~ bnd_less_than_or_equal Y X;
% 7.00/6.60 !!X Z Y.
% 7.00/6.60 (bnd_less_than_or_equal X Z | ~ bnd_less_than_or_equal X Y) |
% 7.00/6.60 ~ bnd_less_than_or_equal Y Z;
% 7.00/6.60 !!X Y. bnd_less_than_or_equal X Y | bnd_less_than_or_equal Y X;
% 7.00/6.60 !!X. bnd_less_than_or_equal X X |]
% 7.00/6.60 ==> True
% 7.00/6.60 Adding axioms...
% 7.00/6.61 Typedef.type_definition_def
% 9.20/8.79 ...done.
% 9.20/8.80 Ground types: ?'b, TPTP_Interpret.ind
% 9.20/8.80 Translating term (sizes: 1, 1) ...
% 11.09/10.62 Invoking SAT solver...
% 11.09/10.62 No model exists.
% 11.09/10.62 Translating term (sizes: 2, 1) ...
% 13.61/13.12 Invoking SAT solver...
% 13.61/13.12 No model exists.
% 13.61/13.12 Translating term (sizes: 1, 2) ...
% 18.21/17.79 Invoking SAT solver...
% 18.21/17.79 No model exists.
% 18.21/17.79 Translating term (sizes: 3, 1) ...
% 23.22/22.70 Invoking SAT solver...
% 23.22/22.70 No model exists.
% 23.22/22.70 Translating term (sizes: 2, 2) ...
% 35.66/35.12 Invoking SAT solver...
% 35.66/35.12 No model exists.
% 35.66/35.12 Translating term (sizes: 1, 3) ...
% 45.47/44.95 Invoking SAT solver...
% 45.47/44.95 No model exists.
% 45.47/44.95 Translating term (sizes: 4, 1) ...
% 57.51/57.00 Invoking SAT solver...
% 57.51/57.00 No model exists.
% 57.51/57.00 Translating term (sizes: 3, 2) ...
% 149.95/149.03 Invoking SAT solver...
% 149.95/149.03 No model exists.
% 149.95/149.03 Translating term (sizes: 2, 3) ...
% 200.74/199.56 Invoking SAT solver...
% 200.74/199.56 No model exists.
% 200.74/199.56 Translating term (sizes: 1, 4) ...
% 219.19/217.81 Invoking SAT solver...
% 219.19/217.81 No model exists.
% 219.19/217.81 Translating term (sizes: 5, 1) ...
% 251.03/249.49 Invoking SAT solver...
% 251.03/249.49 No model exists.
% 251.03/249.49 Translating term (sizes: 4, 2) ...
% 300.08/298.03 /export/starexec/sandbox2/solver/lib/scripts/run-polyml-5.5.2: line 82: 62554 CPU time limit exceeded (core dumped) "$ISABELLE_HOME/lib/scripts/feeder" -p -h "$MLTEXT" -t "$MLEXIT" $FEEDER_OPTS
% 300.08/298.03 62555 (core dumped) | { read FPID; "$POLY" -q -i $ML_OPTIONS; RC="$?"; kill -TERM "$FPID"; exit "$RC"; }
% 300.08/298.04 /export/starexec/sandbox2/solver/src/HOL/TPTP/lib/Tools/tptp_refute: line 26: 62500 Exit 152 "$ISABELLE_PROCESS" -q -e "use_thy \"/tmp/$SCRATCH\"; exit 1;" HOL-TPTP
% 300.08/298.04 62501 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.$"
%------------------------------------------------------------------------------