TSTP Solution File: MGT036-3 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : MGT036-3 : 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 : art06.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/MGT036-3+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: hne
% detected subclass: small
% detected subclass: long
%
% strategies selected:
% (hyper 57 #f 2 9)
% (binary-unit 28 #f 2 9)
% (binary-double 28 #f 2 9)
% (binary-posweight-order 28 #f 2 9)
% (binary-unit 62 #f)
% (hyper 159 #f)
% (binary-posweight-order 154 #f)
% (binary-weightorder 28 #f)
% (binary-order 28 #f)
% (binary 28 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(9,40,0,18,0,0)
%
%
% START OF PROOF
% 10 [] -subpopulations(X,Y,Z,U) | subpopulations(Y,X,Z,U) | -environment(Z).
% 11 [] -greater(zero,growth_rate(X,Y)) | -greater_or_equal(growth_rate(Z,Y),zero) | -subpopulations(X,Z,U,Y) | outcompetes(Z,X,Y) | -environment(U).
% 14 [] environment(sk1).
% 15 [] subpopulations(first_movers,efficient_producers,sk1,sk2).
% 16 [] greater_or_equal(growth_rate(first_movers,sk2),zero).
% 17 [] greater(zero,growth_rate(efficient_producers,sk2)).
% 18 [] -subpopulations(first_movers,efficient_producers,X,Y) | -outcompetes(first_movers,efficient_producers,Y) | -environment(X).
% 31 [hyper:10,15,cut:14] subpopulations(efficient_producers,first_movers,sk1,sk2).
% 32 [hyper:11,31,cut:16,cut:17,cut:14] outcompetes(first_movers,efficient_producers,sk2).
% 39 [hyper:18,32,15,cut:14] 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 9
% clause depth limited to 2
% seconds given: 57
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 7
% derived clauses: 27
% kept clauses: 2
% kept size sum: 9
% kept mid-nuclei: 17
% kept new demods: 0
% forw unit-subs: 6
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 8
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.1
% process. runtime: 0.1
% specific non-discr-tree subsumption statistics:
% tried: 6
% length fails: 0
% strength fails: 6
% predlist fails: 0
% 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/MGT036-3+noeq.in")
%
%------------------------------------------------------------------------------