TSTP Solution File: KLE181+1 by Refute---2015
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Refute---2015
% Problem : KLE181+1 : TPTP v6.4.0. Released v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : isabelle tptp_refute %d %s
% Computer : n091.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 290.72s
% 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 : KLE181+1 : TPTP v6.4.0. Released v6.4.0.
% 0.00/0.04 % Command : isabelle tptp_refute %d %s
% 0.02/0.23 % Computer : n091.star.cs.uiowa.edu
% 0.02/0.23 % Model : x86_64 x86_64
% 0.02/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/0.23 % Memory : 32218.75MB
% 0.02/0.23 % OS : Linux 3.10.0-327.10.1.el7.x86_64
% 0.02/0.23 % CPULimit : 300
% 0.02/0.23 % DateTime : Sat Apr 9 22:11:09 CDT 2016
% 0.02/0.23 % CPUTime :
% 6.32/5.84 > val it = (): unit
% 6.52/6.03 Trying to find a model that refutes: True
% 7.02/6.56 Unfolded term: [| ALL X0 X1.
% 7.02/6.56 bnd_domain (bnd_addition X0 X1) =
% 7.02/6.56 bnd_addition (bnd_domain X0) (bnd_domain X1);
% 7.02/6.56 bnd_domain bnd_zero = bnd_zero;
% 7.02/6.56 ALL X0. bnd_addition (bnd_domain X0) bnd_one = bnd_one;
% 7.02/6.56 ALL X0 X1.
% 7.02/6.56 bnd_domain (bnd_multiplication X0 X1) =
% 7.02/6.56 bnd_domain (bnd_multiplication X0 (bnd_domain X1));
% 7.02/6.56 ALL X0.
% 7.02/6.56 bnd_addition X0 (bnd_multiplication (bnd_domain X0) X0) =
% 7.02/6.56 bnd_multiplication (bnd_domain X0) X0;
% 7.02/6.56 ALL A B C.
% 7.02/6.56 bnd_leq A (bnd_addition (bnd_multiplication B A) C) -->
% 7.02/6.56 bnd_leq A
% 7.02/6.56 (bnd_addition (bnd_omega B) (bnd_multiplication (bnd_star B) C));
% 7.02/6.56 ALL A. bnd_multiplication A (bnd_omega A) = bnd_omega A;
% 7.02/6.56 ALL A B C.
% 7.02/6.56 bnd_leq (bnd_addition (bnd_multiplication A B) C) A -->
% 7.02/6.56 bnd_leq (bnd_multiplication C (bnd_star B)) A;
% 7.02/6.56 ALL A B C.
% 7.02/6.56 bnd_leq (bnd_addition (bnd_multiplication A B) C) B -->
% 7.02/6.56 bnd_leq (bnd_multiplication (bnd_star A) C) B;
% 7.02/6.56 ALL A.
% 7.02/6.56 bnd_leq (bnd_addition bnd_one (bnd_multiplication (bnd_star A) A))
% 7.02/6.56 (bnd_star A);
% 7.02/6.56 ALL A.
% 7.02/6.56 bnd_leq (bnd_addition bnd_one (bnd_multiplication A (bnd_star A)))
% 7.02/6.56 (bnd_star A);
% 7.02/6.56 ALL A B. bnd_leq A B = (bnd_addition A B = B);
% 7.02/6.56 ALL A. bnd_multiplication bnd_zero A = bnd_zero;
% 7.02/6.56 ALL A. bnd_multiplication A bnd_zero = bnd_zero;
% 7.02/6.56 ALL A B C.
% 7.02/6.56 bnd_multiplication (bnd_addition A B) C =
% 7.02/6.56 bnd_addition (bnd_multiplication A C) (bnd_multiplication B C);
% 7.02/6.56 ALL A B C.
% 7.02/6.56 bnd_multiplication A (bnd_addition B C) =
% 7.02/6.56 bnd_addition (bnd_multiplication A B) (bnd_multiplication A C);
% 7.02/6.56 ALL A. bnd_multiplication bnd_one A = A;
% 7.02/6.56 ALL A. bnd_multiplication A bnd_one = A;
% 7.02/6.56 ALL A B C.
% 7.02/6.56 bnd_multiplication A (bnd_multiplication B C) =
% 7.02/6.56 bnd_multiplication (bnd_multiplication A B) C;
% 7.02/6.56 ALL A. bnd_addition A A = A; ALL A. bnd_addition A bnd_zero = A;
% 7.02/6.56 ALL C B A.
% 7.02/6.56 bnd_addition A (bnd_addition B C) = bnd_addition (bnd_addition A B) C;
% 7.02/6.56 ALL A B. bnd_addition A B = bnd_addition B A |]
% 7.02/6.56 ==> True
% 7.02/6.56 Adding axioms...
% 7.02/6.57 Typedef.type_definition_def
% 10.33/9.86 ...done.
% 10.33/9.86 Ground types: ?'b, TPTP_Interpret.ind
% 10.33/9.86 Translating term (sizes: 1, 1) ...
% 12.13/11.66 Invoking SAT solver...
% 12.13/11.66 No model exists.
% 12.13/11.66 Translating term (sizes: 2, 1) ...
% 14.62/14.17 Invoking SAT solver...
% 15.13/14.69 No model exists.
% 15.13/14.69 Translating term (sizes: 1, 2) ...
% 21.04/20.52 Invoking SAT solver...
% 21.04/20.52 No model exists.
% 21.04/20.52 Translating term (sizes: 3, 1) ...
% 25.95/25.44 Invoking SAT solver...
% 25.95/25.44 No model exists.
% 25.95/25.44 Translating term (sizes: 2, 2) ...
% 40.09/39.56 Invoking SAT solver...
% 40.09/39.56 No model exists.
% 40.09/39.56 Translating term (sizes: 1, 3) ...
% 57.12/56.59 Invoking SAT solver...
% 57.12/56.59 No model exists.
% 57.12/56.59 Translating term (sizes: 4, 1) ...
% 69.16/68.57 Invoking SAT solver...
% 69.16/68.57 No model exists.
% 69.16/68.57 Translating term (sizes: 3, 2) ...
% 163.04/162.09 Invoking SAT solver...
% 163.04/162.09 No model exists.
% 163.04/162.09 Translating term (sizes: 2, 3) ...
% 221.42/220.04 Invoking SAT solver...
% 221.42/220.04 No model exists.
% 221.42/220.04 Translating term (sizes: 1, 4) ...
% 258.62/256.98 Invoking SAT solver...
% 258.62/256.98 No model exists.
% 258.62/256.98 Translating term (sizes: 5, 1) ...
% 290.72/288.72 Invoking SAT solver...
% 290.72/288.72 No model exists.
% 290.72/288.72 Translating term (sizes: 4, 2) ...
% 300.02/297.92 /export/starexec/sandbox/solver/lib/scripts/run-polyml-5.5.2: line 82: 24786 CPU time limit exceeded (core dumped) "$ISABELLE_HOME/lib/scripts/feeder" -p -h "$MLTEXT" -t "$MLEXIT" $FEEDER_OPTS
% 300.02/297.92 24787 (core dumped) | { read FPID; "$POLY" -q -i $ML_OPTIONS; RC="$?"; kill -TERM "$FPID"; exit "$RC"; }
% 300.02/297.93 /export/starexec/sandbox/solver/src/HOL/TPTP/lib/Tools/tptp_refute: line 26: 24732 Exit 152 "$ISABELLE_PROCESS" -q -e "use_thy \"/tmp/$SCRATCH\"; exit 1;" HOL-TPTP
% 300.02/297.93 24733 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.$"
%------------------------------------------------------------------------------