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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : GEO039-3 : 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 : art10.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 9.8s
% Output   : Assurance 9.8s
% 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-3+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 15)
% (binary-unit 9 #f 3 15)
% (binary-double 9 #f 3 15)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 3 15)
% (binary-order 25 #f 3 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(48,40,0,96,0,0,234736,4,1888)
% 
% 
% START OF PROOF
% 50 [] equidistant(X,Y,Y,X).
% 51 [] -equidistant(X,Y,V,W) | -equidistant(X,Y,Z,U) | equidistant(Z,U,V,W).
% 52 [] -equidistant(X,Y,Z,Z) | equal(X,Y).
% 56 [] -between(X,Y,X) | equal(X,Y).
% 57 [] between(X,inner_pasch(Y,X,Z,U,V),V) | -between(V,U,Z) | -between(Y,X,Z).
% 58 [] between(X,inner_pasch(Y,Z,U,X,V),Y) | -between(V,X,U) | -between(Y,Z,U).
% 75 [] -equidistant(X,Y,Z,U) | equidistant(U,Z,X,Y).
% 77 [] -equidistant(Z,U,V,W) | -equidistant(X,Y,Z,U) | equidistant(X,Y,V,W).
% 80 [] between(X,Y,reflection(X,Y)).
% 81 [] equidistant(X,reflection(Y,X),Y,X).
% 82 [] equal(X,reflection(Y,X)) | -equal(Y,X).
% 83 [] equal(X,reflection(X,X)).
% 85 [] equidistant(X,X,Y,Y).
% 86 [] -equidistant(X,Y,Z,U) | -equidistant(Y,V,U,W) | equidistant(X,V,Z,W) | -between(Z,U,W) | -between(X,Y,V).
% 93 [] between(X,Y,Y).
% 94 [] between(u,w,x).
% 95 [] equal(u,x).
% 96 [] -between(v,w,x).
% 97 [hyper:82,95] equal(x,reflection(u,x)).
% 101 [hyper:57,93,93] between(X,inner_pasch(Y,X,X,X,Z),Z).
% 104 [hyper:58,93,93] between(X,inner_pasch(Y,X,X,X,Z),Y).
% 158 [para:95.1.2,94.1.3] between(u,w,u).
% 197 [hyper:56,158] equal(u,w).
% 231 [hyper:82,197] equal(w,reflection(u,w)).
% 477 [para:197.1.2,231.1.2.2,demod:83] equal(w,u).
% 478 [hyper:82,477] equal(u,reflection(w,u)).
% 884 [hyper:86,81,80,50,158,demod:478] equidistant(w,u,u,u).
% 888 [para:97.1.2,81.1.2] equidistant(x,x,u,x).
% 901 [hyper:77,884,85] equidistant(w,u,X,X).
% 1201 [hyper:51,901,50] equidistant(u,w,X,X).
% 1622 [hyper:51,888,85] equidistant(u,x,X,X).
% 39340 [hyper:56,101] equal(X,inner_pasch(Y,X,X,X,X)).
% 46230 [para:39340.1.2,104.1.2] between(X,X,Y).
% 48509 [hyper:86,46230,1201,94,50] equidistant(u,x,x,w).
% 50693 [hyper:51,48509,1622] equidistant(X,X,x,w).
% 52759 [hyper:75,50693] equidistant(w,x,X,X).
% 64582 [hyper:52,52759] equal(w,x).
% 236527 [para:64582.1.1,96.1.2,cut:93] 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 3
% seconds given: 25
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    252
%  derived clauses:   1139108
%  kept clauses:      9747
%  kept size sum:     206511
%  kept mid-nuclei:   226577
%  kept new demods:   51
%  forw unit-subs:    789649
%  forw double-subs: 39052
%  forw overdouble-subs: 5257
%  backward subs:     19
%  fast unit cutoff:  47287
%  full unit cutoff:  0
%  dbl  unit cutoff:  65
%  real runtime  :  19.17
%  process. runtime:  18.98
% specific non-discr-tree subsumption statistics: 
%  tried:           48947
%  length fails:    583
%  strength fails:  4833
%  predlist fails:  20306
%  aux str. fails:  2221
%  by-lit fails:    0
%  full subs tried: 21004
%  full subs fail:  15730
% 
% ; 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-3+eq_r.in")
% 
%------------------------------------------------------------------------------