TSTP Solution File: HEN009-6 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : HEN009-6 : 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 : art06.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-6+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(18,40,0,36,0,0)
%
%
% START OF PROOF
% 19 [] equal(X,X).
% 20 [] equal(divide(X,Y),zero) | -less_equal(X,Y).
% 21 [] -equal(divide(X,Y),zero) | less_equal(X,Y).
% 22 [] less_equal(divide(X,Y),X).
% 23 [] less_equal(divide(divide(X,Y),divide(Z,Y)),divide(divide(X,Z),Y)).
% 24 [] less_equal(zero,X).
% 25 [] -less_equal(Y,X) | -less_equal(X,Y) | equal(X,Y).
% 27 [] equal(divide(X,identity),zero).
% 28 [] equal(divide(zero,X),zero).
% 29 [] equal(divide(X,X),zero).
% 30 [] -less_equal(divide(X,Y),Z) | less_equal(divide(X,Z),Y).
% 33 [] equal(divide(identity,a),b).
% 34 [] equal(divide(identity,b),c).
% 35 [] equal(divide(identity,c),d).
% 36 [] -equal(b,d).
% 40 [para:29.1.1,21.1.1,cut:19] less_equal(X,X).
% 49 [para:33.1.1,23.1.1.1] less_equal(divide(b,divide(X,a)),divide(divide(identity,X),a)).
% 50 [para:33.1.1,23.1.1.2,demod:28,27] less_equal(divide(divide(X,a),b),zero).
% 53 [para:34.1.1,23.1.1.2,demod:28,27] less_equal(divide(divide(X,b),c),zero).
% 67 [binary:24,25] -less_equal(X,zero) | equal(X,zero).
% 71 [binary:50,25,cut:24] equal(zero,divide(divide(X,a),b)).
% 72 [binary:53,25,cut:24] equal(zero,divide(divide(X,b),c)).
% 76 [para:71.1.2,21.1.1,cut:19] less_equal(divide(X,a),b).
% 81 [para:72.1.2,21.1.1,cut:19] less_equal(divide(X,b),c).
% 90 [binary:40,30] less_equal(divide(X,divide(X,Y)),Y).
% 96 [binary:76,30] less_equal(divide(X,b),a).
% 99 [binary:30,81] less_equal(divide(X,c),b).
% 100 [para:34.1.1,96.1.1] less_equal(c,a).
% 103 [binary:20.2,100] equal(divide(c,a),zero).
% 105 [para:35.1.1,99.1.1] less_equal(d,b).
% 108 [binary:20.2,105] equal(divide(d,b),zero).
% 109 [binary:25,105,cut:36] -less_equal(b,d).
% 135 [para:108.1.1,30.1.1,cut:24] less_equal(divide(d,X),b).
% 153 [binary:67,90,binarydemod:21] less_equal(X,divide(X,zero)).
% 155 [binary:25,153,cut:22] equal(divide(X,zero),X).
% 191 [para:35.1.1,49.1.2.1,demod:155,103] less_equal(b,divide(d,a)).
% 200 [binary:25,191,cut:135] equal(divide(d,a),b).
% 204 [para:200.1.1,22.1.1,cut:109] 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: 64
% derived clauses: 631
% kept clauses: 155
% kept size sum: 1404
% kept mid-nuclei: 0
% kept new demods: 38
% forw unit-subs: 462
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 17
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.1
% process. runtime: 0.1
% 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-6+eq_r.in")
%
%------------------------------------------------------------------------------