TSTP Solution File: SWV382+1 by Refute---2015
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Refute---2015
% Problem : SWV382+1 : TPTP v6.4.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : isabelle tptp_refute %d %s
% Computer : n102.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:28:33 EDT 2016
% Result : Timeout 300.04s
% 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 : SWV382+1 : TPTP v6.4.0. Released v3.3.0.
% 0.00/0.04 % Command : isabelle tptp_refute %d %s
% 0.03/0.22 % Computer : n102.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 : 32218.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 : Fri Apr 8 14:33:54 CDT 2016
% 0.03/0.23 % CPUTime :
% 6.31/5.83 > val it = (): unit
% 6.61/6.13 Trying to find a model that refutes: (EX X. bnd_contains_cpq (bnd_triple U V W) X &
% 6.61/6.13 bnd_strictly_less_than X
% 6.61/6.13 (bnd_findmin_cpq_res (bnd_triple U V W))) -->
% 6.61/6.13 ~ bnd_phi (bnd_findmin_cpq_eff (bnd_triple U V W))
% 8.01/7.57 Unfolded term: [| ALL U V W.
% 8.01/7.57 (EX X. bnd_contains_cpq (bnd_triple U V W) X &
% 8.01/7.57 bnd_strictly_less_than X
% 8.01/7.57 (bnd_findmin_cpq_res (bnd_triple U V W))) -->
% 8.01/7.57 ~ bnd_check_cpq (bnd_findmin_cpq_eff (bnd_triple U V W));
% 8.01/7.57 ALL U V W.
% 8.01/7.57 ~ bnd_check_cpq (bnd_triple U V W) -->
% 8.01/7.57 (ALL X Y Z.
% 8.01/7.57 bnd_succ_cpq (bnd_triple U V W) (bnd_triple X Y Z) -->
% 8.01/7.57 ~ bnd_ok (bnd_triple X Y Z) | ~ bnd_check_cpq (bnd_triple X Y Z));
% 8.01/7.57 ALL U.
% 8.01/7.57 bnd_phi U = (EX V. (bnd_succ_cpq U V & bnd_ok V) & bnd_check_cpq V);
% 8.01/7.57 ALL U. bnd_pi_removemin U = Ex (bnd_pi_sharp_find_min (bnd_i U));
% 8.01/7.57 ALL U V.
% 8.01/7.57 bnd_pi_sharp_removemin U V =
% 8.01/7.57 (bnd_contains_pq U V & bnd_issmallestelement_pq U V);
% 8.01/7.57 ALL U. bnd_pi_find_min U = Ex (bnd_pi_sharp_find_min (bnd_i U));
% 8.01/7.57 ALL U V.
% 8.01/7.57 bnd_pi_sharp_find_min U V =
% 8.01/7.57 (bnd_contains_pq U V & bnd_issmallestelement_pq U V);
% 8.01/7.57 ALL U V. bnd_pi_remove U V = bnd_pi_sharp_remove (bnd_i U) V;
% 8.01/7.57 ALL U V. bnd_pi_sharp_remove U V = bnd_contains_pq U V;
% 8.01/7.57 ALL U V W X Y.
% 8.01/7.57 bnd_i (bnd_triple U (bnd_insert_slb V (bnd_pair X Y)) W) =
% 8.01/7.57 bnd_insert_pq (bnd_i (bnd_triple U V W)) X;
% 8.01/7.57 ALL U V. bnd_i (bnd_triple U bnd_create_slb V) = bnd_create_pq;
% 8.01/7.57 ALL U. bnd_removemin_cpq_res U = bnd_findmin_cpq_res U;
% 8.01/7.57 ALL U.
% 8.01/7.57 bnd_removemin_cpq_eff U =
% 8.01/7.57 bnd_remove_cpq (bnd_findmin_cpq_eff U) (bnd_findmin_cpq_res U);
% 8.01/7.57 ALL U V W X.
% 8.01/7.57 ~ V = bnd_create_slb -->
% 8.01/7.57 bnd_findmin_cpq_res (bnd_triple U V W) = bnd_findmin_pqp_res U;
% 8.01/7.57 ALL U V.
% 8.01/7.57 bnd_findmin_cpq_res (bnd_triple U bnd_create_slb V) = bnd_bottom;
% 8.01/7.57 ALL U V W X.
% 8.01/7.57 (~ V = bnd_create_slb & bnd_contains_slb V (bnd_findmin_pqp_res U)) &
% 8.01/7.57 bnd_less_than (bnd_lookup_slb V (bnd_findmin_pqp_res U))
% 8.01/7.57 (bnd_findmin_pqp_res U) -->
% 8.01/7.57 bnd_findmin_cpq_eff (bnd_triple U V W) =
% 8.01/7.57 bnd_triple U (bnd_update_slb V (bnd_findmin_pqp_res U)) W;
% 8.01/7.57 ALL U V W X.
% 8.01/7.57 (~ V = bnd_create_slb & bnd_contains_slb V (bnd_findmin_pqp_res U)) &
% 8.01/7.57 bnd_strictly_less_than (bnd_findmin_pqp_res U)
% 8.01/7.57 (bnd_lookup_slb V (bnd_findmin_pqp_res U)) -->
% 8.01/7.57 bnd_findmin_cpq_eff (bnd_triple U V W) =
% 8.01/7.57 bnd_triple U (bnd_update_slb V (bnd_findmin_pqp_res U)) bnd_bad;
% 8.01/7.57 ALL U V W X.
% 8.01/7.57 ~ V = bnd_create_slb &
% 8.01/7.57 ~ bnd_contains_slb V (bnd_findmin_pqp_res U) -->
% 8.01/7.57 bnd_findmin_cpq_eff (bnd_triple U V W) =
% 8.01/7.57 bnd_triple U (bnd_update_slb V (bnd_findmin_pqp_res U)) bnd_bad;
% 8.01/7.57 ALL U V.
% 8.01/7.57 bnd_findmin_cpq_eff (bnd_triple U bnd_create_slb V) =
% 8.01/7.57 bnd_triple U bnd_create_slb bnd_bad;
% 8.01/7.57 ALL U V W X.
% 8.01/7.57 bnd_contains_slb V X &
% 8.01/7.57 bnd_strictly_less_than X (bnd_lookup_slb V X) -->
% 8.01/7.57 bnd_remove_cpq (bnd_triple U V W) X =
% 8.01/7.57 bnd_triple (bnd_remove_pqp U X) (bnd_remove_slb V X) bnd_bad;
% 8.01/7.57 ALL U V W X.
% 8.01/7.57 bnd_contains_slb V X & bnd_less_than (bnd_lookup_slb V X) X -->
% 8.01/7.57 bnd_remove_cpq (bnd_triple U V W) X =
% 8.01/7.57 bnd_triple (bnd_remove_pqp U X) (bnd_remove_slb V X) W;
% 8.01/7.57 ALL U V W X.
% 8.01/7.57 ~ bnd_contains_slb V X -->
% 8.01/7.57 bnd_remove_cpq (bnd_triple U V W) X = bnd_triple U V bnd_bad;
% 8.01/7.57 ALL U V W X.
% 8.01/7.57 bnd_insert_cpq (bnd_triple U V W) X =
% 8.01/7.57 bnd_triple (bnd_insert_pqp U X)
% 8.01/7.57 (bnd_insert_slb V (bnd_pair X bnd_bottom)) W;
% 8.01/7.57 ALL U V W. ~ bnd_ok (bnd_triple U V W) --> W = bnd_bad;
% 8.01/7.57 ALL U V. bnd_ok (bnd_triple U V bnd_bad) = False;
% 8.01/7.57 ALL U V W X.
% 8.01/7.57 bnd_contains_cpq (bnd_triple U V W) X = bnd_contains_slb V X;
% 8.01/7.57 ALL U V W X Y.
% 8.01/7.57 bnd_strictly_less_than X Y -->
% 8.01/7.57 bnd_check_cpq (bnd_triple U (bnd_insert_slb V (bnd_pair X Y)) W) =
% 8.01/7.57 False;
% 8.01/7.57 ALL U V W X Y.
% 8.01/7.57 bnd_less_than Y X -->
% 8.01/7.57 bnd_check_cpq (bnd_triple U (bnd_insert_slb V (bnd_pair X Y)) W) =
% 8.01/7.57 bnd_check_cpq (bnd_triple U V W);
% 8.01/7.57 ALL U V. bnd_check_cpq (bnd_triple U bnd_create_slb V);
% 8.01/7.57 ALL U V. bnd_succ_cpq U V --> bnd_succ_cpq U (bnd_removemin_cpq_eff V);
% 8.01/7.57 ALL U V. bnd_succ_cpq U V --> bnd_succ_cpq U (bnd_findmin_cpq_eff V);
% 8.01/7.57 ALL U V W. bnd_succ_cpq U V --> bnd_succ_cpq U (bnd_remove_cpq V W);
% 8.01/7.57 ALL U V W. bnd_succ_cpq U V --> bnd_succ_cpq U (bnd_insert_cpq V W);
% 8.01/7.57 ALL U. bnd_succ_cpq U U;
% 8.01/7.57 ALL U V W X.
% 8.01/7.57 bnd_less_than W X -->
% 8.01/7.57 bnd_update_slb (bnd_insert_slb U (bnd_pair V X)) W =
% 8.01/7.57 bnd_insert_slb (bnd_update_slb U W) (bnd_pair V X);
% 8.01/7.57 ALL U V W X.
% 8.01/7.57 bnd_strictly_less_than X W -->
% 8.01/7.57 bnd_update_slb (bnd_insert_slb U (bnd_pair V X)) W =
% 8.01/7.57 bnd_insert_slb (bnd_update_slb U W) (bnd_pair V W);
% 8.01/7.57 ALL U. bnd_update_slb bnd_create_slb U = bnd_create_slb;
% 8.01/7.57 ALL U V W X.
% 8.01/7.57 ~ V = W & bnd_contains_slb U W -->
% 8.01/7.57 bnd_lookup_slb (bnd_insert_slb U (bnd_pair V X)) W =
% 8.01/7.57 bnd_lookup_slb U W;
% 8.01/7.57 ALL U V W. bnd_lookup_slb (bnd_insert_slb U (bnd_pair V W)) V = W;
% 8.01/7.57 ALL U V W X.
% 8.01/7.57 ~ V = W & bnd_contains_slb U W -->
% 8.01/7.57 bnd_remove_slb (bnd_insert_slb U (bnd_pair V X)) W =
% 8.01/7.57 bnd_insert_slb (bnd_remove_slb U W) (bnd_pair V X);
% 8.01/7.57 ALL U V W. bnd_remove_slb (bnd_insert_slb U (bnd_pair V W)) V = U;
% 8.01/7.57 ALL U V W X Y.
% 8.01/7.57 bnd_pair_in_list (bnd_insert_slb U (bnd_pair V X)) W Y =
% 8.01/7.57 (bnd_pair_in_list U W Y | V = W & X = Y);
% 8.01/7.57 ALL U V. ~ bnd_pair_in_list bnd_create_slb U V;
% 8.01/7.57 ALL U V W X.
% 8.01/7.57 bnd_contains_slb (bnd_insert_slb U (bnd_pair V X)) W =
% 8.01/7.57 (bnd_contains_slb U W | V = W);
% 8.01/7.57 ALL U. ~ bnd_contains_slb bnd_create_slb U;
% 8.01/7.57 ALL U V W. bnd_isnonempty_slb (bnd_insert_slb U (bnd_pair V W));
% 8.01/7.57 ~ bnd_isnonempty_slb bnd_create_slb;
% 8.01/7.57 ALL U V W.
% 8.01/7.57 bnd_insert_pq (bnd_insert_pq U V) W =
% 8.01/7.57 bnd_insert_pq (bnd_insert_pq U W) V;
% 8.01/7.57 ALL U V.
% 8.01/7.57 bnd_contains_pq U V & bnd_issmallestelement_pq U V -->
% 8.01/7.57 bnd_removemin_pq_res U V = V;
% 8.01/7.57 ALL U V.
% 8.01/7.57 bnd_contains_pq U V & bnd_issmallestelement_pq U V -->
% 8.01/7.57 bnd_removemin_pq_eff U V = bnd_remove_pq U V;
% 8.01/7.57 ALL U V.
% 8.01/7.57 bnd_contains_pq U V & bnd_issmallestelement_pq U V -->
% 8.01/7.57 bnd_findmin_pq_res U V = V;
% 8.01/7.57 ALL U V.
% 8.01/7.57 bnd_contains_pq U V & bnd_issmallestelement_pq U V -->
% 8.01/7.57 bnd_findmin_pq_eff U V = U;
% 8.01/7.57 ALL U V W.
% 8.01/7.57 bnd_contains_pq U W & ~ V = W -->
% 8.01/7.57 bnd_remove_pq (bnd_insert_pq U V) W =
% 8.01/7.57 bnd_insert_pq (bnd_remove_pq U W) V;
% 8.01/7.57 ALL U V. bnd_remove_pq (bnd_insert_pq U V) V = U;
% 8.01/7.57 ALL U V.
% 8.01/7.57 bnd_issmallestelement_pq U V =
% 8.01/7.57 (ALL W. bnd_contains_pq U W --> bnd_less_than V W);
% 8.01/7.57 ALL U V W.
% 8.01/7.57 bnd_contains_pq (bnd_insert_pq U V) W = (bnd_contains_pq U W | V = W);
% 8.01/7.57 ALL U. ~ bnd_contains_pq bnd_create_pq U;
% 8.01/7.57 ALL U V. bnd_isnonempty_pq (bnd_insert_pq U V);
% 8.01/7.57 ~ bnd_isnonempty_pq bnd_create_pq; All (bnd_less_than bnd_bottom);
% 8.01/7.57 ALL U V.
% 8.01/7.57 bnd_strictly_less_than U V =
% 8.01/7.57 (bnd_less_than U V & ~ bnd_less_than V U);
% 8.01/7.57 ALL U. bnd_less_than U U; ALL U V. bnd_less_than U V | bnd_less_than V U;
% 8.01/7.57 ALL U V W. bnd_less_than U V & bnd_less_than V W --> bnd_less_than U W |]
% 8.01/7.57 ==> (EX X. bnd_contains_cpq (bnd_triple U V W) X &
% 8.01/7.57 bnd_strictly_less_than X
% 8.01/7.57 (bnd_findmin_cpq_res (bnd_triple U V W))) -->
% 8.01/7.57 ~ bnd_phi (bnd_findmin_cpq_eff (bnd_triple U V W))
% 8.01/7.57 Adding axioms...
% 8.01/7.57 Typedef.type_definition_def
% 18.04/17.51 ...done.
% 18.04/17.52 Ground types: ?'b, TPTP_Interpret.ind
% 18.04/17.52 Translating term (sizes: 1, 1) ...
% 23.55/23.05 Invoking SAT solver...
% 23.55/23.05 No model exists.
% 23.55/23.05 Translating term (sizes: 2, 1) ...
% 29.75/29.27 Invoking SAT solver...
% 29.75/29.27 No model exists.
% 29.75/29.27 Translating term (sizes: 1, 2) ...
% 84.06/83.47 Invoking SAT solver...
% 84.18/83.56 No model exists.
% 84.18/83.56 Translating term (sizes: 3, 1) ...
% 92.81/92.19 Invoking SAT solver...
% 92.81/92.19 No model exists.
% 92.81/92.19 Translating term (sizes: 2, 2) ...
% 154.96/154.01 Invoking SAT solver...
% 155.05/154.10 No model exists.
% 155.05/154.10 Translating term (sizes: 1, 3) ...
% 300.04/298.04 /export/starexec/sandbox2/solver/lib/scripts/run-polyml-5.5.2: line 82: 33655 CPU time limit exceeded (core dumped) "$ISABELLE_HOME/lib/scripts/feeder" -p -h "$MLTEXT" -t "$MLEXIT" $FEEDER_OPTS
% 300.04/298.04 33656 (core dumped) | { read FPID; "$POLY" -q -i $ML_OPTIONS; RC="$?"; kill -TERM "$FPID"; exit "$RC"; }
% 300.04/298.06 /export/starexec/sandbox2/solver/src/HOL/TPTP/lib/Tools/tptp_refute: line 26: 33601 Exit 152 "$ISABELLE_PROCESS" -q -e "use_thy \"/tmp/$SCRATCH\"; exit 1;" HOL-TPTP
% 300.04/298.06 33602 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.$"
%------------------------------------------------------------------------------