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

View Problem - Process Solution

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

% Computer : art01.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/GEO009-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(84,40,1,168,0,1)
% 
% 
% START OF PROOF
% 109 [] -equidistant(X,Y,Z,U) | equidistant(X,Y,U,Z).
% 117 [] between(X,Y,reflection(X,Y)).
% 118 [] equidistant(X,reflection(Y,X),Y,X).
% 122 [] equidistant(X,X,Y,Y).
% 132 [] -between(X,Y,Z) | between(Z,Y,X).
% 133 [] between(X,X,Y).
% 135 [] -between(X,Y,Z) | -between(X,Z,Y) | equal(Z,Y).
% 139 [] -between(X,Y,Z) | -between(X,U,Y) | between(U,Y,Z).
% 143 [] -between(X,Y,Z) | -between(X,U,Y) | between(X,U,Z).
% 161 [] -equidistant(X,Y,Z,U) | -equidistant(X,V,Z,W) | -equidistant(V,Y,W,U) | -between(X,V,Y) | between(Z,W,U).
% 163 [] -between(X,Y,Z) | -between(X,Y,U) | between(Y,Z,U) | between(Y,U,Z) | equal(X,Y).
% 165 [] between(a,c,e).
% 166 [] between(a,d,e).
% 167 [] -between(a,c,d).
% 168 [] -between(a,d,c).
% 255 [hyper:132,165] between(e,c,a).
% 441 [hyper:132,166] between(e,d,a).
% 1357 [hyper:139,117,255] between(c,a,reflection(e,a)).
% 1358 [hyper:139,117,441] between(d,a,reflection(e,a)).
% 2640 [hyper:132,1357] between(reflection(e,a),a,c).
% 2934 [hyper:132,1358] between(reflection(e,a),a,d).
% 9462 [hyper:163,2934,2640,cut:167,cut:168] equal(reflection(e,a),a).
% 10417 [para:9462.1.1,118.1.2] equidistant(a,a,e,a).
% 10470 [hyper:109,10417] equidistant(a,a,a,e).
% 10626 [hyper:161,10417,122,cut:133,cut:10470] between(e,a,e).
% 10868 [hyper:143,10626,cut:133] between(e,a,X).
% 12907 [hyper:135,10868,441] equal(d,a).
% 13328 [para:12907.1.2,2640.1.2,demod:9462,cut:168] 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 3
% seconds given: 25
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    62
%  derived clauses:   24047
%  kept clauses:      2930
%  kept size sum:     48675
%  kept mid-nuclei:   10209
%  kept new demods:   57
%  forw unit-subs:    8151
%  forw double-subs: 1677
%  forw overdouble-subs: 102
%  backward subs:     3
%  fast unit cutoff:  1723
%  full unit cutoff:  2
%  dbl  unit cutoff:  11
%  real runtime  :  0.60
%  process. runtime:  0.59
% specific non-discr-tree subsumption statistics: 
%  tried:           18825
%  length fails:    119
%  strength fails:  2586
%  predlist fails:  9373
%  aux str. fails:  1589
%  by-lit fails:    0
%  full subs tried: 5106
%  full subs fail:  5056
% 
% ; 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/GEO009-3+eq_r.in")
% 
%------------------------------------------------------------------------------