TSTP Solution File: MGT047-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : MGT047-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 : 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 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/MGT047-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 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)
%
%
% SOS clause
% -greater(hazard_of_mortality(sk2,sk5),hazard_of_mortality(sk2,sk6)) | -greater(hazard_of_mortality(sk2,sk6),hazard_of_mortality(sk2,sk4)) | -equal(hazard_of_mortality(sk2,sk4),hazard_of_mortality(sk2,sk3)).
% was split for some strategies as:
% -greater(hazard_of_mortality(sk2,sk5),hazard_of_mortality(sk2,sk6)).
% -greater(hazard_of_mortality(sk2,sk6),hazard_of_mortality(sk2,sk4)).
% -equal(hazard_of_mortality(sk2,sk4),hazard_of_mortality(sk2,sk3)).
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(39,40,0,78,0,0,31925,4,903,52285,5,1201,52286,1,1201,52286,50,1202,52286,40,1202,52325,0,1202)
%
%
% START OF PROOF
% 536 [?] ?
% 52288 [] -smaller_or_equal(X,Y) | smaller(X,Y) | equal(X,Y).
% 52289 [] -smaller(X,Y) | smaller_or_equal(X,Y).
% 52290 [] -equal(X,Y) | smaller_or_equal(X,Y).
% 52294 [] -smaller(X,Y) | greater(Y,X).
% 52297 [] -greater(Y,Z) | -greater(X,Y) | greater(X,Z).
% 52298 [] greater(X,Y) | smaller(X,Y) | equal(X,Y).
% 52300 [] -smaller_or_equal(age(X,Y),eta) | has_immunity(X,Y) | -has_endowment(X).
% 52301 [] -greater(age(X,Y),eta) | -has_immunity(X,Y) | -has_endowment(X).
% 52306 [] equal(hazard_of_mortality(X,Y),hazard_of_mortality(X,Z)) | -has_immunity(X,Z) | -has_immunity(X,Y) | -organization(X).
% 52307 [] greater(hazard_of_mortality(X,Y),hazard_of_mortality(X,Z)) | -has_immunity(X,Z) | has_immunity(X,Y) | -organization(X).
% 52308 [] -greater(capability(X,Y),capability(X,Z)) | -greater_or_equal(position(X,Y),position(X,Z)) | smaller(hazard_of_mortality(X,Y),hazard_of_mortality(X,Z)) | has_immunity(X,Z) | has_immunity(X,Y) | -organization(X).
% 52311 [] -greater(stock_of_knowledge(X,Y),stock_of_knowledge(X,Z)) | -smaller_or_equal(internal_friction(X,Y),internal_friction(X,Z)) | greater(capability(X,Y),capability(X,Z)) | -organization(X).
% 52316 [] -greater(age(X,Y),age(X,Z)) | greater(stock_of_knowledge(X,Y),stock_of_knowledge(X,Z)) | -organization(X).
% 52318 [] equal(internal_friction(X,Y),internal_friction(X,Z)) | -organization(X).
% 52319 [] organization(sk2).
% 52320 [] has_endowment(sk2).
% 52321 [] smaller_or_equal(age(sk2,sk3),age(sk2,sk4)).
% 52322 [] smaller_or_equal(age(sk2,sk4),eta).
% 52323 [] greater(age(sk2,sk5),eta).
% 52324 [] greater(age(sk2,sk6),age(sk2,sk5)).
% 52325 [] -greater(hazard_of_mortality(sk2,sk6),hazard_of_mortality(sk2,sk4)) | -greater(hazard_of_mortality(sk2,sk5),hazard_of_mortality(sk2,sk6)) | -equal(hazard_of_mortality(sk2,sk4),hazard_of_mortality(sk2,sk3)).
% 52341 [binary:52322,52288] smaller(age(sk2,sk4),eta) | equal(age(sk2,sk4),eta).
% 52342 [binary:52321,52288] smaller(age(sk2,sk3),age(sk2,sk4)) | equal(age(sk2,sk3),age(sk2,sk4)).
% 52358 [binary:52323,52297] -greater(X,age(sk2,sk5)) | greater(X,eta).
% 52366 [binary:52324,52358] greater(age(sk2,sk6),eta).
% 52379 [binary:52320,52300.3] -smaller_or_equal(age(sk2,X),eta) | has_immunity(sk2,X).
% 52380 [binary:52322,52300,cut:52320] has_immunity(sk2,sk4).
% 52383 [binary:52323,52301,cut:52320] -has_immunity(sk2,sk5).
% 52384 [binary:52366,52301,cut:52320] -has_immunity(sk2,sk6).
% 52385 [binary:52380,52301.2,cut:52320] -greater(age(sk2,sk4),eta).
% 52390 [binary:52297.3,52385] -greater(age(sk2,sk4),X) | -greater(X,eta).
% 52421 [binary:52319,52318.2] equal(internal_friction(sk2,X),internal_friction(sk2,Y)).
% 52422 [binary:52290,52421] smaller_or_equal(internal_friction(sk2,X),internal_friction(sk2,Y)).
% 52428 [binary:52380,52306.3,cut:52319] equal(hazard_of_mortality(sk2,sk4),hazard_of_mortality(sk2,X)) | -has_immunity(sk2,X).
% 52436 [binary:52380,52307.2,cut:52319] greater(hazard_of_mortality(sk2,X),hazard_of_mortality(sk2,sk4)) | has_immunity(sk2,X).
% 52449 [binary:52384,52436.2] greater(hazard_of_mortality(sk2,sk6),hazard_of_mortality(sk2,sk4)).
% 52557 [binary:52324,52316,cut:52319] greater(stock_of_knowledge(sk2,sk6),stock_of_knowledge(sk2,sk5)).
% 52565 [binary:52311,52557,cut:52422,cut:52319] greater(capability(sk2,sk6),capability(sk2,sk5)).
% 52578 [binary:52308,52565,cut:536,cut:52383,cut:52384,cut:52319] smaller(hazard_of_mortality(sk2,sk6),hazard_of_mortality(sk2,sk5)).
% 52592 [para:52341.2.1,52321.1.2,binarydemod:52379] smaller(age(sk2,sk4),eta) | has_immunity(sk2,sk3).
% 52612 [binary:52294,52578] greater(hazard_of_mortality(sk2,sk5),hazard_of_mortality(sk2,sk6)).
% 53008 [binary:52325,52449,cut:52612] -equal(hazard_of_mortality(sk2,sk4),hazard_of_mortality(sk2,sk3)).
% 53014 [para:52306.1.1,53008.1.2,cut:52319,binarycut:52428,slowcut:52380] -has_immunity(sk2,sk3).
% 53018 [binary:52300.2,53014,cut:52320] -smaller_or_equal(age(sk2,sk3),eta).
% 53027 [binary:52592.2,53014] smaller(age(sk2,sk4),eta).
% 53036 [binary:52289.2,53018] -smaller(age(sk2,sk3),eta).
% 53037 [binary:52290.2,53018] -equal(age(sk2,sk3),eta).
% 53038 [para:52342.2.2,53027.1.1,cut:53036] smaller(age(sk2,sk3),age(sk2,sk4)).
% 53047 [binary:52298.2,53036,cut:53037] greater(age(sk2,sk3),eta).
% 53059 [binary:52390.2,53047] -greater(age(sk2,sk4),age(sk2,sk3)).
% 53078 [binary:52294,53038,cut:53059] 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 11
% clause depth limited to 3
% seconds given: 4
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 696
% derived clauses: 160094
% kept clauses: 34823
% kept size sum: 872231
% kept mid-nuclei: 14581
% kept new demods: 0
% forw unit-subs: 35779
% forw double-subs: 15157
% forw overdouble-subs: 58753
% backward subs: 181
% fast unit cutoff: 4007
% full unit cutoff: 1
% dbl unit cutoff: 323
% real runtime : 12.6
% process. runtime: 12.5
% specific non-discr-tree subsumption statistics:
% tried: 7426377
% length fails: 106718
% strength fails: 1648702
% predlist fails: 3974549
% aux str. fails: 40243
% by-lit fails: 66232
% full subs tried: 1557271
% full subs fail: 1500960
%
% ; 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/MGT047-1+eq_r.in")
%
%------------------------------------------------------------------------------