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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : GEO045-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 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/GEO045-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(59,40,0,118,0,0)
% 
% 
% START OF PROOF
% 106 [] -between(X,Y,Z) | between(Z,Y,X).
% 114 [] -between(X,Y,Z) | -between(Y,Z,U) | between(X,Z,U) | equal(Y,Z).
% 115 [] between(u,v,w).
% 116 [] between(v,w,x).
% 117 [] -equal(v,w).
% 118 [] -between(u,v,x).
% 213 [hyper:106,115] between(w,v,u).
% 268 [hyper:106,116] between(x,w,v).
% 281 [hyper:114,116,115,cut:117] between(u,w,x).
% 443 [hyper:114,268,213] between(x,v,u) | equal(w,v).
% 16461 [hyper:106,443,cut:118] equal(w,v).
% 16529 [para:16461.1.1,281.1.2,cut:118] 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:    67
%  derived clauses:   31554
%  kept clauses:      3128
%  kept size sum:     52579
%  kept mid-nuclei:   13267
%  kept new demods:   7
%  forw unit-subs:    8816
%  forw double-subs: 3370
%  forw overdouble-subs: 37
%  backward subs:     3
%  fast unit cutoff:  2529
%  full unit cutoff:  0
%  dbl  unit cutoff:  2
%  real runtime  :  0.70
%  process. runtime:  0.69
% specific non-discr-tree subsumption statistics: 
%  tried:           5768
%  length fails:    38
%  strength fails:  406
%  predlist fails:  2734
%  aux str. fails:  660
%  by-lit fails:    7
%  full subs tried: 1902
%  full subs fail:  1886
% 
% ; 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/GEO045-3+eq_r.in")
% 
%------------------------------------------------------------------------------