%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : HEN005-2 : 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 : art03.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/HEN005-2+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(17,40,0,34,0,0)
%
%
% START OF PROOF
% 19 [] quotient(X,Y,zero) | -less_equal(X,Y).
% 20 [] -quotient(X,Y,zero) | less_equal(X,Y).
% 22 [] -quotient(Z,U,X2) | -quotient(V,W,X1) | -quotient(Y,U,W) | -quotient(X,U,V) | -quotient(X,Y,Z) | less_equal(X1,X2).
% 23 [] less_equal(zero,X).
% 24 [] -less_equal(X,Y) | -less_equal(Y,X) | equal(Y,X).
% 26 [] quotient(X,Y,divide(X,Y)).
% 29 [] quotient(zero,X,zero).
% 31 [] quotient(X,zero,X).
% 32 [] less_equal(x,y).
% 33 [] less_equal(y,z).
% 34 [] -less_equal(x,z).
% 39 [hyper:19,32] quotient(x,y,zero).
% 42 [hyper:19,33] quotient(y,z,zero).
% 1434 [hyper:22,26,31,42,39,29] less_equal(divide(x,z),zero).
% 1606 [hyper:24,1434,cut:23] equal(zero,divide(x,z)).
% 2910 [para:1606.1.2,26.1.3] quotient(x,z,zero).
% 2911 [hyper:20,2910,cut:34] 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 2
% seconds given: 58
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 33
% derived clauses: 9865
% kept clauses: 38
% kept size sum: 223
% kept mid-nuclei: 2784
% kept new demods: 7
% forw unit-subs: 5639
% forw double-subs: 920
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 23
% full unit cutoff: 50
% dbl unit cutoff: 0
% real runtime : 0.9
% process. runtime: 0.9
% specific non-discr-tree subsumption statistics:
% tried: 1489
% length fails: 0
% strength fails: 735
% predlist fails: 257
% aux str. fails: 497
% by-lit fails: 0
% full subs tried: 0
% full subs fail: 0
%
% ; 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/HEN005-2+eq_r.in")
%
%------------------------------------------------------------------------------