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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Refute---2015
% Problem  : GRP399-1 : TPTP v6.4.0. Released v2.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : isabelle tptp_refute %d %s

% Computer : n106.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 15:06:36 EDT 2016

% Result   : Timeout 300.06s
% 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  : GRP399-1 : TPTP v6.4.0. Released v2.5.0.
% 0.00/0.04  % Command  : isabelle tptp_refute %d %s
% 0.03/0.23  % Computer : n106.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 17:47:54 CDT 2016
% 0.03/0.23  % CPUTime  : 
% 6.27/5.88  > val it = (): unit
% 6.47/6.07  Trying to find a model that refutes: True
% 6.78/6.36  Unfolded term: [| !!Y Z X.
% 6.78/6.36        bnd_multiply (bnd_greatest_lower_bound Y Z) X =
% 6.78/6.36        bnd_greatest_lower_bound (bnd_multiply Y X) (bnd_multiply Z X);
% 6.78/6.36     !!Y Z X.
% 6.78/6.36        bnd_multiply (bnd_least_upper_bound Y Z) X =
% 6.78/6.36        bnd_least_upper_bound (bnd_multiply Y X) (bnd_multiply Z X);
% 6.78/6.36     !!X Y Z.
% 6.78/6.36        bnd_multiply X (bnd_greatest_lower_bound Y Z) =
% 6.78/6.36        bnd_greatest_lower_bound (bnd_multiply X Y) (bnd_multiply X Z);
% 6.78/6.36     !!X Y Z.
% 6.78/6.36        bnd_multiply X (bnd_least_upper_bound Y Z) =
% 6.78/6.36        bnd_least_upper_bound (bnd_multiply X Y) (bnd_multiply X Z);
% 6.78/6.36     !!X Y. bnd_greatest_lower_bound X (bnd_least_upper_bound X Y) = X;
% 6.78/6.36     !!X Y. bnd_least_upper_bound X (bnd_greatest_lower_bound X Y) = X;
% 6.78/6.36     !!X. bnd_greatest_lower_bound X X = X;
% 6.78/6.36     !!X. bnd_least_upper_bound X X = X;
% 6.78/6.36     !!X Y Z.
% 6.78/6.36        bnd_least_upper_bound X (bnd_least_upper_bound Y Z) =
% 6.78/6.36        bnd_least_upper_bound (bnd_least_upper_bound X Y) Z;
% 6.78/6.36     !!X Y Z.
% 6.78/6.36        bnd_greatest_lower_bound X (bnd_greatest_lower_bound Y Z) =
% 6.78/6.36        bnd_greatest_lower_bound (bnd_greatest_lower_bound X Y) Z;
% 6.78/6.36     !!X Y. bnd_least_upper_bound X Y = bnd_least_upper_bound Y X;
% 6.78/6.36     !!X Y. bnd_greatest_lower_bound X Y = bnd_greatest_lower_bound Y X;
% 6.78/6.36     !!X Y Z.
% 6.78/6.36        bnd_multiply (bnd_multiply X Y) Z = bnd_multiply X (bnd_multiply Y Z);
% 6.78/6.36     !!X. bnd_multiply (bnd_inverse X) X = bnd_identity;
% 6.78/6.36     !!X. bnd_multiply bnd_identity X = X |]
% 6.78/6.36  ==> True
% 6.78/6.36  Adding axioms...
% 6.78/6.37  Typedef.type_definition_def
% 8.78/8.37   ...done.
% 8.78/8.37  Ground types: ?'b, TPTP_Interpret.ind
% 8.78/8.37  Translating term (sizes: 1, 1) ...
% 10.08/9.62  Invoking SAT solver...
% 10.08/9.62  No model exists.
% 10.08/9.62  Translating term (sizes: 2, 1) ...
% 12.09/11.63  Invoking SAT solver...
% 12.09/11.63  No model exists.
% 12.09/11.63  Translating term (sizes: 1, 2) ...
% 17.69/17.24  Invoking SAT solver...
% 17.69/17.24  No model exists.
% 17.69/17.24  Translating term (sizes: 3, 1) ...
% 22.11/21.60  Invoking SAT solver...
% 22.11/21.60  No model exists.
% 22.11/21.60  Translating term (sizes: 2, 2) ...
% 35.52/35.00  Invoking SAT solver...
% 35.52/35.00  No model exists.
% 35.52/35.00  Translating term (sizes: 1, 3) ...
% 51.47/50.98  Invoking SAT solver...
% 51.47/50.98  No model exists.
% 51.47/50.98  Translating term (sizes: 4, 1) ...
% 63.10/62.51  Invoking SAT solver...
% 63.10/62.51  No model exists.
% 63.10/62.51  Translating term (sizes: 3, 2) ...
% 156.05/155.15  Invoking SAT solver...
% 156.05/155.15  No model exists.
% 156.05/155.15  Translating term (sizes: 2, 3) ...
% 212.96/211.72  Invoking SAT solver...
% 212.96/211.72  No model exists.
% 212.96/211.72  Translating term (sizes: 1, 4) ...
% 248.48/247.01  Invoking SAT solver...
% 248.48/247.01  No model exists.
% 248.48/247.01  Translating term (sizes: 5, 1) ...
% 279.79/278.10  Invoking SAT solver...
% 279.79/278.10  No model exists.
% 279.79/278.10  Translating term (sizes: 4, 2) ...
% 300.06/298.22  /export/starexec/sandbox2/solver/lib/scripts/run-polyml-5.5.2: line 82:  4597 CPU time limit exceeded (core dumped) "$ISABELLE_HOME/lib/scripts/feeder" -p -h "$MLTEXT" -t "$MLEXIT" $FEEDER_OPTS
% 300.06/298.22        4598                       (core dumped) | { read FPID; "$POLY" -q -i $ML_OPTIONS; RC="$?"; kill -TERM "$FPID"; exit "$RC"; }
% 300.06/298.23  /export/starexec/sandbox2/solver/src/HOL/TPTP/lib/Tools/tptp_refute: line 26:  4543 Exit 152                "$ISABELLE_PROCESS" -q -e "use_thy \"/tmp/$SCRATCH\"; exit 1;" HOL-TPTP
% 300.06/298.23        4544 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.$"
%------------------------------------------------------------------------------