%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : MGT054-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 : art05.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 20.0s
% Output : Assurance 20.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/MGT054-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 2 9)
% (binary-unit 9 #f 2 9)
% (binary-double 9 #f 2 9)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 2 9)
% (binary-order 25 #f 2 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(33,40,0,66,0,0,32690,4,1885,61821,5,2501,61821,1,2501,61821,50,2502,61821,40,2502,61854,0,2502)
%
%
% START OF PROOF
% 57521 [?] ?
% 61822 [] equal(X,X).
% 61823 [] -smaller_or_equal(X,Y) | smaller(X,Y) | equal(X,Y).
% 61829 [] -smaller(X,Y) | greater(Y,X).
% 61831 [] -greater(X,Y) | -greater(Y,X).
% 61834 [] -has_immunity(X,Y) | -organization(X) | has_endowment(X).
% 61838 [] -dissimilar(X,Y,Z) | -is_aligned(X,Y) | -is_aligned(X,Z).
% 61840 [] dissimilar(X,Y,Z) | -is_aligned(X,Y) | is_aligned(X,Z) | -organization(X).
% 61843 [] -equal(age(X,Y),zero) | is_aligned(X,Y) | -organization(X).
% 61844 [] greater(capability(X,Y),capability(X,Z)) | -is_aligned(X,Y) | is_aligned(X,Z) | -organization(X).
% 61845 [] -greater(age(X,Y),sigma) | -equal(age(X,Z),zero) | dissimilar(X,Z,Y) | -organization(X).
% 61846 [] -equal(age(X,Y),zero) | greater(age(X,Z),sigma) | -dissimilar(X,Y,Z) | -organization(X).
% 61847 [] -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).
% 61848 [] organization(sk1).
% 61849 [] -has_endowment(sk1).
% 61850 [] equal(age(sk1,sk2),zero).
% 61851 [] smaller_or_equal(age(sk1,sk3),sigma).
% 61852 [] greater(age(sk1,sk4),sigma).
% 61854 [] -greater(hazard_of_mortality(sk1,sk4),hazard_of_mortality(sk1,sk3)).
% 61863 [binary:61851,61823] smaller(age(sk1,sk3),sigma) | equal(age(sk1,sk3),sigma).
% 61911 [binary:61848,61834.2,cut:61849] -has_immunity(sk1,X).
% 61933 [para:61850.1.1,61843.1.1,cut:61822,cut:61848] is_aligned(sk1,sk2).
% 61941 [binary:61933,61840.2,cut:61848] dissimilar(sk1,sk2,X) | is_aligned(sk1,X).
% 61964 [para:61850.1.1,61845.2.1,cut:61822,cut:61848] -greater(age(sk1,X),sigma) | dissimilar(sk1,sk2,X).
% 61967 [binary:61852,61964] dissimilar(sk1,sk2,sk4).
% 61968 [binary:61838,61967,cut:61933] -is_aligned(sk1,sk4).
% 61975 [binary:61844.3,61968,cut:61848] greater(capability(sk1,X),capability(sk1,sk4)) | -is_aligned(sk1,X).
% 61990 [binary:61854,61847.2,cut:61911,cut:61911,cut:61848,binarydemod:61975] -is_aligned(sk1,sk3).
% 61995 [binary:61941.2,61990] dissimilar(sk1,sk2,sk3).
% 62002 [binary:61846.3,61995,demod:61850,cut:61822,cut:61848] greater(age(sk1,sk3),sigma).
% 62011 [binary:61831,62002] -greater(sigma,age(sk1,sk3)).
% 62016 [para:61863.2.1,62002.1.1,cut:57521] smaller(age(sk1,sk3),sigma).
% 62020 [binary:61829.2,62011,cut:62016] 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 2
% seconds given: 9
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 563
% derived clauses: 378329
% kept clauses: 36224
% kept size sum: 723858
% kept mid-nuclei: 18557
% kept new demods: 2
% forw unit-subs: 85698
% forw double-subs: 106603
% forw overdouble-subs: 128503
% backward subs: 25
% fast unit cutoff: 6729
% full unit cutoff: 2
% dbl unit cutoff: 1264
% real runtime : 25.5
% process. runtime: 25.2
% specific non-discr-tree subsumption statistics:
% tried: 25958895
% length fails: 239110
% strength fails: 4093185
% predlist fails: 17549079
% aux str. fails: 437462
% by-lit fails: 145442
% full subs tried: 3440538
% full subs fail: 3312152
%
% ; 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/MGT054-1+eq_r.in")
%
%------------------------------------------------------------------------------