%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : MGT057-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/MGT057-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 7)
% (binary-unit 9 #f 3 7)
% (binary-double 9 #f 3 7)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 3 7)
% (binary-order 25 #f 3 7)
% (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,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,sk4)).
% -equal(hazard_of_mortality(sk2,sk4),hazard_of_mortality(sk2,sk3)).
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(28,40,0,56,0,0,22039,4,915,31637,5,1201,31638,1,1201,31638,50,1201,31638,40,1201,31666,0,1201)
%
%
% START OF PROOF
% 31639 [] equal(X,X).
% 31641 [] -smaller(X,Y) | smaller_or_equal(X,Y).
% 31647 [] -greater(X,Y) | smaller(Y,X).
% 31652 [] -smaller_or_equal(age(X,Y),eta) | has_immunity(X,Y) | -has_endowment(X).
% 31653 [] -greater(age(X,Y),eta) | -has_immunity(X,Y) | -has_endowment(X).
% 31658 [] equal(hazard_of_mortality(X,Y),hazard_of_mortality(X,Z)) | -has_immunity(X,Z) | -has_immunity(X,Y) | -organization(X).
% 31659 [] greater(hazard_of_mortality(X,Y),hazard_of_mortality(X,Z)) | -has_immunity(X,Z) | has_immunity(X,Y) | -organization(X).
% 31660 [] organization(sk2).
% 31661 [] has_endowment(sk2).
% 31662 [] equal(age(sk2,sk3),zero).
% 31663 [] smaller_or_equal(age(sk2,sk4),eta).
% 31664 [] greater(age(sk2,sk5),eta).
% 31665 [] greater(eta,zero).
% 31666 [] -greater(hazard_of_mortality(sk2,sk5),hazard_of_mortality(sk2,sk4)) | -equal(hazard_of_mortality(sk2,sk4),hazard_of_mortality(sk2,sk3)).
% 31685 [binary:31665,31647] smaller(zero,eta).
% 31687 [binary:31641,31685] smaller_or_equal(zero,eta).
% 31716 [para:31662.1.1,31652.1.1,cut:31687,cut:31661] has_immunity(sk2,sk3).
% 31717 [binary:31663,31652,cut:31661] has_immunity(sk2,sk4).
% 31720 [binary:31664,31653,cut:31661] -has_immunity(sk2,sk5).
% 31759 [binary:31716,31658.2,cut:31660] equal(hazard_of_mortality(sk2,X),hazard_of_mortality(sk2,sk3)) | -has_immunity(sk2,X).
% 31768 [binary:31717,31759.2] equal(hazard_of_mortality(sk2,sk4),hazard_of_mortality(sk2,sk3)).
% 31772 [binary:31720,31659.3,cut:31660] greater(hazard_of_mortality(sk2,sk5),hazard_of_mortality(sk2,X)) | -has_immunity(sk2,X).
% 31774 [para:31768.1.2,31666.2.2,cut:31639,binarydemod:31772,cut:31717] 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 7
% clause depth limited to 3
% seconds given: 4
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 369
% derived clauses: 96740
% kept clauses: 19886
% kept size sum: 544028
% kept mid-nuclei: 2351
% kept new demods: 3
% forw unit-subs: 22363
% forw double-subs: 12049
% forw overdouble-subs: 37489
% backward subs: 18
% fast unit cutoff: 992
% full unit cutoff: 0
% dbl unit cutoff: 255
% real runtime : 12.3
% process. runtime: 12.1
% specific non-discr-tree subsumption statistics:
% tried: 12437288
% length fails: 886290
% strength fails: 2346684
% predlist fails: 7310471
% aux str. fails: 52061
% by-lit fails: 189254
% full subs tried: 1567197
% full subs fail: 1529876
%
% ; 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/MGT057-1+eq_r.in")
%
%------------------------------------------------------------------------------