TSTP Solution File: FLD053-2 by Refute---2015
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Refute---2015
% Problem : FLD053-2 : TPTP v6.4.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : isabelle tptp_refute %d %s
% Computer : n067.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 14:19:11 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 : FLD053-2 : TPTP v6.4.0. Bugfixed v2.1.0.
% 0.00/0.04 % Command : isabelle tptp_refute %d %s
% 0.03/0.22 % Computer : n067.star.cs.uiowa.edu
% 0.03/0.22 % Model : x86_64 x86_64
% 0.03/0.22 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.03/0.22 % Memory : 32218.75MB
% 0.03/0.22 % OS : Linux 3.10.0-327.10.1.el7.x86_64
% 0.03/0.22 % CPULimit : 300
% 0.03/0.22 % DateTime : Sat Apr 9 10:37:09 CDT 2016
% 0.03/0.23 % CPUTime :
% 6.29/5.83 > val it = (): unit
% 6.49/6.05 Trying to find a model that refutes: True
% 7.59/7.11 Unfolded term: [| ~ bnd_equalish (bnd_multiply bnd_k (bnd_multiplicative_inverse bnd_l))
% 7.59/7.11 bnd_u;
% 7.59/7.11 bnd_equalish (bnd_multiply bnd_b bnd_d) bnd_l;
% 7.59/7.11 bnd_equalish (bnd_add bnd_p (bnd_additive_inverse bnd_q)) bnd_k;
% 7.59/7.11 bnd_equalish (bnd_multiply bnd_b bnd_c) bnd_q;
% 7.59/7.11 bnd_equalish (bnd_multiply bnd_a bnd_d) bnd_p;
% 7.59/7.11 bnd_equalish (bnd_add bnd_s (bnd_additive_inverse bnd_t)) bnd_u;
% 7.59/7.11 bnd_equalish (bnd_multiply bnd_c (bnd_multiplicative_inverse bnd_d))
% 7.59/7.11 bnd_t;
% 7.59/7.11 bnd_equalish (bnd_multiply bnd_a (bnd_multiplicative_inverse bnd_b))
% 7.59/7.11 bnd_s;
% 7.59/7.11 ~ bnd_equalish bnd_d bnd_additive_identity;
% 7.59/7.11 ~ bnd_equalish bnd_b bnd_additive_identity; bnd_defined bnd_t;
% 7.59/7.11 bnd_defined bnd_s; bnd_defined bnd_q; bnd_defined bnd_p;
% 7.59/7.11 bnd_defined bnd_l; bnd_defined bnd_k; bnd_defined bnd_u;
% 7.59/7.11 bnd_defined bnd_d; bnd_defined bnd_c; bnd_defined bnd_b;
% 7.59/7.11 bnd_defined bnd_a;
% 7.59/7.11 ~ bnd_equalish bnd_additive_identity bnd_multiplicative_identity;
% 7.59/7.11 !!Y Z X.
% 7.59/7.11 (bnd_less_or_equal Y Z | ~ bnd_less_or_equal X Z) |
% 7.59/7.11 ~ bnd_equalish X Y;
% 7.59/7.11 !!X Z Y.
% 7.59/7.11 (bnd_equalish (bnd_multiply X Z) (bnd_multiply Y Z) |
% 7.59/7.11 ~ bnd_defined Z) |
% 7.59/7.11 ~ bnd_equalish X Y;
% 7.59/7.11 !!X Z Y.
% 7.59/7.11 (bnd_equalish (bnd_add X Z) (bnd_add Y Z) | ~ bnd_defined Z) |
% 7.59/7.11 ~ bnd_equalish X Y;
% 7.59/7.11 !!X Z Y. (bnd_equalish X Z | ~ bnd_equalish X Y) | ~ bnd_equalish Y Z;
% 7.59/7.11 !!X Y. bnd_equalish X Y | ~ bnd_equalish Y X;
% 7.59/7.11 !!X. bnd_equalish X X | ~ bnd_defined X;
% 7.59/7.11 !!Y Z.
% 7.59/7.11 (bnd_less_or_equal bnd_additive_identity (bnd_multiply Y Z) |
% 7.59/7.11 ~ bnd_less_or_equal bnd_additive_identity Y) |
% 7.59/7.11 ~ bnd_less_or_equal bnd_additive_identity Z;
% 7.59/7.11 !!X Z Y.
% 7.59/7.11 (bnd_less_or_equal (bnd_add X Z) (bnd_add Y Z) | ~ bnd_defined Z) |
% 7.59/7.11 ~ bnd_less_or_equal X Y;
% 7.59/7.11 !!X Y.
% 7.59/7.11 ((bnd_less_or_equal X Y | bnd_less_or_equal Y X) | ~ bnd_defined X) |
% 7.59/7.11 ~ bnd_defined Y;
% 7.59/7.11 !!X Z Y.
% 7.59/7.11 (bnd_less_or_equal X Z | ~ bnd_less_or_equal X Y) |
% 7.59/7.11 ~ bnd_less_or_equal Y Z;
% 7.59/7.11 !!X Y.
% 7.59/7.11 (bnd_equalish X Y | ~ bnd_less_or_equal X Y) |
% 7.59/7.11 ~ bnd_less_or_equal Y X;
% 7.59/7.11 !!X. (bnd_defined (bnd_multiplicative_inverse X) | ~ bnd_defined X) |
% 7.59/7.11 bnd_equalish X bnd_additive_identity;
% 7.59/7.11 bnd_defined bnd_multiplicative_identity;
% 7.59/7.11 !!X Y.
% 7.59/7.11 (bnd_defined (bnd_multiply X Y) | ~ bnd_defined X) | ~ bnd_defined Y;
% 7.59/7.11 !!X. bnd_defined (bnd_additive_inverse X) | ~ bnd_defined X;
% 7.59/7.11 bnd_defined bnd_additive_identity;
% 7.59/7.11 !!X Y. (bnd_defined (bnd_add X Y) | ~ bnd_defined X) | ~ bnd_defined Y;
% 7.59/7.11 !!X Z Y.
% 7.59/7.11 ((bnd_equalish (bnd_add (bnd_multiply X Z) (bnd_multiply Y Z))
% 7.59/7.11 (bnd_multiply (bnd_add X Y) Z) |
% 7.59/7.11 ~ bnd_defined X) |
% 7.59/7.11 ~ bnd_defined Y) |
% 7.59/7.11 ~ bnd_defined Z;
% 7.59/7.11 !!X Y.
% 7.59/7.11 (bnd_equalish (bnd_multiply X Y) (bnd_multiply Y X) |
% 7.59/7.11 ~ bnd_defined X) |
% 7.59/7.11 ~ bnd_defined Y;
% 7.59/7.11 !!X. (bnd_equalish (bnd_multiply X (bnd_multiplicative_inverse X))
% 7.59/7.11 bnd_multiplicative_identity |
% 7.59/7.11 ~ bnd_defined X) |
% 7.59/7.11 bnd_equalish X bnd_additive_identity;
% 7.59/7.11 !!X. bnd_equalish (bnd_multiply bnd_multiplicative_identity X) X |
% 7.59/7.11 ~ bnd_defined X;
% 7.59/7.11 !!X Y Z.
% 7.59/7.11 ((bnd_equalish (bnd_multiply X (bnd_multiply Y Z))
% 7.59/7.11 (bnd_multiply (bnd_multiply X Y) Z) |
% 7.59/7.11 ~ bnd_defined X) |
% 7.59/7.11 ~ bnd_defined Y) |
% 7.59/7.11 ~ bnd_defined Z;
% 7.59/7.11 !!X Y.
% 7.59/7.11 (bnd_equalish (bnd_add X Y) (bnd_add Y X) | ~ bnd_defined X) |
% 7.59/7.11 ~ bnd_defined Y;
% 7.59/7.11 !!X. bnd_equalish (bnd_add X (bnd_additive_inverse X))
% 7.59/7.11 bnd_additive_identity |
% 7.59/7.11 ~ bnd_defined X;
% 7.59/7.11 !!X. bnd_equalish (bnd_add bnd_additive_identity X) X | ~ bnd_defined X;
% 7.59/7.11 !!X Y Z.
% 7.59/7.11 ((bnd_equalish (bnd_add X (bnd_add Y Z)) (bnd_add (bnd_add X Y) Z) |
% 7.59/7.11 ~ bnd_defined X) |
% 7.59/7.11 ~ bnd_defined Y) |
% 7.59/7.11 ~ bnd_defined Z |]
% 7.59/7.11 ==> True
% 7.59/7.11 Adding axioms...
% 7.59/7.12 Typedef.type_definition_def
% 11.60/11.18 ...done.
% 11.60/11.19 Ground types: ?'b, TPTP_Interpret.ind
% 11.60/11.19 Translating term (sizes: 1, 1) ...
% 15.11/14.61 Invoking SAT solver...
% 15.11/14.61 No model exists.
% 15.11/14.61 Translating term (sizes: 2, 1) ...
% 19.22/18.73 Invoking SAT solver...
% 19.22/18.73 No model exists.
% 19.22/18.73 Translating term (sizes: 1, 2) ...
% 31.44/30.91 Invoking SAT solver...
% 31.44/30.91 No model exists.
% 31.44/30.91 Translating term (sizes: 3, 1) ...
% 37.97/37.43 Invoking SAT solver...
% 37.97/37.43 No model exists.
% 37.97/37.43 Translating term (sizes: 2, 2) ...
% 57.90/57.38 Invoking SAT solver...
% 57.90/57.38 No model exists.
% 57.90/57.38 Translating term (sizes: 1, 3) ...
% 90.93/90.26 Invoking SAT solver...
% 90.93/90.26 No model exists.
% 90.93/90.26 Translating term (sizes: 4, 1) ...
% 104.56/103.88 Invoking SAT solver...
% 104.56/103.88 No model exists.
% 104.56/103.88 Translating term (sizes: 3, 2) ...
% 204.56/203.32 Invoking SAT solver...
% 204.56/203.32 No model exists.
% 204.56/203.32 Translating term (sizes: 2, 3) ...
% 278.89/277.08 Invoking SAT solver...
% 278.89/277.08 No model exists.
% 278.89/277.08 Translating term (sizes: 1, 4) ...
% 300.11/298.03 /export/starexec/sandbox2/solver/lib/scripts/run-polyml-5.5.2: line 82: 15267 CPU time limit exceeded (core dumped) "$ISABELLE_HOME/lib/scripts/feeder" -p -h "$MLTEXT" -t "$MLEXIT" $FEEDER_OPTS
% 300.11/298.03 15268 (core dumped) | { read FPID; "$POLY" -q -i $ML_OPTIONS; RC="$?"; kill -TERM "$FPID"; exit "$RC"; }
% 300.11/298.04 /export/starexec/sandbox2/solver/src/HOL/TPTP/lib/Tools/tptp_refute: line 26: 15213 Exit 152 "$ISABELLE_PROCESS" -q -e "use_thy \"/tmp/$SCRATCH\"; exit 1;" HOL-TPTP
% 300.11/298.04 15214 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.$"
%------------------------------------------------------------------------------