TSTP Solution File: HEN010-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : HEN010-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 : 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 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/HEN010-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,0,28,0,0,2565,50,9,2579,0,9)
%
%
% START OF PROOF
% 2567 [] quotient(X,Y,zero) | -less_equal(X,Y).
% 2568 [] -quotient(X,Y,zero) | less_equal(X,Y).
% 2569 [] -quotient(X,Y,Z) | less_equal(Z,X).
% 2570 [] -quotient(Z,U,X2) | -quotient(V,W,X1) | -quotient(Y,U,W) | -quotient(X,U,V) | -quotient(X,Y,Z) | less_equal(X1,X2).
% 2571 [] less_equal(zero,X).
% 2572 [] -less_equal(Y,X) | -less_equal(X,Y) | equal(X,Y).
% 2573 [] less_equal(X,identity).
% 2574 [] quotient(X,Y,divide(X,Y)).
% 2575 [] -quotient(X,Y,U) | -quotient(X,Y,Z) | equal(Z,U).
% 2576 [] quotient(identity,a,id^qa).
% 2577 [] quotient(identity,id^qa,id^q_id^qa).
% 2578 [] quotient(id^qa,id^q_id^qa,id^qa_^q__id^q_id^qa).
% 2579 [] -equal(id^qa,id^qa_^q__id^q_id^qa).
% 2580 [hyper:2567,2571] quotient(zero,X,zero).
% 2583 [hyper:2567,2573] quotient(X,identity,zero).
% 2673 [hyper:2569,2578] less_equal(id^qa_^q__id^q_id^qa,id^qa).
% 2737 [hyper:2569,2574] less_equal(divide(X,Y),X).
% 2797 [hyper:2570,2574,2574,2574,2574,2583] less_equal(divide(divide(X,Y),divide(identity,Y)),divide(zero,Y)).
% 2820 [hyper:2570,2574,2574,2574,2576,2574] less_equal(divide(id^qa,divide(X,a)),divide(divide(identity,X),a)).
% 3251 [hyper:2570,2574,2583,2580,2577,2574] less_equal(divide(divide(X,id^qa),id^q_id^qa),zero).
% 3252 [hyper:2570,2574,2583,2580,2576,2576] less_equal(divide(id^qa,id^qa),zero).
% 3253 [hyper:2570,2574,2583,2580,2576,2574] less_equal(divide(divide(X,a),id^qa),zero).
% 3492 [hyper:2575,2574,2580] equal(zero,divide(zero,X)).
% 3496 [hyper:2575,2574,2578] equal(id^qa_^q__id^q_id^qa,divide(id^qa,id^q_id^qa)).
% 3499 [hyper:2567,2737] quotient(divide(X,Y),X,zero).
% 3506 [hyper:2572,3252,cut:2571] equal(zero,divide(id^qa,id^qa)).
% 3644 [para:3506.1.2,2574.1.3] quotient(id^qa,id^qa,zero).
% 3657 [hyper:2570,3644,2576,2574,2574,2577] less_equal(divide(id^q_id^qa,divide(a,id^qa)),zero).
% 4965 [hyper:2575,3499,2574] equal(divide(divide(X,Y),X),zero).
% 6346 [hyper:2572,2797,demod:3492,cut:2571] equal(zero,divide(divide(X,Y),divide(identity,Y))).
% 7257 [hyper:2572,3251,cut:2571] equal(zero,divide(divide(X,id^qa),id^q_id^qa)).
% 7259 [hyper:2572,3253,cut:2571] equal(zero,divide(divide(X,a),id^qa)).
% 7260 [para:7257.1.2,2574.1.3] quotient(divide(X,id^qa),id^q_id^qa,zero).
% 7261 [hyper:2568,7260] less_equal(divide(X,id^qa),id^q_id^qa).
% 7275 [hyper:2570,7260,2574,2574,2574,2574,demod:3496] less_equal(divide(divide(X,id^q_id^qa),id^qa_^q__id^q_id^qa),zero).
% 7544 [para:7259.1.2,2574.1.3] quotient(divide(X,a),id^qa,zero).
% 7545 [hyper:2568,7544] less_equal(divide(X,a),id^qa).
% 7810 [hyper:2572,7275,cut:2571] equal(zero,divide(divide(X,id^q_id^qa),id^qa_^q__id^q_id^qa)).
% 7813 [para:7810.1.2,2574.1.3] quotient(divide(X,id^q_id^qa),id^qa_^q__id^q_id^qa,zero).
% 7825 [hyper:2570,7813,2574,2574,2574,2574] less_equal(divide(divide(X,id^qa_^q__id^q_id^qa),divide(id^q_id^qa,id^qa_^q__id^q_id^qa)),zero).
% 8083 [hyper:2572,3657,cut:2571] equal(zero,divide(id^q_id^qa,divide(a,id^qa))).
% 9279 [para:8083.1.2,2574.1.3] quotient(id^q_id^qa,divide(a,id^qa),zero).
% 9285 [hyper:2568,9279] less_equal(id^q_id^qa,divide(a,id^qa)).
% 9623 [hyper:2572,9285,cut:7261] equal(divide(a,id^qa),id^q_id^qa).
% 9626 [para:9623.1.1,3499.1.1] quotient(id^q_id^qa,a,zero).
% 10445 [hyper:2570,9626,2574,2574,2574,2574,demod:3492] less_equal(divide(divide(id^q_id^qa,X),divide(a,X)),zero).
% 22749 [para:6346.1.2,2574.1.3] quotient(divide(X,Y),divide(identity,Y),zero).
% 22750 [hyper:2568,22749] less_equal(divide(X,Y),divide(identity,Y)).
% 23860 [hyper:2572,10445,cut:2571] equal(zero,divide(divide(id^q_id^qa,X),divide(a,X))).
% 23861 [para:23860.1.2,2574.1.3] quotient(divide(id^q_id^qa,X),divide(a,X),zero).
% 23862 [hyper:2568,23861] less_equal(divide(id^q_id^qa,X),divide(a,X)).
% 24387 [hyper:2572,7825,cut:2571] equal(zero,divide(divide(X,id^qa_^q__id^q_id^qa),divide(id^q_id^qa,id^qa_^q__id^q_id^qa))).
% 24388 [para:24387.1.2,2574.1.3] quotient(divide(X,id^qa_^q__id^q_id^qa),divide(id^q_id^qa,id^qa_^q__id^q_id^qa),zero).
% 24389 [hyper:2568,24388] less_equal(divide(X,id^qa_^q__id^q_id^qa),divide(id^q_id^qa,id^qa_^q__id^q_id^qa)).
% 24835 [hyper:2572,24389,22750] equal(divide(id^q_id^qa,id^qa_^q__id^q_id^qa),divide(identity,id^qa_^q__id^q_id^qa)).
% 24836 [hyper:2572,24389,23862] equal(divide(id^q_id^qa,id^qa_^q__id^q_id^qa),divide(a,id^qa_^q__id^q_id^qa)).
% 24847 [para:24835.1.2,2820.1.2.1,demod:4965,24836] less_equal(divide(id^qa,divide(id^qa_^q__id^q_id^qa,a)),zero).
% 25843 [hyper:2572,24847,cut:2571] equal(zero,divide(id^qa,divide(id^qa_^q__id^q_id^qa,a))).
% 25846 [para:25843.1.2,2574.1.3] quotient(id^qa,divide(id^qa_^q__id^q_id^qa,a),zero).
% 25849 [hyper:2568,25846] less_equal(id^qa,divide(id^qa_^q__id^q_id^qa,a)).
% 26301 [hyper:2572,25849,cut:7545] equal(divide(id^qa_^q__id^q_id^qa,a),id^qa).
% 26303 [para:26301.1.1,2737.1.1] less_equal(id^qa,id^qa_^q__id^q_id^qa).
% 26309 [hyper:2572,26303,cut:2673] equal(id^qa,id^qa_^q__id^q_id^qa).
% 26337 [hyper:2579,26309] 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 3
% seconds given: 58
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 243
% derived clauses: 96175
% kept clauses: 330
% kept size sum: 2459
% kept mid-nuclei: 25928
% kept new demods: 54
% forw unit-subs: 53211
% forw double-subs: 14489
% forw overdouble-subs: 0
% backward subs: 16
% fast unit cutoff: 627
% full unit cutoff: 24
% dbl unit cutoff: 0
% real runtime : 1.18
% process. runtime: 1.17
% specific non-discr-tree subsumption statistics:
% tried: 20608
% length fails: 0
% strength fails: 7731
% predlist fails: 4201
% aux str. fails: 8462
% by-lit fails: 0
% full subs tried: 214
% full subs fail: 214
%
% ; 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/HEN010-1+eq_r.in")
%
%------------------------------------------------------------------------------