%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GEO112-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 : art06.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/GEO112-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(57,40,0,114,0,0)
%
%
% START OF PROOF
% 58 [] equal(X,X).
% 107 [] -between_c(X,Y,Z,U) | -equal(Y,U).
% 108 [] part_of(ax1_sk1(X,Y,Z,U),U) | -between_c(U,Z,Y,X).
% 109 [] end_point(X,ax1_sk1(Y,Z,X,U)) | -between_c(U,X,Z,Y).
% 110 [] end_point(X,ax1_sk1(X,Y,Z,U)) | -between_c(U,Z,Y,X).
% 111 [] inner_point(X,ax1_sk1(Y,X,Z,U)) | -between_c(U,Z,X,Y).
% 112 [] between_c(X,Y,Z,U) | -inner_point(Z,V) | -end_point(U,V) | -end_point(Y,V) | -part_of(V,X) | equal(Y,U).
% 113 [] between_c(sk15,sk16,sk17,sk18).
% 114 [] -between_c(sk15,sk18,sk17,sk16).
% 165 [hyper:108,113] part_of(ax1_sk1(sk18,sk17,sk16,sk15),sk15).
% 166 [hyper:109,113] end_point(sk16,ax1_sk1(sk18,sk17,sk16,sk15)).
% 167 [hyper:110,113] end_point(sk18,ax1_sk1(sk18,sk17,sk16,sk15)).
% 168 [hyper:111,113] inner_point(sk17,ax1_sk1(sk18,sk17,sk16,sk15)).
% 776 [hyper:112,168,165,166,167,cut:114] equal(sk18,sk16).
% 826 [para:776.1.1,113.1.4] between_c(sk15,sk16,sk17,sk16).
% 832 [hyper:107,826,cut:58] 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: 33
% derived clauses: 1088
% kept clauses: 205
% kept size sum: 4167
% kept mid-nuclei: 491
% kept new demods: 1
% forw unit-subs: 149
% forw double-subs: 75
% forw overdouble-subs: 79
% backward subs: 0
% fast unit cutoff: 14
% full unit cutoff: 0
% dbl unit cutoff: 1
% real runtime : 0.5
% process. runtime: 0.4
% specific non-discr-tree subsumption statistics:
% tried: 566
% length fails: 46
% strength fails: 116
% predlist fails: 198
% aux str. fails: 3
% by-lit fails: 0
% full subs tried: 156
% full subs fail: 115
%
% ; 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/GEO112-1+eq_r.in")
%
%------------------------------------------------------------------------------