%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRA001-1 : TPTP v3.4.2. Released v1.0.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/GRA/GRA001-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 1 5)
% (binary-unit 10 #f 1 5)
% (binary-double 16 #f 1 5)
% (binary 54 #t 1 5)
% (binary-order 27 #f 1 5)
% (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)
%
%
% SOS clause
% -a(0) | -c(0) | -d(0).
% was split for some strategies as:
% -a(0).
% -c(0).
% -d(0).
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(12,40,0,24,0,0)
%
%
% START OF PROOF
% 13 [] -d(0) | e(0).
% 14 [] -e(0) | d(0).
% 15 [] -b(0) | e(0) | c(0).
% 16 [] -c(0) | e(0) | b(0).
% 17 [] -e(0) | c(0) | b(0).
% 18 [] -a(0) | d(0) | c(0).
% 19 [] -c(0) | d(0) | a(0).
% 20 [] -d(0) | c(0) | a(0).
% 21 [] b(0) | a(0).
% 22 [] -b(0) | -a(0).
% 23 [] -d(0) | -c(0) | -a(0).
% 24 [] -e(0) | -c(0) | -b(0).
% 31 [hyper:15,21] e(0) | c(0) | a(0).
% 44 [hyper:18,31,binarycut:14] d(0) | c(0).
% 46 [hyper:19,31,binarycut:14] d(0) | a(0).
% 48 [hyper:13,44] e(0) | c(0).
% 50 [hyper:16,44,binarycut:14] d(0) | b(0).
% 51 [hyper:20,44] c(0) | a(0).
% 58 [hyper:17,48] c(0) | b(0).
% 61 [hyper:22,50,46] d(0).
% 64 [hyper:23,50,21,binarycut:58] b(0).
% 67 [hyper:13,61] e(0).
% 76 [hyper:22,51,cut:64] c(0).
% 77 [hyper:24,51,cut:67,cut:64] a(0).
% 78 [hyper:23,76,cut:61,cut:77] 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 5
% clause depth limited to 1
% seconds given: 13
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 22
% derived clauses: 107
% kept clauses: 16
% kept size sum: 60
% kept mid-nuclei: 15
% kept new demods: 0
% forw unit-subs: 8
% forw double-subs: 17
% forw overdouble-subs: 4
% backward subs: 25
% fast unit cutoff: 7
% full unit cutoff: 0
% dbl unit cutoff: 4
% real runtime : 0.5
% process. runtime: 0.1
% specific non-discr-tree subsumption statistics:
% tried: 14
% length fails: 0
% strength fails: 0
% predlist fails: 10
% 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/GRA/GRA001-1+noeq.in")
%
%------------------------------------------------------------------------------