TSTP Solution File: PUZ015-1 by Refute---2015
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Refute---2015
% Problem : PUZ015-1 : TPTP v6.4.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : isabelle tptp_refute %d %s
% Computer : n029.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 02:30:03 EDT 2016
% Result : Timeout 300.02s
% 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 : PUZ015-1 : TPTP v6.4.0. Released v1.0.0.
% 0.00/0.04 % Command : isabelle tptp_refute %d %s
% 0.03/0.22 % Computer : n029.star.cs.uiowa.edu
% 0.03/0.22 % Model : x86_64 x86_64
% 0.03/0.22 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.03/0.22 % Memory : 16091.75MB
% 0.03/0.22 % OS : Linux 3.10.0-327.10.1.el7.x86_64
% 0.03/0.22 % CPULimit : 300
% 0.03/0.22 % DateTime : Wed Apr 6 09:12:54 CDT 2016
% 0.03/0.23 % CPUTime :
% 6.28/5.85 > val it = (): unit
% 6.48/6.06 Trying to find a model that refutes: True
% 7.28/6.82 Unfolded term: [| ~ bnd_achievable (bnd_row bnd_n8)
% 7.28/6.82 (bnd_squares bnd_covered bnd_covered bnd_covered bnd_covered
% 7.28/6.82 bnd_covered bnd_covered bnd_covered bnd_not_covered);
% 7.28/6.82 bnd_achievable (bnd_row bnd_n1)
% 7.28/6.82 (bnd_squares bnd_removed bnd_not_covered bnd_not_covered bnd_not_covered
% 7.28/6.82 bnd_not_covered bnd_not_covered bnd_not_covered bnd_not_covered);
% 7.28/6.82 bnd_complement bnd_removed = bnd_not_covered;
% 7.28/6.82 bnd_complement bnd_not_covered = bnd_covered;
% 7.28/6.82 bnd_complement bnd_covered = bnd_not_covered;
% 7.28/6.82 bnd_successor bnd_n8 = bnd_n9; bnd_successor bnd_n7 = bnd_n8;
% 7.28/6.82 bnd_successor bnd_n6 = bnd_n7; bnd_successor bnd_n5 = bnd_n6;
% 7.28/6.82 bnd_successor bnd_n4 = bnd_n5; bnd_successor bnd_n3 = bnd_n4;
% 7.28/6.82 bnd_successor bnd_n2 = bnd_n3; bnd_successor bnd_n1 = bnd_n2;
% 7.28/6.82 !!X Y1 Y2 Y3 Y4 Y5 Y6 Y7 Y8.
% 7.28/6.82 ~ bnd_achievable (bnd_row X) (bnd_squares Y1 Y2 Y3 Y4 Y5 Y6 Y7 Y8) |
% 7.28/6.82 bnd_achievable (bnd_row (bnd_successor X))
% 7.28/6.82 (bnd_squares (bnd_complement Y1) (bnd_complement Y2)
% 7.28/6.82 (bnd_complement Y3) (bnd_complement Y4) (bnd_complement Y5)
% 7.28/6.82 (bnd_complement Y6) (bnd_complement Y7) (bnd_complement Y8));
% 7.28/6.82 !!X Y1 Y2 Y3 Y4 Y5 Y6.
% 7.28/6.82 ~ bnd_achievable (bnd_row X)
% 7.28/6.82 (bnd_squares Y1 Y2 Y3 Y4 Y5 Y6 bnd_not_covered bnd_not_covered) |
% 7.28/6.82 bnd_achievable (bnd_row X)
% 7.28/6.82 (bnd_squares Y1 Y2 Y3 Y4 Y5 Y6 bnd_covered bnd_covered);
% 7.28/6.82 !!X Y1 Y2 Y3 Y4 Y5 Y8.
% 7.28/6.82 ~ bnd_achievable (bnd_row X)
% 7.28/6.82 (bnd_squares Y1 Y2 Y3 Y4 Y5 bnd_not_covered bnd_not_covered Y8) |
% 7.28/6.82 bnd_achievable (bnd_row X)
% 7.28/6.82 (bnd_squares Y1 Y2 Y3 Y4 Y5 bnd_covered bnd_covered Y8);
% 7.28/6.82 !!X Y1 Y2 Y3 Y4 Y7 Y8.
% 7.28/6.82 ~ bnd_achievable (bnd_row X)
% 7.28/6.82 (bnd_squares Y1 Y2 Y3 Y4 bnd_not_covered bnd_not_covered Y7 Y8) |
% 7.28/6.82 bnd_achievable (bnd_row X)
% 7.28/6.82 (bnd_squares Y1 Y2 Y3 Y4 bnd_covered bnd_covered Y7 Y8);
% 7.28/6.82 !!X Y1 Y2 Y3 Y6 Y7 Y8.
% 7.28/6.82 ~ bnd_achievable (bnd_row X)
% 7.28/6.82 (bnd_squares Y1 Y2 Y3 bnd_not_covered bnd_not_covered Y6 Y7 Y8) |
% 7.28/6.82 bnd_achievable (bnd_row X)
% 7.28/6.82 (bnd_squares Y1 Y2 Y3 bnd_covered bnd_covered Y6 Y7 Y8);
% 7.28/6.82 !!X Y1 Y2 Y5 Y6 Y7 Y8.
% 7.28/6.82 ~ bnd_achievable (bnd_row X)
% 7.28/6.82 (bnd_squares Y1 Y2 bnd_not_covered bnd_not_covered Y5 Y6 Y7 Y8) |
% 7.28/6.82 bnd_achievable (bnd_row X)
% 7.28/6.82 (bnd_squares Y1 Y2 bnd_covered bnd_covered Y5 Y6 Y7 Y8);
% 7.28/6.82 !!X Y1 Y4 Y5 Y6 Y7 Y8.
% 7.28/6.82 ~ bnd_achievable (bnd_row X)
% 7.28/6.82 (bnd_squares Y1 bnd_not_covered bnd_not_covered Y4 Y5 Y6 Y7 Y8) |
% 7.28/6.82 bnd_achievable (bnd_row X)
% 7.28/6.82 (bnd_squares Y1 bnd_covered bnd_covered Y4 Y5 Y6 Y7 Y8);
% 7.28/6.82 !!X Y3 Y4 Y5 Y6 Y7 Y8.
% 7.28/6.82 ~ bnd_achievable (bnd_row X)
% 7.28/6.82 (bnd_squares bnd_not_covered bnd_not_covered Y3 Y4 Y5 Y6 Y7 Y8) |
% 7.28/6.82 bnd_achievable (bnd_row X)
% 7.28/6.82 (bnd_squares bnd_covered bnd_covered Y3 Y4 Y5 Y6 Y7 Y8) |]
% 7.28/6.82 ==> True
% 7.28/6.82 Adding axioms...
% 7.28/6.83 Typedef.type_definition_def
% 11.50/11.05 ...done.
% 11.50/11.06 Ground types: ?'b, TPTP_Interpret.ind
% 11.50/11.06 Translating term (sizes: 1, 1) ...
% 13.98/13.50 Invoking SAT solver...
% 13.98/13.50 No model exists.
% 13.98/13.50 Translating term (sizes: 2, 1) ...
% 17.09/16.61 Invoking SAT solver...
% 17.09/16.61 No model exists.
% 17.09/16.61 Translating term (sizes: 1, 2) ...
% 267.82/266.00 Invoking SAT solver...
% 267.82/266.00 No model exists.
% 267.82/266.00 Translating term (sizes: 3, 1) ...
% 273.35/271.51 Invoking SAT solver...
% 273.35/271.51 No model exists.
% 273.35/271.51 Translating term (sizes: 2, 2) ...
% 300.02/297.92 /export/starexec/sandbox2/solver/lib/scripts/run-polyml-5.5.2: line 82: 23905 CPU time limit exceeded (core dumped) "$ISABELLE_HOME/lib/scripts/feeder" -p -h "$MLTEXT" -t "$MLEXIT" $FEEDER_OPTS
% 300.02/297.92 23906 (core dumped) | { read FPID; "$POLY" -q -i $ML_OPTIONS; RC="$?"; kill -TERM "$FPID"; exit "$RC"; }
% 300.02/297.93 /export/starexec/sandbox2/solver/src/HOL/TPTP/lib/Tools/tptp_refute: line 26: 23800 Exit 152 "$ISABELLE_PROCESS" -q -e "use_thy \"/tmp/$SCRATCH\"; exit 1;" HOL-TPTP
% 300.02/297.93 23801 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.$"
%------------------------------------------------------------------------------