TSTP Solution File: MGT039-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : MGT039-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 : 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 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/MGT039-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(20,40,0,40,0,0,346,50,3,366,0,3,726,50,6,746,0,6,1106,50,10,1126,0,10,1486,50,12,1506,0,12,1866,50,14,1886,0,14,2246,50,16,2266,0,16,2626,50,18,2646,0,18,3006,50,21,3026,0,21,3386,50,23,3406,0,23,3766,50,26,3786,0,26,4146,50,28,4166,0,28,4526,50,31,4546,0,31,4906,50,33,4926,0,33,5286,50,36,5306,0,36,5666,50,39,5686,0,39,6046,50,42,6066,0,42,6426,50,45,6446,0,45,6806,50,48,6826,0,48,7186,50,51,7186,40,51,7206,0,51)
%
%
% START OF PROOF
% 6858 [?] ?
% 7187 [] equal(X,X).
% 7188 [?] ?
% 7189 [?] ?
% 7190 [?] ?
% 7191 [] in_environment(X,sk2(X,Y)) | -in_environment(Y,X) | -slow_change(Y) | -environment(X) | -observational_period(Y).
% 7192 [] greater(sk2(X,Y),critical_point(X)) | -in_environment(Y,X) | -slow_change(Y) | -environment(X) | -observational_period(Y).
% 7193 [] propagation_strategy(first_movers).
% 7194 [] propagation_strategy(efficient_producers).
% 7195 [] -greater_or_equal(end_time(X),Y) | -greater_or_equal(Y,start_time(X)) | in_environment(X,Y) | -environment(X).
% 7196 [] greater_or_equal(end_time(X),Y) | -in_environment(X,Y) | -environment(X).
% 7197 [] greater_or_equal(critical_point(X),start_time(X)) | -environment(X).
% 7198 [] -greater(Y,Z) | -greater(X,Y) | greater(X,Z).
% 7199 [] -greater_or_equal(X,Y) | greater(X,Y) | equal(X,Y).
% 7200 [] -greater(X,Y) | greater_or_equal(X,Y).
% 7201 [] -equal(X,Y) | greater_or_equal(X,Y).
% 7203 [] -greater(X,critical_point(Y)) | selection_favors(efficient_producers,first_movers,X) | -in_environment(Y,X) | -environment(Y).
% 7204 [] observational_period(sk3).
% 7205 [] slow_change(sk3).
% 7206 [] -selection_favors(efficient_producers,first_movers,sk3).
% 7211 [binary:7187,7201] greater_or_equal(X,X).
% 7213 [input:7188,cut:7194,cut:7193] environment(sk1(X)) | selection_favors(efficient_producers,first_movers,X) | -observational_period(X).
% 7214 [binary:7204,7213.3,cut:7206] environment(sk1(sk3)).
% 7218 [binary:7214,7197.2] greater_or_equal(critical_point(sk1(sk3)),start_time(sk1(sk3))).
% 7222 [input:7189,cut:7194,cut:7193] in_environment(X,sk1(X)) | selection_favors(efficient_producers,first_movers,X) | -observational_period(X).
% 7223 [binary:7204,7222.3,cut:7206] in_environment(sk3,sk1(sk3)).
% 7228 [binary:7218,7199] greater(critical_point(sk1(sk3)),start_time(sk1(sk3))) | equal(critical_point(sk1(sk3)),start_time(sk1(sk3))).
% 7231 [input:7190,cut:7194,cut:7193] -selection_favors(efficient_producers,first_movers,end_time(sk1(X))) | selection_favors(efficient_producers,first_movers,X) | -observational_period(X).
% 7232 [binary:7204,7231.3,cut:7206] -selection_favors(efficient_producers,first_movers,end_time(sk1(sk3))).
% 7247 [binary:7223,7191.2,cut:7205,cut:7214,cut:7204] in_environment(sk1(sk3),sk2(sk1(sk3),sk3)).
% 7248 [binary:7203.3,7247,cut:6858,cut:7214] selection_favors(efficient_producers,first_movers,sk2(sk1(sk3),sk3)).
% 7249 [binary:7196.2,7247,cut:7214] greater_or_equal(end_time(sk1(sk3)),sk2(sk1(sk3),sk3)).
% 7250 [binary:7199,7249] greater(end_time(sk1(sk3)),sk2(sk1(sk3),sk3)) | equal(end_time(sk1(sk3)),sk2(sk1(sk3),sk3)).
% 7257 [binary:7223,7192.2,cut:7205,cut:7214,cut:7204] greater(sk2(sk1(sk3),sk3),critical_point(sk1(sk3))).
% 7259 [binary:7198,7257] -greater(X,sk2(sk1(sk3),sk3)) | greater(X,critical_point(sk1(sk3))).
% 7260 [binary:7198.2,7257] greater(sk2(sk1(sk3),sk3),X) | -greater(critical_point(sk1(sk3)),X).
% 7278 [para:7250.2.2,7248.1.3,cut:7232] greater(end_time(sk1(sk3)),sk2(sk1(sk3),sk3)).
% 7280 [binary:7198.2,7278] -greater(sk2(sk1(sk3),sk3),X) | greater(end_time(sk1(sk3)),X).
% 7281 [binary:7259,7278] greater(end_time(sk1(sk3)),critical_point(sk1(sk3))).
% 7282 [binary:7203,7281,cut:7232,cut:7214] -in_environment(sk1(sk3),end_time(sk1(sk3))).
% 7283 [binary:7200,7281] greater_or_equal(end_time(sk1(sk3)),critical_point(sk1(sk3))).
% 7286 [binary:7195.3,7282,cut:7211,cut:7214] -greater_or_equal(end_time(sk1(sk3)),start_time(sk1(sk3))).
% 7290 [binary:7200.2,7286] -greater(end_time(sk1(sk3)),start_time(sk1(sk3))).
% 7294 [para:7228.2.2,7286.1.2,cut:7283] greater(critical_point(sk1(sk3)),start_time(sk1(sk3))).
% 7298 [binary:7260.2,7294] greater(sk2(sk1(sk3),sk3),start_time(sk1(sk3))).
% 7300 [binary:7290,7280.2,cut:7298] 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 3
% seconds given: 9
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 1490
% derived clauses: 20507
% kept clauses: 1498
% kept size sum: 33209
% kept mid-nuclei: 4202
% kept new demods: 0
% forw unit-subs: 3530
% forw double-subs: 2914
% forw overdouble-subs: 7108
% backward subs: 476
% fast unit cutoff: 1939
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.53
% process. runtime: 0.52
% specific non-discr-tree subsumption statistics:
% tried: 31620
% length fails: 345
% strength fails: 707
% predlist fails: 20479
% aux str. fails: 0
% by-lit fails: 2316
% full subs tried: 2
% 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/MGT039-1+eq_r.in")
%
%------------------------------------------------------------------------------