TSTP Solution File: HEN006-6 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : HEN006-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 : art08.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/HEN006-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 3 5)
% (binary-unit 28 #f 3 5)
% (binary-double 28 #f 3 5)
% (binary 45 #t 3 5)
% (hyper 11 #t 3 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,0,26,0,0,58,50,0,71,0,0)
%
%
% START OF PROOF
% 59 [] equal(X,X).
% 60 [] equal(divide(X,Y),zero) | -less_equal(X,Y).
% 61 [] -equal(divide(X,Y),zero) | less_equal(X,Y).
% 62 [] less_equal(divide(X,Y),X).
% 63 [] less_equal(divide(divide(X,Y),divide(Z,Y)),divide(divide(X,Z),Y)).
% 64 [] less_equal(zero,X).
% 65 [] -less_equal(Y,X) | -less_equal(X,Y) | equal(X,Y).
% 68 [] equal(divide(zero,X),zero).
% 69 [] equal(divide(X,X),zero).
% 70 [] less_equal(divide(a,b),d).
% 71 [] -less_equal(divide(a,d),b).
% 73 [binary:62,60.2] equal(divide(divide(X,Y),X),zero).
% 74 [binary:70,60.2] equal(divide(divide(a,b),d),zero).
% 80 [binary:62,65] -less_equal(X,divide(X,Y)) | equal(X,divide(X,Y)).
% 85 [para:69.1.1,63.1.2] less_equal(divide(divide(X,divide(X,Y)),divide(Y,divide(X,Y))),zero).
% 90 [para:74.1.1,63.1.2] less_equal(divide(divide(a,d),divide(b,d)),zero).
% 92 [para:73.1.1,63.1.1.2] less_equal(divide(divide(X,Y),zero),divide(divide(X,divide(Y,Z)),Y)).
% 103 [binary:65,90,cut:64] equal(zero,divide(divide(a,d),divide(b,d))).
% 116 [para:68.1.1,85.1.1.2] less_equal(divide(divide(X,divide(X,zero)),zero),zero).
% 131 [binary:65,116,cut:64] equal(zero,divide(divide(X,divide(X,zero)),zero)).
% 132 [para:131.1.2,61.1.1,cut:59] less_equal(divide(X,divide(X,zero)),zero).
% 134 [para:131.1.2,80.1.2,demod:131,cut:132,binarydemod:61] less_equal(X,divide(X,zero)).
% 135 [binary:65,134,cut:62] equal(divide(X,zero),X).
% 168 [para:103.1.2,92.1.2.1,demod:68,135] less_equal(divide(divide(a,d),b),zero).
% 171 [binary:60.2,168,demod:135,binarydemod:61,cut:71] 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: 88
% derived clauses: 1334
% kept clauses: 110
% kept size sum: 1218
% kept mid-nuclei: 0
% kept new demods: 38
% forw unit-subs: 1060
% forw double-subs: 25
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 25
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.3
% 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/HEN006-6+eq_r.in")
%
%------------------------------------------------------------------------------