TSTP Solution File: GRP177-1 by Refute---2015
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Refute---2015
% Problem : GRP177-1 : TPTP v6.4.0. Bugfixed v1.2.1.
% 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 15:06:07 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 : GRP177-1 : TPTP v6.4.0. Bugfixed v1.2.1.
% 0.00/0.04 % Command : isabelle tptp_refute %d %s
% 0.02/0.22 % Computer : n084.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 16:34:39 CDT 2016
% 0.02/0.23 % CPUTime :
% 6.26/5.85 > val it = (): unit
% 6.46/6.04 Trying to find a model that refutes: True
% 6.97/6.52 Unfolded term: [| ~ bnd_least_upper_bound
% 6.97/6.52 (bnd_greatest_lower_bound bnd_a (bnd_multiply bnd_b bnd_c))
% 6.97/6.52 (bnd_multiply (bnd_greatest_lower_bound bnd_a bnd_b)
% 6.97/6.52 (bnd_greatest_lower_bound bnd_a bnd_c)) =
% 6.97/6.52 bnd_multiply (bnd_greatest_lower_bound bnd_a bnd_b)
% 6.97/6.52 (bnd_greatest_lower_bound bnd_a bnd_c);
% 6.97/6.52 bnd_least_upper_bound bnd_identity bnd_c = bnd_c;
% 6.97/6.52 bnd_least_upper_bound bnd_identity bnd_b = bnd_b;
% 6.97/6.52 bnd_least_upper_bound bnd_identity bnd_a = bnd_a;
% 6.97/6.52 !!Y Z X.
% 6.97/6.52 bnd_multiply (bnd_greatest_lower_bound Y Z) X =
% 6.97/6.52 bnd_greatest_lower_bound (bnd_multiply Y X) (bnd_multiply Z X);
% 6.97/6.52 !!Y Z X.
% 6.97/6.52 bnd_multiply (bnd_least_upper_bound Y Z) X =
% 6.97/6.52 bnd_least_upper_bound (bnd_multiply Y X) (bnd_multiply Z X);
% 6.97/6.52 !!X Y Z.
% 6.97/6.52 bnd_multiply X (bnd_greatest_lower_bound Y Z) =
% 6.97/6.52 bnd_greatest_lower_bound (bnd_multiply X Y) (bnd_multiply X Z);
% 6.97/6.52 !!X Y Z.
% 6.97/6.52 bnd_multiply X (bnd_least_upper_bound Y Z) =
% 6.97/6.52 bnd_least_upper_bound (bnd_multiply X Y) (bnd_multiply X Z);
% 6.97/6.52 !!X Y. bnd_greatest_lower_bound X (bnd_least_upper_bound X Y) = X;
% 6.97/6.52 !!X Y. bnd_least_upper_bound X (bnd_greatest_lower_bound X Y) = X;
% 6.97/6.52 !!X. bnd_greatest_lower_bound X X = X;
% 6.97/6.52 !!X. bnd_least_upper_bound X X = X;
% 6.97/6.52 !!X Y Z.
% 6.97/6.52 bnd_least_upper_bound X (bnd_least_upper_bound Y Z) =
% 6.97/6.52 bnd_least_upper_bound (bnd_least_upper_bound X Y) Z;
% 6.97/6.52 !!X Y Z.
% 6.97/6.52 bnd_greatest_lower_bound X (bnd_greatest_lower_bound Y Z) =
% 6.97/6.52 bnd_greatest_lower_bound (bnd_greatest_lower_bound X Y) Z;
% 6.97/6.52 !!X Y. bnd_least_upper_bound X Y = bnd_least_upper_bound Y X;
% 6.97/6.52 !!X Y. bnd_greatest_lower_bound X Y = bnd_greatest_lower_bound Y X;
% 6.97/6.52 !!X Y Z.
% 6.97/6.52 bnd_multiply (bnd_multiply X Y) Z = bnd_multiply X (bnd_multiply Y Z);
% 6.97/6.52 !!X. bnd_multiply (bnd_inverse X) X = bnd_identity;
% 6.97/6.52 !!X. bnd_multiply bnd_identity X = X |]
% 6.97/6.52 ==> True
% 6.97/6.52 Adding axioms...
% 6.97/6.53 Typedef.type_definition_def
% 9.55/9.13 ...done.
% 9.55/9.13 Ground types: ?'b, TPTP_Interpret.ind
% 9.55/9.13 Translating term (sizes: 1, 1) ...
% 11.16/10.72 Invoking SAT solver...
% 11.16/10.72 No model exists.
% 11.16/10.72 Translating term (sizes: 2, 1) ...
% 13.36/12.99 Invoking SAT solver...
% 13.36/12.99 No model exists.
% 13.36/12.99 Translating term (sizes: 1, 2) ...
% 19.26/18.86 Invoking SAT solver...
% 19.26/18.86 No model exists.
% 19.26/18.86 Translating term (sizes: 3, 1) ...
% 23.98/23.50 Invoking SAT solver...
% 23.98/23.50 No model exists.
% 23.98/23.50 Translating term (sizes: 2, 2) ...
% 37.60/37.11 Invoking SAT solver...
% 37.60/37.11 No model exists.
% 37.60/37.11 Translating term (sizes: 1, 3) ...
% 53.74/53.27 Invoking SAT solver...
% 53.74/53.27 No model exists.
% 53.74/53.27 Translating term (sizes: 4, 1) ...
% 65.58/65.06 Invoking SAT solver...
% 65.58/65.06 No model exists.
% 65.58/65.06 Translating term (sizes: 3, 2) ...
% 158.89/158.07 Invoking SAT solver...
% 158.89/158.07 No model exists.
% 158.89/158.07 Translating term (sizes: 2, 3) ...
% 216.10/214.90 Invoking SAT solver...
% 216.10/214.90 No model exists.
% 216.10/214.90 Translating term (sizes: 1, 4) ...
% 251.97/250.50 Invoking SAT solver...
% 251.97/250.50 No model exists.
% 251.97/250.50 Translating term (sizes: 5, 1) ...
% 283.63/281.91 Invoking SAT solver...
% 283.63/281.91 No model exists.
% 283.63/281.91 Translating term (sizes: 4, 2) ...
% 300.09/298.22 /export/starexec/sandbox/solver/lib/scripts/run-polyml-5.5.2: line 82: 47922 CPU time limit exceeded (core dumped) "$ISABELLE_HOME/lib/scripts/feeder" -p -h "$MLTEXT" -t "$MLEXIT" $FEEDER_OPTS
% 300.09/298.22 47923 (core dumped) | { read FPID; "$POLY" -q -i $ML_OPTIONS; RC="$?"; kill -TERM "$FPID"; exit "$RC"; }
% 300.09/298.23 /export/starexec/sandbox/solver/src/HOL/TPTP/lib/Tools/tptp_refute: line 26: 47868 Exit 152 "$ISABELLE_PROCESS" -q -e "use_thy \"/tmp/$SCRATCH\"; exit 1;" HOL-TPTP
% 300.09/298.23 47869 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.$"
%------------------------------------------------------------------------------