TSTP Solution File: KLE182+1 by Refute---2015

View Problem - Process Solution

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

% Computer : n157.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 16:15:52 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  : KLE182+1 : TPTP v6.4.0. Released v6.4.0.
% 0.00/0.04  % Command  : isabelle tptp_refute %d %s
% 0.03/0.23  % Computer : n157.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 22:11:24 CDT 2016
% 0.03/0.23  % CPUTime  : 
% 6.31/5.84  > val it = (): unit
% 6.51/6.03  Trying to find a model that refutes: True
% 6.91/6.46  Unfolded term: [| ALL A B. bnd_leq A B = (bnd_addition A B = B);
% 6.91/6.46     ALL A.
% 6.91/6.46        bnd_strong_iteration A =
% 6.91/6.46        bnd_addition (bnd_star A)
% 6.91/6.46         (bnd_multiplication (bnd_strong_iteration A) bnd_zero);
% 6.91/6.46     ALL A B C.
% 6.91/6.46        bnd_leq C (bnd_addition (bnd_multiplication A C) B) -->
% 6.91/6.46        bnd_leq C (bnd_multiplication (bnd_strong_iteration A) B);
% 6.91/6.46     ALL A.
% 6.91/6.46        bnd_strong_iteration A =
% 6.91/6.46        bnd_addition (bnd_multiplication A (bnd_strong_iteration A)) bnd_one;
% 6.91/6.46     ALL A B C.
% 6.91/6.46        bnd_leq (bnd_addition (bnd_multiplication C A) B) C -->
% 6.91/6.46        bnd_leq (bnd_multiplication B (bnd_star A)) C;
% 6.91/6.46     ALL A B C.
% 6.91/6.46        bnd_leq (bnd_addition (bnd_multiplication A C) B) C -->
% 6.91/6.46        bnd_leq (bnd_multiplication (bnd_star A) B) C;
% 6.91/6.46     ALL A.
% 6.91/6.46        bnd_addition bnd_one (bnd_multiplication (bnd_star A) A) = bnd_star A;
% 6.91/6.46     ALL A.
% 6.91/6.46        bnd_addition bnd_one (bnd_multiplication A (bnd_star A)) = bnd_star A;
% 6.91/6.46     ALL A. bnd_multiplication bnd_zero A = bnd_zero;
% 6.91/6.46     ALL A B C.
% 6.91/6.46        bnd_multiplication (bnd_addition A B) C =
% 6.91/6.46        bnd_addition (bnd_multiplication A C) (bnd_multiplication B C);
% 6.91/6.46     ALL A B C.
% 6.91/6.46        bnd_multiplication A (bnd_addition B C) =
% 6.91/6.46        bnd_addition (bnd_multiplication A B) (bnd_multiplication A C);
% 6.91/6.46     ALL A. bnd_multiplication bnd_one A = A;
% 6.91/6.46     ALL A. bnd_multiplication A bnd_one = A;
% 6.91/6.46     ALL A B C.
% 6.91/6.46        bnd_multiplication A (bnd_multiplication B C) =
% 6.91/6.46        bnd_multiplication (bnd_multiplication A B) C;
% 6.91/6.46     ALL A. bnd_addition A A = A; ALL A. bnd_addition A bnd_zero = A;
% 6.91/6.46     ALL C B A.
% 6.91/6.46        bnd_addition A (bnd_addition B C) = bnd_addition (bnd_addition A B) C;
% 6.91/6.46     ALL A B. bnd_addition A B = bnd_addition B A |]
% 6.91/6.46  ==> True
% 6.91/6.46  Adding axioms...
% 6.91/6.46  Typedef.type_definition_def
% 9.61/9.11   ...done.
% 9.61/9.11  Ground types: ?'b, TPTP_Interpret.ind
% 9.61/9.11  Translating term (sizes: 1, 1) ...
% 11.11/10.63  Invoking SAT solver...
% 11.11/10.63  No model exists.
% 11.11/10.63  Translating term (sizes: 2, 1) ...
% 13.32/12.88  Invoking SAT solver...
% 13.32/12.88  No model exists.
% 13.32/12.88  Translating term (sizes: 1, 2) ...
% 18.93/18.47  Invoking SAT solver...
% 18.93/18.47  No model exists.
% 18.93/18.47  Translating term (sizes: 3, 1) ...
% 23.53/23.06  Invoking SAT solver...
% 23.53/23.06  No model exists.
% 23.53/23.06  Translating term (sizes: 2, 2) ...
% 36.87/36.36  Invoking SAT solver...
% 36.87/36.36  No model exists.
% 36.87/36.36  Translating term (sizes: 1, 3) ...
% 52.20/51.70  Invoking SAT solver...
% 52.20/51.70  No model exists.
% 52.20/51.70  Translating term (sizes: 4, 1) ...
% 64.03/63.44  Invoking SAT solver...
% 64.03/63.44  No model exists.
% 64.03/63.44  Translating term (sizes: 3, 2) ...
% 157.15/156.30  Invoking SAT solver...
% 157.15/156.30  No model exists.
% 157.15/156.30  Translating term (sizes: 2, 3) ...
% 213.75/212.53  Invoking SAT solver...
% 213.75/212.53  No model exists.
% 213.75/212.53  Translating term (sizes: 1, 4) ...
% 247.83/246.39  Invoking SAT solver...
% 247.83/246.39  No model exists.
% 247.83/246.39  Translating term (sizes: 5, 1) ...
% 279.69/277.99  Invoking SAT solver...
% 279.69/277.99  No model exists.
% 279.69/277.99  Translating term (sizes: 4, 2) ...
% 300.08/298.13  /export/starexec/sandbox2/solver/lib/scripts/run-polyml-5.5.2: line 82:  1534 CPU time limit exceeded (core dumped) "$ISABELLE_HOME/lib/scripts/feeder" -p -h "$MLTEXT" -t "$MLEXIT" $FEEDER_OPTS
% 300.08/298.13        1535                       (core dumped) | { read FPID; "$POLY" -q -i $ML_OPTIONS; RC="$?"; kill -TERM "$FPID"; exit "$RC"; }
% 300.08/298.14  /export/starexec/sandbox2/solver/src/HOL/TPTP/lib/Tools/tptp_refute: line 26:  1480 Exit 152                "$ISABELLE_PROCESS" -q -e "use_thy \"/tmp/$SCRATCH\"; exit 1;" HOL-TPTP
% 300.08/298.14        1481 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.$"
%------------------------------------------------------------------------------