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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : HEN006-1 : 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 : art02.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/HEN/HEN006-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: heq
% detected subclass: medium
% detected subclass: long
% 
% strategies selected: 
% (hyper 58 #f 2 11)
% (binary-posweight-order 29 #f 2 11)
% (binary-unit 29 #f 2 11)
% (binary-double 29 #f 2 11)
% (binary 29 #t 2 11)
% (hyper 29 #t)
% (hyper 105 #f)
% (binary-unit-uniteq 17 #f)
% (binary-weightorder 23 #f)
% (binary-posweight-order 70 #f)
% (binary-posweight-lex-big-order 29 #f)
% (binary-posweight-lex-small-order 11 #f)
% (binary-order 29 #f)
% (binary-unit 46 #f)
% (binary 67 #t)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(14,40,0,28,0,0,1158,50,3,1172,0,3)
% 
% 
% START OF PROOF
% 1160 [] quotient(X,Y,zero) | -less_equal(X,Y).
% 1161 [] -quotient(X,Y,zero) | less_equal(X,Y).
% 1162 [] -quotient(X,Y,Z) | less_equal(Z,X).
% 1163 [] -quotient(Z,U,X2) | -quotient(V,W,X1) | -quotient(Y,U,W) | -quotient(X,U,V) | -quotient(X,Y,Z) | less_equal(X1,X2).
% 1164 [] less_equal(zero,X).
% 1165 [] -less_equal(Y,X) | -less_equal(X,Y) | equal(X,Y).
% 1167 [] quotient(X,Y,divide(X,Y)).
% 1169 [] quotient(x,y,x^qy).
% 1170 [] less_equal(x^qy,z).
% 1171 [] quotient(x,z,x^qz).
% 1172 [] -less_equal(x^qz,y).
% 1173 [hyper:1160,1164] quotient(zero,X,zero).
% 1179 [hyper:1160,1170] quotient(x^qy,z,zero).
% 1334 [hyper:1162,1167] less_equal(divide(X,Y),X).
% 1990 [hyper:1163,1167,1169,1167,1171,1179] less_equal(divide(x^qz,divide(y,z)),zero).
% 2221 [hyper:1160,1334] quotient(divide(X,Y),X,zero).
% 4078 [hyper:1165,1990,cut:1164] equal(zero,divide(x^qz,divide(y,z))).
% 5010 [para:4078.1.2,1167.1.3] quotient(x^qz,divide(y,z),zero).
% 5117 [hyper:1163,5010,1167,1167,2221,1173] less_equal(divide(divide(x^qz,y),zero),zero).
% 5365 [hyper:1165,5117,cut:1164] equal(zero,divide(divide(x^qz,y),zero)).
% 5366 [para:5365.1.2,1167.1.3] quotient(divide(x^qz,y),zero,zero).
% 5368 [hyper:1161,5366] less_equal(divide(x^qz,y),zero).
% 5685 [hyper:1165,5368,cut:1164] equal(zero,divide(x^qz,y)).
% 5686 [para:5685.1.2,1167.1.3] quotient(x^qz,y,zero).
% 5690 [hyper:1161,5686,cut:1172] 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 11
% clause depth limited to 3
% seconds given: 58
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    118
%  derived clauses:   16411
%  kept clauses:      191
%  kept size sum:     1482
%  kept mid-nuclei:   5426
%  kept new demods:   27
%  forw unit-subs:    7893
%  forw double-subs: 2000
%  forw overdouble-subs: 0
%  backward subs:     8
%  fast unit cutoff:  41
%  full unit cutoff:  18
%  dbl  unit cutoff:  0
%  real runtime  :  0.21
%  process. runtime:  0.20
% specific non-discr-tree subsumption statistics: 
%  tried:           3483
%  length fails:    0
%  strength fails:  1008
%  predlist fails:  265
%  aux str. fails:  2192
%  by-lit fails:    0
%  full subs tried: 18
%  full subs fail:  18
% 
% ; 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/HEN/HEN006-1+eq_r.in")
% 
%------------------------------------------------------------------------------