TSTP Solution File: FLD081-2 by Refute---2015
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Refute---2015
% Problem : FLD081-2 : TPTP v6.4.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : isabelle tptp_refute %d %s
% Computer : n040.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:22 EDT 2016
% Result : Timeout 300.01s
% 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 : FLD081-2 : TPTP v6.4.0. Bugfixed v2.1.0.
% 0.00/0.04 % Command : isabelle tptp_refute %d %s
% 0.02/0.22 % Computer : n040.star.cs.uiowa.edu
% 0.02/0.22 % Model : x86_64 x86_64
% 0.02/0.22 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/0.22 % Memory : 32218.75MB
% 0.02/0.22 % OS : Linux 3.10.0-327.10.1.el7.x86_64
% 0.02/0.22 % CPULimit : 300
% 0.02/0.22 % DateTime : Sat Apr 9 10:55:09 CDT 2016
% 0.02/0.22 % CPUTime :
% 6.27/5.86 > val it = (): unit
% 6.47/6.07 Trying to find a model that refutes: True
% 7.37/6.91 Unfolded term: [| ~ bnd_less_or_equal bnd_u bnd_v;
% 7.37/6.91 bnd_equalish (bnd_multiply bnd_d bnd_b) bnd_v;
% 7.37/6.91 bnd_equalish (bnd_multiply bnd_a bnd_c) bnd_u;
% 7.37/6.91 bnd_less_or_equal bnd_c bnd_d;
% 7.37/6.91 bnd_less_or_equal bnd_additive_identity bnd_c;
% 7.37/6.91 bnd_less_or_equal bnd_a bnd_b;
% 7.37/6.91 bnd_less_or_equal bnd_additive_identity bnd_a; bnd_defined bnd_v;
% 7.37/6.91 bnd_defined bnd_u; bnd_defined bnd_d; bnd_defined bnd_c;
% 7.37/6.91 bnd_defined bnd_b; bnd_defined bnd_a;
% 7.37/6.91 ~ bnd_equalish bnd_additive_identity bnd_multiplicative_identity;
% 7.37/6.91 !!Y Z X.
% 7.37/6.91 (bnd_less_or_equal Y Z | ~ bnd_less_or_equal X Z) |
% 7.37/6.91 ~ bnd_equalish X Y;
% 7.37/6.91 !!X Z Y.
% 7.37/6.91 (bnd_equalish (bnd_multiply X Z) (bnd_multiply Y Z) |
% 7.37/6.91 ~ bnd_defined Z) |
% 7.37/6.91 ~ bnd_equalish X Y;
% 7.37/6.91 !!X Z Y.
% 7.37/6.91 (bnd_equalish (bnd_add X Z) (bnd_add Y Z) | ~ bnd_defined Z) |
% 7.37/6.91 ~ bnd_equalish X Y;
% 7.37/6.91 !!X Z Y. (bnd_equalish X Z | ~ bnd_equalish X Y) | ~ bnd_equalish Y Z;
% 7.37/6.91 !!X Y. bnd_equalish X Y | ~ bnd_equalish Y X;
% 7.37/6.91 !!X. bnd_equalish X X | ~ bnd_defined X;
% 7.37/6.91 !!Y Z.
% 7.37/6.91 (bnd_less_or_equal bnd_additive_identity (bnd_multiply Y Z) |
% 7.37/6.91 ~ bnd_less_or_equal bnd_additive_identity Y) |
% 7.37/6.91 ~ bnd_less_or_equal bnd_additive_identity Z;
% 7.37/6.91 !!X Z Y.
% 7.37/6.91 (bnd_less_or_equal (bnd_add X Z) (bnd_add Y Z) | ~ bnd_defined Z) |
% 7.37/6.91 ~ bnd_less_or_equal X Y;
% 7.37/6.91 !!X Y.
% 7.37/6.91 ((bnd_less_or_equal X Y | bnd_less_or_equal Y X) | ~ bnd_defined X) |
% 7.37/6.91 ~ bnd_defined Y;
% 7.37/6.91 !!X Z Y.
% 7.37/6.91 (bnd_less_or_equal X Z | ~ bnd_less_or_equal X Y) |
% 7.37/6.91 ~ bnd_less_or_equal Y Z;
% 7.37/6.91 !!X Y.
% 7.37/6.91 (bnd_equalish X Y | ~ bnd_less_or_equal X Y) |
% 7.37/6.91 ~ bnd_less_or_equal Y X;
% 7.37/6.91 !!X. (bnd_defined (bnd_multiplicative_inverse X) | ~ bnd_defined X) |
% 7.37/6.91 bnd_equalish X bnd_additive_identity;
% 7.37/6.91 bnd_defined bnd_multiplicative_identity;
% 7.37/6.91 !!X Y.
% 7.37/6.91 (bnd_defined (bnd_multiply X Y) | ~ bnd_defined X) | ~ bnd_defined Y;
% 7.37/6.91 !!X. bnd_defined (bnd_additive_inverse X) | ~ bnd_defined X;
% 7.37/6.91 bnd_defined bnd_additive_identity;
% 7.37/6.91 !!X Y. (bnd_defined (bnd_add X Y) | ~ bnd_defined X) | ~ bnd_defined Y;
% 7.37/6.91 !!X Z Y.
% 7.37/6.91 ((bnd_equalish (bnd_add (bnd_multiply X Z) (bnd_multiply Y Z))
% 7.37/6.91 (bnd_multiply (bnd_add X Y) Z) |
% 7.37/6.91 ~ bnd_defined X) |
% 7.37/6.91 ~ bnd_defined Y) |
% 7.37/6.91 ~ bnd_defined Z;
% 7.37/6.91 !!X Y.
% 7.37/6.91 (bnd_equalish (bnd_multiply X Y) (bnd_multiply Y X) |
% 7.37/6.91 ~ bnd_defined X) |
% 7.37/6.91 ~ bnd_defined Y;
% 7.37/6.91 !!X. (bnd_equalish (bnd_multiply X (bnd_multiplicative_inverse X))
% 7.37/6.91 bnd_multiplicative_identity |
% 7.37/6.91 ~ bnd_defined X) |
% 7.37/6.91 bnd_equalish X bnd_additive_identity;
% 7.37/6.91 !!X. bnd_equalish (bnd_multiply bnd_multiplicative_identity X) X |
% 7.37/6.91 ~ bnd_defined X;
% 7.37/6.91 !!X Y Z.
% 7.37/6.91 ((bnd_equalish (bnd_multiply X (bnd_multiply Y Z))
% 7.37/6.91 (bnd_multiply (bnd_multiply X Y) Z) |
% 7.37/6.91 ~ bnd_defined X) |
% 7.37/6.91 ~ bnd_defined Y) |
% 7.37/6.91 ~ bnd_defined Z;
% 7.37/6.91 !!X Y.
% 7.37/6.91 (bnd_equalish (bnd_add X Y) (bnd_add Y X) | ~ bnd_defined X) |
% 7.37/6.91 ~ bnd_defined Y;
% 7.37/6.91 !!X. bnd_equalish (bnd_add X (bnd_additive_inverse X))
% 7.37/6.91 bnd_additive_identity |
% 7.37/6.91 ~ bnd_defined X;
% 7.37/6.91 !!X. bnd_equalish (bnd_add bnd_additive_identity X) X | ~ bnd_defined X;
% 7.37/6.91 !!X Y Z.
% 7.37/6.91 ((bnd_equalish (bnd_add X (bnd_add Y Z)) (bnd_add (bnd_add X Y) Z) |
% 7.37/6.91 ~ bnd_defined X) |
% 7.37/6.91 ~ bnd_defined Y) |
% 7.37/6.91 ~ bnd_defined Z |]
% 7.37/6.91 ==> True
% 7.37/6.91 Adding axioms...
% 7.37/6.92 Typedef.type_definition_def
% 10.89/10.40 ...done.
% 10.89/10.40 Ground types: ?'b, TPTP_Interpret.ind
% 10.89/10.40 Translating term (sizes: 1, 1) ...
% 13.89/13.45 Invoking SAT solver...
% 13.89/13.45 No model exists.
% 13.89/13.45 Translating term (sizes: 2, 1) ...
% 17.59/17.19 Invoking SAT solver...
% 18.39/17.93 No model exists.
% 18.39/17.93 Translating term (sizes: 1, 2) ...
% 29.50/29.04 Invoking SAT solver...
% 29.50/29.04 No model exists.
% 29.50/29.04 Translating term (sizes: 3, 1) ...
% 35.61/35.13 Invoking SAT solver...
% 35.61/35.13 No model exists.
% 35.61/35.13 Translating term (sizes: 2, 2) ...
% 55.14/54.68 Invoking SAT solver...
% 55.14/54.68 No model exists.
% 55.14/54.68 Translating term (sizes: 1, 3) ...
% 87.73/87.17 Invoking SAT solver...
% 87.73/87.17 No model exists.
% 87.73/87.17 Translating term (sizes: 4, 1) ...
% 101.07/100.41 Invoking SAT solver...
% 101.07/100.41 No model exists.
% 101.07/100.41 Translating term (sizes: 3, 2) ...
% 200.75/199.78 Invoking SAT solver...
% 200.75/199.78 No model exists.
% 200.75/199.78 Translating term (sizes: 2, 3) ...
% 274.60/273.11 Invoking SAT solver...
% 274.60/273.11 No model exists.
% 274.60/273.11 Translating term (sizes: 1, 4) ...
% 300.01/298.32 /export/starexec/sandbox2/solver/lib/scripts/run-polyml-5.5.2: line 82: 52549 CPU time limit exceeded (core dumped) "$ISABELLE_HOME/lib/scripts/feeder" -p -h "$MLTEXT" -t "$MLEXIT" $FEEDER_OPTS
% 300.01/298.32 52550 (core dumped) | { read FPID; "$POLY" -q -i $ML_OPTIONS; RC="$?"; kill -TERM "$FPID"; exit "$RC"; }
% 300.01/298.33 /export/starexec/sandbox2/solver/src/HOL/TPTP/lib/Tools/tptp_refute: line 26: 52495 Exit 152 "$ISABELLE_PROCESS" -q -e "use_thy \"/tmp/$SCRATCH\"; exit 1;" HOL-TPTP
% 300.01/298.33 52496 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.$"
%------------------------------------------------------------------------------