TSTP Solution File: MGT031-1 by Refute---2015

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Refute---2015
% Problem  : MGT031-1 : TPTP v6.4.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : isabelle tptp_refute %d %s

% Computer : n137.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 : Tue Apr 12 17:35:05 EDT 2016

% Result   : Timeout 300.01s
% 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  : MGT031-1 : TPTP v6.4.0. Released v2.4.0.
% 0.02/0.04  % Command  : isabelle tptp_refute %d %s
% 0.03/0.23  % Computer : n137.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 : Mon Apr 11 00:21:24 CDT 2016
% 0.03/0.23  % CPUTime  : 
% 6.31/5.84  > val it = (): unit
% 6.51/6.05  Trying to find a model that refutes: True
% 7.02/6.51  Unfolded term: [| ~ bnd_appear bnd_an_organisation bnd_sk2 =
% 7.02/6.51       bnd_appear bnd_first_movers bnd_sk2;
% 7.02/6.51     bnd_in_environment bnd_sk2 (bnd_appear bnd_an_organisation bnd_sk2);
% 7.02/6.51     bnd_environment bnd_sk2;
% 7.02/6.51     !!A. ~ bnd_environment A |
% 7.02/6.51          bnd_greater (bnd_appear bnd_efficient_producers bnd_e)
% 7.02/6.51           (bnd_appear bnd_first_movers A);
% 7.02/6.51     !!A B C.
% 7.02/6.51        (((~ bnd_environment A | ~ bnd_subpopulation B A C) |
% 7.02/6.51          ~ bnd_greater (bnd_cardinality_at_time B C) bnd_zero) |
% 7.02/6.51         B = bnd_efficient_producers) |
% 7.02/6.51        B = bnd_first_movers;
% 7.02/6.51     !!A B. ~ A = B | bnd_greater_or_equal A B;
% 7.02/6.51     !!A B. ~ bnd_greater A B | bnd_greater_or_equal A B;
% 7.02/6.51     !!A B. (~ bnd_greater_or_equal A B | bnd_greater A B) | A = B;
% 7.02/6.51     !!A B C. (~ bnd_greater A B | ~ bnd_greater B C) | bnd_greater A C;
% 7.02/6.51     !!A. ~ bnd_environment A |
% 7.02/6.51          bnd_greater_or_equal (bnd_appear bnd_first_movers A)
% 7.02/6.51           (bnd_appear bnd_an_organisation A);
% 7.02/6.51     !!A B.
% 7.02/6.51        ((~ bnd_environment A | ~ bnd_in_environment A B) |
% 7.02/6.51         ~ bnd_greater (bnd_appear bnd_first_movers A) B) |
% 7.02/6.51        ~ bnd_greater (bnd_cardinality_at_time bnd_first_movers B) bnd_zero;
% 7.02/6.51     !!A B.
% 7.02/6.51        ((~ bnd_environment A | ~ bnd_in_environment A B) |
% 7.02/6.51         ~ bnd_greater (bnd_appear bnd_efficient_producers A) B) |
% 7.02/6.51        ~ bnd_greater (bnd_cardinality_at_time bnd_efficient_producers B)
% 7.02/6.51           bnd_zero;
% 7.02/6.51     !!A B.
% 7.02/6.51        (~ bnd_environment A |
% 7.02/6.51         ~ bnd_greater (bnd_number_of_organizations A B) bnd_zero) |
% 7.02/6.51        bnd_greater (bnd_cardinality_at_time (bnd_sk1 B A) B) bnd_zero;
% 7.02/6.51     !!A B.
% 7.02/6.51        (~ bnd_environment A |
% 7.02/6.51         ~ bnd_greater (bnd_number_of_organizations A B) bnd_zero) |
% 7.02/6.51        bnd_subpopulation (bnd_sk1 B A) A B;
% 7.02/6.51     !!A. ~ bnd_environment A |
% 7.02/6.51          bnd_greater
% 7.02/6.51           (bnd_number_of_organizations bnd_e
% 7.02/6.51             (bnd_appear bnd_an_organisation A))
% 7.02/6.51           bnd_zero |]
% 7.02/6.51  ==> True
% 7.02/6.51  Adding axioms...
% 7.02/6.52  Typedef.type_definition_def
% 8.91/8.49   ...done.
% 8.91/8.49  Ground types: ?'b, TPTP_Interpret.ind
% 8.91/8.49  Translating term (sizes: 1, 1) ...
% 10.62/10.12  Invoking SAT solver...
% 10.62/10.12  No model exists.
% 10.62/10.12  Translating term (sizes: 2, 1) ...
% 13.02/12.52  Invoking SAT solver...
% 13.02/12.52  No model exists.
% 13.02/12.52  Translating term (sizes: 1, 2) ...
% 18.33/17.86  Invoking SAT solver...
% 18.33/17.86  No model exists.
% 18.33/17.86  Translating term (sizes: 3, 1) ...
% 23.03/22.59  Invoking SAT solver...
% 23.03/22.59  No model exists.
% 23.03/22.59  Translating term (sizes: 2, 2) ...
% 36.16/35.67  Invoking SAT solver...
% 36.16/35.67  No model exists.
% 36.16/35.67  Translating term (sizes: 1, 3) ...
% 48.69/48.16  Invoking SAT solver...
% 48.69/48.16  No model exists.
% 48.69/48.16  Translating term (sizes: 4, 1) ...
% 60.61/60.07  Invoking SAT solver...
% 60.61/60.07  No model exists.
% 60.61/60.07  Translating term (sizes: 3, 2) ...
% 153.53/152.64  Invoking SAT solver...
% 153.53/152.64  No model exists.
% 153.53/152.64  Translating term (sizes: 2, 3) ...
% 207.10/205.91  Invoking SAT solver...
% 207.10/205.91  No model exists.
% 207.10/205.91  Translating term (sizes: 1, 4) ...
% 231.67/230.39  Invoking SAT solver...
% 231.67/230.39  No model exists.
% 231.67/230.39  Translating term (sizes: 5, 1) ...
% 263.50/261.95  Invoking SAT solver...
% 263.50/261.95  No model exists.
% 263.50/261.95  Translating term (sizes: 4, 2) ...
% 300.01/298.13  /export/starexec/sandbox2/solver/lib/scripts/run-polyml-5.5.2: line 82:  6041 CPU time limit exceeded (core dumped) "$ISABELLE_HOME/lib/scripts/feeder" -p -h "$MLTEXT" -t "$MLEXIT" $FEEDER_OPTS
% 300.01/298.13        6042                       (core dumped) | { read FPID; "$POLY" -q -i $ML_OPTIONS; RC="$?"; kill -TERM "$FPID"; exit "$RC"; }
% 300.01/298.14  /export/starexec/sandbox2/solver/src/HOL/TPTP/lib/Tools/tptp_refute: line 26:  5987 Exit 152                "$ISABELLE_PROCESS" -q -e "use_thy \"/tmp/$SCRATCH\"; exit 1;" HOL-TPTP
% 300.01/298.14        5988 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.$"
%------------------------------------------------------------------------------