TSTP Solution File: HEN008-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : HEN008-1 : 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 : art08.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/HEN008-1+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)
%
%
% START OF PROOF
% 16 [] quotient(X,Y,zero) | -less_equal(X,Y).
% 17 [] -quotient(X,Y,zero) | less_equal(X,Y).
% 19 [] -quotient(X,Y,Z) | -quotient(U,V,W) | -quotient(X1,Y,V) | -quotient(X2,Y,U) | -quotient(X2,X1,X) | less_equal(W,Z).
% 20 [] less_equal(zero,X).
% 21 [] -less_equal(X,Y) | -less_equal(Y,X) | equal(Y,X).
% 23 [] quotient(X,Y,divide(X,Y)).
% 25 [] less_equal(a,b).
% 26 [] quotient(a,c,a^qc).
% 27 [] quotient(b,c,b^qc).
% 28 [] -less_equal(a^qc,b^qc).
% 29 [hyper:16,20] quotient(zero,X,zero).
% 35 [hyper:16,25] quotient(a,b,zero).
% 520 [hyper:19,23,26,29,35,27] less_equal(divide(a^qc,b^qc),zero).
% 663 [hyper:21,520,cut:20] equal(zero,divide(a^qc,b^qc)).
% 665 [para:663.1.2,23.1.3] quotient(a^qc,b^qc,zero).
% 666 [hyper:17,665,cut:28] 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 2
% seconds given: 58
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 29
% derived clauses: 1331
% kept clauses: 29
% kept size sum: 155
% kept mid-nuclei: 603
% kept new demods: 8
% forw unit-subs: 416
% forw double-subs: 52
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 2
% full unit cutoff: 2
% dbl unit cutoff: 0
% real runtime : 0.3
% process. runtime: 0.2
% specific non-discr-tree subsumption statistics:
% tried: 378
% length fails: 0
% strength fails: 128
% predlist fails: 11
% aux str. fails: 239
% 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/HEN008-1+eq_r.in")
%
%------------------------------------------------------------------------------