TSTP Solution File: PUZ133+3 by Refute---2015
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Refute---2015
% Problem : PUZ133+3 : TPTP v6.4.0. Released v4.1.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 02:30:25 EDT 2016
% Result : Timeout 290.14s
% 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 : PUZ133+3 : TPTP v6.4.0. Released v4.1.0.
% 0.00/0.04 % Command : isabelle tptp_refute %d %s
% 0.02/0.23 % Computer : n024.star.cs.uiowa.edu
% 0.02/0.23 % Model : x86_64 x86_64
% 0.02/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/0.23 % Memory : 16091.75MB
% 0.02/0.23 % OS : Linux 3.10.0-327.10.1.el7.x86_64
% 0.02/0.23 % CPULimit : 300
% 0.02/0.23 % DateTime : Wed Apr 6 10:04:54 CDT 2016
% 0.02/0.23 % CPUTime :
% 6.31/5.82 > val it = (): unit
% 6.51/6.02 Trying to find a model that refutes: bnd_queens_p & (ALL I. bnd_q I = bnd_p (bnd_perm I)) --> bnd_queens_q
% 6.91/6.50 Unfolded term: [| ALL I J K L.
% 6.91/6.50 (bnd_minus I J = bnd_minus K L) = (bnd_minus I K = bnd_minus J L);
% 6.91/6.50 ALL I J K L.
% 6.91/6.50 (bnd_plus I J = bnd_plus K L) = (bnd_minus I K = bnd_minus L J);
% 6.91/6.50 ALL X. bnd_le X (bnd_s X);
% 6.91/6.50 ALL X Y Z. bnd_le X Y & bnd_le Y Z --> bnd_le X Z;
% 6.91/6.50 ALL J I. bnd_minus I J = bnd_minus (bnd_perm J) (bnd_perm I);
% 6.91/6.50 ALL I J. bnd_lt I J = bnd_lt (bnd_perm J) (bnd_perm I);
% 6.91/6.50 ALL I.
% 6.91/6.50 bnd_le (bnd_s bnd_n0) I & bnd_le I bnd_n -->
% 6.91/6.50 bnd_le (bnd_s bnd_n0) (bnd_perm I) & bnd_le (bnd_perm I) bnd_n;
% 6.91/6.50 (ALL I J.
% 6.91/6.50 ((bnd_le (bnd_s bnd_n0) I & bnd_le I bnd_n) & bnd_le (bnd_s I) J) &
% 6.91/6.50 bnd_le J bnd_n -->
% 6.91/6.50 (~ bnd_q I = bnd_q J &
% 6.91/6.50 ~ bnd_plus (bnd_q I) I = bnd_plus (bnd_q J) J) &
% 6.91/6.50 ~ bnd_minus (bnd_q I) I = bnd_minus (bnd_q J) J) -->
% 6.91/6.50 bnd_queens_q;
% 6.91/6.50 ALL I. bnd_perm I = bnd_minus (bnd_s bnd_n) I;
% 6.91/6.50 bnd_queens_p -->
% 6.91/6.50 (ALL I J.
% 6.91/6.50 ((bnd_le (bnd_s bnd_n0) I & bnd_le I bnd_n) & bnd_le (bnd_s I) J) &
% 6.91/6.50 bnd_le J bnd_n -->
% 6.91/6.50 (~ bnd_p I = bnd_p J &
% 6.91/6.50 ~ bnd_plus (bnd_p I) I = bnd_plus (bnd_p J) J) &
% 6.91/6.50 ~ bnd_minus (bnd_p I) I = bnd_minus (bnd_p J) J) |]
% 6.91/6.50 ==> bnd_queens_p & (ALL I. bnd_q I = bnd_p (bnd_perm I)) --> bnd_queens_q
% 6.91/6.50 Adding axioms...
% 7.01/6.51 Typedef.type_definition_def
% 9.41/8.91 ...done.
% 9.41/8.91 Ground types: ?'b, TPTP_Interpret.ind
% 9.41/8.91 Translating term (sizes: 1, 1) ...
% 10.91/10.41 Invoking SAT solver...
% 10.91/10.41 No model exists.
% 10.91/10.41 Translating term (sizes: 2, 1) ...
% 13.11/12.64 Invoking SAT solver...
% 13.11/12.64 No model exists.
% 13.11/12.64 Translating term (sizes: 1, 2) ...
% 19.03/18.53 Invoking SAT solver...
% 19.03/18.55 No model exists.
% 19.03/18.55 Translating term (sizes: 3, 1) ...
% 23.64/23.11 Invoking SAT solver...
% 23.64/23.12 No model exists.
% 23.64/23.12 Translating term (sizes: 2, 2) ...
% 37.16/36.66 Invoking SAT solver...
% 37.16/36.68 No model exists.
% 37.16/36.68 Translating term (sizes: 1, 3) ...
% 55.41/54.81 Invoking SAT solver...
% 126.17/125.27 No model exists.
% 126.17/125.27 Translating term (sizes: 4, 1) ...
% 137.89/136.93 Invoking SAT solver...
% 137.89/136.93 No model exists.
% 137.89/136.93 Translating term (sizes: 3, 2) ...
% 230.88/229.54 Invoking SAT solver...
% 230.88/229.56 No model exists.
% 230.88/229.56 Translating term (sizes: 2, 3) ...
% 290.14/288.35 Invoking SAT solver...
% 300.08/298.14 /export/starexec/sandbox2/solver/lib/scripts/run-polyml-5.5.2: line 82: 58636 CPU time limit exceeded (core dumped) "$ISABELLE_HOME/lib/scripts/feeder" -p -h "$MLTEXT" -t "$MLEXIT" $FEEDER_OPTS
% 300.08/298.14 58637 (core dumped) | { read FPID; "$POLY" -q -i $ML_OPTIONS; RC="$?"; kill -TERM "$FPID"; exit "$RC"; }
% 300.08/298.16 /export/starexec/sandbox2/solver/src/HOL/TPTP/lib/Tools/tptp_refute: line 26: 58582 Exit 152 "$ISABELLE_PROCESS" -q -e "use_thy \"/tmp/$SCRATCH\"; exit 1;" HOL-TPTP
% 300.08/298.16 58583 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.$"
%------------------------------------------------------------------------------