TSTP Solution File: MGT023-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : MGT023-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 : art02.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/MGT023-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: neq
% detected subclass: small
%
% strategies selected:
% (hyper 27 #f 3 9)
% (binary-unit 10 #f 3 9)
% (binary-double 10 #f 3 9)
% (binary-double 16 #f)
% (binary-double 10 #t)
% (binary 16 #t 3 9)
% (binary-order 27 #f 3 9)
% (binary-posweight-order 125 #f)
% (binary-posweight-lex-big-order 43 #f)
% (binary-posweight-lex-small-order 16 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 54 #f)
% (binary-weightorder 65 #f)
% (binary-order 27 #f)
% (hyper-order 37 #f)
% (binary 63 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(10,40,0,20,0,0,42,50,0,52,0,0)
%
%
% START OF PROOF
% 44 [] subpopulations(first_movers,efficient_producers,X,sk1(Y,X)) | greater(growth_rate(efficient_producers,Y),growth_rate(first_movers,Y)) | equal(Y,critical_point(X)) | -in_environment(X,Y) | -environment(X).
% 45 [] greater(growth_rate(efficient_producers,X),growth_rate(first_movers,X)) | greater(sk1(X,Y),X) | equal(X,critical_point(Y)) | -in_environment(Y,X) | -environment(Y).
% 46 [] -greater(growth_rate(efficient_producers,sk1(X,Y)),growth_rate(first_movers,sk1(X,Y))) | greater(growth_rate(efficient_producers,X),growth_rate(first_movers,X)) | equal(X,critical_point(Y)) | -in_environment(Y,X) | -environment(Y).
% 47 [] in_environment(X,sk2(X)) | -stable(X) | -environment(X).
% 48 [] -greater(growth_rate(efficient_producers,sk2(X)),growth_rate(first_movers,sk2(X))) | -stable(X) | -environment(X).
% 49 [] greater(growth_rate(efficient_producers,X),growth_rate(first_movers,X)) | -greater(X,sk2(Y)) | -subpopulations(first_movers,efficient_producers,Y,X) | -stable(Y) | -environment(Y).
% 50 [] environment(sk3).
% 51 [] stable(sk3).
% 52 [] -in_environment(sk3,critical_point(sk3)).
% 56 [hyper:47,50,cut:51] in_environment(sk3,sk2(sk3)).
% 61 [hyper:44,56,cut:50] greater(growth_rate(efficient_producers,sk2(sk3)),growth_rate(first_movers,sk2(sk3))) | subpopulations(first_movers,efficient_producers,sk3,sk1(sk2(sk3),sk3)) | equal(sk2(sk3),critical_point(sk3)).
% 62 [hyper:45,56,cut:50] greater(growth_rate(efficient_producers,sk2(sk3)),growth_rate(first_movers,sk2(sk3))) | greater(sk1(sk2(sk3),sk3),sk2(sk3)) | equal(sk2(sk3),critical_point(sk3)).
% 70 [hyper:48,62,cut:51,cut:50] greater(sk1(sk2(sk3),sk3),sk2(sk3)) | equal(sk2(sk3),critical_point(sk3)).
% 78 [hyper:48,61,cut:51,cut:50] subpopulations(first_movers,efficient_producers,sk3,sk1(sk2(sk3),sk3)) | equal(sk2(sk3),critical_point(sk3)).
% 83 [hyper:49,78,cut:51,cut:50,binarycut:70] greater(growth_rate(efficient_producers,sk1(sk2(sk3),sk3)),growth_rate(first_movers,sk1(sk2(sk3),sk3))) | equal(sk2(sk3),critical_point(sk3)).
% 85 [hyper:46,83,cut:56,cut:50] greater(growth_rate(efficient_producers,sk2(sk3)),growth_rate(first_movers,sk2(sk3))) | equal(sk2(sk3),critical_point(sk3)).
% 87 [hyper:48,85,cut:51,cut:50] equal(sk2(sk3),critical_point(sk3)).
% 88 [para:87.1.1,56.1.2,cut:52] 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 4
% seconds given: 27
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 33
% derived clauses: 81
% kept clauses: 14
% kept size sum: 208
% kept mid-nuclei: 19
% kept new demods: 1
% forw unit-subs: 5
% forw double-subs: 6
% forw overdouble-subs: 5
% backward subs: 9
% fast unit cutoff: 39
% full unit cutoff: 0
% dbl unit cutoff: 2
% real runtime : 0.1
% process. runtime: 0.0
% specific non-discr-tree subsumption statistics:
% tried: 31
% length fails: 0
% strength fails: 10
% predlist fails: 16
% 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/MGT023-1+eq_r.in")
%
%------------------------------------------------------------------------------