TSTP Solution File: MGT039-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : MGT039-2 : 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 : art03.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 10.0s
% Output : Assurance 10.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/MGT039-2+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 11)
% (binary-unit 9 #f 3 11)
% (binary-double 9 #f 3 11)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 3 11)
% (binary-order 25 #f 3 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(29,40,0,58,0,0,635,50,12,664,0,12,4070,50,102,4099,0,102,7616,50,197,7645,0,197,11162,50,298,11191,0,299,14708,50,406,14737,0,406,18254,50,525,18283,0,525,21800,50,654,21829,0,654,25346,50,778,25375,0,778,28892,50,865,28921,0,865,32438,50,956,32467,0,956,35984,50,1048,36013,0,1048,39530,50,1142,39559,0,1142,43076,50,1238,43105,0,1238,46622,50,1335,46622,40,1335,46651,0,1336,46787,50,1336,46816,0,1336,47076,50,1337,47105,0,1337,47371,50,1339,47400,0,1339,47666,50,1340,47695,0,1340,47961,50,1341,47990,0,1341,48256,50,1343,48285,0,1343,48551,50,1344,48580,0,1344,48846,50,1345,48875,0,1345,49141,50,1347,49170,0,1347,49436,50,1348,49465,0,1348,49731,50,1350,49760,0,1350,50026,50,1352,50055,0,1352,50321,50,1353,50350,0,1353,50616,50,1355,50645,0,1355,50911,50,1357,50940,0,1357,51206,50,1358,51235,0,1358,51501,50,1360,51530,0,1360,51796,50,1362,51825,0,1362,52091,50,1364,52091,40,1364,52120,0,1364,57767,50,1756,57796,0,1756)
%
%
% START OF PROOF
% 52037 [?] ?
% 52669 [?] ?
% 53302 [?] ?
% 57768 [] equal(X,X).
% 57770 [] -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).
% 57771 [?] ?
% 57773 [?] ?
% 57776 [] propagation_strategy(first_movers).
% 57777 [] propagation_strategy(efficient_producers).
% 57778 [] -greater_or_equal(end_time(X),Y) | -greater_or_equal(Y,start_time(X)) | in_environment(X,Y) | -environment(X).
% 57780 [] -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).
% 57781 [] greater_or_equal(cardinality_at_time(first_movers,X),zero) | -in_environment(Y,X) | -environment(Y).
% 57782 [] subpopulation(first_movers,X,Y) | -in_environment(X,Y) | -environment(X).
% 57783 [] subpopulation(efficient_producers,X,Y) | -in_environment(X,Y) | -environment(X).
% 57788 [] -greater_or_equal(X,Y) | greater(X,Y) | equal(X,Y).
% 57790 [] -equal(X,Y) | greater_or_equal(X,Y).
% 57793 [] greater(cardinality_at_time(efficient_producers,X),zero) | -greater_or_equal(X,appear(efficient_producers,Y)) | -in_environment(Y,X) | -environment(Y).
% 57794 [] observational_period(sk3).
% 57796 [] -selection_favors(efficient_producers,first_movers,sk3).
% 57802 [binary:57768,57790] greater_or_equal(X,X).
% 57840 [binary:57802,57778] -greater_or_equal(end_time(X),start_time(X)) | in_environment(X,end_time(X)) | -environment(X).
% 57858 [input:57771,cut:57777,cut:57776] environment(sk1(X)) | selection_favors(efficient_producers,first_movers,X) | -observational_period(X).
% 57859 [binary:57794,57858.3,cut:57796] environment(sk1(sk3)).
% 57878 [binary:57840.3,57859,cut:52669] in_environment(sk1(sk3),end_time(sk1(sk3))).
% 57880 [binary:57770.6,57859] -subpopulation(X,sk1(sk3),Y) | -subpopulation(Z,sk1(sk3),Y) | -greater(cardinality_at_time(X,Y),zero) | -equal(cardinality_at_time(Z,Y),zero) | selection_favors(X,Z,Y).
% 57883 [binary:57793.3,57878,cut:53302,cut:57859] greater(cardinality_at_time(efficient_producers,end_time(sk1(sk3))),zero).
% 57884 [binary:57782.2,57878,cut:57859] subpopulation(first_movers,sk1(sk3),end_time(sk1(sk3))).
% 57885 [binary:57783.2,57878,cut:57859] subpopulation(efficient_producers,sk1(sk3),end_time(sk1(sk3))).
% 57886 [binary:57781.2,57878,cut:57859] greater_or_equal(cardinality_at_time(first_movers,end_time(sk1(sk3))),zero).
% 57899 [input:57773,cut:57777,cut:57776] -selection_favors(efficient_producers,first_movers,end_time(sk1(X))) | selection_favors(efficient_producers,first_movers,X) | -observational_period(X).
% 57900 [binary:57794,57899.3,cut:57796] -selection_favors(efficient_producers,first_movers,end_time(sk1(sk3))).
% 57951 [binary:57878,57780.4,cut:52037,cut:57883,cut:57859] -greater(cardinality_at_time(first_movers,end_time(sk1(sk3))),zero).
% 57973 [binary:57788.2,57951,cut:57886] equal(cardinality_at_time(first_movers,end_time(sk1(sk3))),zero).
% 58926 [binary:57900,57880.5,demod:57973,cut:57768,cut:57883,cut:57884,cut:57885] 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 4
% seconds given: 9
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 9073
% derived clauses: 410103
% kept clauses: 11357
% kept size sum: 268715
% kept mid-nuclei: 37713
% kept new demods: 1
% forw unit-subs: 51023
% forw double-subs: 45467
% forw overdouble-subs: 233051
% backward subs: 3512
% fast unit cutoff: 53761
% full unit cutoff: 0
% dbl unit cutoff: 564
% real runtime : 17.70
% process. runtime: 17.68
% specific non-discr-tree subsumption statistics:
% tried: 2163058
% length fails: 14806
% strength fails: 31152
% predlist fails: 1249157
% aux str. fails: 2638
% by-lit fails: 586448
% full subs tried: 38649
% full subs fail: 28090
%
% ; 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/MGT039-2+eq_r.in")
%
%------------------------------------------------------------------------------