TSTP Solution File: MGT026-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : MGT026-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 : art08.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/MGT026-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 2 11)
% (binary-unit 9 #f 2 11)
% (binary-double 9 #f 2 11)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 2 11)
% (binary-order 25 #f 2 11)
% (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(19,40,0,38,0,0,181,50,1,200,0,1,362,50,1,381,0,1,543,50,2,562,0,2,724,50,3,743,0,3,905,50,4,924,0,4,1086,50,5,1105,0,5,1267,50,5,1286,0,5,1448,50,6,1467,0,6,1629,50,6,1648,0,7,1810,50,7,1829,0,7,1991,50,8,2010,0,8,2172,50,8,2191,0,8,2353,50,9,2372,0,9,2534,50,9,2553,0,9,2715,50,10,2734,0,10,2896,50,10,2915,0,11,3077,50,11,3096,0,11,3258,50,12,3277,0,12,3439,50,12,3458,0,12,3620,50,13,3620,40,13,3639,0,13,3724,50,14,3743,0,14,3849,50,14,3868,0,14,3974,50,14,3993,0,14,4099,50,15,4118,0,15,4224,50,15,4243,0,15,4349,50,16,4368,0,16,4474,50,17,4493,0,17,4599,50,17,4618,0,17,4724,50,18,4743,0,18,4849,50,18,4868,0,18,4974,50,19,4993,0,19,5099,50,19,5118,0,20,5224,50,20,5243,0,20,5349,50,21,5368,0,21,5474,50,22,5493,0,22,5599,50,22,5618,0,22,5724,50,23,5743,0,23,5849,50,24,5868,0,24,5974,50,24,5993,0,25,6099,50,25,6099,40,25,6118,0,25)
%
%
% START OF PROOF
% 6079 [?] ?
% 6100 [] equal(X,X).
% 6102 [] -greater(cardinality_at_time(X,Y),zero) | -equal(cardinality_at_time(Z,Y),zero) | -subpopulation(X,U,Y) | -subpopulation(Z,U,Y) | selection_favors(X,Z,Y) | -environment(U).
% 6103 [] -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).
% 6104 [] greater_or_equal(cardinality_at_time(first_movers,X),zero) | -in_environment(Y,X) | -environment(Y).
% 6105 [] subpopulation(first_movers,X,Y) | -in_environment(X,Y) | -environment(X).
% 6106 [] subpopulation(efficient_producers,X,Y) | -in_environment(X,Y) | -environment(X).
% 6107 [] greater_or_equal(critical_point(X),appear(efficient_producers,X)) | -environment(X).
% 6108 [] -greater(Y,Z) | -greater(X,Y) | greater(X,Z).
% 6109 [] -greater_or_equal(X,Y) | greater(X,Y) | equal(X,Y).
% 6110 [] -greater(X,Y) | greater_or_equal(X,Y).
% 6114 [] greater(cardinality_at_time(efficient_producers,X),zero) | -greater_or_equal(X,appear(efficient_producers,Y)) | -in_environment(Y,X) | -environment(Y).
% 6115 [] environment(sk1).
% 6116 [] in_environment(sk1,sk2).
% 6117 [] greater(sk2,critical_point(sk1)).
% 6118 [] -selection_favors(efficient_producers,first_movers,sk2).
% 6123 [binary:6117,6110] greater_or_equal(sk2,critical_point(sk1)).
% 6138 [binary:6117,6108.2] -greater(critical_point(sk1),X) | greater(sk2,X).
% 6147 [binary:6110,6138.2] -greater(critical_point(sk1),X) | greater_or_equal(sk2,X).
% 6152 [binary:6116,6114.3,cut:6115] -greater_or_equal(sk2,appear(efficient_producers,sk1)) | greater(cardinality_at_time(efficient_producers,sk2),zero).
% 6164 [binary:6107,6109] greater(critical_point(X),appear(efficient_producers,X)) | equal(critical_point(X),appear(efficient_producers,X)) | -environment(X).
% 6179 [binary:6116,6105.2,cut:6115] subpopulation(first_movers,sk1,sk2).
% 6183 [binary:6116,6106.2,cut:6115] subpopulation(efficient_producers,sk1,sk2).
% 6185 [binary:6115,6102.6] -greater(cardinality_at_time(X,Y),zero) | -equal(cardinality_at_time(Z,Y),zero) | -subpopulation(X,sk1,Y) | -subpopulation(Z,sk1,Y) | selection_favors(X,Z,Y).
% 6198 [binary:6116,6104.2,cut:6115] greater_or_equal(cardinality_at_time(first_movers,sk2),zero).
% 6206 [binary:6116,6103.4,cut:6079,cut:6115] -greater(cardinality_at_time(first_movers,sk2),zero) | -greater(cardinality_at_time(efficient_producers,sk2),zero).
% 6274 [binary:6147.2,6152] -greater(critical_point(sk1),appear(efficient_producers,sk1)) | greater(cardinality_at_time(efficient_producers,sk2),zero).
% 6726 [para:6164.2.2,6152.1.2,cut:6123,cut:6115,binarycut:6274] greater(cardinality_at_time(efficient_producers,sk2),zero).
% 6743 [binary:6206.2,6726] -greater(cardinality_at_time(first_movers,sk2),zero).
% 6762 [binary:6109.2,6743,cut:6198] equal(cardinality_at_time(first_movers,sk2),zero).
% 7022 [binary:6118,6185.5,demod:6762,cut:6179,cut:6183,cut:6100,cut:6726] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using double 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 11
% clause depth limited to 2
% seconds given: 9
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 2248
% derived clauses: 10099
% kept clauses: 2113
% kept size sum: 25570
% kept mid-nuclei: 2301
% kept new demods: 1
% forw unit-subs: 1541
% forw double-subs: 1545
% forw overdouble-subs: 775
% backward subs: 78
% fast unit cutoff: 1456
% full unit cutoff: 0
% dbl unit cutoff: 45
% real runtime : 0.35
% process. runtime: 0.33
% specific non-discr-tree subsumption statistics:
% tried: 8945
% length fails: 78
% strength fails: 3172
% predlist fails: 3680
% aux str. fails: 36
% by-lit fails: 44
% full subs tried: 1587
% full subs fail: 1072
%
% ; 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/MGT026-1+eq_r.in")
%
%------------------------------------------------------------------------------