TSTP Solution File: MGT001-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : MGT001-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/MGT001-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 21)
% (binary-unit 28 #f 2 21)
% (binary-double 28 #f)
% (binary-posweight-order 28 #f 2 21)
% (binary 28 #t 2 21)
% (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(19,40,0,38,0,0)
%
%
% START OF PROOF
% 20 [] reliability(X,sk1(Y,X),Y) | -organization(X,Y).
% 21 [] accountability(X,sk2(Y,X),Y) | -organization(X,Y).
% 22 [] reproducibility(X,sk3(Y,X),Y) | -organization(X,Y).
% 23 [] -survival_chance(X,Y,Z) | -survival_chance(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 [] -reproducibility(X,Y,Z) | -reproducibility(U,V,W) | -accountability(X,X2,Z) | -accountability(U,X1,W) | -reliability(X,X4,Z) | -reliability(U,X3,W) | -greater(Y,V) | -organization(U,W) | -organization(X,Z) | greater(X4,X3).
% 25 [] -reproducibility(X,Y,Z) | -reproducibility(U,V,W) | -accountability(X,X2,Z) | -accountability(U,X1,W) | -reliability(X,X4,Z) | -reliability(U,X3,W) | -greater(Y,V) | -organization(U,W) | -organization(X,Z) | greater(X2,X1).
% 28 [] -inertia(X,Y,Z) | -inertia(U,V,W) | -reorganization_free(X,Z,Z) | -reorganization_free(U,W,W) | -reproducibility(X,X1,Z) | -reproducibility(U,X2,W) | -greater(Y,V) | -organization(U,W) | -organization(X,Z) | greater(X1,X2).
% 29 [] organization(sk4,sk6).
% 30 [] organization(sk5,sk7).
% 31 [] reorganization_free(sk4,sk6,sk6).
% 32 [] reorganization_free(sk5,sk7,sk7).
% 33 [] inertia(sk4,sk8,sk6).
% 34 [] inertia(sk5,sk9,sk7).
% 35 [] survival_chance(sk4,sk10,sk6).
% 36 [] survival_chance(sk5,sk11,sk7).
% 37 [] greater(sk9,sk8).
% 38 [] -greater(sk11,sk10).
% 51 [hyper:20,29] reliability(sk4,sk1(sk6,sk4),sk6).
% 52 [hyper:21,29] accountability(sk4,sk2(sk6,sk4),sk6).
% 53 [hyper:22,29] reproducibility(sk4,sk3(sk6,sk4),sk6).
% 66 [hyper:20,30] reliability(sk5,sk1(sk7,sk5),sk7).
% 67 [hyper:21,30] accountability(sk5,sk2(sk7,sk5),sk7).
% 68 [hyper:22,30] reproducibility(sk5,sk3(sk7,sk5),sk7).
% 293 [hyper:28,68,34,37,53,cut:32,cut:30,cut:31,cut:33,cut:29] greater(sk3(sk7,sk5),sk3(sk6,sk4)).
% 358 [hyper:24,293,53,68,66,51,cut:29,slowcut:52,cut:30,slowcut:67] greater(sk1(sk7,sk5),sk1(sk6,sk4)).
% 384 [hyper:25,293,53,68,52,67,cut:29,slowcut:51,cut:30,slowcut:66] greater(sk2(sk7,sk5),sk2(sk6,sk4)).
% 614 [hyper:23,384,67,52,35,36,66,358,cut:30,cut:29,cut:51] greater(sk11,sk10).
% 735 [hyper:38,614] 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: 57
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 25
% derived clauses: 644
% kept clauses: 11
% kept size sum: 63
% kept mid-nuclei: 612
% kept new demods: 0
% forw unit-subs: 15
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 349
% full unit cutoff: 68
% dbl unit cutoff: 0
% real runtime : 0.4
% process. runtime: 0.3
% specific non-discr-tree subsumption statistics:
% tried: 835
% length fails: 0
% strength fails: 349
% predlist fails: 217
% aux str. fails: 196
% by-lit fails: 0
% full subs tried: 73
% full subs fail: 73
%
% ; 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/MGT001-1+noeq.in")
%
%------------------------------------------------------------------------------