%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GEO111-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 10.0s
% Output : Assurance 10.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/GEO111-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)
%
%
% SOS clause
% -incident_c(sk16,sk15) | -incident_c(sk17,sk15) | -incident_c(sk18,sk15) | equal(sk16,sk17) | equal(sk17,sk18) | equal(sk16,sk18).
% was split for some strategies as:
% -incident_c(sk16,sk15).
% -incident_c(sk17,sk15).
% -incident_c(sk18,sk15).
% equal(sk16,sk17).
% equal(sk17,sk18).
% equal(sk16,sk18).
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(57,40,0,114,0,0,62878,4,934,80299,5,1209,80300,1,1209,80300,50,1210,80300,40,1210,80357,0,1210)
%
%
% START OF PROOF
% 168 [?] ?
% 80301 [] equal(X,X).
% 80302 [] -incident_c(X,Y) | -part_of(Y,Z) | incident_c(X,Z).
% 80314 [] -end_point(X,Y) | incident_c(X,Y).
% 80322 [] -inner_point(X,Y) | incident_c(X,Y).
% 80323 [] -inner_point(X,Y) | -end_point(X,Y).
% 80350 [] -between_c(X,Y,Z,U) | -equal(Y,U).
% 80351 [] part_of(ax1_sk1(X,Y,Z,U),U) | -between_c(U,Z,Y,X).
% 80352 [] end_point(X,ax1_sk1(Y,Z,X,U)) | -between_c(U,X,Z,Y).
% 80353 [] end_point(X,ax1_sk1(X,Y,Z,U)) | -between_c(U,Z,Y,X).
% 80354 [] inner_point(X,ax1_sk1(Y,X,Z,U)) | -between_c(U,Z,X,Y).
% 80356 [] between_c(sk15,sk16,sk17,sk18).
% 80357 [] -incident_c(sk17,sk15) | -incident_c(sk18,sk15) | -incident_c(sk16,sk15) | equal(sk17,sk18) | equal(sk16,sk18) | equal(sk16,sk17).
% 80406 [binary:80356,80350] -equal(sk16,sk18).
% 80407 [para:80357.5.2,80406.1.2,cut:80301] -incident_c(sk17,sk15) | -incident_c(sk18,sk15) | -incident_c(sk16,sk15) | equal(sk16,sk17) | equal(sk17,sk18).
% 80894 [binary:80356,80351.2] part_of(ax1_sk1(sk18,sk17,sk16,sk15),sk15).
% 80895 [binary:80302.2,80894] -incident_c(X,ax1_sk1(sk18,sk17,sk16,sk15)) | incident_c(X,sk15).
% 80931 [binary:80356,80352.2] end_point(sk16,ax1_sk1(sk18,sk17,sk16,sk15)).
% 80934 [binary:80314,80931] incident_c(sk16,ax1_sk1(sk18,sk17,sk16,sk15)).
% 80935 [binary:80323.2,80931] -inner_point(sk16,ax1_sk1(sk18,sk17,sk16,sk15)).
% 81015 [binary:80356,80353.2] end_point(sk18,ax1_sk1(sk18,sk17,sk16,sk15)).
% 81016 [binary:80314,81015] incident_c(sk18,ax1_sk1(sk18,sk17,sk16,sk15)).
% 81017 [binary:80323.2,81015] -inner_point(sk18,ax1_sk1(sk18,sk17,sk16,sk15)).
% 81091 [binary:80356,80354.2] inner_point(sk17,ax1_sk1(sk18,sk17,sk16,sk15)).
% 81092 [binary:80322,81091] incident_c(sk17,ax1_sk1(sk18,sk17,sk16,sk15)).
% 81329 [binary:80934,80895] incident_c(sk16,sk15).
% 81330 [binary:81016,80895] incident_c(sk18,sk15).
% 81331 [binary:81092,80895] incident_c(sk17,sk15).
% 83420 [para:80407.5.2,81017.1.1,cut:168,cut:81330,cut:81331,cut:81329] equal(sk16,sk17).
% 83421 [para:83420.1.2,80356.1.3] between_c(sk15,sk16,sk16,sk18).
% 83430 [para:83420.1.2,80935.1.2.2,binarydemod:80354,cut:83421] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using unit strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% clause length limited to 23
% clause depth limited to 3
% seconds given: 4
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 695
% derived clauses: 280184
% kept clauses: 40005
% kept size sum: 0
% kept mid-nuclei: 41137
% kept new demods: 0
% forw unit-subs: 28361
% forw double-subs: 50018
% forw overdouble-subs: 87943
% backward subs: 31
% fast unit cutoff: 4980
% full unit cutoff: 247
% dbl unit cutoff: 271
% real runtime : 12.38
% process. runtime: 12.35
% specific non-discr-tree subsumption statistics:
% tried: 4209948
% length fails: 582820
% strength fails: 571195
% predlist fails: 2147527
% aux str. fails: 31607
% by-lit fails: 200690
% full subs tried: 267830
% full subs fail: 228003
%
% ; 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/GEO111-1+eq_r.in")
%
%------------------------------------------------------------------------------