TSTP Solution File: FLD098-1 by Refute---2015

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Refute---2015
% Problem  : FLD098-1 : TPTP v6.4.0. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : isabelle tptp_refute %d %s

% Computer : n153.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:27 EDT 2016

% Result   : Timeout 300.02s
% 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  : FLD098-1 : TPTP v6.4.0. Bugfixed v2.1.0.
% 0.00/0.04  % Command  : isabelle tptp_refute %d %s
% 0.03/0.23  % Computer : n153.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 11:06:09 CDT 2016
% 0.03/0.23  % CPUTime  : 
% 6.29/5.86  > val it = (): unit
% 6.49/6.06  Trying to find a model that refutes: True
% 7.29/6.84  Unfolded term: [| ~ bnd_less_or_equal
% 7.29/6.84        (bnd_add bnd_multiplicative_identity
% 7.29/6.84          (bnd_additive_inverse (bnd_add bnd_a bnd_b)))
% 7.29/6.84        (bnd_multiply
% 7.29/6.84          (bnd_add bnd_multiplicative_identity (bnd_additive_inverse bnd_a))
% 7.29/6.84          (bnd_add bnd_multiplicative_identity (bnd_additive_inverse bnd_b)));
% 7.29/6.84     bnd_less_or_equal bnd_additive_identity bnd_b;
% 7.29/6.84     bnd_less_or_equal bnd_additive_identity bnd_a; bnd_defined bnd_b;
% 7.29/6.84     bnd_defined bnd_a;
% 7.29/6.84     ~ bnd_equalish bnd_additive_identity bnd_multiplicative_identity;
% 7.29/6.84     !!Y Z X.
% 7.29/6.84        (bnd_less_or_equal Y Z | ~ bnd_less_or_equal X Z) |
% 7.29/6.84        ~ bnd_equalish X Y;
% 7.29/6.84     !!X Z Y.
% 7.29/6.84        (bnd_equalish (bnd_multiply X Z) (bnd_multiply Y Z) |
% 7.29/6.84         ~ bnd_defined Z) |
% 7.29/6.84        ~ bnd_equalish X Y;
% 7.29/6.84     !!X Z Y.
% 7.29/6.84        (bnd_equalish (bnd_add X Z) (bnd_add Y Z) | ~ bnd_defined Z) |
% 7.29/6.84        ~ bnd_equalish X Y;
% 7.29/6.84     !!X Z Y. (bnd_equalish X Z | ~ bnd_equalish X Y) | ~ bnd_equalish Y Z;
% 7.29/6.84     !!X Y. bnd_equalish X Y | ~ bnd_equalish Y X;
% 7.29/6.84     !!X. bnd_equalish X X | ~ bnd_defined X;
% 7.29/6.84     !!Y Z.
% 7.29/6.84        (bnd_less_or_equal bnd_additive_identity (bnd_multiply Y Z) |
% 7.29/6.84         ~ bnd_less_or_equal bnd_additive_identity Y) |
% 7.29/6.84        ~ bnd_less_or_equal bnd_additive_identity Z;
% 7.29/6.84     !!X Z Y.
% 7.29/6.84        (bnd_less_or_equal (bnd_add X Z) (bnd_add Y Z) | ~ bnd_defined Z) |
% 7.29/6.84        ~ bnd_less_or_equal X Y;
% 7.29/6.84     !!X Y.
% 7.29/6.84        ((bnd_less_or_equal X Y | bnd_less_or_equal Y X) | ~ bnd_defined X) |
% 7.29/6.84        ~ bnd_defined Y;
% 7.29/6.84     !!X Z Y.
% 7.29/6.84        (bnd_less_or_equal X Z | ~ bnd_less_or_equal X Y) |
% 7.29/6.84        ~ bnd_less_or_equal Y Z;
% 7.29/6.84     !!X Y.
% 7.29/6.84        (bnd_equalish X Y | ~ bnd_less_or_equal X Y) |
% 7.29/6.84        ~ bnd_less_or_equal Y X;
% 7.29/6.84     !!X. (bnd_defined (bnd_multiplicative_inverse X) | ~ bnd_defined X) |
% 7.29/6.84          bnd_equalish X bnd_additive_identity;
% 7.29/6.84     bnd_defined bnd_multiplicative_identity;
% 7.29/6.84     !!X Y.
% 7.29/6.84        (bnd_defined (bnd_multiply X Y) | ~ bnd_defined X) | ~ bnd_defined Y;
% 7.29/6.84     !!X. bnd_defined (bnd_additive_inverse X) | ~ bnd_defined X;
% 7.29/6.84     bnd_defined bnd_additive_identity;
% 7.29/6.84     !!X Y. (bnd_defined (bnd_add X Y) | ~ bnd_defined X) | ~ bnd_defined Y;
% 7.29/6.84     !!X Z Y.
% 7.29/6.84        ((bnd_equalish (bnd_add (bnd_multiply X Z) (bnd_multiply Y Z))
% 7.29/6.84           (bnd_multiply (bnd_add X Y) Z) |
% 7.29/6.84          ~ bnd_defined X) |
% 7.29/6.84         ~ bnd_defined Y) |
% 7.29/6.84        ~ bnd_defined Z;
% 7.29/6.84     !!X Y.
% 7.29/6.84        (bnd_equalish (bnd_multiply X Y) (bnd_multiply Y X) |
% 7.29/6.84         ~ bnd_defined X) |
% 7.29/6.84        ~ bnd_defined Y;
% 7.29/6.84     !!X. (bnd_equalish (bnd_multiply X (bnd_multiplicative_inverse X))
% 7.29/6.84            bnd_multiplicative_identity |
% 7.29/6.84           ~ bnd_defined X) |
% 7.29/6.84          bnd_equalish X bnd_additive_identity;
% 7.29/6.84     !!X. bnd_equalish (bnd_multiply bnd_multiplicative_identity X) X |
% 7.29/6.84          ~ bnd_defined X;
% 7.29/6.84     !!X Y Z.
% 7.29/6.84        ((bnd_equalish (bnd_multiply X (bnd_multiply Y Z))
% 7.29/6.84           (bnd_multiply (bnd_multiply X Y) Z) |
% 7.29/6.84          ~ bnd_defined X) |
% 7.29/6.84         ~ bnd_defined Y) |
% 7.29/6.84        ~ bnd_defined Z;
% 7.29/6.84     !!X Y.
% 7.29/6.84        (bnd_equalish (bnd_add X Y) (bnd_add Y X) | ~ bnd_defined X) |
% 7.29/6.84        ~ bnd_defined Y;
% 7.29/6.84     !!X. bnd_equalish (bnd_add X (bnd_additive_inverse X))
% 7.29/6.84           bnd_additive_identity |
% 7.29/6.84          ~ bnd_defined X;
% 7.29/6.84     !!X. bnd_equalish (bnd_add bnd_additive_identity X) X | ~ bnd_defined X;
% 7.29/6.84     !!X Y Z.
% 7.29/6.84        ((bnd_equalish (bnd_add X (bnd_add Y Z)) (bnd_add (bnd_add X Y) Z) |
% 7.29/6.84          ~ bnd_defined X) |
% 7.29/6.84         ~ bnd_defined Y) |
% 7.29/6.84        ~ bnd_defined Z |]
% 7.29/6.84  ==> True
% 7.29/6.84  Adding axioms...
% 7.29/6.86  Typedef.type_definition_def
% 10.69/10.27   ...done.
% 10.69/10.27  Ground types: ?'b, TPTP_Interpret.ind
% 10.69/10.27  Translating term (sizes: 1, 1) ...
% 13.61/13.17  Invoking SAT solver...
% 13.61/13.17  No model exists.
% 13.61/13.17  Translating term (sizes: 2, 1) ...
% 17.21/16.77  Invoking SAT solver...
% 17.21/16.77  No model exists.
% 17.21/16.77  Translating term (sizes: 1, 2) ...
% 28.93/28.44  Invoking SAT solver...
% 28.93/28.44  No model exists.
% 28.93/28.44  Translating term (sizes: 3, 1) ...
% 34.85/34.38  Invoking SAT solver...
% 34.85/34.38  No model exists.
% 34.85/34.38  Translating term (sizes: 2, 2) ...
% 54.39/53.83  Invoking SAT solver...
% 54.39/53.83  No model exists.
% 54.39/53.83  Translating term (sizes: 1, 3) ...
% 86.90/86.28  Invoking SAT solver...
% 86.90/86.28  No model exists.
% 86.90/86.28  Translating term (sizes: 4, 1) ...
% 100.05/99.35  Invoking SAT solver...
% 100.05/99.35  No model exists.
% 100.05/99.35  Translating term (sizes: 3, 2) ...
% 199.21/198.04  Invoking SAT solver...
% 199.21/198.04  No model exists.
% 199.21/198.04  Translating term (sizes: 2, 3) ...
% 272.75/271.08  Invoking SAT solver...
% 272.75/271.08  No model exists.
% 272.75/271.08  Translating term (sizes: 1, 4) ...
% 300.02/298.03  /export/starexec/sandbox2/solver/lib/scripts/run-polyml-5.5.2: line 82: 21410 CPU time limit exceeded (core dumped) "$ISABELLE_HOME/lib/scripts/feeder" -p -h "$MLTEXT" -t "$MLEXIT" $FEEDER_OPTS
% 300.02/298.03       21411                       (core dumped) | { read FPID; "$POLY" -q -i $ML_OPTIONS; RC="$?"; kill -TERM "$FPID"; exit "$RC"; }
% 300.02/298.04  /export/starexec/sandbox2/solver/src/HOL/TPTP/lib/Tools/tptp_refute: line 26: 21356 Exit 152                "$ISABELLE_PROCESS" -q -e "use_thy \"/tmp/$SCRATCH\"; exit 1;" HOL-TPTP
% 300.02/298.04       21357 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.$"
%------------------------------------------------------------------------------