TSTP Solution File: HEN011-3 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : HEN011-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 : 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/HEN011-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(14,40,0,28,0,0)
%
%
% START OF PROOF
% 15 [] equal(X,X).
% 16 [] equal(divide(X,Y),zero) | -less_equal(X,Y).
% 17 [] -equal(divide(X,Y),zero) | less_equal(X,Y).
% 18 [] less_equal(divide(X,Y),X).
% 19 [] less_equal(divide(divide(X,Y),divide(Z,Y)),divide(divide(X,Z),Y)).
% 20 [] less_equal(zero,X).
% 21 [] -less_equal(Y,X) | -less_equal(X,Y) | equal(X,Y).
% 22 [] less_equal(X,identity).
% 24 [] equal(divide(identity,a),c).
% 25 [] equal(divide(identity,b),d).
% 26 [] equal(divide(identity,c),e).
% 27 [] equal(divide(identity,d),g).
% 28 [] -equal(divide(c,g),divide(d,e)).
% 30 [binary:20,16.2] equal(divide(zero,X),zero).
% 31 [binary:22,16.2] equal(divide(X,identity),zero).
% 32 [binary:18,16.2] equal(divide(divide(X,Y),X),zero).
% 41 [para:24.1.1,19.1.1.1] less_equal(divide(c,divide(X,a)),divide(divide(identity,X),a)).
% 42 [para:24.1.1,19.1.1.2,demod:30,31] less_equal(divide(divide(X,a),c),zero).
% 43 [para:24.1.1,19.1.2.1] less_equal(divide(divide(identity,X),divide(a,X)),divide(c,X)).
% 44 [para:25.1.1,19.1.1.1] less_equal(divide(d,divide(X,b)),divide(divide(identity,X),b)).
% 45 [para:25.1.1,19.1.1.2,demod:30,31] less_equal(divide(divide(X,b),d),zero).
% 46 [para:25.1.1,19.1.2.1] less_equal(divide(divide(identity,X),divide(b,X)),divide(d,X)).
% 47 [para:26.1.1,19.1.1.1] less_equal(divide(e,divide(X,c)),divide(divide(identity,X),c)).
% 48 [para:26.1.1,19.1.1.2,demod:30,31] less_equal(divide(divide(X,c),e),zero).
% 51 [para:27.1.1,19.1.1.2,demod:30,31] less_equal(divide(divide(X,d),g),zero).
% 52 [para:27.1.1,19.1.2.1] less_equal(divide(divide(identity,X),divide(d,X)),divide(g,X)).
% 53 [binary:16.2,19] equal(divide(divide(divide(X,Y),divide(Z,Y)),divide(divide(X,Z),Y)),zero).
% 54 [para:30.1.1,19.1.1.2] less_equal(divide(divide(X,Y),zero),divide(divide(X,zero),Y)).
% 57 [para:32.1.1,19.1.1.2] less_equal(divide(divide(X,Y),zero),divide(divide(X,divide(Y,Z)),Y)).
% 59 [para:32.1.1,19.1.2.1,demod:30] less_equal(divide(divide(divide(X,Y),Z),divide(X,Z)),zero).
% 60 [para:24.1.1,42.1.1.1] less_equal(divide(c,c),zero).
% 63 [para:25.1.1,45.1.1.1] less_equal(divide(d,d),zero).
% 68 [binary:18,21] -less_equal(X,divide(X,Y)) | equal(X,divide(X,Y)).
% 69 [binary:19,21] -less_equal(divide(divide(X,Y),Z),divide(divide(X,Z),divide(Y,Z))) | equal(divide(divide(X,Y),Z),divide(divide(X,Z),divide(Y,Z))).
% 70 [binary:42,21,cut:20] equal(zero,divide(divide(X,a),c)).
% 71 [binary:60,21,cut:20] equal(zero,divide(c,c)).
% 72 [binary:45,21,cut:20] equal(zero,divide(divide(X,b),d)).
% 74 [binary:21,63,cut:20] equal(zero,divide(d,d)).
% 84 [para:27.1.1,41.1.2.1] less_equal(divide(c,divide(d,a)),divide(g,a)).
% 85 [binary:16.2,41] equal(divide(divide(c,divide(X,a)),divide(divide(identity,X),a)),zero).
% 93 [binary:21,48,cut:20] equal(zero,divide(divide(X,c),e)).
% 99 [para:25.1.1,43.1.1.1] less_equal(divide(d,divide(a,b)),divide(c,b)).
% 100 [para:26.1.1,43.1.1.1,demod:71] less_equal(divide(e,divide(a,c)),zero).
% 106 [binary:21,51,cut:20] equal(zero,divide(divide(X,d),g)).
% 112 [binary:16.2,44] equal(divide(divide(d,divide(X,b)),divide(divide(identity,X),b)),zero).
% 120 [para:27.1.1,46.1.1.1,demod:74] less_equal(divide(g,divide(b,d)),zero).
% 123 [para:70.1.2,17.1.1,cut:15] less_equal(divide(X,a),c).
% 128 [para:72.1.2,17.1.1,cut:15] less_equal(divide(X,b),d).
% 133 [para:26.1.1,47.1.2.1,demod:71] less_equal(divide(e,zero),divide(e,c)).
% 140 [para:93.1.2,17.1.1,cut:15] less_equal(divide(X,c),e).
% 145 [para:106.1.2,17.1.1,cut:15] less_equal(divide(X,d),g).
% 154 [binary:21,100,cut:20] equal(zero,divide(e,divide(a,c))).
% 156 [binary:21,120,cut:20] equal(zero,divide(g,divide(b,d))).
% 165 [para:154.1.2,17.1.1,cut:15] less_equal(e,divide(a,c)).
% 169 [binary:21,165,cut:140] equal(divide(a,c),e).
% 174 [para:169.1.1,32.1.1.1] equal(divide(e,a),zero).
% 184 [para:156.1.2,17.1.1,cut:15] less_equal(g,divide(b,d)).
% 188 [binary:21,184,cut:145] equal(divide(b,d),g).
% 204 [para:174.1.1,53.1.1.1.2] equal(divide(divide(divide(X,a),zero),divide(divide(X,e),a)),zero).
% 210 [para:188.1.1,32.1.1.1] equal(divide(g,b),zero).
% 214 [para:210.1.1,19.1.1.2] less_equal(divide(divide(X,b),zero),divide(divide(X,g),b)).
% 217 [para:210.1.1,52.1.2,demod:25] less_equal(divide(d,divide(d,b)),zero).
% 222 [para:32.1.1,54.1.2] less_equal(divide(divide(X,X),zero),zero).
% 227 [binary:21,222,cut:20] equal(zero,divide(divide(X,X),zero)).
% 229 [para:227.1.2,17.1.1,cut:15] less_equal(divide(X,X),zero).
% 232 [binary:21,229,cut:20] equal(zero,divide(X,X)).
% 239 [para:232.1.2,54.1.2] less_equal(divide(divide(X,divide(X,zero)),zero),zero).
% 240 [binary:21,57] -less_equal(divide(divide(X,divide(Y,Z)),Y),divide(divide(X,Y),zero)) | equal(divide(divide(X,divide(Y,Z)),Y),divide(divide(X,Y),zero)).
% 248 [binary:21,217,cut:20] equal(zero,divide(d,divide(d,b))).
% 265 [binary:21,59,cut:20] equal(zero,divide(divide(divide(X,Y),Z),divide(X,Z))).
% 266 [para:174.1.1,59.1.1.2] less_equal(divide(divide(divide(e,X),a),zero),zero).
% 267 [para:210.1.1,59.1.1.2] less_equal(divide(divide(divide(g,X),b),zero),zero).
% 268 [para:248.1.2,17.1.1,cut:15] less_equal(d,divide(d,b)).
% 274 [binary:21,268,cut:128] equal(divide(d,b),d).
% 276 [para:274.1.1,19.1.1.1] less_equal(divide(d,divide(X,b)),divide(divide(d,X),b)).
% 289 [binary:21,239,cut:20] equal(zero,divide(divide(X,divide(X,zero)),zero)).
% 305 [para:70.1.2,69.1.1.1,demod:70,30,cut:20] equal(zero,divide(divide(divide(X,a),Y),divide(c,Y))).
% 307 [para:72.1.2,69.1.1.1,demod:72,30,cut:20] equal(zero,divide(divide(divide(X,b),Y),divide(d,Y))).
% 309 [para:93.1.2,69.1.1,demod:93,cut:20] equal(zero,divide(divide(X,e),divide(c,e))).
% 311 [para:93.1.2,69.1.2.2,demod:93] -less_equal(divide(divide(X,divide(Y,c)),e),divide(divide(X,e),zero)) | equal(divide(divide(X,divide(Y,c)),e),divide(divide(X,e),zero)).
% 312 [para:106.1.2,69.1.1,demod:106,cut:20] equal(zero,divide(divide(X,g),divide(d,g))).
% 336 [para:289.1.2,17.1.1,cut:15] less_equal(divide(X,divide(X,zero)),zero).
% 337 [para:289.1.2,68.1.2,demod:289,cut:336] equal(divide(X,divide(X,zero)),zero).
% 338 [para:289.1.2,68.1.2,demod:289,cut:336,binarydemod:17] less_equal(X,divide(X,zero)).
% 339 [binary:21,338,cut:18] equal(divide(X,zero),X).
% 341 [para:339.1.1,133.1.1] less_equal(e,divide(e,c)).
% 342 [para:339.1.1,57.1.1] less_equal(divide(X,Y),divide(divide(X,divide(Y,Z)),Y)).
% 346 [binary:21,341,cut:140] equal(divide(e,c),e).
% 363 [para:337.1.1,69.1.2.2,demod:232,339,cut:18] equal(divide(divide(X,Y),Y),divide(X,Y)).
% 378 [binary:16.2,266,demod:339] equal(divide(divide(e,X),a),zero).
% 381 [para:378.1.1,19.1.1.2,demod:339] less_equal(divide(X,a),divide(divide(X,divide(e,Y)),a)).
% 392 [binary:16.2,84] equal(divide(divide(c,divide(d,a)),divide(g,a)),zero).
% 394 [binary:16.2,267,demod:339] equal(divide(divide(g,X),b),zero).
% 398 [para:174.1.1,85.1.1.1.2,demod:339,binarydemod:17] less_equal(c,divide(divide(identity,e),a)).
% 400 [para:394.1.1,19.1.1.2,demod:339] less_equal(divide(X,b),divide(divide(X,divide(g,Y)),b)).
% 410 [binary:21,398,cut:123] equal(divide(divide(identity,e),a),c).
% 415 [para:410.1.1,32.1.1.1] equal(divide(c,divide(identity,e)),zero).
% 426 [para:415.1.1,53.1.1.2.1,demod:339,30,binarydemod:17] less_equal(divide(c,X),divide(divide(identity,e),X)).
% 443 [para:309.1.2,57.1.2.1,demod:30,339] less_equal(divide(divide(X,e),c),zero).
% 452 [binary:16.2,443,demod:339] equal(divide(divide(X,e),c),zero).
% 455 [para:452.1.1,19.1.1.2,demod:339] less_equal(divide(X,c),divide(divide(X,divide(Y,e)),c)).
% 459 [para:452.1.1,53.1.1.2.1,demod:339,30,binarydemod:17] less_equal(divide(divide(X,e),Y),divide(c,Y)).
% 466 [binary:21,426,cut:459] equal(divide(divide(identity,e),X),divide(c,X)).
% 509 [para:466.1.1,339.1.1,demod:339] equal(c,divide(identity,e)).
% 518 [para:312.1.2,57.1.2.1,demod:30,339] less_equal(divide(divide(X,g),d),zero).
% 531 [binary:16.2,518,demod:339] equal(divide(divide(X,g),d),zero).
% 538 [para:531.1.1,53.1.1.2.1,demod:339,30,binarydemod:17] less_equal(divide(divide(X,g),Y),divide(d,Y)).
% 1113 [para:32.1.1,342.1.2.1,demod:30] less_equal(divide(divide(divide(X,Y),Z),X),zero).
% 1124 [binary:16.2,1113,demod:339,binarydemod:17] less_equal(divide(divide(X,Y),Z),X).
% 1164 [para:265.1.2,17.1.1,cut:15] less_equal(divide(divide(X,Y),Z),divide(X,Z)).
% 1199 [para:305.1.2,17.1.1,cut:15] less_equal(divide(divide(X,a),Y),divide(c,Y)).
% 1211 [para:307.1.2,17.1.1,cut:15] less_equal(divide(divide(X,b),Y),divide(d,Y)).
% 1220 [para:204.1.1,57.1.2.1,demod:30,339] less_equal(divide(divide(X,a),divide(X,e)),zero).
% 1226 [binary:16.2,1220,demod:339,binarydemod:17] less_equal(divide(X,a),divide(X,e)).
% 1229 [para:363.1.1,1226.1.1] less_equal(divide(X,a),divide(divide(X,a),e)).
% 1246 [binary:21,1229,cut:18] equal(divide(divide(X,a),e),divide(X,a)).
% 1323 [binary:21,214,demod:339,cut:1164] equal(divide(divide(X,g),b),divide(X,b)).
% 1324 [para:1323.1.1,18.1.1] less_equal(divide(X,b),divide(X,g)).
% 1344 [para:1323.1.1,1164.1.1.1] less_equal(divide(divide(X,b),Y),divide(divide(X,g),Y)).
% 1401 [binary:21,381,cut:1164] equal(divide(divide(X,divide(e,Y)),a),divide(X,a)).
% 1407 [binary:21,400,cut:1164] equal(divide(divide(X,divide(g,Y)),b),divide(X,b)).
% 1413 [binary:21,455,cut:1164] equal(divide(divide(X,divide(Y,e)),c),divide(X,c)).
% 1436 [para:339.1.1,240.1.2,demod:339,cut:1164] equal(divide(divide(X,divide(Y,Z)),Y),divide(X,Y)).
% 1482 [para:1436.1.1,18.1.1] less_equal(divide(X,Y),divide(X,divide(Y,Z))).
% 1489 [para:1436.1.1,1124.1.1.1] less_equal(divide(divide(X,Y),Z),divide(X,divide(Y,U))).
% 1765 [para:1323.1.1,1489.1.1] less_equal(divide(X,b),divide(X,divide(g,Y))).
% 1784 [binary:21,276,cut:1489] equal(divide(divide(d,X),b),divide(d,divide(X,b))).
% 2115 [para:1401.1.1,1124.1.1.1] less_equal(divide(divide(X,a),Y),divide(X,divide(e,Z))).
% 2155 [para:1407.1.1,1124.1.1.1] less_equal(divide(divide(X,b),Y),divide(X,divide(g,Z))).
% 2199 [para:1413.1.1,1489.1.1] less_equal(divide(X,c),divide(X,divide(divide(Y,e),Z))).
% 2285 [para:112.1.1,2199.1.2] less_equal(divide(divide(d,divide(e,b)),c),zero).
% 2290 [binary:16.2,2285,demod:339] equal(divide(divide(d,divide(e,b)),c),zero).
% 2300 [para:2290.1.1,53.1.1.2,demod:339,binarydemod:17] less_equal(divide(d,c),divide(divide(e,b),c)).
% 2307 [binary:21,2300,cut:1211] equal(divide(divide(e,b),c),divide(d,c)).
% 2310 [para:2307.1.1,18.1.1] less_equal(divide(d,c),divide(e,b)).
% 2334 [para:2307.1.1,1344.1.1] less_equal(divide(d,c),divide(divide(e,g),c)).
% 2360 [para:2307.1.1,2155.1.1] less_equal(divide(d,c),divide(e,divide(g,X))).
% 2535 [binary:21,2334,cut:538] equal(divide(divide(e,g),c),divide(d,c)).
% 2693 [para:2535.1.1,69.1.1,demod:2535,346,cut:2360] equal(divide(d,c),divide(e,divide(g,c))).
% 2779 [para:2693.1.2,1765.1.2] less_equal(divide(e,b),divide(d,c)).
% 2815 [binary:21,2779,cut:2310] equal(divide(d,c),divide(e,b)).
% 2872 [para:2815.1.2,44.1.1.2,demod:509] less_equal(divide(d,divide(d,c)),divide(c,b)).
% 3073 [para:392.1.1,240.1.1.1,demod:392,339,30,cut:20] equal(zero,divide(divide(c,divide(d,a)),g)).
% 3075 [para:392.1.1,1407.1.1.1,demod:30] equal(zero,divide(divide(c,divide(d,a)),b)).
% 3082 [para:3073.1.2,53.1.1.2,demod:339,binarydemod:17] less_equal(divide(c,g),divide(divide(d,a),g)).
% 3092 [para:3075.1.2,53.1.1.2,demod:339,1784,binarydemod:17] less_equal(divide(c,b),divide(d,divide(a,b))).
% 3159 [binary:21,3082,cut:1199] equal(divide(divide(d,a),g),divide(c,g)).
% 3160 [binary:21,3092,cut:99] equal(divide(d,divide(a,b)),divide(c,b)).
% 3202 [para:3159.1.1,1124.1.1.1] less_equal(divide(divide(c,g),X),divide(d,a)).
% 3215 [para:3159.1.1,1489.1.1] less_equal(divide(c,g),divide(d,divide(a,X))).
% 3234 [para:3159.1.1,2115.1.1] less_equal(divide(c,g),divide(d,divide(e,X))).
% 3263 [para:2693.1.2,3234.1.2.2] less_equal(divide(c,g),divide(d,divide(d,c))).
% 3270 [para:1323.1.1,3202.1.1] less_equal(divide(c,b),divide(d,a)).
% 3318 [para:3160.1.1,1482.1.2] less_equal(divide(d,a),divide(c,b)).
% 3348 [para:3160.1.1,3215.1.2] less_equal(divide(c,g),divide(c,b)).
% 3349 [binary:21,3318,cut:3270] equal(divide(c,b),divide(d,a)).
% 3351 [binary:21,3348,cut:1324] equal(divide(c,b),divide(c,g)).
% 3378 [para:3349.1.2,1226.1.1] less_equal(divide(c,b),divide(d,e)).
% 3382 [para:3349.1.2,1246.1.1.1,demod:3349] equal(divide(divide(c,b),e),divide(c,b)).
% 3419 [para:3351.1.2,28.1.1] -equal(divide(c,b),divide(d,e)).
% 3533 [binary:21,3263,demod:3351,cut:2872] equal(divide(d,divide(d,c)),divide(c,b)).
% 3703 [para:3533.1.1,311.1.1.1,demod:3533,339,3382,cut:3378,cut:3419] 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: 1151
% derived clauses: 87826
% kept clauses: 3486
% kept size sum: 45203
% kept mid-nuclei: 0
% kept new demods: 766
% forw unit-subs: 77472
% forw double-subs: 1629
% forw overdouble-subs: 0
% backward subs: 38
% fast unit cutoff: 352
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 1.37
% process. runtime: 1.35
% 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/HEN011-3+eq_r.in")
%
%------------------------------------------------------------------------------