TSTP Solution File: HEN004-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : HEN004-2 : 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 : art09.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-2+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: long
%
% strategies selected:
% (hyper 58 #f 2 11)
% (binary-posweight-order 29 #f 2 11)
% (binary-unit 29 #f 2 11)
% (binary-double 29 #f 2 11)
% (binary 29 #t 2 11)
% (hyper 29 #t)
% (hyper 105 #f)
% (binary-unit-uniteq 17 #f)
% (binary-weightorder 23 #f)
% (binary-posweight-order 70 #f)
% (binary-posweight-lex-big-order 29 #f)
% (binary-posweight-lex-small-order 11 #f)
% (binary-order 29 #f)
% (binary-unit 46 #f)
% (binary 67 #t)
%
%
% **** EMPTY CLAUSE DERIVED ****
%
%
% timer checkpoints: c(14,40,1,28,0,1,655,50,4,669,0,4,3309,50,18,3323,0,18)
%
%
% START OF PROOF
% 3312 [] -quotient(X,Y,zero) | less_equal(X,Y).
% 3313 [] -quotient(X,Y,Z) | less_equal(Z,X).
% 3314 [] -quotient(Z,U,X2) | -quotient(V,W,X1) | -quotient(Y,U,W) | -quotient(X,U,V) | -quotient(X,Y,Z) | less_equal(X1,X2).
% 3315 [] less_equal(zero,X).
% 3316 [] -less_equal(Y,X) | -less_equal(X,Y) | equal(X,Y).
% 3318 [] quotient(X,Y,divide(X,Y)).
% 3321 [] quotient(zero,X,zero).
% 3322 [] quotient(X,X,zero).
% 3323 [] -quotient(x,zero,x).
% 3394 [hyper:3313,3318] less_equal(divide(X,Y),X).
% 3615 [hyper:3314,3318,3318,3322,3318,3321] less_equal(divide(divide(X,divide(X,zero)),zero),zero).
% 5016 [hyper:3316,3615,cut:3315] equal(zero,divide(divide(X,divide(X,zero)),zero)).
% 5017 [para:5016.1.2,3318.1.3] quotient(divide(X,divide(X,zero)),zero,zero).
% 5019 [hyper:3312,5017] less_equal(divide(X,divide(X,zero)),zero).
% 5398 [hyper:3316,5019,cut:3315] equal(zero,divide(X,divide(X,zero))).
% 5399 [para:5398.1.2,3318.1.3] quotient(X,divide(X,zero),zero).
% 5405 [hyper:3312,5399] less_equal(X,divide(X,zero)).
% 6063 [hyper:3316,5405,cut:3394] equal(divide(X,zero),X).
% 6065 [para:6063.1.1,3318.1.3,slowcut:3323] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 11
% clause depth limited to 4
% seconds given: 58
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 126
% derived clauses: 23593
% kept clauses: 120
% kept size sum: 1055
% kept mid-nuclei: 5850
% kept new demods: 17
% forw unit-subs: 11936
% forw double-subs: 4550
% forw overdouble-subs: 0
% backward subs: 9
% fast unit cutoff: 87
% full unit cutoff: 19
% dbl unit cutoff: 0
% real runtime : 0.33
% process. runtime: 0.33
% specific non-discr-tree subsumption statistics:
% tried: 4179
% length fails: 0
% strength fails: 798
% predlist fails: 483
% aux str. fails: 2556
% by-lit fails: 0
% full subs tried: 342
% full subs fail: 342
%
% ; 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-2+eq_r.in")
%
%------------------------------------------------------------------------------