TSTP Solution File: SET784+1 by Refute---2015
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Refute---2015
% Problem : SET784+1 : TPTP v6.4.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : isabelle tptp_refute %d %s
% Computer : n057.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:11:05 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 : SET784+1 : TPTP v6.4.0. Released v2.5.0.
% 0.00/0.04 % Command : isabelle tptp_refute %d %s
% 0.03/0.23 % Computer : n057.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 : 32218.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 : Fri Apr 8 01:56:54 CDT 2016
% 0.03/0.24 % CPUTime :
% 6.34/6.64 > val it = (): unit
% 6.52/6.89 Trying to find a model that refutes: True
% 7.33/7.61 Unfolded term: [| ALL F A R B S.
% 7.33/7.61 bnd_isomorphism F A R B S =
% 7.33/7.61 ((bnd_maps F A B & bnd_one_to_one F A B) &
% 7.33/7.61 (ALL X1 Y1 X2 Y2.
% 7.33/7.61 ((((bnd_member X1 A & bnd_member Y1 B) & bnd_member X2 A) &
% 7.33/7.61 bnd_member Y2 B) &
% 7.33/7.61 bnd_apply F X1 Y1) &
% 7.33/7.61 bnd_apply F X2 Y2 -->
% 7.33/7.61 bnd_apply R X1 X2 = bnd_apply S Y1 Y2));
% 7.33/7.61 ALL F A R B S.
% 7.33/7.61 bnd_decreasing F A R B S =
% 7.33/7.61 (ALL X1 Y1 X2 Y2.
% 7.33/7.61 (((((bnd_member X1 A & bnd_member Y1 B) & bnd_member X2 A) &
% 7.33/7.61 bnd_member Y2 B) &
% 7.33/7.61 bnd_apply R X1 X2) &
% 7.33/7.61 bnd_apply F X1 Y1) &
% 7.33/7.61 bnd_apply F X2 Y2 -->
% 7.33/7.61 bnd_apply S Y2 Y1);
% 7.33/7.61 ALL F A R B S.
% 7.33/7.61 bnd_increasing F A R B S =
% 7.33/7.61 (ALL X1 Y1 X2 Y2.
% 7.33/7.61 (((((bnd_member X1 A & bnd_member Y1 B) & bnd_member X2 A) &
% 7.33/7.61 bnd_member Y2 B) &
% 7.33/7.61 bnd_apply R X1 X2) &
% 7.33/7.61 bnd_apply F X1 Y1) &
% 7.33/7.61 bnd_apply F X2 Y2 -->
% 7.33/7.61 bnd_apply S Y1 Y2);
% 7.33/7.61 ALL F B A X.
% 7.33/7.61 bnd_member X (bnd_inverse_image3 F B A) =
% 7.33/7.61 (bnd_member X A & (EX Y. bnd_member Y B & bnd_apply F X Y));
% 7.33/7.61 ALL F B X.
% 7.33/7.61 bnd_member X (bnd_inverse_image2 F B) =
% 7.33/7.61 (EX Y. bnd_member Y B & bnd_apply F X Y);
% 7.33/7.61 ALL F A B Y.
% 7.33/7.61 bnd_member Y (bnd_image3 F A B) =
% 7.33/7.61 (bnd_member Y B & (EX X. bnd_member X A & bnd_apply F X Y));
% 7.33/7.61 ALL F A Y.
% 7.33/7.61 bnd_member Y (bnd_image2 F A) =
% 7.33/7.61 (EX X. bnd_member X A & bnd_apply F X Y);
% 7.33/7.61 ALL F A B X Y.
% 7.33/7.61 bnd_member X A & bnd_member Y B -->
% 7.33/7.61 bnd_apply F X Y = bnd_apply (bnd_inverse_function F A B) Y X;
% 7.33/7.61 ALL G F A B.
% 7.33/7.61 bnd_inverse_predicate G F A B =
% 7.33/7.61 (ALL X Y.
% 7.33/7.61 bnd_member X A & bnd_member Y B -->
% 7.33/7.61 bnd_apply F X Y = bnd_apply G Y X);
% 7.33/7.61 ALL F A B.
% 7.33/7.61 bnd_one_to_one F A B = (bnd_injective F A B & bnd_surjective F A B);
% 7.33/7.61 ALL F A B.
% 7.33/7.61 bnd_surjective F A B =
% 7.33/7.61 (ALL Y. bnd_member Y B --> (EX E. bnd_member E A & bnd_apply F E Y));
% 7.33/7.61 ALL F A B.
% 7.33/7.61 bnd_injective F A B =
% 7.33/7.61 (ALL X1 X2 Y.
% 7.33/7.61 (bnd_member X1 A & bnd_member X2 A) & bnd_member Y B -->
% 7.33/7.61 bnd_apply F X1 Y & bnd_apply F X2 Y --> X1 = X2);
% 7.33/7.61 ALL F A. bnd_identity F A = (ALL X. bnd_member X A --> bnd_apply F X X);
% 7.33/7.61 ALL F G A B.
% 7.33/7.61 bnd_equal_maps F G A B =
% 7.33/7.61 (ALL X Y1 Y2.
% 7.33/7.61 (bnd_member X A & bnd_member Y1 B) & bnd_member Y2 B -->
% 7.33/7.61 bnd_apply F X Y1 & bnd_apply G X Y2 --> Y1 = Y2);
% 7.33/7.61 ALL G F A B C X Z.
% 7.33/7.61 bnd_member X A & bnd_member Z C -->
% 7.33/7.61 bnd_apply (bnd_compose_function G F A B C) X Z =
% 7.33/7.61 (EX Y. (bnd_member Y B & bnd_apply F X Y) & bnd_apply G Y Z);
% 7.33/7.61 ALL H G F A B C.
% 7.33/7.61 bnd_compose_predicate H G F A B C =
% 7.33/7.61 (ALL X Z.
% 7.33/7.61 bnd_member X A & bnd_member Z C -->
% 7.33/7.61 bnd_apply H X Z =
% 7.33/7.61 (EX Y. (bnd_member Y B & bnd_apply F X Y) & bnd_apply G Y Z));
% 7.33/7.61 ALL F A B.
% 7.33/7.61 bnd_maps F A B =
% 7.33/7.61 ((ALL X.
% 7.33/7.61 bnd_member X A --> (EX Y. bnd_member Y B & bnd_apply F X Y)) &
% 7.33/7.61 (ALL X Y1 Y2.
% 7.33/7.61 (bnd_member X A & bnd_member Y1 B) & bnd_member Y2 B -->
% 7.33/7.61 bnd_apply F X Y1 & bnd_apply F X Y2 --> Y1 = Y2));
% 7.33/7.61 ALL X A.
% 7.33/7.61 bnd_member X (bnd_product A) =
% 7.33/7.61 (ALL Y. bnd_member Y A --> bnd_member X Y);
% 7.33/7.61 ALL X A.
% 7.33/7.61 bnd_member X (bnd_sum A) = (EX Y. bnd_member Y A & bnd_member X Y);
% 7.33/7.61 ALL X A B. bnd_member X (bnd_unordered_pair A B) = (X = A | X = B);
% 7.33/7.61 ALL X A. bnd_member X (bnd_singleton A) = (X = A);
% 7.33/7.61 ALL B A E.
% 7.33/7.61 bnd_member B (bnd_difference E A) =
% 7.33/7.61 (bnd_member B E & ~ bnd_member B A);
% 7.33/7.61 ALL X. ~ bnd_member X bnd_empty_set;
% 7.33/7.61 ALL X A B.
% 7.33/7.61 bnd_member X (bnd_union A B) = (bnd_member X A | bnd_member X B);
% 7.33/7.61 ALL X A B.
% 7.33/7.61 bnd_member X (bnd_intersection A B) =
% 7.33/7.61 (bnd_member X A & bnd_member X B);
% 7.33/7.61 ALL X A. bnd_member X (bnd_power_set A) = bnd_subset X A;
% 7.33/7.61 ALL A B. bnd_equal_set A B = (bnd_subset A B & bnd_subset B A);
% 7.33/7.61 ALL A B. bnd_subset A B = (ALL X. bnd_member X A --> bnd_member X B) |]
% 7.33/7.61 ==> True
% 7.33/7.61 Adding axioms...
% 7.33/7.62 Typedef.type_definition_def
% 13.13/13.41 ...done.
% 13.13/13.42 Ground types: ?'b, TPTP_Interpret.ind
% 13.13/13.42 Translating term (sizes: 1, 1) ...
% 16.64/16.99 Invoking SAT solver...
% 17.43/17.71 No model exists.
% 17.43/17.71 Translating term (sizes: 2, 1) ...
% 20.94/21.28 Invoking SAT solver...
% 20.94/21.28 No model exists.
% 20.94/21.28 Translating term (sizes: 1, 2) ...
% 300.02/298.62 /export/starexec/sandbox2/solver/lib/scripts/run-polyml-5.5.2: line 82: 37142 CPU time limit exceeded (core dumped) "$ISABELLE_HOME/lib/scripts/feeder" -p -h "$MLTEXT" -t "$MLEXIT" $FEEDER_OPTS
% 300.02/298.62 37143 (core dumped) | { read FPID; "$POLY" -q -i $ML_OPTIONS; RC="$?"; kill -TERM "$FPID"; exit "$RC"; }
% 300.02/298.63 /export/starexec/sandbox2/solver/src/HOL/TPTP/lib/Tools/tptp_refute: line 26: 37088 Exit 152 "$ISABELLE_PROCESS" -q -e "use_thy \"/tmp/$SCRATCH\"; exit 1;" HOL-TPTP
% 300.02/298.63 37089 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.$"
%------------------------------------------------------------------------------