TSTP Solution File: HEN010-4 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : HEN010-4 : 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/HEN010-4+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).
% 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).
% 29 [] equal(divide(X,X),zero).
% 31 [] -less_equal(Y,Z) | -less_equal(X,Y) | less_equal(X,Z).
% 32 [] -less_equal(divide(X,Y),Z) | less_equal(divide(X,Z),Y).
% 35 [] equal(divide(identity,divide(identity,divide(identity,X))),divide(identity,X)).
% 36 [] -equal(divide(identity,a),divide(divide(identity,a),divide(identity,divide(identity,a)))).
% 41 [para:29.1.1,21.1.1,cut:19] less_equal(X,X).
% 45 [binary:24,25] -less_equal(X,zero) | equal(X,zero).
% 62 [binary:22,31] -less_equal(X,divide(Y,Z)) | less_equal(X,Y).
% 67 [binary:23,62] less_equal(divide(divide(X,Y),divide(Z,Y)),divide(X,Z)).
% 74 [binary:41,32] less_equal(divide(X,divide(X,Y)),Y).
% 78 [binary:45,74] equal(divide(X,divide(X,zero)),zero).
% 79 [binary:45,74,binarydemod:21] less_equal(X,divide(X,zero)).
% 80 [binary:31,74] -less_equal(X,divide(Y,divide(Y,Z))) | less_equal(X,Z).
% 82 [binary:25,79,cut:22] equal(divide(X,zero),X).
% 86 [para:78.1.1,23.1.1.2,demod:82] less_equal(divide(X,Y),divide(divide(X,Y),Y)).
% 98 [binary:25,86,cut:22] equal(divide(divide(X,Y),Y),divide(X,Y)).
% 195 [binary:80,67] less_equal(divide(divide(X,Y),divide(divide(X,Z),Y)),Z).
% 239 [binary:32,195] less_equal(divide(divide(X,Y),Z),divide(divide(X,Z),Y)).
% 276 [binary:25,239,cut:239] equal(divide(divide(X,Y),Z),divide(divide(X,Z),Y)).
% 343 [para:276.1.1,36.1.2,demod:98,35,cut:19] 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: 94
% derived clauses: 3304
% kept clauses: 279
% kept size sum: 3661
% kept mid-nuclei: 0
% kept new demods: 41
% forw unit-subs: 2424
% forw double-subs: 94
% forw overdouble-subs: 0
% backward subs: 7
% fast unit cutoff: 17
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.3
% process. runtime: 0.3
% specific non-discr-tree subsumption statistics:
% tried: 1
% length fails: 0
% strength fails: 0
% predlist fails: 1
% 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/HEN010-4+eq_r.in")
%
%------------------------------------------------------------------------------