TSTP Solution File: HEN009-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : HEN009-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 : art06.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/HEN009-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(22,40,0,44,0,0)
%
%
% START OF PROOF
% 25 [] -quotient(X,Y,zero) | less_equal(X,Y).
% 29 [] -less_equal(X,Y) | -less_equal(Y,X) | equal(Y,X).
% 35 [] quotient(X,X,zero).
% 38 [] -quotient(X,Y,Z) | -quotient(X,U,V) | -less_equal(V,Y) | less_equal(Z,U).
% 39 [] -quotient(X,Y,Z) | -quotient(X,U,V) | -less_equal(Y,U) | less_equal(V,Z).
% 41 [] quotient(identity,a,id^qa).
% 42 [] quotient(identity,id^qa,id^q_id^qa).
% 43 [] quotient(identity,id^q_id^qa,id^q__id^q_id^qa).
% 44 [] -equal(id^qa,id^q__id^q_id^qa).
% 58 [hyper:25,35] less_equal(X,X).
% 577 [hyper:38,42,41,cut:58] less_equal(id^q_id^qa,a).
% 717 [hyper:38,43,42,cut:58] less_equal(id^q__id^q_id^qa,id^qa).
% 726 [hyper:39,43,41,cut:577] less_equal(id^qa,id^q__id^q_id^qa).
% 761 [hyper:29,717,cut:726] equal(id^qa,id^q__id^q_id^qa).
% 789 [hyper:44,761] 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: 16
% derived clauses: 1539
% kept clauses: 10
% kept size sum: 33
% kept mid-nuclei: 719
% kept new demods: 3
% forw unit-subs: 565
% forw double-subs: 227
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 18
% full unit cutoff: 15
% dbl unit cutoff: 0
% real runtime : 0.2
% process. runtime: 0.2
% specific non-discr-tree subsumption statistics:
% tried: 1138
% length fails: 0
% strength fails: 687
% predlist fails: 451
% 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/HEN009-2+eq_r.in")
%
%------------------------------------------------------------------------------