%------------------------------------------------------------------------------
% File : Refute---2015
% Problem : KLE173+1 : TPTP v6.4.0. Released v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : isabelle tptp_refute %d %s
% Computer : n084.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:51 EDT 2016
% Result : Timeout 300.05s
% 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 : KLE173+1 : TPTP v6.4.0. Released v6.4.0.
% 0.00/0.04 % Command : isabelle tptp_refute %d %s
% 0.03/0.23 % Computer : n084.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:09:24 CDT 2016
% 0.03/0.23 % CPUTime :
% 6.32/5.82 > val it = (): unit
% 6.52/6.02 Trying to find a model that refutes: True
% 6.93/6.46 Unfolded term: [| ALL X0 X1 X2.
% 6.93/6.46 bnd_ismeetu X2 X0 X1 =
% 6.93/6.46 (ALL X3. (bnd_leq X3 X0 & bnd_leq X3 X1) = bnd_leq X3 X2);
% 6.93/6.46 ALL X0 X1 X2.
% 6.93/6.46 bnd_ismeet X2 X0 X1 =
% 6.93/6.46 ((bnd_leq X2 X0 & bnd_leq X2 X1) &
% 6.93/6.46 (ALL X3. bnd_leq X3 X0 & bnd_leq X3 X1 --> bnd_leq X3 X2));
% 6.93/6.46 ALL X0 X1.
% 6.93/6.46 bnd_test X0 & bnd_test X1 -->
% 6.93/6.46 bnd_c (bnd_multiplication X0 X1) = bnd_addition (bnd_c X0) (bnd_c X1);
% 6.93/6.46 ALL X0 X1.
% 6.93/6.46 bnd_test X0 & bnd_test X1 -->
% 6.93/6.46 bnd_c (bnd_addition X0 X1) = bnd_multiplication (bnd_c X0) (bnd_c X1);
% 6.93/6.46 ALL X0. ~ bnd_test X0 --> bnd_c X0 = bnd_zero;
% 6.93/6.46 ALL X0 X1. bnd_test X0 --> (bnd_c X0 = X1) = bnd_complement X0 X1;
% 6.93/6.46 ALL X0 X1.
% 6.93/6.46 bnd_complement X1 X0 =
% 6.93/6.46 ((bnd_multiplication X0 X1 = bnd_zero &
% 6.93/6.46 bnd_multiplication X1 X0 = bnd_zero) &
% 6.93/6.46 bnd_addition X0 X1 = bnd_one);
% 6.93/6.46 ALL X0. bnd_test X0 = (EX X1. bnd_complement X1 X0);
% 6.93/6.46 ALL A B. bnd_leq A B = (bnd_addition A B = B);
% 6.93/6.46 ALL A. bnd_multiplication bnd_zero A = bnd_zero;
% 6.93/6.46 ALL A. bnd_multiplication A bnd_zero = bnd_zero;
% 6.93/6.46 ALL A B C.
% 6.93/6.46 bnd_multiplication (bnd_addition A B) C =
% 6.93/6.46 bnd_addition (bnd_multiplication A C) (bnd_multiplication B C);
% 6.93/6.46 ALL A B C.
% 6.93/6.46 bnd_multiplication A (bnd_addition B C) =
% 6.93/6.46 bnd_addition (bnd_multiplication A B) (bnd_multiplication A C);
% 6.93/6.46 ALL A. bnd_multiplication bnd_one A = A;
% 6.93/6.46 ALL A. bnd_multiplication A bnd_one = A;
% 6.93/6.46 ALL A B C.
% 6.93/6.46 bnd_multiplication A (bnd_multiplication B C) =
% 6.93/6.46 bnd_multiplication (bnd_multiplication A B) C;
% 6.93/6.46 ALL A. bnd_addition A A = A; ALL A. bnd_addition A bnd_zero = A;
% 6.93/6.46 ALL C B A.
% 6.93/6.46 bnd_addition A (bnd_addition B C) = bnd_addition (bnd_addition A B) C;
% 6.93/6.46 ALL A B. bnd_addition A B = bnd_addition B A |]
% 6.93/6.46 ==> True
% 6.93/6.46 Adding axioms...
% 6.93/6.47 Typedef.type_definition_def
% 9.73/9.24 ...done.
% 9.73/9.25 Ground types: ?'b, TPTP_Interpret.ind
% 9.73/9.25 Translating term (sizes: 1, 1) ...
% 11.44/10.96 Invoking SAT solver...
% 11.63/11.17 No model exists.
% 11.63/11.17 Translating term (sizes: 2, 1) ...
% 13.83/13.33 Invoking SAT solver...
% 13.83/13.33 No model exists.
% 13.83/13.33 Translating term (sizes: 1, 2) ...
% 20.74/20.23 Invoking SAT solver...
% 20.74/20.23 No model exists.
% 20.74/20.23 Translating term (sizes: 3, 1) ...
% 25.55/25.03 Invoking SAT solver...
% 25.55/25.03 No model exists.
% 25.55/25.03 Translating term (sizes: 2, 2) ...
% 40.19/39.62 Invoking SAT solver...
% 40.19/39.62 No model exists.
% 40.19/39.62 Translating term (sizes: 1, 3) ...
% 61.32/60.75 Invoking SAT solver...
% 61.32/60.75 No model exists.
% 61.32/60.75 Translating term (sizes: 4, 1) ...
% 73.16/72.60 Invoking SAT solver...
% 73.16/72.60 No model exists.
% 73.16/72.60 Translating term (sizes: 3, 2) ...
% 167.61/166.69 Invoking SAT solver...
% 167.61/166.69 No model exists.
% 167.61/166.69 Translating term (sizes: 2, 3) ...
% 230.03/228.61 Invoking SAT solver...
% 230.03/228.61 No model exists.
% 230.03/228.61 Translating term (sizes: 1, 4) ...
% 282.47/280.69 Invoking SAT solver...
% 282.47/280.69 No model exists.
% 282.47/280.69 Translating term (sizes: 5, 1) ...
% 300.05/298.03 /export/starexec/sandbox/solver/lib/scripts/run-polyml-5.5.2: line 82: 11977 CPU time limit exceeded (core dumped) "$ISABELLE_HOME/lib/scripts/feeder" -p -h "$MLTEXT" -t "$MLEXIT" $FEEDER_OPTS
% 300.05/298.03 11978 (core dumped) | { read FPID; "$POLY" -q -i $ML_OPTIONS; RC="$?"; kill -TERM "$FPID"; exit "$RC"; }
% 300.05/298.04 /export/starexec/sandbox/solver/src/HOL/TPTP/lib/Tools/tptp_refute: line 26: 11919 Exit 152 "$ISABELLE_PROCESS" -q -e "use_thy \"/tmp/$SCRATCH\"; exit 1;" HOL-TPTP
% 300.05/298.04 11920 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.$"
%------------------------------------------------------------------------------