TSTP Solution File: SEV440^1 by Refute---2015
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Refute---2015
% Problem : SEV440^1 : TPTP v6.4.0. Released v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : isabelle tptp_refute %d %s
% Computer : n050.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.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 : SEV440^1 : TPTP v6.4.0. Released v6.4.0.
% 0.00/0.04 % Command : isabelle tptp_refute %d %s
% 0.03/0.23 % Computer : n050.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:59:18 CDT 2016
% 0.03/0.23 % CPUTime :
% 6.30/5.84 > val it = (): unit
% 6.60/6.11 Trying to find a model that refutes: True
% 6.90/6.43 Unfolded term: [| bnd_upwards_well_founded =
% 6.90/6.43 (%R. ALL X Z. X Z --> (EX Y. X Y & (ALL W. R Y Y --> ~ X W)));
% 6.90/6.43 bnd_well_founded =
% 6.90/6.43 (%R. ALL X Z. X Z --> (EX Y. X Y & (ALL W. R Y W --> ~ X W)));
% 6.90/6.43 bnd_rel_field = (%R X. bnd_rel_domain R X | bnd_rel_codomain R X);
% 6.90/6.43 bnd_restrict_rel_codomain = (%R S X Y. S Y & R X Y);
% 6.90/6.43 bnd_equiv_classes = (%R S1. EX X. S1 X & (ALL Y. S1 Y = R X Y));
% 6.90/6.43 bnd_rel_inverse = (%R X Y. R Y X); bnd_rel_domain = (%R X. Ex (R X));
% 6.90/6.43 bnd_rel_codomain = (%R Y. EX X. R X Y);
% 6.90/6.43 bnd_equiv_rel =
% 6.90/6.43 (%R. (bnd_reflexive R & bnd_symmetric R) & bnd_transitive R);
% 6.90/6.43 bnd_transitive = (%R. ALL X Y Z. R X Y & R Y Z --> R X Z);
% 6.90/6.43 bnd_symmetric = (%R. ALL X Y. R X Y --> R Y X);
% 6.90/6.43 bnd_irreflexive = (%R. ALL X. ~ R X X);
% 6.90/6.43 bnd_reflexive = (%R. ALL X. R X X);
% 6.90/6.43 bnd_rel_composition = (%R1 R2 X Z. EX Y. R1 X Y & R2 Y Z);
% 6.90/6.43 bnd_rel_diagonal = op =;
% 6.90/6.43 bnd_restrict_rel_domain = (%R S X Y. S X & R X Y);
% 6.90/6.43 bnd_is_rel_on = (%R A B. ALL X Y. R X Y --> A X & B Y);
% 6.90/6.43 bnd_sub_rel = (%R1 R2. ALL X Y. R1 X Y --> R2 X Y);
% 6.90/6.43 bnd_id_rel = (%S X Y. S X & X = Y);
% 6.90/6.43 bnd_pair_rel = (%X Y U V. U = X | V = Y);
% 6.90/6.43 bnd_cartesian_product = (%X Y U V. X U & Y V);
% 6.90/6.43 bnd_fun_increasing =
% 6.90/6.43 (%F SMALLER. ALL X Y. SMALLER X Y --> SMALLER (F X) (F Y));
% 6.90/6.43 bnd_fun_decreasing =
% 6.90/6.43 (%F SMALLER. ALL X Y. SMALLER X Y --> SMALLER (F Y) (F X));
% 6.90/6.43 bnd_fun_bijective = (%F. bnd_fun_injective F & bnd_fun_surjective F);
% 6.90/6.43 bnd_fun_surjective = (%F. ALL Y. EX X. Y = F X);
% 6.90/6.43 bnd_fun_injective = (%F. ALL X Y. F X = F Y --> X = Y);
% 6.90/6.43 bnd_fun_inv_image = (%F B X. EX Y. B Y & Y = F X);
% 6.90/6.43 bnd_fun_composition = (%F G X. G (F X));
% 6.90/6.43 bnd_fun_image = (%F A Y. EX X. A X & Y = F X);
% 6.90/6.43 bnd_misses = (%X Y. ~ (EX U. X U & Y U));
% 6.90/6.43 bnd_meets = (%X Y. EX U. X U & Y U);
% 6.90/6.43 bnd_subset = (%X Y. ALL U. X U --> Y U);
% 6.90/6.43 bnd_disjoint = (%X Y. bnd_intersection X Y = bnd_emptyset);
% 6.90/6.43 bnd_complement = (%X U. ~ X U); bnd_setminus = (%X Y U. X U & ~ Y U);
% 6.90/6.43 bnd_intersection = (%X Y U. X U & Y U);
% 6.90/6.43 bnd_excl_union = (%X Y U. X U & ~ Y U | ~ X U & Y U);
% 6.90/6.43 bnd_union = (%X Y U. X U | Y U); bnd_singleton = (%X U. U = X);
% 6.90/6.43 bnd_unord_pair = (%X Y U. U = X | U = Y); bnd_emptyset = (%X. False);
% 6.90/6.43 bnd_is_a = (%X M. M X); bnd_in = (%X M. M X) |]
% 6.90/6.43 ==> True
% 6.90/6.43 Adding axioms...
% 6.90/6.43 Typedef.type_definition_def
% 12.21/11.75 ...done.
% 12.21/11.76 Ground types: ?'b, TPTP_Interpret.ind
% 12.21/11.76 Translating term (sizes: 1, 1) ...
% 14.91/14.44 Invoking SAT solver...
% 14.91/14.44 No model exists.
% 14.91/14.44 Translating term (sizes: 2, 1) ...
% 18.32/17.83 Invoking SAT solver...
% 18.32/17.83 No model exists.
% 18.32/17.83 Translating term (sizes: 1, 2) ...
% 88.83/88.11 Invoking SAT solver...
% 88.83/88.11 No model exists.
% 88.83/88.11 Translating term (sizes: 3, 1) ...
% 94.56/93.86 Invoking SAT solver...
% 94.56/93.86 No model exists.
% 94.56/93.86 Translating term (sizes: 2, 2) ...
% 173.00/171.86 Invoking SAT solver...
% 173.00/171.86 No model exists.
% 173.00/171.86 Translating term (sizes: 1, 3) ...
% 300.04/297.72 /export/starexec/sandbox2/solver/lib/scripts/run-polyml-5.5.2: line 82: 32013 CPU time limit exceeded (core dumped) "$ISABELLE_HOME/lib/scripts/feeder" -p -h "$MLTEXT" -t "$MLEXIT" $FEEDER_OPTS
% 300.04/297.72 32014 (core dumped) | { read FPID; "$POLY" -q -i $ML_OPTIONS; RC="$?"; kill -TERM "$FPID"; exit "$RC"; }
% 300.04/297.73 /export/starexec/sandbox2/solver/src/HOL/TPTP/lib/Tools/tptp_refute: line 26: 31959 Exit 152 "$ISABELLE_PROCESS" -q -e "use_thy \"/tmp/$SCRATCH\"; exit 1;" HOL-TPTP
% 300.04/297.73 31960 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.$"
%------------------------------------------------------------------------------