TSTP Solution File: HEN011-5 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : HEN011-5 : TPTP v3.4.2. Bugfixed v1.2.1.
% 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-5+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: peq
%
% strategies selected:
% (hyper 30 #f 4 5)
% (binary-unit 12 #f)
% (binary-unit-uniteq 12 #f)
% (binary-posweight-kb-big-order 60 #f 4 5)
% (binary-posweight-lex-big-order 30 #f 4 5)
% (binary 30 #t)
% (binary-posweight-kb-big-order 156 #f)
% (binary-posweight-lex-big-order 102 #f)
% (binary-posweight-firstpref-order 60 #f)
% (binary-order 30 #f)
% (binary-posweight-kb-small-order 48 #f)
% (binary-posweight-lex-small-order 30 #f)
%
%
% **** EMPTY CLAUSE DERIVED ****
%
%
% timer checkpoints: c(15,40,0,30,0,0)
%
%
% START OF PROOF
% 16 [] equal(X,X).
% 17 [] equal(divide(divide(X,Y),X),zero).
% 18 [] equal(divide(divide(divide(X,Y),divide(Z,Y)),divide(divide(X,Z),Y)),zero).
% 20 [] -equal(divide(Y,X),zero) | -equal(divide(X,Y),zero) | equal(X,Y).
% 21 [] equal(divide(X,identity),zero).
% 22 [] equal(divide(X,X),zero).
% 23 [] equal(divide(X,zero),X).
% 24 [] -equal(divide(Y,Z),zero) | -equal(divide(X,Y),zero) | equal(divide(X,Z),zero).
% 25 [] -equal(divide(divide(X,Y),Z),zero) | equal(divide(divide(X,Z),Y),zero).
% 26 [] equal(divide(divide(X,Y),divide(X,Z)),zero) | -equal(divide(Z,Y),zero).
% 27 [] equal(divide(divide(X,Y),divide(Z,Y)),zero) | -equal(divide(X,Z),zero).
% 30 [] -equal(divide(divide(identity,a),divide(identity,divide(identity,b))),divide(divide(identity,b),divide(identity,divide(identity,a)))).
% 31 [hyper:25,22] equal(divide(divide(X,divide(X,Y)),Y),zero).
% 37 [hyper:27,21] equal(divide(divide(X,Y),divide(identity,Y)),zero).
% 43 [hyper:26,17] equal(divide(divide(X,Y),divide(X,divide(Y,Z))),zero).
% 44 [hyper:27,17] equal(divide(divide(divide(X,Y),Z),divide(X,Z)),zero).
% 58 [hyper:24,37,31] equal(divide(divide(X,divide(identity,Y)),Y),zero).
% 59 [hyper:26,37] equal(divide(divide(X,divide(identity,Y)),divide(X,divide(Z,Y))),zero).
% 71 [para:22.1.1,18.1.1.2,demod:23] equal(divide(divide(X,divide(X,Y)),divide(Y,divide(X,Y))),zero).
% 72 [para:37.1.1,18.1.1.2,demod:23] equal(divide(divide(X,divide(identity,Y)),divide(Y,divide(identity,Y))),zero).
% 73 [para:58.1.1,18.1.1.2,demod:23] equal(divide(divide(X,Y),divide(divide(identity,Y),Y)),zero).
% 75 [hyper:20,43,18,demod:23,22] equal(divide(X,Y),divide(divide(X,Y),Y)).
% 78 [hyper:24,43,17] equal(divide(divide(divide(X,Y),Z),divide(X,divide(Y,U))),zero).
% 80 [hyper:24,43,18] equal(divide(divide(divide(X,Y),divide(Z,Y)),divide(divide(X,Z),divide(Y,U))),zero).
% 82 [hyper:24,43,18] equal(divide(divide(divide(X,Y),Z),divide(divide(X,Z),Y)),zero).
% 83 [para:75.1.2,43.1.1.1] equal(divide(divide(X,Y),divide(divide(X,Y),divide(Y,Z))),zero).
% 179 [hyper:20,71,44] equal(divide(divide(X,Y),divide(X,divide(X,Y))),divide(X,divide(X,divide(X,Y)))).
% 194 [para:75.1.2,78.1.1.1.1] equal(divide(divide(divide(X,Y),Z),divide(divide(X,Y),divide(Y,U))),zero).
% 200 [hyper:20,82,demod:82,cut:16] equal(divide(divide(X,Y),Z),divide(divide(X,Z),Y)).
% 213 [para:200.1.1,200.1.1.1] equal(divide(divide(divide(X,Y),Z),U),divide(divide(divide(X,Z),U),Y)).
% 219 [hyper:20,83,demod:17,cut:16] equal(divide(divide(X,Y),divide(Y,Z)),divide(X,Y)).
% 221 [para:219.1.1,200.1.1] equal(divide(X,Y),divide(divide(X,divide(Y,Z)),Y)).
% 222 [para:219.1.1,200.1.1.1] equal(divide(divide(X,Y),Z),divide(divide(divide(X,Y),Z),divide(Y,U))).
% 241 [hyper:24,59,44] equal(divide(divide(divide(X,Y),divide(identity,Z)),divide(X,divide(U,Z))),zero).
% 305 [hyper:24,72,59] equal(divide(divide(X,divide(identity,Y)),divide(Y,divide(Z,Y))),zero).
% 339 [hyper:20,80,80] equal(divide(divide(X,Y),divide(Z,Y)),divide(divide(X,Z),divide(Y,Z))).
% 374 [para:75.1.2,339.1.1.1,demod:222] equal(divide(divide(X,Y),divide(Z,Y)),divide(divide(X,Y),Z)).
% 375 [para:75.1.2,339.1.1.2,demod:374] equal(divide(divide(X,Y),Z),divide(divide(X,divide(Z,Y)),Y)).
% 376 [para:73.1.1,339.1.1.2,demod:374,23,75] equal(divide(X,divide(identity,Y)),divide(divide(X,divide(Z,Y)),divide(divide(identity,Y),Z))).
% 380 [para:200.1.1,339.1.1.2,demod:374] equal(divide(divide(X,Y),divide(divide(Z,Y),U)),divide(divide(X,divide(Z,U)),Y)).
% 385 [para:31.1.1,374.1.1.2,demod:23] equal(divide(X,Y),divide(divide(X,Y),divide(Z,divide(Z,Y)))).
% 396 [para:375.1.2,374.1.1.2,demod:380] equal(divide(divide(X,divide(Y,Z)),U),divide(divide(X,U),divide(Y,divide(Z,U)))).
% 397 [para:385.1.2,200.1.1.1] equal(divide(divide(X,Y),Z),divide(divide(divide(X,Y),Z),divide(U,divide(U,Y)))).
% 419 [hyper:20,194,71,demod:380,219,demod:221] equal(divide(X,divide(Y,divide(X,Y))),divide(X,Y)).
% 420 [hyper:20,194,305,demod:380,219,demod:221] equal(divide(identity,divide(X,divide(Y,X))),divide(identity,X)).
% 428 [para:419.1.1,200.1.1.1] equal(divide(divide(X,Y),Z),divide(divide(X,Z),divide(Y,divide(X,Y)))).
% 430 [para:419.1.1,213.1.1.1.1] equal(divide(divide(divide(X,Y),Z),U),divide(divide(divide(X,Z),U),divide(Y,divide(X,Y)))).
% 451 [para:420.1.1,200.1.1.1] equal(divide(divide(identity,X),Y),divide(divide(identity,Y),divide(X,divide(Z,X)))).
% 455 [para:200.1.1,179.1.1.1,demod:397,374,380] equal(divide(divide(X,Y),Z),divide(divide(X,Z),divide(X,divide(X,Y)))).
% 475 [hyper:20,241,305,demod:396] equal(divide(X,divide(identity,divide(X,Y))),divide(divide(X,divide(identity,X)),Y)).
% 536 [para:451.1.2,428.1.2.2,demod:75,475] equal(divide(X,divide(identity,divide(X,Y))),divide(divide(X,Y),divide(identity,X))).
% 554 [para:455.1.2,376.1.2.1,demod:221] equal(divide(divide(X,Y),divide(identity,divide(X,Z))),divide(divide(divide(X,Z),Y),divide(identity,X))).
% 586 [para:536.1.2,430.1.2.1,demod:428,554,slowcut:30] 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 5
% clause depth limited to 4
% seconds given: 30
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 145
% derived clauses: 80352
% kept clauses: 204
% kept size sum: 3396
% kept mid-nuclei: 345
% kept new demods: 139
% forw unit-subs: 42093
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 12
% fast unit cutoff: 2
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 1.13
% process. runtime: 1.12
% specific non-discr-tree subsumption statistics:
% tried: 1
% length fails: 1
% 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-5+eq_r.in")
%
%------------------------------------------------------------------------------