%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : MGT056-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 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/MGT056-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(29,40,2,58,0,2,27888,4,907,45304,5,1203,45305,1,1203,45305,50,1204,45305,40,1204,45334,0,1204)
%
%
% START OF PROOF
% 45306 [] equal(X,X).
% 45308 [] -smaller(X,Y) | smaller_or_equal(X,Y).
% 45310 [] -greater_or_equal(X,Y) | greater(X,Y) | equal(X,Y).
% 45314 [] -greater(X,Y) | smaller(Y,X).
% 45316 [] -greater(Y,Z) | -greater(X,Y) | greater(X,Z).
% 45319 [] -smaller_or_equal(age(X,Y),eta) | has_immunity(X,Y) | -has_endowment(X).
% 45320 [] -greater(age(X,Y),eta) | -has_immunity(X,Y) | -has_endowment(X).
% 45325 [] equal(hazard_of_mortality(X,Y),hazard_of_mortality(X,Z)) | -has_immunity(X,Z) | -has_immunity(X,Y) | -organization(X).
% 45326 [] greater(hazard_of_mortality(X,Y),hazard_of_mortality(X,Z)) | -has_immunity(X,Z) | has_immunity(X,Y) | -organization(X).
% 45327 [] organization(sk2).
% 45328 [] has_endowment(sk2).
% 45329 [] equal(age(sk2,sk3),zero).
% 45330 [] smaller_or_equal(age(sk2,sk4),eta).
% 45331 [] greater(age(sk2,sk5),eta).
% 45332 [] greater_or_equal(eta,sigma).
% 45333 [] greater(sigma,zero).
% 45334 [] -greater(hazard_of_mortality(sk2,sk5),hazard_of_mortality(sk2,sk4)) | -equal(hazard_of_mortality(sk2,sk4),hazard_of_mortality(sk2,sk3)).
% 45347 [binary:45332,45310] greater(eta,sigma) | equal(eta,sigma).
% 45370 [binary:45333,45316] -greater(X,sigma) | greater(X,zero).
% 45384 [para:45347.2.2,45333.1.1,binarycut:45370] greater(eta,zero).
% 45386 [binary:45314,45384] smaller(zero,eta).
% 45394 [binary:45330,45319,cut:45328] has_immunity(sk2,sk4).
% 45395 [binary:45308,45386] smaller_or_equal(zero,eta).
% 45399 [binary:45331,45320,cut:45328] -has_immunity(sk2,sk5).
% 45463 [binary:45394,45325.2,cut:45327] equal(hazard_of_mortality(sk2,X),hazard_of_mortality(sk2,sk4)) | -has_immunity(sk2,X).
% 45465 [para:45329.1.1,45319.1.1,cut:45328,cut:45395] has_immunity(sk2,sk3).
% 45493 [binary:45399,45326.3,cut:45327] greater(hazard_of_mortality(sk2,sk5),hazard_of_mortality(sk2,X)) | -has_immunity(sk2,X).
% 45556 [binary:45465,45463.2] equal(hazard_of_mortality(sk2,sk3),hazard_of_mortality(sk2,sk4)).
% 45558 [para:45556.1.1,45334.2.2,cut:45306,binarydemod:45493,cut:45394] 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: 513
% derived clauses: 145031
% kept clauses: 35424
% kept size sum: 818277
% kept mid-nuclei: 2431
% kept new demods: 3
% forw unit-subs: 28721
% forw double-subs: 18595
% forw overdouble-subs: 58959
% backward subs: 107
% fast unit cutoff: 1681
% full unit cutoff: 0
% dbl unit cutoff: 354
% real runtime : 12.3
% process. runtime: 12.3
% specific non-discr-tree subsumption statistics:
% tried: 12414455
% length fails: 499126
% strength fails: 2606588
% predlist fails: 7344841
% aux str. fails: 109216
% by-lit fails: 136643
% full subs tried: 1656430
% full subs fail: 1599599
%
% ; 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/MGT056-1+eq_r.in")
%
%------------------------------------------------------------------------------