TSTP Solution File: MGT010-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : MGT010-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/MGT010-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 23)
% (binary-unit 28 #f 2 23)
% (binary-double 28 #f)
% (binary-posweight-order 28 #f 2 23)
% (binary 28 #t 2 23)
% (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,1,38,0,2)
%
%
% START OF PROOF
% 20 [] reproducibility(X,sk1(Y,X),Y) | -organization(X,Y).
% 21 [] -accountability(X,Y,Z) | -accountability(U,V,W) | -reliability(X,X2,Z) | -reliability(U,X1,W) | -reproducibility(X,X4,Z) | -reproducibility(U,X3,W) | -greater(X4,X3) | -organization(U,W) | -organization(X,Z) | greater(X2,X1).
% 22 [] -accountability(X,Y,Z) | -accountability(U,V,W) | -reliability(X,X2,Z) | -reliability(U,X1,W) | -reproducibility(X,X4,Z) | -reproducibility(U,X3,W) | -greater(X4,X3) | -organization(U,W) | -organization(X,Z) | greater(Y,V).
% 24 [] -size(X,Y,Z) | -size(U,V,W) | -class(U,X1,W) | -class(X,X1,Z) | -reorganization_free(X,Z,Z) | -reorganization_free(U,W,W) | -reproducibility(X,X2,Z) | -reproducibility(U,X3,W) | -greater(Y,V) | -organization(X,Z) | -organization(U,W) | greater(X2,X3).
% 25 [] organization(sk2,sk11).
% 26 [] organization(sk3,sk12).
% 27 [] reorganization_free(sk2,sk11,sk11).
% 28 [] reorganization_free(sk3,sk12,sk12).
% 29 [] class(sk2,sk4,sk11).
% 30 [] class(sk3,sk4,sk12).
% 31 [] reliability(sk2,sk5,sk11).
% 32 [] reliability(sk3,sk6,sk12).
% 33 [] accountability(sk2,sk7,sk11).
% 34 [] accountability(sk3,sk8,sk12).
% 35 [] size(sk2,sk9,sk11).
% 36 [] size(sk3,sk10,sk12).
% 37 [] greater(sk10,sk9).
% 38 [] -greater(sk6,sk5) | -greater(sk8,sk7).
% 51 [hyper:20,25] reproducibility(sk2,sk1(sk11,sk2),sk11).
% 64 [hyper:20,26] reproducibility(sk3,sk1(sk12,sk3),sk12).
% 798 [hyper:24,64,36,30,37,51,cut:28,cut:26,cut:27,cut:29,cut:35,cut:25] greater(sk1(sk12,sk3),sk1(sk11,sk2)).
% 967 [hyper:21,798,51,64,32,31,cut:25,slowcut:33,cut:26,slowcut:34] greater(sk6,sk5).
% 993 [hyper:22,798,51,64,33,34,cut:25,slowcut:31,cut:26,slowcut:32] greater(sk8,sk7).
% 1085 [hyper:38,967,cut:993] 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 23
% clause depth limited to 2
% seconds given: 57
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 21
% derived clauses: 991
% kept clauses: 5
% kept size sum: 25
% kept mid-nuclei: 961
% kept new demods: 0
% forw unit-subs: 20
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 401
% full unit cutoff: 76
% dbl unit cutoff: 0
% real runtime : 0.5
% process. runtime: 0.4
% specific non-discr-tree subsumption statistics:
% tried: 587
% length fails: 0
% strength fails: 166
% predlist fails: 223
% aux str. fails: 158
% by-lit fails: 0
% full subs tried: 40
% full subs fail: 40
%
% ; 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/MGT010-1+noeq.in")
%
%------------------------------------------------------------------------------