TSTP Solution File: SEV439+1 by Refute---2015
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Refute---2015
% Problem : SEV439+1 : TPTP v6.4.0. Released v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : isabelle tptp_refute %d %s
% Computer : n130.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.08s
% 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 : SEV439+1 : TPTP v6.4.0. Released v6.4.0.
% 0.00/0.04 % Command : isabelle tptp_refute %d %s
% 0.03/0.23 % Computer : n130.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:09 CDT 2016
% 0.03/0.23 % CPUTime :
% 6.24/5.88 > val it = (): unit
% 6.55/6.10 Trying to find a model that refutes: True
% 6.96/6.55 Unfolded term: [| ALL A X.
% 6.96/6.55 bnd_member X (bnd_suc A) =
% 6.96/6.55 bnd_member X (bnd_union A (bnd_singleton A));
% 6.96/6.55 ALL X R A Y.
% 6.96/6.55 bnd_member Y (bnd_initial_segment X R A) =
% 6.96/6.55 (bnd_member Y A & bnd_apply R Y X);
% 6.96/6.55 ALL X. bnd_set X --> (ALL Y. bnd_member Y X --> bnd_set Y);
% 6.96/6.55 ALL R E.
% 6.96/6.55 bnd_strict_order R E =
% 6.96/6.55 ((ALL X Y.
% 6.96/6.55 bnd_member X E & bnd_member Y E -->
% 6.96/6.55 ~ (bnd_apply R X Y & bnd_apply R Y X)) &
% 6.96/6.55 (ALL X Y Z.
% 6.96/6.55 (bnd_member X E & bnd_member Y E) & bnd_member Z E -->
% 6.96/6.55 bnd_apply R X Y & bnd_apply R Y Z --> bnd_apply R X Z));
% 6.96/6.55 ALL X Y. bnd_apply bnd_member_predicate X Y = bnd_member X Y;
% 6.96/6.55 ALL R E M.
% 6.96/6.55 bnd_least M R E =
% 6.96/6.55 (bnd_member M E &
% 6.96/6.55 (ALL X. bnd_member X E --> M = X | bnd_apply R M X));
% 6.96/6.55 ALL R E.
% 6.96/6.55 bnd_strict_well_order R E =
% 6.96/6.55 (bnd_strict_order R E &
% 6.96/6.55 (ALL A.
% 6.96/6.55 bnd_subset A E & (EX X. bnd_member X A) -->
% 6.96/6.55 (EX Y. bnd_least Y R A)));
% 6.96/6.55 ALL A.
% 6.96/6.55 bnd_member A bnd_on =
% 6.96/6.55 ((bnd_set A & bnd_strict_well_order bnd_member_predicate A) &
% 6.96/6.55 (ALL X. bnd_member X A --> bnd_subset X A));
% 6.96/6.55 ALL X A.
% 6.96/6.55 bnd_member X (bnd_product A) =
% 6.96/6.55 (ALL Y. bnd_member Y A --> bnd_member X Y);
% 6.96/6.55 ALL X A.
% 6.96/6.55 bnd_member X (bnd_sum A) = (EX Y. bnd_member Y A & bnd_member X Y);
% 6.96/6.55 ALL X A B. bnd_member X (bnd_unordered_pair A B) = (X = A | X = B);
% 6.96/6.55 ALL X A. bnd_member X (bnd_singleton A) = (X = A);
% 6.96/6.55 ALL B A E.
% 6.96/6.55 bnd_member B (bnd_difference E A) =
% 6.96/6.55 (bnd_member B E & ~ bnd_member B A);
% 6.96/6.55 ALL X. ~ bnd_member X bnd_empty_set;
% 6.96/6.55 ALL X A B.
% 6.96/6.55 bnd_member X (bnd_union A B) = (bnd_member X A | bnd_member X B);
% 6.96/6.55 ALL X A B.
% 6.96/6.55 bnd_member X (bnd_intersection A B) =
% 6.96/6.55 (bnd_member X A & bnd_member X B);
% 6.96/6.55 ALL X A. bnd_member X (bnd_power_set A) = bnd_subset X A;
% 6.96/6.55 ALL A B. bnd_equal_set A B = (bnd_subset A B & bnd_subset B A);
% 6.96/6.55 ALL A B. bnd_subset A B = (ALL X. bnd_member X A --> bnd_member X B) |]
% 6.96/6.55 ==> True
% 6.96/6.55 Adding axioms...
% 6.96/6.56 Typedef.type_definition_def
% 9.65/9.29 ...done.
% 9.74/9.30 Ground types: ?'b, TPTP_Interpret.ind
% 9.74/9.30 Translating term (sizes: 1, 1) ...
% 11.65/11.28 Invoking SAT solver...
% 11.65/11.28 No model exists.
% 11.65/11.28 Translating term (sizes: 2, 1) ...
% 14.36/13.93 Invoking SAT solver...
% 14.36/13.93 No model exists.
% 14.36/13.93 Translating term (sizes: 1, 2) ...
% 27.28/26.83 Invoking SAT solver...
% 27.28/26.83 No model exists.
% 27.28/26.83 Translating term (sizes: 3, 1) ...
% 32.19/31.79 Invoking SAT solver...
% 32.19/31.79 No model exists.
% 32.19/31.79 Translating term (sizes: 2, 2) ...
% 52.84/52.38 Invoking SAT solver...
% 52.84/52.38 No model exists.
% 52.84/52.38 Translating term (sizes: 1, 3) ...
% 112.25/111.51 Invoking SAT solver...
% 112.25/111.51 No model exists.
% 112.25/111.51 Translating term (sizes: 4, 1) ...
% 124.30/123.58 Invoking SAT solver...
% 124.30/123.58 No model exists.
% 124.30/123.58 Translating term (sizes: 3, 2) ...
% 224.74/223.48 Invoking SAT solver...
% 224.74/223.48 No model exists.
% 224.74/223.48 Translating term (sizes: 2, 3) ...
% 300.08/298.13 /export/starexec/sandbox/solver/lib/scripts/run-polyml-5.5.2: line 82: 33012 CPU time limit exceeded (core dumped) "$ISABELLE_HOME/lib/scripts/feeder" -p -h "$MLTEXT" -t "$MLEXIT" $FEEDER_OPTS
% 300.08/298.13 33013 (core dumped) | { read FPID; "$POLY" -q -i $ML_OPTIONS; RC="$?"; kill -TERM "$FPID"; exit "$RC"; }
% 300.08/298.14 /export/starexec/sandbox/solver/src/HOL/TPTP/lib/Tools/tptp_refute: line 26: 32958 Exit 152 "$ISABELLE_PROCESS" -q -e "use_thy \"/tmp/$SCRATCH\"; exit 1;" HOL-TPTP
% 300.08/298.14 32959 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.$"
%------------------------------------------------------------------------------