TSTP Solution File: HEN004-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : HEN004-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/HEN004-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(11,40,1,22,0,1,349,50,2,360,0,2,4000,50,21,4011,0,21)
%
%
% START OF PROOF
% 4002 [] quotient(X,Y,zero) | -less_equal(X,Y).
% 4003 [] -quotient(X,Y,zero) | less_equal(X,Y).
% 4004 [] -quotient(X,Y,Z) | less_equal(Z,X).
% 4005 [] -quotient(Z,U,X2) | -quotient(V,W,X1) | -quotient(Y,U,W) | -quotient(X,U,V) | -quotient(X,Y,Z) | less_equal(X1,X2).
% 4006 [] less_equal(zero,X).
% 4007 [] -less_equal(Y,X) | -less_equal(X,Y) | equal(X,Y).
% 4009 [] quotient(X,Y,divide(X,Y)).
% 4011 [] -quotient(x,zero,x).
% 4012 [hyper:4002,4006] quotient(zero,X,zero).
% 4048 [hyper:4004,4009] less_equal(divide(X,Y),X).
% 4342 [hyper:4002,4048] quotient(divide(X,Y),X,zero).
% 4358 [hyper:4005,4342,4009,4009,4009,4012] less_equal(divide(divide(X,X),zero),zero).
% 4469 [hyper:4007,4358,cut:4006] equal(zero,divide(divide(X,X),zero)).
% 4470 [para:4469.1.2,4009.1.3] quotient(divide(X,X),zero,zero).
% 4687 [hyper:4003,4470] less_equal(divide(X,X),zero).
% 5014 [hyper:4007,4687,cut:4006] equal(zero,divide(X,X)).
% 5015 [para:5014.1.2,4009.1.3] quotient(X,X,zero).
% 5038 [hyper:4005,5015,4009,4009,4009,4012] less_equal(divide(divide(X,divide(X,zero)),zero),zero).
% 6578 [hyper:4007,5038,cut:4006] equal(zero,divide(divide(X,divide(X,zero)),zero)).
% 6579 [para:6578.1.2,4009.1.3] quotient(divide(X,divide(X,zero)),zero,zero).
% 6581 [hyper:4003,6579] less_equal(divide(X,divide(X,zero)),zero).
% 6988 [hyper:4007,6581,cut:4006] equal(zero,divide(X,divide(X,zero))).
% 6989 [para:6988.1.2,4009.1.3] quotient(X,divide(X,zero),zero).
% 6995 [hyper:4003,6989] less_equal(X,divide(X,zero)).
% 7733 [hyper:4007,6995,cut:4048] equal(divide(X,zero),X).
% 7735 [para:7733.1.1,4009.1.3,slowcut:4011] 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: 119
% derived clauses: 31147
% kept clauses: 115
% kept size sum: 950
% kept mid-nuclei: 7534
% kept new demods: 18
% forw unit-subs: 16358
% forw double-subs: 6007
% forw overdouble-subs: 0
% backward subs: 5
% fast unit cutoff: 139
% full unit cutoff: 22
% dbl unit cutoff: 0
% real runtime : 0.41
% process. runtime: 0.41
% specific non-discr-tree subsumption statistics:
% tried: 6009
% length fails: 0
% strength fails: 1605
% predlist fails: 1151
% aux str. fails: 2913
% by-lit fails: 0
% full subs tried: 340
% full subs fail: 340
%
% ; 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/HEN004-1+eq_r.in")
%
%------------------------------------------------------------------------------