TSTP Solution File: MGT007-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : MGT007-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 : art08.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/MGT007-1+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: nne
% detected subclass: medium
%
% strategies selected:
% (hyper 27 #f 2 21)
% (binary-unit 10 #f 2 21)
% (binary-double 16 #f 2 21)
% (binary 54 #t 2 21)
% (binary-order 27 #f 2 21)
% (binary-posweight-order 125 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 27 #f)
% (binary-weightorder 54 #f)
% (binary-order 54 #f)
% (hyper-order 43 #f)
% (binary 109 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(17,40,1,34,0,1)
%
%
% START OF PROOF
% 18 [] reliability(X,sk1(Y,X),Y) | -organization(X,Y).
% 19 [] accountability(X,sk2(Y,X),Y) | -organization(X,Y).
% 23 [] -reproducibility(X,Y,Z) | -reproducibility(U,V,W) | -accountability(U,X2,W) | -accountability(X,X1,Z) | -reliability(U,X4,W) | -reliability(X,X3,Z) | -greater(X2,X1) | -greater(X4,X3) | -organization(X,Z) | -organization(U,W) | greater(V,Y).
% 24 [] -reorganization(X,Y,Z) | -accountability(X,W,X1) | -accountability(X,U,V) | -reliability(X,X2,V) | -reliability(X,X3,X1) | -greater(X1,V) | -organization(X,V) | -organization(X,X1) | greater(X1,Z) | greater(X2,X3) | greater(Y,V).
% 25 [] -reorganization(X,Y,Z) | -accountability(X,W,X1) | -accountability(X,U,V) | -reliability(X,X2,V) | -reliability(X,X3,X1) | -greater(X1,V) | -organization(X,V) | -organization(X,X1) | greater(X1,Z) | greater(U,W) | greater(Y,V).
% 26 [] organization(sk4,sk7).
% 27 [] organization(sk4,sk8).
% 28 [] reorganization(sk4,sk9,sk10).
% 29 [] reproducibility(sk4,sk5,sk7).
% 30 [] reproducibility(sk4,sk6,sk8).
% 31 [] -greater(sk9,sk7).
% 32 [] greater(sk8,sk7).
% 33 [] -greater(sk8,sk10).
% 34 [] -greater(sk5,sk6).
% 45 [hyper:18,26] reliability(sk4,sk1(sk7,sk4),sk7).
% 46 [hyper:19,26] accountability(sk4,sk2(sk7,sk4),sk7).
% 58 [hyper:18,27] reliability(sk4,sk1(sk8,sk4),sk8).
% 59 [hyper:19,27] accountability(sk4,sk2(sk8,sk4),sk8).
% 595 [hyper:24,58,28,46,45,cut:27,slowcut:59,cut:32,cut:26,cut:33,cut:31] greater(sk1(sk7,sk4),sk1(sk8,sk4)).
% 1427 [hyper:25,59,28,46,cut:27,slowcut:58,cut:32,cut:26,slowcut:45,cut:31,cut:33] greater(sk2(sk7,sk4),sk2(sk8,sk4)).
% 1464 [hyper:23,1427,46,59,58,595,30,29,cut:26,cut:27,cut:45,cut:34] 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 21
% clause depth limited to 2
% seconds given: 27
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 25
% derived clauses: 1182
% kept clauses: 11
% kept size sum: 81
% kept mid-nuclei: 1102
% kept new demods: 0
% forw unit-subs: 58
% forw double-subs: 0
% forw overdouble-subs: 1
% backward subs: 1
% fast unit cutoff: 505
% full unit cutoff: 307
% dbl unit cutoff: 0
% real runtime : 0.5
% process. runtime: 0.5
% specific non-discr-tree subsumption statistics:
% tried: 793
% length fails: 0
% strength fails: 244
% predlist fails: 292
% aux str. fails: 209
% by-lit fails: 0
% full subs tried: 47
% full subs fail: 47
%
% ; 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/MGT007-1+noeq.in")
%
%------------------------------------------------------------------------------