TSTP Solution File: HEN011-4 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : HEN011-4 : 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 : art05.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-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 *********
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(19,40,0,38,0,0)
%
%
% START OF PROOF
% 20 [] equal(X,X).
% 22 [] -equal(divide(X,Y),zero) | less_equal(X,Y).
% 23 [] less_equal(divide(X,Y),X).
% 24 [] less_equal(divide(divide(X,Y),divide(Z,Y)),divide(divide(X,Z),Y)).
% 26 [] -less_equal(Y,X) | -less_equal(X,Y) | equal(X,Y).
% 30 [] equal(divide(X,X),zero).
% 32 [] -less_equal(Y,Z) | -less_equal(X,Y) | less_equal(X,Z).
% 33 [] -less_equal(divide(X,Y),Z) | less_equal(divide(X,Z),Y).
% 36 [] equal(divide(identity,divide(identity,divide(identity,X))),divide(identity,X)).
% 38 [] -equal(divide(divide(identity,a),divide(identity,divide(identity,b))),divide(divide(identity,b),divide(identity,divide(identity,a)))).
% 43 [para:30.1.1,22.1.1,cut:20] less_equal(X,X).
% 64 [binary:23,32] -less_equal(X,divide(Y,Z)) | less_equal(X,Y).
% 69 [binary:24,64] less_equal(divide(divide(X,Y),divide(Z,Y)),divide(X,Z)).
% 76 [binary:43,33] less_equal(divide(X,divide(X,Y)),Y).
% 82 [binary:32,76] -less_equal(X,divide(Y,divide(Y,Z))) | less_equal(X,Z).
% 196 [binary:82,69] less_equal(divide(divide(X,Y),divide(divide(X,Z),Y)),Z).
% 241 [binary:33,196] less_equal(divide(divide(X,Y),Z),divide(divide(X,Z),Y)).
% 278 [binary:26,241,cut:241] equal(divide(divide(X,Y),Z),divide(divide(X,Z),Y)).
% 340 [para:278.1.1,38.1.1,demod:36] -equal(divide(divide(identity,b),a),divide(divide(identity,b),divide(identity,divide(identity,a)))).
% 436 [para:278.1.1,340.1.2,demod:36,cut:278] 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: 96
% derived clauses: 4005
% kept clauses: 370
% kept size sum: 5040
% kept mid-nuclei: 0
% kept new demods: 54
% forw unit-subs: 2828
% forw double-subs: 120
% forw overdouble-subs: 0
% backward subs: 7
% fast unit cutoff: 14
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.3
% process. runtime: 0.4
% 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/HEN011-4+eq_r.in")
%
%------------------------------------------------------------------------------