TSTP Solution File: HEN011-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : HEN011-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 : art04.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/HEN011-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(27,40,0,54,0,0)
%
%
% START OF PROOF
% 31 [] -quotient(X,Y,Z) | less_equal(Z,X).
% 32 [] -quotient(Z,U,X2) | -quotient(V,W,X1) | -quotient(Y,U,W) | -quotient(X,U,V) | -quotient(X,Y,Z) | less_equal(X1,X2).
% 34 [] -less_equal(Y,X) | -less_equal(X,Y) | equal(X,Y).
% 36 [] quotient(X,Y,divide(X,Y)).
% 42 [] -less_equal(Y,Z) | -less_equal(X,Y) | less_equal(X,Z).
% 43 [] -quotient(X,Y,Z) | -quotient(X,U,V) | -less_equal(V,Y) | less_equal(Z,U).
% 46 [] -quotient(identity,Y,Z) | -quotient(identity,U,X) | -quotient(identity,X,Y) | equal(X,Z).
% 48 [] quotient(identity,a,id^qa).
% 49 [] quotient(identity,b,id^qb).
% 50 [] quotient(identity,id^qb,id^q_id^qb).
% 51 [] quotient(id^qa,id^q_id^qb,id^qa_^q__id^q_id^qb).
% 52 [] quotient(identity,id^qa,id^q_id^qa).
% 53 [] quotient(id^qb,id^q_id^qa,id^qb_^q__id^q_id^qa).
% 54 [] -equal(id^qa_^q__id^q_id^qb,id^qb_^q__id^q_id^qa).
% 1640 [hyper:31,36] less_equal(divide(X,Y),X).
% 3983 [hyper:46,36,50,slowcut:49] equal(id^qb,divide(identity,id^q_id^qb)).
% 3985 [hyper:46,36,52,slowcut:48] equal(id^qa,divide(identity,id^q_id^qa)).
% 4652 [hyper:32,36,52,51,36,36,demod:3983] less_equal(divide(id^qb,id^qa_^q__id^q_id^qb),divide(id^q_id^qa,id^q_id^qb)).
% 4721 [hyper:32,36,50,53,36,36,demod:3985] less_equal(divide(id^qa,id^qb_^q__id^q_id^qa),divide(id^q_id^qb,id^q_id^qa)).
% 42065 [hyper:42,4652,1640] less_equal(divide(id^qb,id^qa_^q__id^q_id^qb),id^q_id^qa).
% 42108 [hyper:43,42065,36,53] less_equal(id^qb_^q__id^q_id^qa,id^qa_^q__id^q_id^qb).
% 42210 [hyper:42,4721,1640] less_equal(divide(id^qa,id^qb_^q__id^q_id^qa),id^q_id^qb).
% 43162 [hyper:43,42210,36,51] less_equal(id^qa_^q__id^q_id^qb,id^qb_^q__id^q_id^qa).
% 43186 [hyper:34,43162,cut:42108] equal(id^qa_^q__id^q_id^qb,id^qb_^q__id^q_id^qa).
% 43292 [hyper:54,43186] 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: 315
% derived clauses: 117710
% kept clauses: 396
% kept size sum: 2357
% kept mid-nuclei: 42689
% kept new demods: 39
% forw unit-subs: 52257
% forw double-subs: 13752
% forw overdouble-subs: 0
% backward subs: 22
% fast unit cutoff: 281
% full unit cutoff: 140
% dbl unit cutoff: 0
% real runtime : 1.60
% process. runtime: 1.60
% specific non-discr-tree subsumption statistics:
% tried: 59948
% length fails: 1
% strength fails: 26378
% predlist fails: 24599
% aux str. fails: 8799
% by-lit fails: 0
% full subs tried: 171
% full subs fail: 171
%
% ; 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/HEN011-2+eq_r.in")
%
%------------------------------------------------------------------------------