TSTP Solution File: MGT028-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : MGT028-1 : TPTP v3.4.2. Released v2.4.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art07.cs.miami.edu
% Model : i686 unknown
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 1000MB
% OS : Linux 2.4.22-21mdk-i686-up-4GB
% CPULimit : 600s
% Result : Unsatisfiable 0.0s
% Output : Assurance 0.0s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----NO SOLUTION OUTPUT BY SYSTEM
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
%
% Gandalf c-2.6 r1 starting to prove: /home/graph/tptp/TSTP/PreparedTPTP/otter:hypothesis:set(auto),clear(print_given)---add_equality:r/MGT/MGT028-1+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: nne
% detected subclass: medium
%
% strategies selected:
% (hyper 27 #f 3 13)
% (binary-unit 10 #f 3 13)
% (binary-double 16 #f 3 13)
% (binary 54 #t 3 13)
% (binary-order 27 #f 3 13)
% (binary-posweight-order 125 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 27 #f)
% (binary-weightorder 54 #f)
% (binary-order 54 #f)
% (hyper-order 43 #f)
% (binary 109 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(14,40,0,28,0,0,71,50,0,85,0,0)
%
%
% START OF PROOF
% 73 [] greater(sk2(X),appear(efficient_producers,X)) | greater_or_equal(sk1(Y,X),Y) | -in_environment(X,Y) | -stable(X) | -environment(X).
% 74 [] subpopulations(first_movers,efficient_producers,X,sk1(Y,X)) | greater(zero,growth_rate(first_movers,Z)) | -greater_or_equal(Z,sk2(X)) | -subpopulations(first_movers,efficient_producers,X,Z) | -in_environment(X,Y) | -stable(X) | -environment(X).
% 75 [] greater(zero,growth_rate(first_movers,X)) | greater_or_equal(sk1(Y,Z),Y) | -greater_or_equal(X,sk2(Z)) | -subpopulations(first_movers,efficient_producers,Z,X) | -in_environment(Z,Y) | -stable(Z) | -environment(Z).
% 76 [] -greater(zero,growth_rate(first_movers,sk1(X,Y))) | greater(sk2(Y),appear(efficient_producers,Y)) | -in_environment(Y,X) | -stable(Y) | -environment(Y).
% 77 [] -greater(zero,growth_rate(first_movers,sk1(X,Y))) | greater(zero,growth_rate(first_movers,Z)) | -greater_or_equal(Z,sk2(Y)) | -subpopulations(first_movers,efficient_producers,Y,Z) | -in_environment(Y,X) | -stable(Y) | -environment(Y).
% 78 [] in_environment(X,sk3(X)) | -stable(X) | -environment(X).
% 80 [] greater(zero,growth_rate(first_movers,X)) | -greater_or_equal(X,sk3(Y)) | -subpopulations(first_movers,efficient_producers,Y,X) | -stable(Y) | -environment(Y).
% 81 [] environment(sk4).
% 82 [] stable(sk4).
% 83 [] subpopulations(first_movers,efficient_producers,sk4,sk5(X)) | -greater(X,appear(efficient_producers,sk4)).
% 84 [] -greater(X,appear(efficient_producers,sk4)) | greater_or_equal(sk5(X),X).
% 85 [] -greater(zero,growth_rate(first_movers,sk5(X))) | -greater(X,appear(efficient_producers,sk4)).
% 86 [hyper:78,81,cut:82] in_environment(sk4,sk3(sk4)).
% 103 [?] ?
% 104 [hyper:73,86,cut:82,cut:81] greater_or_equal(sk1(sk3(sk4),sk4),sk3(sk4)) | greater(sk2(sk4),appear(efficient_producers,sk4)).
% 118 [hyper:80,104,cut:82,cut:81,binarycut:103] greater(zero,growth_rate(first_movers,sk1(sk3(sk4),sk4))) | greater(sk2(sk4),appear(efficient_producers,sk4)).
% 119 [?] ?
% 120 [hyper:84,104] greater_or_equal(sk1(sk3(sk4),sk4),sk3(sk4)) | greater_or_equal(sk5(sk2(sk4)),sk2(sk4)).
% 131 [hyper:75,120,86,cut:82,cut:81,binarycut:119] greater(zero,growth_rate(first_movers,sk5(sk2(sk4)))) | greater_or_equal(sk1(sk3(sk4),sk4),sk3(sk4)).
% 144 [hyper:85,131,104] greater_or_equal(sk1(sk3(sk4),sk4),sk3(sk4)).
% 159 [hyper:76,118,cut:86,cut:82,cut:81] greater(sk2(sk4),appear(efficient_producers,sk4)).
% 161 [hyper:83,159] subpopulations(first_movers,efficient_producers,sk4,sk5(sk2(sk4))).
% 162 [hyper:84,159] greater_or_equal(sk5(sk2(sk4)),sk2(sk4)).
% 167 [hyper:74,162,86,cut:161,cut:82,cut:81] greater(zero,growth_rate(first_movers,sk5(sk2(sk4)))) | subpopulations(first_movers,efficient_producers,sk4,sk1(sk3(sk4),sk4)).
% 181 [hyper:85,167,cut:159] subpopulations(first_movers,efficient_producers,sk4,sk1(sk3(sk4),sk4)).
% 183 [hyper:80,181,cut:144,cut:82,cut:81] greater(zero,growth_rate(first_movers,sk1(sk3(sk4),sk4))).
% 188 [hyper:77,183,162,cut:86,cut:82,cut:81,cut:161] greater(zero,growth_rate(first_movers,sk5(sk2(sk4)))).
% 189 [hyper:85,188,cut:159] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 13
% clause depth limited to 4
% seconds given: 27
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 48
% derived clauses: 249
% kept clauses: 31
% kept size sum: 369
% kept mid-nuclei: 77
% kept new demods: 0
% forw unit-subs: 23
% forw double-subs: 21
% forw overdouble-subs: 0
% backward subs: 12
% fast unit cutoff: 94
% full unit cutoff: 0
% dbl unit cutoff: 4
% real runtime : 0.1
% process. runtime: 0.0
% specific non-discr-tree subsumption statistics:
% tried: 53
% length fails: 0
% strength fails: 32
% predlist fails: 21
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 0
% full subs fail: 0
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/home/graph/tptp/TSTP/PreparedTPTP/otter:hypothesis:set(auto),clear(print_given)---add_equality:r/MGT/MGT028-1+noeq.in")
%
%------------------------------------------------------------------------------