%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GEO085-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 : art05.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/GEO/GEO085-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: neq
% detected subclass: medium
%
% strategies selected:
% (hyper 25 #f 3 23)
% (binary-unit 9 #f 3 23)
% (binary-double 9 #f 3 23)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 3 23)
% (binary-order 25 #f 3 23)
% (binary-posweight-order 101 #f)
% (binary-posweight-lex-big-order 25 #f)
% (binary-posweight-lex-small-order 9 #f)
% (binary-order-sos 50 #t)
% (binary-unit-uniteq 25 #f)
% (binary-weightorder 50 #f)
% (binary-order 50 #f)
% (hyper-order 30 #f)
% (binary 112 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(51,40,1,102,0,1)
%
%
% START OF PROOF
% 52 [] equal(X,X).
% 85 [] end_point(ax0_sk7(X),X) | -open(X).
% 93 [] end_point(ax0_sk11(X,Y),Y) | -end_point(X,Y).
% 94 [] -equal(X,ax0_sk11(X,Y)) | -end_point(X,Y).
% 101 [] open(sk14).
% 102 [] -end_point(Y,sk14) | -end_point(X,sk14) | equal(Y,X).
% 110 [hyper:85,101] end_point(ax0_sk7(sk14),sk14).
% 170 [hyper:93,110] end_point(ax0_sk11(ax0_sk7(sk14),sk14),sk14).
% 199 [hyper:102,170,110] equal(ax0_sk11(ax0_sk7(sk14),sk14),ax0_sk7(sk14)).
% 219 [hyper:94,170,demod:199,cut:52] 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 3
% seconds given: 25
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 11
% derived clauses: 160
% kept clauses: 22
% kept size sum: 206
% kept mid-nuclei: 87
% kept new demods: 1
% forw unit-subs: 25
% forw double-subs: 9
% forw overdouble-subs: 6
% backward subs: 0
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.1
% process. runtime: 0.0
% specific non-discr-tree subsumption statistics:
% tried: 88
% length fails: 0
% strength fails: 10
% predlist fails: 24
% aux str. fails: 16
% by-lit fails: 0
% full subs tried: 38
% full subs fail: 30
%
% ; 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/GEO/GEO085-1+eq_r.in")
%
%------------------------------------------------------------------------------