TSTP Solution File: MGT055-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : MGT055-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 : art04.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 9.6s
% Output : Assurance 9.6s
% 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/MGT055-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)
%
%
% SOS clause
% -greater(hazard_of_mortality(sk2,sk6),hazard_of_mortality(sk2,sk5)) | -greater(hazard_of_mortality(sk2,sk5),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,sk6),hazard_of_mortality(sk2,sk5)).
% -greater(hazard_of_mortality(sk2,sk5),hazard_of_mortality(sk2,sk4)).
% -equal(hazard_of_mortality(sk2,sk4),hazard_of_mortality(sk2,sk3)).
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(43,40,0,86,0,0,15440,4,908,43785,5,1206,43786,1,1206,43786,50,1207,43786,40,1207,43829,0,1207)
%
%
% START OF PROOF
% 43787 [] equal(X,X).
% 43788 [] -smaller_or_equal(X,Y) | smaller(X,Y) | equal(X,Y).
% 43789 [] -smaller(X,Y) | smaller_or_equal(X,Y).
% 43794 [] -smaller(X,Y) | greater(Y,X).
% 43795 [] -greater(X,Y) | smaller(Y,X).
% 43796 [] -greater(X,Y) | -greater(Y,X).
% 43797 [] -greater(Y,Z) | -greater(X,Y) | greater(X,Z).
% 43800 [] -smaller_or_equal(age(X,Y),eta) | has_immunity(X,Y) | -has_endowment(X).
% 43801 [] -greater(age(X,Y),eta) | -has_immunity(X,Y) | -has_endowment(X).
% 43806 [] equal(hazard_of_mortality(X,Y),hazard_of_mortality(X,Z)) | -has_immunity(X,Z) | -has_immunity(X,Y) | -organization(X).
% 43807 [] greater(hazard_of_mortality(X,Y),hazard_of_mortality(X,Z)) | -has_immunity(X,Z) | has_immunity(X,Y) | -organization(X).
% 43810 [] -dissimilar(X,Y,Z) | -is_aligned(X,Y) | -is_aligned(X,Z).
% 43812 [] dissimilar(X,Y,Z) | -is_aligned(X,Y) | is_aligned(X,Z) | -organization(X).
% 43815 [] -equal(age(X,Y),zero) | is_aligned(X,Y) | -organization(X).
% 43816 [] greater(capability(X,Y),capability(X,Z)) | -is_aligned(X,Y) | is_aligned(X,Z) | -organization(X).
% 43817 [] -greater(age(X,Y),sigma) | -equal(age(X,Z),zero) | dissimilar(X,Z,Y) | -organization(X).
% 43818 [] -equal(age(X,Y),zero) | greater(age(X,Z),sigma) | -dissimilar(X,Y,Z) | -organization(X).
% 43819 [] -greater(capability(X,Y),capability(X,Z)) | greater(hazard_of_mortality(X,Z),hazard_of_mortality(X,Y)) | has_immunity(X,Y) | has_immunity(X,Z) | -organization(X).
% 43820 [] organization(sk2).
% 43821 [] has_endowment(sk2).
% 43822 [] equal(age(sk2,sk3),zero).
% 43823 [] smaller_or_equal(age(sk2,sk4),eta).
% 43824 [] greater(age(sk2,sk5),eta).
% 43825 [] smaller_or_equal(age(sk2,sk5),sigma).
% 43826 [] greater(age(sk2,sk6),sigma).
% 43827 [] greater(sigma,eta).
% 43828 [] greater(eta,zero).
% 43829 [] -greater(hazard_of_mortality(sk2,sk5),hazard_of_mortality(sk2,sk4)) | -greater(hazard_of_mortality(sk2,sk6),hazard_of_mortality(sk2,sk5)) | -equal(hazard_of_mortality(sk2,sk4),hazard_of_mortality(sk2,sk3)).
% 43830 [input:43796,factor] -greater(X,X).
% 43847 [binary:43825,43788] smaller(age(sk2,sk5),sigma) | equal(age(sk2,sk5),sigma).
% 43852 [binary:43828,43795] smaller(zero,eta).
% 43856 [binary:43789,43852] smaller_or_equal(zero,eta).
% 43871 [binary:43827,43797] -greater(X,sigma) | greater(X,eta).
% 43893 [para:43822.1.1,43800.1.1,cut:43856,cut:43821] has_immunity(sk2,sk3).
% 43894 [binary:43823,43800,cut:43821] has_immunity(sk2,sk4).
% 43897 [binary:43826,43871] greater(age(sk2,sk6),eta).
% 43905 [binary:43824,43801,cut:43821] -has_immunity(sk2,sk5).
% 43915 [binary:43801,43897,cut:43821] -has_immunity(sk2,sk6).
% 43947 [binary:43893,43806.2,cut:43820] equal(hazard_of_mortality(sk2,X),hazard_of_mortality(sk2,sk3)) | -has_immunity(sk2,X).
% 43961 [binary:43893,43807.2,cut:43820] greater(hazard_of_mortality(sk2,X),hazard_of_mortality(sk2,sk3)) | has_immunity(sk2,X).
% 44010 [para:43822.1.1,43815.1.1,cut:43787,cut:43820] is_aligned(sk2,sk3).
% 44013 [binary:43812.2,44010,cut:43820] dissimilar(sk2,sk3,X) | is_aligned(sk2,X).
% 44028 [para:43822.1.1,43817.2.1,cut:43787,cut:43820] -greater(age(sk2,X),sigma) | dissimilar(sk2,sk3,X).
% 44087 [binary:43826,44028] dissimilar(sk2,sk3,sk6).
% 44088 [binary:43810,44087,cut:44010] -is_aligned(sk2,sk6).
% 44093 [binary:43816.3,44088,cut:43820] greater(capability(sk2,X),capability(sk2,sk6)) | -is_aligned(sk2,X).
% 44152 [binary:43894,43947.2] equal(hazard_of_mortality(sk2,sk4),hazard_of_mortality(sk2,sk3)).
% 44159 [binary:43905,43961.2,demod:44152] greater(hazard_of_mortality(sk2,sk5),hazard_of_mortality(sk2,sk4)).
% 44278 [para:44152.1.2,43829.3.2,cut:43787,cut:44159] -greater(hazard_of_mortality(sk2,sk6),hazard_of_mortality(sk2,sk5)).
% 44284 [binary:43819.2,44278,cut:43905,cut:43915,cut:43820,binarydemod:44093] -is_aligned(sk2,sk5).
% 44291 [binary:44013.2,44284] dissimilar(sk2,sk3,sk5).
% 44300 [binary:43818.3,44291,demod:43822,cut:43787,cut:43820] greater(age(sk2,sk5),sigma).
% 44304 [binary:43796,44300] -greater(sigma,age(sk2,sk5)).
% 44308 [para:43847.2.1,44300.1.1,cut:43830] smaller(age(sk2,sk5),sigma).
% 44310 [binary:43794.2,44304,cut:44308] 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: 4
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 778
% derived clauses: 248554
% kept clauses: 28792
% kept size sum: 543818
% kept mid-nuclei: 13815
% kept new demods: 3
% forw unit-subs: 58171
% forw double-subs: 46903
% forw overdouble-subs: 96918
% backward subs: 225
% fast unit cutoff: 5504
% full unit cutoff: 3
% dbl unit cutoff: 66
% real runtime : 12.63
% process. runtime: 12.10
% specific non-discr-tree subsumption statistics:
% tried: 6258850
% length fails: 68051
% strength fails: 1187114
% predlist fails: 3618930
% aux str. fails: 22521
% by-lit fails: 80702
% full subs tried: 1268093
% full subs fail: 1173226
%
% ; 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/MGT055-1+eq_r.in")
%
%------------------------------------------------------------------------------