TSTP Solution File: SEV438+1 by Refute---2015
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Refute---2015
% Problem : SEV438+1 : TPTP v6.4.0. Released v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : isabelle tptp_refute %d %s
% Computer : n157.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 04:28:46 EDT 2016
% Result : Timeout 300.03s
% 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 : SEV438+1 : TPTP v6.4.0. Released v6.4.0.
% 0.00/0.04 % Command : isabelle tptp_refute %d %s
% 0.03/0.23 % Computer : n157.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 11:58:23 CDT 2016
% 0.03/0.23 % CPUTime :
% 6.28/5.84 > val it = (): unit
% 6.47/6.07 Trying to find a model that refutes: True
% 6.99/6.57 Unfolded term: [| ALL A X R E.
% 6.99/6.57 bnd_greatest_lower_bound A X R E =
% 6.99/6.57 ((bnd_member A X & bnd_lower_bound A R X) &
% 6.99/6.57 (ALL M. bnd_member M E & bnd_lower_bound M R X --> bnd_apply R M A));
% 6.99/6.57 ALL A X R E.
% 6.99/6.57 bnd_least_upper_bound A X R E =
% 6.99/6.57 ((bnd_member A X & bnd_upper_bound A R X) &
% 6.99/6.57 (ALL M. bnd_member M E & bnd_upper_bound M R X --> bnd_apply R A M));
% 6.99/6.57 ALL R E M.
% 6.99/6.57 bnd_min M R E =
% 6.99/6.57 (bnd_member M E &
% 6.99/6.57 (ALL X. bnd_member X E & bnd_apply R X M --> M = X));
% 6.99/6.57 ALL R E M.
% 6.99/6.57 bnd_max M R E =
% 6.99/6.57 (bnd_member M E &
% 6.99/6.57 (ALL X. bnd_member X E & bnd_apply R M X --> M = X));
% 6.99/6.57 ALL R E M.
% 6.99/6.57 bnd_least M R E =
% 6.99/6.57 (bnd_member M E & (ALL X. bnd_member X E --> bnd_apply R M X));
% 6.99/6.57 ALL R E M.
% 6.99/6.57 bnd_greatest M R E =
% 6.99/6.57 (bnd_member M E & (ALL X. bnd_member X E --> bnd_apply R X M));
% 6.99/6.57 ALL R E M.
% 6.99/6.57 bnd_lower_bound M R E = (ALL X. bnd_member X E --> bnd_apply R M X);
% 6.99/6.57 ALL R E M.
% 6.99/6.57 bnd_upper_bound M R E = (ALL X. bnd_member X E --> bnd_apply R X M);
% 6.99/6.57 ALL R E.
% 6.99/6.57 bnd_total_order R E =
% 6.99/6.57 (bnd_order R E &
% 6.99/6.57 (ALL X Y.
% 6.99/6.57 bnd_member X E & bnd_member Y E -->
% 6.99/6.57 bnd_apply R X Y | bnd_apply R Y X));
% 6.99/6.57 ALL R E.
% 6.99/6.57 bnd_order R E =
% 6.99/6.57 (((ALL X. bnd_member X E --> bnd_apply R X X) &
% 6.99/6.57 (ALL X Y.
% 6.99/6.57 bnd_member X E & bnd_member Y E -->
% 6.99/6.57 bnd_apply R X Y & bnd_apply R Y X --> X = Y)) &
% 6.99/6.57 (ALL X Y Z.
% 6.99/6.57 (bnd_member X E & bnd_member Y E) & bnd_member Z E -->
% 6.99/6.57 bnd_apply R X Y & bnd_apply R Y Z --> bnd_apply R X Z));
% 6.99/6.57 ALL X A.
% 6.99/6.57 bnd_member X (bnd_product A) =
% 6.99/6.57 (ALL Y. bnd_member Y A --> bnd_member X Y);
% 6.99/6.57 ALL X A.
% 6.99/6.57 bnd_member X (bnd_sum A) = (EX Y. bnd_member Y A & bnd_member X Y);
% 6.99/6.57 ALL X A B. bnd_member X (bnd_unordered_pair A B) = (X = A | X = B);
% 6.99/6.57 ALL X A. bnd_member X (bnd_singleton A) = (X = A);
% 6.99/6.57 ALL B A E.
% 6.99/6.57 bnd_member B (bnd_difference E A) =
% 6.99/6.57 (bnd_member B E & ~ bnd_member B A);
% 6.99/6.57 ALL X. ~ bnd_member X bnd_empty_set;
% 6.99/6.57 ALL X A B.
% 6.99/6.57 bnd_member X (bnd_union A B) = (bnd_member X A | bnd_member X B);
% 6.99/6.57 ALL X A B.
% 6.99/6.57 bnd_member X (bnd_intersection A B) =
% 6.99/6.57 (bnd_member X A & bnd_member X B);
% 6.99/6.57 ALL X A. bnd_member X (bnd_power_set A) = bnd_subset X A;
% 6.99/6.57 ALL A B. bnd_equal_set A B = (bnd_subset A B & bnd_subset B A);
% 6.99/6.57 ALL A B. bnd_subset A B = (ALL X. bnd_member X A --> bnd_member X B) |]
% 6.99/6.57 ==> True
% 6.99/6.57 Adding axioms...
% 6.99/6.58 Typedef.type_definition_def
% 10.49/10.07 ...done.
% 10.49/10.08 Ground types: ?'b, TPTP_Interpret.ind
% 10.49/10.08 Translating term (sizes: 1, 1) ...
% 12.88/12.45 Invoking SAT solver...
% 12.88/12.45 No model exists.
% 12.88/12.45 Translating term (sizes: 2, 1) ...
% 15.98/15.51 Invoking SAT solver...
% 15.98/15.51 No model exists.
% 15.98/15.51 Translating term (sizes: 1, 2) ...
% 37.72/37.26 Invoking SAT solver...
% 37.72/37.26 No model exists.
% 37.72/37.26 Translating term (sizes: 3, 1) ...
% 43.23/42.71 Invoking SAT solver...
% 43.23/42.71 No model exists.
% 43.23/42.71 Translating term (sizes: 2, 2) ...
% 72.61/72.08 Invoking SAT solver...
% 72.61/72.08 No model exists.
% 72.61/72.08 Translating term (sizes: 1, 3) ...
% 185.02/183.90 Invoking SAT solver...
% 185.02/183.90 No model exists.
% 185.02/183.90 Translating term (sizes: 4, 1) ...
% 197.71/196.51 Invoking SAT solver...
% 197.71/196.51 No model exists.
% 197.71/196.51 Translating term (sizes: 3, 2) ...
% 300.03/297.92 /export/starexec/sandbox2/solver/lib/scripts/run-polyml-5.5.2: line 82: 21706 CPU time limit exceeded (core dumped) "$ISABELLE_HOME/lib/scripts/feeder" -p -h "$MLTEXT" -t "$MLEXIT" $FEEDER_OPTS
% 300.03/297.92 21707 (core dumped) | { read FPID; "$POLY" -q -i $ML_OPTIONS; RC="$?"; kill -TERM "$FPID"; exit "$RC"; }
% 300.03/297.93 /export/starexec/sandbox2/solver/src/HOL/TPTP/lib/Tools/tptp_refute: line 26: 21652 Exit 152 "$ISABELLE_PROCESS" -q -e "use_thy \"/tmp/$SCRATCH\"; exit 1;" HOL-TPTP
% 300.03/297.93 21653 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.$"
%------------------------------------------------------------------------------