%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : MGT008-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 : art02.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 0.0s
% Output : Assurance 0.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/MGT008-1+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: hne
% detected subclass: medium
% detected subclass: long
%
% strategies selected:
% (hyper 57 #f 2 19)
% (binary-unit 28 #f 2 19)
% (binary-double 28 #f)
% (binary-posweight-order 28 #f 2 19)
% (binary 28 #t 2 19)
% (hyper 28 #t)
% (hyper 159 #f)
% (binary-posweight-order 85 #f)
% (binary-weightorder 39 #f)
% (binary-order 28 #f)
% (binary-unit 45 #f)
% (binary 47 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(15,40,0,30,0,0)
%
%
% START OF PROOF
% 16 [] inertia(X,sk1(Y,X),Y) | -organization(X,Y).
% 17 [] -size(X,Y,Z) | -size(U,V,W) | -class(X,X1,Z) | -class(U,X1,W) | -inertia(X,X3,Z) | -inertia(U,X2,W) | -greater(Y,V) | -organization(U,W) | -organization(X,Z) | greater(X3,X2).
% 18 [] -survival_chance(X,Y,Z) | -survival_chance(U,V,W) | -reorganization_free(X,Z,Z) | -reorganization_free(U,W,W) | -inertia(X,X2,Z) | -inertia(U,X1,W) | -greater(X2,X1) | -organization(U,W) | -organization(X,Z) | greater(Y,V).
% 19 [] organization(sk2,sk9).
% 20 [] organization(sk3,sk10).
% 21 [] reorganization_free(sk2,sk9,sk9).
% 22 [] reorganization_free(sk3,sk10,sk10).
% 23 [] class(sk2,sk4,sk9).
% 24 [] class(sk3,sk4,sk10).
% 25 [] survival_chance(sk2,sk5,sk9).
% 26 [] survival_chance(sk3,sk6,sk10).
% 27 [] size(sk2,sk7,sk9).
% 28 [] size(sk3,sk8,sk10).
% 29 [] greater(sk8,sk7).
% 30 [] -greater(sk6,sk5).
% 35 [hyper:16,19] inertia(sk2,sk1(sk9,sk2),sk9).
% 40 [hyper:16,20] inertia(sk3,sk1(sk10,sk3),sk10).
% 231 [hyper:17,40,28,24,29,35,cut:20,cut:23,cut:27,cut:19] greater(sk1(sk10,sk3),sk1(sk9,sk2)).
% 356 [hyper:18,231,35,40,26,25,cut:21,cut:19,cut:22,cut:20,cut:30] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 19
% clause depth limited to 2
% seconds given: 57
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 17
% derived clauses: 337
% kept clauses: 3
% kept size sum: 19
% kept mid-nuclei: 320
% kept new demods: 0
% forw unit-subs: 11
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 181
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.1
% process. runtime: 0.1
% specific non-discr-tree subsumption statistics:
% tried: 89
% length fails: 0
% strength fails: 27
% predlist fails: 38
% aux str. fails: 24
% by-lit fails: 0
% full subs tried: 0
% full subs fail: 0
%
% ; 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/MGT008-1+noeq.in")
%
%------------------------------------------------------------------------------