TSTP Solution File: SEU260+1 by Refute---2015
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Refute---2015
% Problem : SEU260+1 : TPTP v6.4.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : isabelle tptp_refute %d %s
% Computer : n064.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 03:55:39 EDT 2016
% Result : Timeout 300.06s
% 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 : SEU260+1 : TPTP v6.4.0. Released v3.3.0.
% 0.00/0.04 % Command : isabelle tptp_refute %d %s
% 0.02/0.23 % Computer : n064.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 : 32218.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 : Thu Apr 7 01:30:54 CDT 2016
% 0.02/0.23 % CPUTime :
% 6.35/5.91 > val it = (): unit
% 6.54/6.16 Trying to find a model that refutes: bnd_relation A -->
% 6.54/6.16 (ALL B.
% 6.54/6.16 bnd_relation B -->
% 6.54/6.16 (ALL C.
% 6.54/6.16 bnd_relation C & bnd_function C -->
% 6.54/6.16 bnd_relation_isomorphism A B C -->
% 6.54/6.16 ((((bnd_reflexive A --> bnd_reflexive B) &
% 6.54/6.16 (bnd_transitive A --> bnd_transitive B)) &
% 6.54/6.16 (bnd_connected A --> bnd_connected B)) &
% 6.54/6.16 (bnd_antisymmetric A --> bnd_antisymmetric B)) &
% 6.54/6.16 (bnd_well_founded_relation A --> bnd_well_founded_relation B)))
% 7.75/7.39 Unfolded term: [| ALL A B. ~ ((bnd_empty A & ~ A = B) & bnd_empty B);
% 7.75/7.39 ALL A B. ~ (bnd_in A B & bnd_empty B);
% 7.75/7.39 ALL A. bnd_empty A --> A = bnd_empty_set;
% 7.75/7.39 ALL A B C.
% 7.75/7.39 ~ ((bnd_in A B & bnd_element B (bnd_powerset C)) & bnd_empty C);
% 7.75/7.39 ALL A B.
% 7.75/7.39 bnd_relation B & bnd_function B -->
% 7.75/7.39 bnd_one_to_one B & bnd_in A (bnd_relation_rng B) -->
% 7.75/7.39 A = bnd_apply B (bnd_apply (bnd_function_inverse B) A) &
% 7.75/7.39 A = bnd_apply (bnd_relation_composition (bnd_function_inverse B) B) A;
% 7.75/7.39 ALL A.
% 7.75/7.39 bnd_relation A & bnd_function A -->
% 7.75/7.39 bnd_one_to_one A -->
% 7.75/7.39 bnd_relation_rng A = bnd_relation_dom (bnd_function_inverse A) &
% 7.75/7.39 bnd_relation_dom A = bnd_relation_rng (bnd_function_inverse A);
% 7.75/7.39 ALL A B C.
% 7.75/7.39 bnd_in A B & bnd_element B (bnd_powerset C) --> bnd_element A C;
% 7.75/7.39 ALL A B.
% 7.75/7.39 ~ (~ bnd_disjoint A B & (ALL C. ~ (bnd_in C A & bnd_in C B))) &
% 7.75/7.39 ~ ((EX C. bnd_in C A & bnd_in C B) & bnd_disjoint A B);
% 7.75/7.39 ALL A B. bnd_element A (bnd_powerset B) = bnd_subset A B;
% 7.75/7.39 ALL A B C.
% 7.75/7.39 bnd_relation C -->
% 7.75/7.39 bnd_in (bnd_ordered_pair A B) C -->
% 7.75/7.39 bnd_in A (bnd_relation_field C) & bnd_in B (bnd_relation_field C);
% 7.75/7.39 ALL A B. bnd_element A B --> bnd_empty B | bnd_in A B;
% 7.75/7.39 ALL A B. bnd_in A B --> bnd_element A B;
% 7.75/7.39 ALL A. bnd_set_union2 A bnd_empty_set = A;
% 7.75/7.39 ALL A B.
% 7.75/7.39 bnd_relation B -->
% 7.75/7.39 ~ ((~ A = bnd_empty_set & bnd_subset A (bnd_relation_rng B)) &
% 7.75/7.39 bnd_relation_inverse_image B A = bnd_empty_set);
% 7.75/7.39 ALL A B.
% 7.75/7.39 bnd_relation B -->
% 7.75/7.39 bnd_subset (bnd_relation_inverse_image B A) (bnd_relation_dom B);
% 7.75/7.39 ALL A B. bnd_disjoint A B --> bnd_disjoint B A; ALL A B. bnd_subset A A;
% 7.75/7.39 EX A. (bnd_relation A & bnd_function A) & bnd_one_to_one A;
% 7.75/7.39 EX A. ~ bnd_empty A;
% 7.75/7.39 EX A. (bnd_relation A & bnd_empty A) & bnd_function A; Ex bnd_empty;
% 7.75/7.39 EX A. bnd_relation A & bnd_function A;
% 7.75/7.39 ALL A.
% 7.75/7.39 bnd_relation A -->
% 7.75/7.39 bnd_connected A =
% 7.75/7.39 (ALL B C.
% 7.75/7.39 ~ ((((bnd_in B (bnd_relation_field A) &
% 7.75/7.39 bnd_in C (bnd_relation_field A)) &
% 7.75/7.39 ~ B = C) &
% 7.75/7.39 ~ bnd_in (bnd_ordered_pair B C) A) &
% 7.75/7.39 ~ bnd_in (bnd_ordered_pair C B) A));
% 7.75/7.39 ALL A.
% 7.75/7.39 bnd_relation A -->
% 7.75/7.39 bnd_antisymmetric A =
% 7.75/7.39 (ALL B C.
% 7.75/7.39 bnd_in (bnd_ordered_pair B C) A &
% 7.75/7.39 bnd_in (bnd_ordered_pair C B) A -->
% 7.75/7.39 B = C);
% 7.75/7.39 ALL A.
% 7.75/7.39 bnd_relation A -->
% 7.75/7.39 bnd_transitive A =
% 7.75/7.39 (ALL B C D.
% 7.75/7.39 bnd_in (bnd_ordered_pair B C) A &
% 7.75/7.39 bnd_in (bnd_ordered_pair C D) A -->
% 7.75/7.39 bnd_in (bnd_ordered_pair B D) A);
% 7.75/7.39 ALL A.
% 7.75/7.39 bnd_relation A -->
% 7.75/7.39 bnd_reflexive A =
% 7.75/7.39 (ALL B.
% 7.75/7.39 bnd_in B (bnd_relation_field A) -->
% 7.75/7.39 bnd_in (bnd_ordered_pair B B) A);
% 7.75/7.39 ALL A B. bnd_set_union2 A A = A;
% 7.75/7.39 ALL A B. ~ bnd_empty A --> ~ bnd_empty (bnd_set_union2 B A);
% 7.75/7.39 ALL A B. ~ bnd_empty A --> ~ bnd_empty (bnd_set_union2 A B);
% 7.75/7.39 ALL A B. ~ bnd_empty (bnd_ordered_pair A B); bnd_empty bnd_empty_set;
% 7.75/7.39 ALL A B.
% 7.75/7.39 ((bnd_relation A & bnd_function A) & bnd_relation B) &
% 7.75/7.39 bnd_function B -->
% 7.75/7.39 bnd_relation (bnd_relation_composition A B) &
% 7.75/7.39 bnd_function (bnd_relation_composition A B);
% 7.75/7.39 ALL A. EX B. bnd_element B A; True;
% 7.75/7.39 ALL A B.
% 7.75/7.39 bnd_relation A & bnd_relation B -->
% 7.75/7.39 bnd_relation (bnd_relation_composition A B);
% 7.75/7.39 True; True; True; True; True;
% 7.75/7.39 ALL A.
% 7.75/7.39 bnd_relation A & bnd_function A -->
% 7.75/7.39 bnd_relation (bnd_function_inverse A) &
% 7.75/7.39 bnd_function (bnd_function_inverse A);
% 7.75/7.39 True; True; True; True; True; True; True;
% 7.75/7.39 ALL A.
% 7.75/7.39 bnd_relation A -->
% 7.75/7.39 (ALL B.
% 7.75/7.39 bnd_relation B -->
% 7.75/7.39 (ALL C.
% 7.75/7.39 bnd_relation C & bnd_function C -->
% 7.75/7.39 bnd_relation_isomorphism A B C =
% 7.75/7.39 (((bnd_relation_dom C = bnd_relation_field A &
% 7.75/7.39 bnd_relation_rng C = bnd_relation_field B) &
% 7.75/7.39 bnd_one_to_one C) &
% 7.75/7.39 (ALL D E.
% 7.75/7.39 bnd_in (bnd_ordered_pair D E) A =
% 7.75/7.39 ((bnd_in D (bnd_relation_field A) &
% 7.75/7.39 bnd_in E (bnd_relation_field A)) &
% 7.75/7.39 bnd_in
% 7.75/7.39 (bnd_ordered_pair (bnd_apply C D) (bnd_apply C E))
% 7.75/7.39 B)))));
% 7.75/7.39 ALL A.
% 7.75/7.39 bnd_relation A -->
% 7.75/7.39 bnd_relation_field A =
% 7.75/7.39 bnd_set_union2 (bnd_relation_dom A) (bnd_relation_rng A);
% 7.75/7.39 ALL A B.
% 7.75/7.39 bnd_ordered_pair A B =
% 7.75/7.39 bnd_unordered_pair (bnd_unordered_pair A B) (bnd_singleton A);
% 7.75/7.39 ALL A.
% 7.75/7.39 bnd_relation A & bnd_function A -->
% 7.75/7.39 (ALL B.
% 7.75/7.39 (B = bnd_relation_rng A) =
% 7.75/7.39 (ALL C.
% 7.75/7.39 bnd_in C B =
% 7.75/7.39 (EX D. bnd_in D (bnd_relation_dom A) & C = bnd_apply A D)));
% 7.75/7.39 ALL A.
% 7.75/7.39 bnd_relation A -->
% 7.75/7.39 bnd_well_founded_relation A =
% 7.75/7.39 (ALL B.
% 7.75/7.39 ~ ((bnd_subset B (bnd_relation_field A) & ~ B = bnd_empty_set) &
% 7.75/7.39 (ALL C. ~ (bnd_in C B & bnd_disjoint (bnd_fiber A C) B))));
% 7.75/7.39 ALL A.
% 7.75/7.39 bnd_relation A -->
% 7.75/7.39 (ALL B C.
% 7.75/7.39 (C = bnd_fiber A B) =
% 7.75/7.39 (ALL D.
% 7.75/7.39 bnd_in D C = (~ D = B & bnd_in (bnd_ordered_pair D B) A)));
% 7.75/7.39 ALL A.
% 7.75/7.39 bnd_relation A & bnd_function A -->
% 7.75/7.39 (ALL B C.
% 7.75/7.39 (C = bnd_relation_inverse_image A B) =
% 7.75/7.39 (ALL D.
% 7.75/7.39 bnd_in D C =
% 7.75/7.39 (bnd_in D (bnd_relation_dom A) & bnd_in (bnd_apply A D) B)));
% 7.75/7.39 ALL A B. bnd_set_union2 A B = bnd_set_union2 B A;
% 7.75/7.39 ALL A B. bnd_unordered_pair A B = bnd_unordered_pair B A;
% 7.75/7.39 ALL A.
% 7.75/7.39 (bnd_relation A & bnd_empty A) & bnd_function A -->
% 7.75/7.39 (bnd_relation A & bnd_function A) & bnd_one_to_one A;
% 7.75/7.39 ALL A. bnd_empty A --> bnd_function A;
% 7.75/7.39 ALL A B. bnd_in A B --> ~ bnd_in B A |]
% 7.75/7.39 ==> bnd_relation A -->
% 7.75/7.39 (ALL B.
% 7.75/7.39 bnd_relation B -->
% 7.75/7.39 (ALL C.
% 7.75/7.39 bnd_relation C & bnd_function C -->
% 7.75/7.39 bnd_relation_isomorphism A B C -->
% 7.75/7.39 ((((bnd_reflexive A --> bnd_reflexive B) &
% 7.75/7.39 (bnd_transitive A --> bnd_transitive B)) &
% 7.75/7.39 (bnd_connected A --> bnd_connected B)) &
% 7.75/7.39 (bnd_antisymmetric A --> bnd_antisymmetric B)) &
% 7.75/7.39 (bnd_well_founded_relation A --> bnd_well_founded_relation B)))
% 7.75/7.39 Adding axioms...
% 7.85/7.40 Typedef.type_definition_def
% 14.26/13.82 ...done.
% 14.26/13.83 Ground types: ?'b, TPTP_Interpret.ind
% 14.26/13.83 Translating term (sizes: 1, 1) ...
% 18.76/18.35 Invoking SAT solver...
% 18.76/18.35 No model exists.
% 18.76/18.35 Translating term (sizes: 2, 1) ...
% 23.97/23.57 Invoking SAT solver...
% 24.77/24.32 No model exists.
% 24.77/24.32 Translating term (sizes: 1, 2) ...
% 46.21/45.74 Invoking SAT solver...
% 46.31/45.84 No model exists.
% 46.31/45.84 Translating term (sizes: 3, 1) ...
% 53.93/53.46 Invoking SAT solver...
% 53.93/53.46 No model exists.
% 53.93/53.46 Translating term (sizes: 2, 2) ...
% 83.82/83.27 Invoking SAT solver...
% 83.92/83.37 No model exists.
% 83.92/83.37 Translating term (sizes: 1, 3) ...
% 170.39/169.50 Invoking SAT solver...
% 300.06/297.72 /export/starexec/sandbox/solver/lib/scripts/run-polyml-5.5.2: line 82: 46894 CPU time limit exceeded (core dumped) "$ISABELLE_HOME/lib/scripts/feeder" -p -h "$MLTEXT" -t "$MLEXIT" $FEEDER_OPTS
% 300.06/297.72 46895 (core dumped) | { read FPID; "$POLY" -q -i $ML_OPTIONS; RC="$?"; kill -TERM "$FPID"; exit "$RC"; }
% 300.06/297.73 /export/starexec/sandbox/solver/src/HOL/TPTP/lib/Tools/tptp_refute: line 26: 46840 Exit 152 "$ISABELLE_PROCESS" -q -e "use_thy \"/tmp/$SCRATCH\"; exit 1;" HOL-TPTP
% 300.06/297.73 46841 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.$"
%------------------------------------------------------------------------------