TSTP Solution File: GEO006-1 by Gandalf---c-2.6

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : GEO006-1 : TPTP v3.4.2. Bugfixed v2.5.0.
% Transfm  : add_equality:r
% Format   : otter:hypothesis:set(auto),clear(print_given)
% Command  : gandalf-wrapper -time %d %s

% Computer : art04.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/GEO006-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 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)
% 
% 
% SOS clause 
% between(c,a,d) | between(a,d,c).
% was split for some strategies as: 
% between(c,a,d).
% between(a,d,c).
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(26,40,1,52,0,1)
% 
% 
% START OF PROOF
% 28 [] -between(X,Y,X) | equal(X,Y).
% 29 [] -between(Y,U,Z) | -between(X,Y,Z) | between(X,Y,U).
% 31 [] equidistant(X,Y,Y,X).
% 32 [] -equidistant(X,Y,Z,Z) | equal(X,Y).
% 33 [] -equidistant(X,Y,V,W) | -equidistant(X,Y,Z,U) | equidistant(Z,U,V,W).
% 34 [] between(X,outer_pasch(Y,X,Z,U,V),Z) | -between(Z,V,U) | -between(X,Y,V).
% 35 [] between(X,Y,outer_pasch(Y,Z,U,X,V)) | -between(U,V,X) | -between(Z,Y,V).
% 39 [] -equidistant(X,X1,Z,X2) | -equidistant(Y,X1,U,X2) | -equidistant(X,Y,Z,U) | -equidistant(Y,V,U,W) | equidistant(V,X1,W,X2) | -between(X,Y,V) | -between(Z,U,W) | equal(X,Y).
% 40 [] between(X,Y,extension(X,Y,Z,U)).
% 41 [] equidistant(X,extension(Y,X,Z,U),Z,U).
% 48 [] -equal(a,c).
% 50 [] -equal(c,d).
% 51 [] between(a,c,d).
% 52 [] between(c,a,d) | between(a,d,c).
% 79 [hyper:29,52,51] between(a,d,c) | between(a,c,a).
% 167 [hyper:33,31,31] equidistant(X,Y,X,Y).
% 444 [hyper:28,79,cut:48] between(a,d,c).
% 704 [hyper:32,41] equal(X,extension(Y,X,Z,Z)).
% 756 [hyper:39,41,40,167,167,51,cut:167,cut:48] equidistant(extension(a,c,c,d),X,d,X).
% 780 [para:704.1.2,40.1.3] between(X,Y,Y).
% 784 [hyper:34,780,51] between(a,outer_pasch(c,a,X,d,d),X).
% 787 [hyper:34,780,444] between(a,outer_pasch(d,a,X,c,c),X).
% 794 [hyper:35,780,51] between(d,c,outer_pasch(c,a,X,d,d)).
% 797 [hyper:35,780,444] between(c,d,outer_pasch(d,a,X,c,c)).
% 4645 [hyper:32,756] equal(extension(a,c,c,d),d).
% 6355 [hyper:28,784] equal(a,outer_pasch(c,a,a,d,d)).
% 6568 [hyper:28,787] equal(a,outer_pasch(d,a,a,c,c)).
% 17912 [para:6355.1.2,794.1.3] between(d,c,a).
% 21844 [para:6568.1.2,797.1.3] between(c,d,a).
% 21846 [hyper:29,21844,17912] between(d,c,d).
% 23310 [hyper:28,21846] equal(d,c).
% 23635 [para:23310.1.1,4645.1.1.4,demod:704,cut:50] 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 15
% clause depth limited to 2
% seconds given: 12
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    112
%  derived clauses:   92707
%  kept clauses:      815
%  kept size sum:     13624
%  kept mid-nuclei:   22751
%  kept new demods:   18
%  forw unit-subs:    26132
%  forw double-subs: 1340
%  forw overdouble-subs: 429
%  backward subs:     30
%  fast unit cutoff:  4382
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  1.55
%  process. runtime:  1.54
% specific non-discr-tree subsumption statistics: 
%  tried:           8591
%  length fails:    0
%  strength fails:  930
%  predlist fails:  5062
%  aux str. fails:  379
%  by-lit fails:    0
%  full subs tried: 2207
%  full subs fail:  1791
% 
% ; 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/GEO006-1+eq_r.in")
% 
%------------------------------------------------------------------------------