TSTP Solution File: KLE050+3 by Refute---2015

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Refute---2015
% Problem  : KLE050+3 : TPTP v6.4.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : isabelle tptp_refute %d %s

% Computer : n077.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:38 EDT 2016

% Result   : Timeout 300.09s
% 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  : KLE050+3 : TPTP v6.4.0. Released v4.0.0.
% 0.00/0.04  % Command  : isabelle tptp_refute %d %s
% 0.02/0.22  % Computer : n077.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 21:19:54 CDT 2016
% 0.02/0.23  % CPUTime  : 
% 6.31/5.83  > val it = (): unit
% 6.52/6.03  Trying to find a model that refutes: bnd_test X2 & bnd_test X3 -->
% 6.52/6.03  bnd_multiplication
% 6.52/6.03   (bnd_star
% 6.52/6.03     (bnd_multiplication
% 6.52/6.03       (bnd_multiplication (bnd_multiplication X2 X0)
% 6.52/6.03         (bnd_star (bnd_multiplication X3 X1)))
% 6.52/6.03       (bnd_c X3)))
% 6.52/6.03   (bnd_c X2) =
% 6.52/6.03  bnd_addition
% 6.52/6.03   (bnd_multiplication
% 6.52/6.03     (bnd_multiplication
% 6.52/6.03       (bnd_multiplication (bnd_multiplication X2 X0) (bnd_addition X2 X3))
% 6.52/6.03       (bnd_star
% 6.52/6.03         (bnd_addition (bnd_multiplication X3 X1)
% 6.52/6.03           (bnd_multiplication (bnd_c X3) X0))))
% 6.52/6.03     (bnd_c (bnd_addition X2 X3)))
% 6.52/6.03   (bnd_c X2)
% 7.13/6.64  Unfolded term: [| ALL X0 X1.
% 7.13/6.64        bnd_test X0 & bnd_test X1 -->
% 7.13/6.64        bnd_c (bnd_multiplication X0 X1) = bnd_addition (bnd_c X0) (bnd_c X1);
% 7.13/6.64     ALL X0 X1.
% 7.13/6.64        bnd_test X0 & bnd_test X1 -->
% 7.13/6.64        bnd_c (bnd_addition X0 X1) = bnd_multiplication (bnd_c X0) (bnd_c X1);
% 7.13/6.64     ALL X0. ~ bnd_test X0 --> bnd_c X0 = bnd_zero;
% 7.13/6.64     ALL X0 X1. bnd_test X0 --> (bnd_c X0 = X1) = bnd_complement X0 X1;
% 7.13/6.64     ALL X0 X1.
% 7.13/6.64        bnd_complement X1 X0 =
% 7.13/6.64        ((bnd_multiplication X0 X1 = bnd_zero &
% 7.13/6.64          bnd_multiplication X1 X0 = bnd_zero) &
% 7.13/6.64         bnd_addition X0 X1 = bnd_one);
% 7.13/6.64     ALL X0. bnd_test X0 = (EX X1. bnd_complement X1 X0);
% 7.13/6.64     ALL A B C.
% 7.13/6.64        bnd_leq (bnd_addition (bnd_multiplication A B) C) A -->
% 7.13/6.64        bnd_leq (bnd_multiplication C (bnd_star B)) A;
% 7.13/6.64     ALL A B C.
% 7.13/6.64        bnd_leq (bnd_addition (bnd_multiplication A B) C) B -->
% 7.13/6.64        bnd_leq (bnd_multiplication (bnd_star A) C) B;
% 7.13/6.64     ALL A.
% 7.13/6.64        bnd_leq (bnd_addition bnd_one (bnd_multiplication (bnd_star A) A))
% 7.13/6.64         (bnd_star A);
% 7.13/6.64     ALL A.
% 7.13/6.64        bnd_leq (bnd_addition bnd_one (bnd_multiplication A (bnd_star A)))
% 7.13/6.64         (bnd_star A);
% 7.13/6.64     ALL A B. bnd_leq A B = (bnd_addition A B = B);
% 7.13/6.64     ALL A. bnd_multiplication bnd_zero A = bnd_zero;
% 7.13/6.64     ALL A. bnd_multiplication A bnd_zero = bnd_zero;
% 7.13/6.64     ALL A B C.
% 7.13/6.64        bnd_multiplication (bnd_addition A B) C =
% 7.13/6.64        bnd_addition (bnd_multiplication A C) (bnd_multiplication B C);
% 7.13/6.64     ALL A B C.
% 7.13/6.64        bnd_multiplication A (bnd_addition B C) =
% 7.13/6.64        bnd_addition (bnd_multiplication A B) (bnd_multiplication A C);
% 7.13/6.64     ALL A. bnd_multiplication bnd_one A = A;
% 7.13/6.64     ALL A. bnd_multiplication A bnd_one = A;
% 7.13/6.64     ALL A B C.
% 7.13/6.64        bnd_multiplication A (bnd_multiplication B C) =
% 7.13/6.64        bnd_multiplication (bnd_multiplication A B) C;
% 7.13/6.64     ALL A. bnd_addition A A = A; ALL A. bnd_addition A bnd_zero = A;
% 7.13/6.64     ALL C B A.
% 7.13/6.64        bnd_addition A (bnd_addition B C) = bnd_addition (bnd_addition A B) C;
% 7.13/6.64     ALL A B. bnd_addition A B = bnd_addition B A |]
% 7.13/6.64  ==> bnd_test X2 & bnd_test X3 -->
% 7.13/6.64      bnd_multiplication
% 7.13/6.64       (bnd_star
% 7.13/6.64         (bnd_multiplication
% 7.13/6.64           (bnd_multiplication (bnd_multiplication X2 X0)
% 7.13/6.64             (bnd_star (bnd_multiplication X3 X1)))
% 7.13/6.64           (bnd_c X3)))
% 7.13/6.64       (bnd_c X2) =
% 7.13/6.64      bnd_addition
% 7.13/6.64       (bnd_multiplication
% 7.13/6.64         (bnd_multiplication
% 7.13/6.64           (bnd_multiplication (bnd_multiplication X2 X0)
% 7.13/6.64             (bnd_addition X2 X3))
% 7.13/6.64           (bnd_star
% 7.13/6.64             (bnd_addition (bnd_multiplication X3 X1)
% 7.13/6.64               (bnd_multiplication (bnd_c X3) X0))))
% 7.13/6.64         (bnd_c (bnd_addition X2 X3)))
% 7.13/6.64       (bnd_c X2)
% 7.13/6.64  Adding axioms...
% 7.13/6.65  Typedef.type_definition_def
% 11.02/10.59   ...done.
% 11.02/10.59  Ground types: ?'b, TPTP_Interpret.ind
% 11.02/10.59  Translating term (sizes: 1, 1) ...
% 13.13/12.64  Invoking SAT solver...
% 13.13/12.64  No model exists.
% 13.13/12.64  Translating term (sizes: 2, 1) ...
% 15.84/15.38  Invoking SAT solver...
% 15.84/15.38  No model exists.
% 15.84/15.38  Translating term (sizes: 1, 2) ...
% 22.34/21.83  Invoking SAT solver...
% 23.50/23.01  No model exists.
% 23.50/23.01  Translating term (sizes: 3, 1) ...
% 28.70/28.15  Invoking SAT solver...
% 28.70/28.15  No model exists.
% 28.70/28.15  Translating term (sizes: 2, 2) ...
% 42.92/42.36  Invoking SAT solver...
% 44.18/43.50  No model exists.
% 44.18/43.50  Translating term (sizes: 1, 3) ...
% 60.41/59.75  Invoking SAT solver...
% 300.09/263.32  /export/starexec/sandbox/solver/lib/scripts/run-polyml-5.5.2: line 82:  3666 CPU time limit exceeded (core dumped) "$ISABELLE_HOME/lib/scripts/feeder" -p -h "$MLTEXT" -t "$MLEXIT" $FEEDER_OPTS
% 300.09/263.32        3667                       (core dumped) | { read FPID; "$POLY" -q -i $ML_OPTIONS; RC="$?"; kill -TERM "$FPID"; exit "$RC"; }
% 300.09/263.33  /export/starexec/sandbox/solver/src/HOL/TPTP/lib/Tools/tptp_refute: line 26:  3612 Exit 152                "$ISABELLE_PROCESS" -q -e "use_thy \"/tmp/$SCRATCH\"; exit 1;" HOL-TPTP
% 300.09/263.33        3613 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.$"
%------------------------------------------------------------------------------