TSTP Solution File: NUM026-1 by Refute---2015
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Refute---2015
% Problem : NUM026-1 : TPTP v6.4.0. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : isabelle tptp_refute %d %s
% Computer : n024.star.cs.uiowa.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory : 16091.75MB
% OS : Linux 3.10.0-327.10.1.el7.x86_64
% CPULimit : 300s
% DateTime : Thu Apr 14 01:54:35 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.02/0.03 % Problem : NUM026-1 : TPTP v6.4.0. Bugfixed v4.0.0.
% 0.02/0.04 % Command : isabelle tptp_refute %d %s
% 0.03/0.23 % Computer : n024.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 : 16091.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 : Tue Apr 5 15:17:09 CDT 2016
% 0.03/0.23 % CPUTime :
% 6.30/5.83 > val it = (): unit
% 6.50/6.02 Trying to find a model that refutes: True
% 6.80/6.38 Unfolded term: [| ~ bnd_less (bnd_multiply bnd_a bnd_c) (bnd_multiply bnd_b bnd_c);
% 6.80/6.38 bnd_less bnd_a bnd_b; ~ bnd_equalish bnd_c bnd_n0; !!A. ~ bnd_less A A;
% 6.80/6.38 !!A. ~ bnd_equalish (bnd_successor A) bnd_n0;
% 6.80/6.38 !!X Y Z. (~ bnd_equalish X Y | ~ bnd_equalish Y Z) | bnd_equalish X Z;
% 6.80/6.38 !!X Y. ~ bnd_equalish X Y | bnd_equalish Y X; !!X. bnd_equalish X X;
% 6.80/6.38 !!A B.
% 6.80/6.38 ~ bnd_less A B |
% 6.80/6.38 bnd_equalish
% 6.80/6.38 (bnd_add (bnd_successor (bnd_predecessor_of_1st_minus_2nd B A)) A) B;
% 6.80/6.38 !!A B C. ~ bnd_equalish (bnd_add (bnd_successor A) B) C | bnd_less B C;
% 6.80/6.38 !!A B C. (~ bnd_less A B | ~ bnd_less C A) | bnd_less C B;
% 6.80/6.38 !!A B.
% 6.80/6.38 ~ bnd_equalish A B | bnd_equalish (bnd_successor A) (bnd_successor B);
% 6.80/6.38 !!A B.
% 6.80/6.38 ~ bnd_equalish (bnd_successor A) (bnd_successor B) | bnd_equalish A B;
% 6.80/6.38 !!A B.
% 6.80/6.38 bnd_equalish (bnd_multiply A (bnd_successor B))
% 6.80/6.38 (bnd_add (bnd_multiply A B) A);
% 6.80/6.38 !!A. bnd_equalish (bnd_multiply A bnd_n0) bnd_n0;
% 6.80/6.38 !!A B.
% 6.80/6.38 bnd_equalish (bnd_add A (bnd_successor B))
% 6.80/6.38 (bnd_successor (bnd_add A B));
% 6.80/6.38 !!A. bnd_equalish (bnd_add A bnd_n0) A |]
% 6.80/6.38 ==> True
% 6.80/6.38 Adding axioms...
% 6.80/6.40 Typedef.type_definition_def
% 8.50/8.02 ...done.
% 8.50/8.02 Ground types: ?'b, TPTP_Interpret.ind
% 8.50/8.02 Translating term (sizes: 1, 1) ...
% 9.81/9.31 Invoking SAT solver...
% 9.81/9.31 No model exists.
% 9.81/9.31 Translating term (sizes: 2, 1) ...
% 11.91/11.48 Invoking SAT solver...
% 11.91/11.48 No model exists.
% 11.91/11.48 Translating term (sizes: 1, 2) ...
% 16.31/15.85 Invoking SAT solver...
% 16.31/15.85 No model exists.
% 16.31/15.85 Translating term (sizes: 3, 1) ...
% 20.83/20.35 Invoking SAT solver...
% 20.83/20.35 No model exists.
% 20.83/20.35 Translating term (sizes: 2, 2) ...
% 33.04/32.50 Invoking SAT solver...
% 33.04/32.50 No model exists.
% 33.04/32.50 Translating term (sizes: 1, 3) ...
% 43.57/43.07 Invoking SAT solver...
% 43.57/43.07 No model exists.
% 43.57/43.07 Translating term (sizes: 4, 1) ...
% 55.31/54.73 Invoking SAT solver...
% 55.31/54.73 No model exists.
% 55.31/54.73 Translating term (sizes: 3, 2) ...
% 146.84/145.94 Invoking SAT solver...
% 146.84/145.94 No model exists.
% 146.84/145.94 Translating term (sizes: 2, 3) ...
% 198.33/197.15 Invoking SAT solver...
% 198.33/197.15 No model exists.
% 198.33/197.15 Translating term (sizes: 1, 4) ...
% 219.77/218.47 Invoking SAT solver...
% 219.77/218.47 No model exists.
% 219.77/218.47 Translating term (sizes: 5, 1) ...
% 251.10/249.60 Invoking SAT solver...
% 251.10/249.60 No model exists.
% 251.10/249.60 Translating term (sizes: 4, 2) ...
% 300.05/298.03 /export/starexec/sandbox/solver/lib/scripts/run-polyml-5.5.2: line 82: 9873 CPU time limit exceeded (core dumped) "$ISABELLE_HOME/lib/scripts/feeder" -p -h "$MLTEXT" -t "$MLEXIT" $FEEDER_OPTS
% 300.05/298.03 9874 (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: 9819 Exit 152 "$ISABELLE_PROCESS" -q -e "use_thy \"/tmp/$SCRATCH\"; exit 1;" HOL-TPTP
% 300.05/298.04 9820 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.$"
%------------------------------------------------------------------------------