TSTP Solution File: GEO039-2 by Gandalf---c-2.6

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : GEO039-2 : 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 : art08.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/GEO039-2+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 2 15)
% (binary-unit 9 #f 2 15)
% (binary-double 9 #f 2 15)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 2 15)
% (binary-order 25 #f 2 15)
% (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(22,40,0,44,0,0,118538,4,1918)
% 
% 
% START OF PROOF
% 26 [] -equidistant(X,Y,Z,Z) | equal(X,Y).
% 27 [] between(X,Y,extension(X,Y,Z,U)).
% 28 [] equidistant(X,extension(Y,X,Z,U),Z,U).
% 30 [] -between(X,Y,X) | equal(X,Y).
% 31 [] between(X,inner_pasch(Y,X,Z,U,V),V) | -between(V,U,Z) | -between(Y,X,Z).
% 32 [] between(X,inner_pasch(Y,Z,U,X,V),Y) | -between(V,X,U) | -between(Y,Z,U).
% 42 [] between(u,w,x).
% 43 [] equal(u,x).
% 44 [] -between(v,w,x).
% 65 [para:43.1.2,42.1.3] between(u,w,u).
% 104 [hyper:30,65] equal(u,w).
% 326 [hyper:26,28] equal(X,extension(Y,X,Z,Z)).
% 381 [para:326.1.2,27.1.3] between(X,Y,Y).
% 419 [hyper:31,381,42] between(w,inner_pasch(u,w,x,x,X),X).
% 423 [hyper:31,381,381] between(X,inner_pasch(Y,X,X,X,Z),Z).
% 433 [hyper:32,381,381] between(X,inner_pasch(Y,X,X,X,Z),Y).
% 2103 [hyper:30,423] equal(X,inner_pasch(Y,X,X,X,X)).
% 2216 [para:2103.1.2,433.1.2] between(X,X,Y).
% 2218 [hyper:31,2216,42] between(w,inner_pasch(u,w,x,X,X),X).
% 2222 [hyper:31,2216,381] between(X,inner_pasch(Y,X,X,Z,Z),Z).
% 2238 [hyper:32,2216,381] between(X,inner_pasch(Y,Y,X,X,Z),Y).
% 3871 [hyper:30,2218] equal(w,inner_pasch(u,w,x,w,w)).
% 3906 [para:43.1.2,3871.1.2.3] equal(w,inner_pasch(u,w,u,w,w)).
% 3910 [para:104.1.2,3906.1.2.2] equal(w,inner_pasch(u,u,u,w,w)).
% 3920 [para:104.1.2,3910.1.2.5] equal(w,inner_pasch(u,u,u,w,u)).
% 5391 [hyper:30,419] equal(w,inner_pasch(u,w,x,x,w)).
% 5429 [para:104.1.2,5391.1.2.2] equal(w,inner_pasch(u,u,x,x,w)).
% 5433 [para:5429.1.2,2238.1.2] between(x,w,u).
% 5732 [hyper:31,5433,2216] between(X,inner_pasch(X,X,u,w,x),x).
% 6183 [hyper:30,5732] equal(x,inner_pasch(x,x,u,w,x)).
% 6209 [para:43.1.2,6183.1.2.1] equal(x,inner_pasch(u,x,u,w,x)).
% 6210 [para:43.1.2,6183.1.2.2] equal(x,inner_pasch(x,u,u,w,x)).
% 6211 [para:43.1.2,6183.1.2.5] equal(x,inner_pasch(x,x,u,w,u)).
% 6212 [para:43.1.2,6209.1.2.2] equal(x,inner_pasch(u,u,u,w,x)).
% 6213 [para:43.1.2,6209.1.2.5] equal(x,inner_pasch(u,x,u,w,u)).
% 6218 [para:43.1.2,6212.1.2.5,demod:3920] equal(x,w).
% 6244 [para:6218.1.1,6210.1.2.5] equal(x,inner_pasch(x,u,u,w,w)).
% 6245 [para:6218.1.1,6211.1.2.1] equal(x,inner_pasch(w,x,u,w,u)).
% 6261 [para:6244.1.2,2222.1.2] between(u,x,w).
% 6388 [para:104.1.2,6261.1.3] between(u,x,u).
% 6567 [hyper:32,6388,65,demod:6213] between(w,x,u).
% 7003 [hyper:32,6567,65,demod:6245] between(w,x,w).
% 7589 [hyper:30,7003] equal(w,x).
% 118864 [para:7589.1.1,44.1.2,cut:381] 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 15
% clause depth limited to 2
% seconds given: 25
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    393
%  derived clauses:   1694425
%  kept clauses:      1839
%  kept size sum:     20845
%  kept mid-nuclei:   116312
%  kept new demods:   183
%  forw unit-subs:    1063758
%  forw double-subs: 19481
%  forw overdouble-subs: 61
%  backward subs:     87
%  fast unit cutoff:  39745
%  full unit cutoff:  12
%  dbl  unit cutoff:  634
%  real runtime  :  19.20
%  process. runtime:  19.20
% specific non-discr-tree subsumption statistics: 
%  tried:           15493
%  length fails:    16
%  strength fails:  3420
%  predlist fails:  5644
%  aux str. fails:  1097
%  by-lit fails:    0
%  full subs tried: 5316
%  full subs fail:  5255
% 
% ; 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/GEO039-2+eq_r.in")
% 
%------------------------------------------------------------------------------