%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SYN312-1 : TPTP v3.4.2. Bugfixed v2.0.0.
% Transfm  : add_equality:r
% Format   : otter:hypothesis:set(auto),clear(print_given)
% Command  : gandalf-wrapper -time %d %s

% Computer : art09.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/SYN/SYN312-1+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: hne
% detected subclass: small
% detected subclass: short
% 
% strategies selected: 
% (hyper 29 #f 3 5)
% (binary-unit 11 #f 3 5)
% (binary-double 17 #f 3 5)
% (hyper 29 #f)
% (binary-unit 34 #f)
% (binary-weightorder 40 #f)
% (binary 17 #t)
% (binary-order 29 #f)
% (binary-posweight-order 111 #f 3 5)
% (binary-posweight-order 283 #f)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(8,40,1,16,0,1,27301,4,2177)
% 
% 
% START OF PROOF
% 9 [] p(f(b),d,c).
% 10 [] p(a,f(b),c).
% 11 [] p(g(X),Y,Z) | -p(X,Y,Z).
% 12 [] p(X,Y,f(Z)) | -p(X,Y,Z).
% 13 [] -p(X,Y,Z) | p(Y,X,Z).
% 14 [] -p(X,Y,Z) | p(Z,Y,X).
% 15 [] -p(U,X,Z) | -p(X,Y,Z) | p(U,Y,Z).
% 16 [] -p(f(g(a)),f(g(d)),f(g(c))).
% 28 [hyper:15,10,9] p(a,d,c).
% 30 [hyper:11,28] p(g(a),d,c).
% 32 [hyper:13,28] p(d,a,c).
% 40 [hyper:15,32,28] p(d,d,c).
% 55 [hyper:14,40] p(c,d,d).
% 74 [hyper:13,55] p(d,c,d).
% 95 [hyper:11,74] p(g(d),c,d).
% 236 [hyper:14,30] p(c,d,g(a)).
% 417 [hyper:14,95] p(d,c,g(d)).
% 660 [hyper:11,236] p(g(c),d,g(a)).
% 1011 [hyper:12,417] p(d,c,f(g(d))).
% 2234 [hyper:12,660] p(g(c),d,f(g(a))).
% 3030 [hyper:14,1011] p(f(g(d)),c,d).
% 6171 [hyper:13,3030] p(c,f(g(d)),d).
% 7637 [hyper:11,6171] p(g(c),f(g(d)),d).
% 8143 [hyper:14,2234] p(f(g(a)),d,g(c)).
% 17935 [hyper:14,7637] p(d,f(g(d)),g(c)).
% 18587 [hyper:12,8143] p(f(g(a)),d,f(g(c))).
% 21566 [hyper:12,17935] p(d,f(g(d)),f(g(c))).
% 27302 [binary:15.3,16] -p(X,f(g(d)),f(g(c))) | -p(f(g(a)),X,f(g(c))).
% 27303 [binary:21566,27302,cut:18587] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% not using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 5
% clause depth limited to 3
% seconds given: 29
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    4810
%  derived clauses:   207615
%  kept clauses:      9279
%  kept size sum:     72329
%  kept mid-nuclei:   18002
%  kept new demods:   0
%  forw unit-subs:    172768
%  forw double-subs: 282
%  forw overdouble-subs: 0
%  backward subs:     0
%  fast unit cutoff:  1
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime:  21.81
%  process. runtime:  21.79
% specific non-discr-tree subsumption statistics: 
%  tried:           0
%  length fails:    0
%  strength fails:  0
%  predlist fails:  0
%  aux str. fails:  0
%  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/SYN/SYN312-1+noeq.in")
% 
%------------------------------------------------------------------------------