TSTP Solution File: MGT027-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : MGT027-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 : art10.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/MGT027-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: neq
% detected subclass: medium
%
% strategies selected:
% (hyper 25 #f 3 9)
% (binary-unit 9 #f 3 9)
% (binary-double 9 #f 3 9)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 3 9)
% (binary-order 25 #f 3 9)
% (binary-posweight-order 101 #f)
% (binary-posweight-lex-big-order 25 #f)
% (binary-posweight-lex-small-order 9 #f)
% (binary-order-sos 50 #t)
% (binary-unit-uniteq 25 #f)
% (binary-weightorder 50 #f)
% (binary-order 50 #f)
% (hyper-order 30 #f)
% (binary 112 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(17,40,0,34,0,0,159,50,0,176,0,0,532,50,2,549,0,2,1060,50,4,1077,0,4,1752,50,8,1769,0,8,2606,50,14,2623,0,14,3505,50,21,3522,0,21,4404,50,30,4421,0,30,5303,50,39,5320,0,39,6202,50,45,6219,0,45,7101,50,51,7118,0,51,8000,50,58,8017,0,58,8899,50,65,8916,0,65,9798,50,72,9815,0,72,10697,50,80,10714,0,80,11596,50,87,11613,0,87,12495,50,95,12512,0,95,13394,50,103,13411,0,103,14293,50,112,14310,0,112,15192,50,121,15192,40,121,15209,0,121,15321,50,121,15338,0,121)
%
%
% START OF PROOF
% 14549 [?] ?
% 15263 [?] ?
% 15322 [] equal(X,X).
% 15323 [] greater(cardinality_at_time(first_movers,sk1(X,Y)),zero) | contracts_from(X,first_movers) | -in_environment(Y,X) | -stable(Y) | -environment(Y).
% 15324 [] greater_or_equal(sk1(X,Y),X) | contracts_from(X,first_movers) | -in_environment(Y,X) | -stable(Y) | -environment(Y).
% 15325 [] -greater(zero,growth_rate(first_movers,sk1(X,Y))) | contracts_from(X,first_movers) | -in_environment(Y,X) | -stable(Y) | -environment(Y).
% 15326 [] -greater(cardinality_at_time(efficient_producers,X),zero) | -greater(cardinality_at_time(first_movers,X),zero) | subpopulations(first_movers,efficient_producers,Y,X) | -in_environment(Y,X) | -environment(Y).
% 15327 [] -greater(X,Y) | -in_environment(Z,Y) | in_environment(Z,X) | -stable(Z) | -environment(Z).
% 15328 [] in_environment(X,appear(efficient_producers,X)) | -stable(X) | -environment(X).
% 15329 [] -greater(Y,Z) | -greater(X,Y) | greater(X,Z).
% 15330 [] -greater_or_equal(X,Y) | greater(X,Y) | equal(X,Y).
% 15331 [] -greater(X,Y) | greater_or_equal(X,Y).
% 15332 [] -equal(X,Y) | greater_or_equal(X,Y).
% 15333 [] greater(cardinality_at_time(efficient_producers,X),zero) | -greater_or_equal(X,appear(efficient_producers,Y)) | -in_environment(Y,X) | -environment(Y).
% 15334 [] greater(sk2(X),appear(efficient_producers,X)) | -stable(X) | -environment(X).
% 15335 [] greater(zero,growth_rate(first_movers,X)) | -greater_or_equal(X,sk2(Y)) | -subpopulations(first_movers,efficient_producers,Y,X) | -stable(Y) | -environment(Y).
% 15336 [] environment(sk3).
% 15337 [] stable(sk3).
% 15338 [] -greater(X,appear(efficient_producers,sk3)) | -contracts_from(X,first_movers).
% 15341 [binary:15322,15332] greater_or_equal(X,X).
% 15343 [binary:15336,15333.4] -greater_or_equal(X,appear(efficient_producers,sk3)) | greater(cardinality_at_time(efficient_producers,X),zero) | -in_environment(sk3,X).
% 15349 [binary:15336,15334.3,cut:15337] greater(sk2(sk3),appear(efficient_producers,sk3)).
% 15351 [binary:15336,15335.5,cut:15337] greater(zero,growth_rate(first_movers,X)) | -greater_or_equal(X,sk2(sk3)) | -subpopulations(first_movers,efficient_producers,sk3,X).
% 15353 [binary:15331,15349] greater_or_equal(sk2(sk3),appear(efficient_producers,sk3)).
% 15354 [binary:15338,15349] -contracts_from(sk2(sk3),first_movers).
% 15355 [binary:15329,15349] greater(X,appear(efficient_producers,sk3)) | -greater(X,sk2(sk3)).
% 15357 [binary:15333.2,15353,cut:15263,cut:15336] greater(cardinality_at_time(efficient_producers,sk2(sk3)),zero).
% 15365 [binary:15336,15328.3,cut:15337] in_environment(sk3,appear(efficient_producers,sk3)).
% 15373 [binary:15336,15324.5,cut:15337] greater_or_equal(sk1(X,sk3),X) | -in_environment(sk3,X) | contracts_from(X,first_movers).
% 15386 [binary:15354,15373.3,cut:15263] greater_or_equal(sk1(sk2(sk3),sk3),sk2(sk3)).
% 15387 [binary:15330,15386] greater(sk1(sk2(sk3),sk3),sk2(sk3)) | equal(sk1(sk2(sk3),sk3),sk2(sk3)).
% 15394 [binary:15365,15327.2,cut:15337,cut:15336] -greater(X,appear(efficient_producers,sk3)) | in_environment(sk3,X).
% 15397 [binary:15349,15394] in_environment(sk3,sk2(sk3)).
% 15403 [binary:15323.3,15397,cut:15354,cut:15337,cut:15336] greater(cardinality_at_time(first_movers,sk1(sk2(sk3),sk3)),zero).
% 15404 [binary:15325.3,15397,cut:15354,cut:15337,cut:15336] -greater(zero,growth_rate(first_movers,sk1(sk2(sk3),sk3))).
% 15405 [binary:15327.2,15397,cut:15337,cut:15336] -greater(X,sk2(sk3)) | in_environment(sk3,X).
% 15406 [binary:15326.4,15397,cut:14549,cut:15357,cut:15336] subpopulations(first_movers,efficient_producers,sk3,sk2(sk3)).
% 15407 [binary:15335.3,15406,cut:15341,cut:15337,cut:15336] greater(zero,growth_rate(first_movers,sk2(sk3))).
% 15416 [binary:15386,15351.2,cut:15404] -subpopulations(first_movers,efficient_producers,sk3,sk1(sk2(sk3),sk3)).
% 15485 [para:15387.2.1,15404.1.2.2,cut:15407] greater(sk1(sk2(sk3),sk3),sk2(sk3)).
% 15488 [binary:15355.2,15485] greater(sk1(sk2(sk3),sk3),appear(efficient_producers,sk3)).
% 15490 [binary:15405,15485] in_environment(sk3,sk1(sk2(sk3),sk3)).
% 15494 [binary:15326.4,15490,cut:15416,cut:15403,cut:15336] -greater(cardinality_at_time(efficient_producers,sk1(sk2(sk3),sk3)),zero).
% 15495 [binary:15331,15488] greater_or_equal(sk1(sk2(sk3),sk3),appear(efficient_producers,sk3)).
% 15507 [binary:15343.2,15494,cut:15495,cut:15490] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using unit strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% clause length limited to 9
% clause depth limited to 4
% seconds given: 9
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 2508
% derived clauses: 27892
% kept clauses: 2587
% kept size sum: 102146
% kept mid-nuclei: 10534
% kept new demods: 18
% forw unit-subs: 1709
% forw double-subs: 3203
% forw overdouble-subs: 7827
% backward subs: 733
% fast unit cutoff: 3051
% full unit cutoff: 0
% dbl unit cutoff: 90
% real runtime : 1.22
% process. runtime: 1.22
% specific non-discr-tree subsumption statistics:
% tried: 13598
% length fails: 0
% strength fails: 783
% predlist fails: 4446
% aux str. fails: 0
% by-lit fails: 542
% full subs tried: 10
% 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/MGT027-1+eq_r.in")
%
%------------------------------------------------------------------------------