%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : HEN007-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 : art06.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/HEN007-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,1231,50,4,1245,0,4,27042,50,143,27056,0,143)
%
%
% START OF PROOF
% 27044 [] quotient(X,Y,zero) | -less_equal(X,Y).
% 27045 [] -quotient(X,Y,zero) | less_equal(X,Y).
% 27046 [] -quotient(X,Y,Z) | less_equal(Z,X).
% 27047 [] -quotient(Z,U,X2) | -quotient(V,W,X1) | -quotient(Y,U,W) | -quotient(X,U,V) | -quotient(X,Y,Z) | less_equal(X1,X2).
% 27048 [] less_equal(zero,X).
% 27049 [] -less_equal(Y,X) | -less_equal(X,Y) | equal(X,Y).
% 27051 [] quotient(X,Y,divide(X,Y)).
% 27053 [] less_equal(x,y).
% 27054 [] quotient(z,y,z^qy).
% 27055 [] quotient(z,x,z^qx).
% 27056 [] -less_equal(z^qy,z^qx).
% 27057 [hyper:27044,27048] quotient(zero,X,zero).
% 27063 [hyper:27044,27053] quotient(x,y,zero).
% 27117 [hyper:27046,27055] less_equal(z^qx,z).
% 27141 [hyper:27044,27117] quotient(z^qx,z,zero).
% 27215 [hyper:27046,27051] less_equal(divide(X,Y),X).
% 27339 [hyper:27047,27051,27051,27063,27055,27054] less_equal(divide(z^qy,zero),divide(z^qx,y)).
% 27703 [hyper:27047,27051,27141,27057,27051,27054] less_equal(divide(divide(z^qx,y),z^qy),zero).
% 28079 [hyper:27044,27215] quotient(divide(X,Y),X,zero).
% 28103 [hyper:27047,28079,27051,27051,27051,27057] less_equal(divide(divide(X,X),zero),zero).
% 28215 [hyper:27049,28103,cut:27048] equal(zero,divide(divide(X,X),zero)).
% 29480 [para:28215.1.2,27051.1.3] quotient(divide(X,X),zero,zero).
% 29481 [hyper:27045,29480] less_equal(divide(X,X),zero).
% 29750 [hyper:27049,29481,cut:27048] equal(zero,divide(X,X)).
% 29776 [para:29750.1.2,27051.1.3] quotient(X,X,zero).
% 29830 [hyper:27047,29776,27051,27051,27051,27057] less_equal(divide(divide(X,divide(X,zero)),zero),zero).
% 30626 [hyper:27049,27703,cut:27048] equal(zero,divide(divide(z^qx,y),z^qy)).
% 30649 [para:30626.1.2,27051.1.3] quotient(divide(z^qx,y),z^qy,zero).
% 30650 [hyper:27045,30649] less_equal(divide(z^qx,y),z^qy).
% 38706 [hyper:27049,29830,cut:27048] equal(zero,divide(divide(X,divide(X,zero)),zero)).
% 40502 [para:38706.1.2,27051.1.3] quotient(divide(X,divide(X,zero)),zero,zero).
% 40504 [hyper:27045,40502] less_equal(divide(X,divide(X,zero)),zero).
% 41083 [hyper:27049,40504,cut:27048] equal(zero,divide(X,divide(X,zero))).
% 41084 [para:41083.1.2,27051.1.3] quotient(X,divide(X,zero),zero).
% 41109 [hyper:27045,41084] less_equal(X,divide(X,zero)).
% 42258 [hyper:27049,41109,cut:27215] equal(divide(X,zero),X).
% 42260 [para:42258.1.1,27339.1.1] less_equal(z^qy,divide(z^qx,y)).
% 60298 [hyper:27049,42260,cut:30650] equal(divide(z^qx,y),z^qy).
% 60304 [para:60298.1.1,27215.1.1,cut:27056] 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 4
% seconds given: 58
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 370
% derived clauses: 296000
% kept clauses: 536
% kept size sum: 4618
% kept mid-nuclei: 59599
% kept new demods: 65
% forw unit-subs: 182571
% forw double-subs: 47150
% forw overdouble-subs: 0
% backward subs: 22
% fast unit cutoff: 1482
% full unit cutoff: 94
% dbl unit cutoff: 0
% real runtime : 3.39
% process. runtime: 3.38
% specific non-discr-tree subsumption statistics:
% tried: 40354
% length fails: 0
% strength fails: 13286
% predlist fails: 8872
% aux str. fails: 16492
% by-lit fails: 0
% full subs tried: 1704
% full subs fail: 1704
%
% ; 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/HEN007-1+eq_r.in")
%
%------------------------------------------------------------------------------