TSTP Solution File: HEN005-3 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : HEN005-3 : 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 : art02.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/HEN005-3+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(11,40,0,22,0,0)
%
%
% START OF PROOF
% 12 [] equal(X,X).
% 13 [] equal(divide(X,Y),zero) | -less_equal(X,Y).
% 14 [] -equal(divide(X,Y),zero) | less_equal(X,Y).
% 15 [] less_equal(divide(X,Y),X).
% 16 [] less_equal(divide(divide(X,Y),divide(Z,Y)),divide(divide(X,Z),Y)).
% 17 [] less_equal(zero,X).
% 18 [] -less_equal(Y,X) | -less_equal(X,Y) | equal(X,Y).
% 20 [] less_equal(a,b).
% 21 [] less_equal(b,c).
% 22 [] -less_equal(a,c).
% 24 [binary:17,13.2] equal(divide(zero,X),zero).
% 26 [binary:20,13.2] equal(divide(a,b),zero).
% 27 [binary:21,13.2] equal(divide(b,c),zero).
% 35 [binary:15,18] -less_equal(X,divide(X,Y)) | equal(X,divide(X,Y)).
% 41 [para:26.1.1,16.1.2.1,demod:24] less_equal(divide(divide(a,X),divide(b,X)),zero).
% 50 [para:27.1.1,41.1.1.2] less_equal(divide(divide(a,c),zero),zero).
% 58 [binary:18,50,cut:17] equal(zero,divide(divide(a,c),zero)).
% 60 [para:58.1.2,14.1.1,cut:12] less_equal(divide(a,c),zero).
% 63 [para:58.1.2,35.1.2,demod:58,cut:60,binarydemod:14,cut:22] 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 3
% seconds given: 57
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 31
% derived clauses: 193
% kept clauses: 32
% kept size sum: 267
% kept mid-nuclei: 0
% kept new demods: 11
% forw unit-subs: 129
% forw double-subs: 5
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 9
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.0
% process. runtime: 0.0
% 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/HEN005-3+eq_r.in")
%
%------------------------------------------------------------------------------