%------------------------------------------------------------------------------
% File : Refute---2015
% Problem : SWV004-1 : TPTP v6.4.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : isabelle tptp_refute %d %s
% Computer : n144.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 : Thu Apr 14 05:26:52 EDT 2016
% Result : Timeout 300.10s
% 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 : SWV004-1 : TPTP v6.4.0. Released v1.0.0.
% 0.00/0.04 % Command : isabelle tptp_refute %d %s
% 0.03/0.23 % Computer : n144.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 : Fri Apr 8 12:02:23 CDT 2016
% 0.03/0.23 % CPUTime :
% 6.30/5.83 > val it = (): unit
% 6.51/6.03 Trying to find a model that refutes: True
% 6.91/6.49 Unfolded term: [| ~ bnd_less_than bnd_j bnd_q; ~ bnd_less_than bnd_q bnd_i;
% 6.91/6.49 !!X. (~ bnd_less_than bnd_one X | ~ bnd_less_than X bnd_i) |
% 6.91/6.49 ~ bnd_less_than (bnd_a X) (bnd_a (bnd_predecessor X));
% 6.91/6.49 !!X. ((bnd_less_than X bnd_i | bnd_less_than bnd_n X) |
% 6.91/6.49 ~ bnd_less_than bnd_one bnd_i) |
% 6.91/6.49 ~ bnd_less_than (bnd_a X) (bnd_a (bnd_predecessor bnd_i));
% 6.91/6.49 !!X. (bnd_less_than X bnd_i | ~ bnd_less_than X bnd_j) |
% 6.91/6.49 ~ bnd_less_than (bnd_a X) (bnd_a bnd_k);
% 6.91/6.49 bnd_less_than (bnd_a bnd_q) (bnd_a bnd_k);
% 6.91/6.49 bnd_less_than (bnd_a bnd_j) (bnd_a bnd_k); bnd_less_than bnd_i bnd_n;
% 6.91/6.49 ~ bnd_less_than bnd_k bnd_i; bnd_less_than bnd_k bnd_j;
% 6.91/6.49 ~ bnd_less_than bnd_n bnd_j;
% 6.91/6.49 !!Z Y X. (bnd_less_than Z Y | ~ X = Y) | ~ bnd_less_than Z X;
% 6.91/6.49 !!Y Z X. (bnd_less_than Y Z | ~ X = Y) | ~ bnd_less_than X Z;
% 6.91/6.49 !!X Y. ~ bnd_less_than X Y | ~ bnd_less_than Y X;
% 6.91/6.49 !!X. ~ bnd_less_than X X;
% 6.91/6.49 !!X Y. (bnd_less_than X Y | bnd_less_than Y X) | X = Y;
% 6.91/6.49 !!X Z Y. (bnd_less_than X Z | ~ bnd_less_than X Y) | ~ bnd_less_than Y Z;
% 6.91/6.49 !!X. bnd_less_than X (bnd_successor X);
% 6.91/6.49 !!X. bnd_less_than (bnd_predecessor X) X;
% 6.91/6.49 !!X Y. X = Y | ~ bnd_successor X = bnd_successor Y;
% 6.91/6.49 !!X Y. X = Y | ~ bnd_predecessor X = bnd_predecessor Y;
% 6.91/6.49 !!X. bnd_successor (bnd_predecessor X) = X;
% 6.91/6.49 !!X. bnd_predecessor (bnd_successor X) = X |]
% 6.91/6.49 ==> True
% 6.91/6.49 Adding axioms...
% 7.01/6.51 Typedef.type_definition_def
% 8.90/8.45 ...done.
% 8.90/8.46 Ground types: ?'b, TPTP_Interpret.ind
% 8.90/8.46 Translating term (sizes: 1, 1) ...
% 10.59/10.14 Invoking SAT solver...
% 10.59/10.14 No model exists.
% 10.59/10.14 Translating term (sizes: 2, 1) ...
% 13.00/12.56 Invoking SAT solver...
% 13.00/12.56 No model exists.
% 13.00/12.56 Translating term (sizes: 1, 2) ...
% 17.41/16.92 Invoking SAT solver...
% 17.41/16.92 No model exists.
% 17.41/16.92 Translating term (sizes: 3, 1) ...
% 22.12/21.68 Invoking SAT solver...
% 22.12/21.68 No model exists.
% 22.12/21.68 Translating term (sizes: 2, 2) ...
% 34.35/33.84 Invoking SAT solver...
% 34.35/33.84 No model exists.
% 34.35/33.84 Translating term (sizes: 1, 3) ...
% 44.06/43.60 Invoking SAT solver...
% 44.06/43.60 No model exists.
% 44.06/43.60 Translating term (sizes: 4, 1) ...
% 56.01/55.48 Invoking SAT solver...
% 56.01/55.48 No model exists.
% 56.01/55.48 Translating term (sizes: 3, 2) ...
% 147.99/147.03 Invoking SAT solver...
% 147.99/147.03 No model exists.
% 147.99/147.03 Translating term (sizes: 2, 3) ...
% 198.71/197.48 Invoking SAT solver...
% 198.71/197.48 No model exists.
% 198.71/197.48 Translating term (sizes: 1, 4) ...
% 218.07/217.13 Invoking SAT solver...
% 218.07/217.13 No model exists.
% 218.07/217.13 Translating term (sizes: 5, 1) ...
% 249.83/248.67 Invoking SAT solver...
% 249.83/248.67 No model exists.
% 249.83/248.67 Translating term (sizes: 4, 2) ...
% 300.10/298.43 /export/starexec/sandbox2/solver/lib/scripts/run-polyml-5.5.2: line 82: 32319 CPU time limit exceeded (core dumped) "$ISABELLE_HOME/lib/scripts/feeder" -p -h "$MLTEXT" -t "$MLEXIT" $FEEDER_OPTS
% 300.10/298.43 32320 (core dumped) | { read FPID; "$POLY" -q -i $ML_OPTIONS; RC="$?"; kill -TERM "$FPID"; exit "$RC"; }
% 300.10/298.44 /export/starexec/sandbox2/solver/src/HOL/TPTP/lib/Tools/tptp_refute: line 26: 32265 Exit 152 "$ISABELLE_PROCESS" -q -e "use_thy \"/tmp/$SCRATCH\"; exit 1;" HOL-TPTP
% 300.10/298.44 32266 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.$"
%------------------------------------------------------------------------------