TSTP Solution File: HEN009-3 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : HEN009-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 : art09.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/HEN009-3+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: short
%
% strategies selected:
% (binary-posweight-order 57 #f 4 5)
% (binary-unit 28 #f 4 5)
% (binary-double 28 #f 4 5)
% (binary 45 #t 4 5)
% (hyper 11 #t 4 5)
% (hyper 28 #f)
% (binary-unit-uniteq 16 #f)
% (binary-weightorder 22 #f)
% (binary-posweight-order 159 #f)
% (binary-posweight-lex-big-order 57 #f)
% (binary-posweight-lex-small-order 11 #f)
% (binary-order 28 #f)
% (binary-unit 45 #f)
% (binary 65 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(13,40,1,26,0,1)
%
%
% START OF PROOF
% 14 [] equal(X,X).
% 15 [] equal(divide(X,Y),zero) | -less_equal(X,Y).
% 16 [] -equal(divide(X,Y),zero) | less_equal(X,Y).
% 17 [] less_equal(divide(X,Y),X).
% 18 [] less_equal(divide(divide(X,Y),divide(Z,Y)),divide(divide(X,Z),Y)).
% 19 [] less_equal(zero,X).
% 20 [] -less_equal(Y,X) | -less_equal(X,Y) | equal(X,Y).
% 21 [] less_equal(X,identity).
% 23 [] equal(divide(identity,a),b).
% 24 [] equal(divide(identity,b),c).
% 25 [] equal(divide(identity,c),d).
% 26 [] -equal(b,d).
% 28 [binary:19,15.2] equal(divide(zero,X),zero).
% 29 [binary:21,15.2] equal(divide(X,identity),zero).
% 30 [binary:17,15.2] equal(divide(divide(X,Y),X),zero).
% 39 [para:23.1.1,18.1.1.2,demod:28,29] less_equal(divide(divide(X,a),b),zero).
% 40 [para:23.1.1,18.1.2.1] less_equal(divide(divide(identity,X),divide(a,X)),divide(b,X)).
% 42 [para:24.1.1,18.1.1.2,demod:28,29] less_equal(divide(divide(X,b),c),zero).
% 43 [para:24.1.1,18.1.2.1] less_equal(divide(divide(identity,X),divide(b,X)),divide(c,X)).
% 45 [para:25.1.1,18.1.1.2,demod:28,29] less_equal(divide(divide(X,c),d),zero).
% 46 [para:25.1.1,18.1.2.1] less_equal(divide(divide(identity,X),divide(c,X)),divide(d,X)).
% 48 [para:28.1.1,18.1.1.2] less_equal(divide(divide(X,Y),zero),divide(divide(X,zero),Y)).
% 53 [para:23.1.1,39.1.1.1] less_equal(divide(b,b),zero).
% 56 [para:24.1.1,42.1.1.1] less_equal(divide(c,c),zero).
% 64 [binary:17,20] -less_equal(X,divide(X,Y)) | equal(X,divide(X,Y)).
% 66 [binary:39,20,cut:19] equal(zero,divide(divide(X,a),b)).
% 67 [binary:53,20,cut:19] equal(zero,divide(b,b)).
% 68 [binary:42,20,cut:19] equal(zero,divide(divide(X,b),c)).
% 69 [binary:56,20,cut:19] equal(zero,divide(c,c)).
% 70 [binary:45,20,cut:19] equal(zero,divide(divide(X,c),d)).
% 89 [para:66.1.2,16.1.1,cut:14] less_equal(divide(X,a),b).
% 95 [para:24.1.1,40.1.1.1,demod:67] less_equal(divide(c,divide(a,b)),zero).
% 100 [para:68.1.2,16.1.1,cut:14] less_equal(divide(X,b),c).
% 112 [para:70.1.2,16.1.1,cut:14] less_equal(divide(X,c),d).
% 116 [para:25.1.1,43.1.1.1,demod:69] less_equal(divide(d,divide(b,c)),zero).
% 121 [binary:20,95,cut:19] equal(zero,divide(c,divide(a,b))).
% 131 [binary:20,116,cut:19] equal(zero,divide(d,divide(b,c))).
% 132 [para:121.1.2,16.1.1,cut:14] less_equal(c,divide(a,b)).
% 136 [binary:20,132,cut:100] equal(divide(a,b),c).
% 139 [para:136.1.1,30.1.1.1] equal(divide(c,a),zero).
% 142 [para:23.1.1,46.1.1.1,demod:139] less_equal(divide(b,zero),divide(d,a)).
% 168 [para:131.1.2,16.1.1,cut:14] less_equal(d,divide(b,c)).
% 172 [binary:20,168,cut:112] equal(divide(b,c),d).
% 173 [para:172.1.1,17.1.1] less_equal(d,b).
% 180 [binary:20,173,cut:26] -less_equal(b,d).
% 181 [para:30.1.1,48.1.2] less_equal(divide(divide(X,X),zero),zero).
% 193 [binary:20,181,cut:19] equal(zero,divide(divide(X,X),zero)).
% 194 [para:193.1.2,16.1.1,cut:14] less_equal(divide(X,X),zero).
% 197 [binary:20,194,cut:19] equal(zero,divide(X,X)).
% 204 [para:197.1.2,48.1.2] less_equal(divide(divide(X,divide(X,zero)),zero),zero).
% 252 [binary:20,204,cut:19] equal(zero,divide(divide(X,divide(X,zero)),zero)).
% 265 [para:252.1.2,16.1.1,cut:14] less_equal(divide(X,divide(X,zero)),zero).
% 268 [para:252.1.2,64.1.2,demod:252,cut:265,binarydemod:16] less_equal(X,divide(X,zero)).
% 269 [binary:20,268,cut:17] equal(divide(X,zero),X).
% 272 [para:269.1.1,142.1.1] less_equal(b,divide(d,a)).
% 278 [binary:20,272,cut:89] equal(divide(d,a),b).
% 315 [para:278.1.1,17.1.1,cut:180] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using first neg lit preferred strategy
% not using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% clause length limited to 5
% clause depth limited to 4
% seconds given: 57
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 113
% derived clauses: 1851
% kept clauses: 273
% kept size sum: 2927
% kept mid-nuclei: 0
% kept new demods: 95
% forw unit-subs: 1445
% forw double-subs: 44
% forw overdouble-subs: 0
% backward subs: 6
% fast unit cutoff: 58
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.4
% process. runtime: 0.2
% specific non-discr-tree subsumption statistics:
% tried: 0
% length fails: 0
% strength fails: 0
% predlist fails: 0
% aux str. fails: 0
% 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/HEN009-3+eq_r.in")
%
%------------------------------------------------------------------------------