TSTP Solution File: HEN004-4 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : HEN004-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 : art03.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/HEN004-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 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(12,40,1,24,0,1,48,50,2,60,0,2)
%
%
% START OF PROOF
% 49 [] equal(X,X).
% 51 [] -equal(divide(X,Y),zero) | less_equal(X,Y).
% 52 [] less_equal(divide(X,Y),X).
% 53 [] less_equal(divide(divide(X,Y),divide(Z,Y)),divide(divide(X,Z),Y)).
% 54 [] less_equal(zero,X).
% 55 [] -less_equal(Y,X) | -less_equal(X,Y) | equal(X,Y).
% 58 [] equal(divide(zero,X),zero).
% 59 [] equal(divide(X,X),zero).
% 60 [] -equal(divide(a,zero),a).
% 66 [para:59.1.1,53.1.2] less_equal(divide(divide(X,divide(X,Y)),divide(Y,divide(X,Y))),zero).
% 75 [binary:52,55] -less_equal(X,divide(X,Y)) | equal(X,divide(X,Y)).
% 92 [para:58.1.1,66.1.1.2] less_equal(divide(divide(X,divide(X,zero)),zero),zero).
% 100 [binary:55,92,cut:54] equal(zero,divide(divide(X,divide(X,zero)),zero)).
% 105 [para:100.1.2,51.1.1,cut:49] less_equal(divide(X,divide(X,zero)),zero).
% 107 [para:100.1.2,75.1.2,demod:100,cut:105,binarydemod:51] less_equal(X,divide(X,zero)).
% 109 [binary:55,107,cut:52,slowcut:60] 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: 58
% derived clauses: 636
% kept clauses: 55
% kept size sum: 631
% kept mid-nuclei: 0
% kept new demods: 19
% forw unit-subs: 490
% forw double-subs: 16
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 15
% 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/HEN004-4+eq_r.in")
%
%------------------------------------------------------------------------------