TSTP Solution File: HEN007-5 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : HEN007-5 : 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 20.0s
% Output : Assurance 20.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/HEN007-5+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: peq
%
% strategies selected:
% (hyper 30 #f 4 5)
% (binary-unit 12 #f)
% (binary-unit-uniteq 12 #f)
% (binary-posweight-kb-big-order 60 #f 4 5)
% (binary-posweight-lex-big-order 30 #f 4 5)
% (binary 30 #t)
% (binary-posweight-kb-big-order 156 #f)
% (binary-posweight-lex-big-order 102 #f)
% (binary-posweight-firstpref-order 60 #f)
% (binary-order 30 #f)
% (binary-posweight-kb-small-order 48 #f)
% (binary-posweight-lex-small-order 30 #f)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(9,40,0,18,0,0,217,50,2,226,0,2,3262,50,465,3271,0,465,10863,4,2345)
%
%
% START OF PROOF
% 3263 [] equal(X,X).
% 3264 [] equal(divide(divide(X,Y),X),zero).
% 3265 [] equal(divide(divide(divide(X,Y),divide(Z,Y)),divide(divide(X,Z),Y)),zero).
% 3266 [] equal(divide(zero,X),zero).
% 3267 [] -equal(divide(Y,X),zero) | -equal(divide(X,Y),zero) | equal(X,Y).
% 3269 [] -equal(divide(Y,Z),zero) | -equal(divide(X,Y),zero) | equal(divide(X,Z),zero).
% 3270 [] equal(divide(a,b),zero).
% 3271 [] -equal(divide(divide(c,b),divide(c,a)),zero).
% 3320 [hyper:3269,3265,3264] equal(divide(divide(divide(X,Y),divide(Z,Y)),divide(X,Z)),zero).
% 3416 [para:3270.1.1,3320.1.1.1.2] equal(divide(divide(divide(X,b),zero),divide(X,a)),zero).
% 3461 [para:3416.1.1,3265.1.1.2,demod:3266] equal(divide(divide(divide(divide(X,b),divide(X,a)),zero),zero),zero).
% 3797 [hyper:3267,3461,demod:3266,cut:3263] equal(zero,divide(divide(divide(X,b),divide(X,a)),zero)).
% 10874 [binary:3267.3,3271,demod:3266,3797,cut:3263] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 5
% clause depth limited to 6
% seconds given: 30
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 1146
% derived clauses: 1448666
% kept clauses: 5461
% kept size sum: 114489
% kept mid-nuclei: 5370
% kept new demods: 5472
% forw unit-subs: 1089031
% forw double-subs: 2
% forw overdouble-subs: 0
% backward subs: 49
% fast unit cutoff: 154
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 23.57
% process. runtime: 23.53
% specific non-discr-tree subsumption statistics:
% tried: 3
% length fails: 3
% 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/HEN007-5+eq_r.in")
%
%------------------------------------------------------------------------------