TSTP Solution File: NUM017-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : NUM017-2 : TPTP v3.4.2. Bugfixed v1.2.1.
% 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/NUM/NUM017-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 7)
% (binary-posweight-order 29 #f 2 7)
% (binary-unit 29 #f 2 7)
% (binary-double 29 #f 2 7)
% (binary 29 #t 2 7)
% (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(16,40,0,32,0,0,5757,50,20,5773,0,20)
%
%
% START OF PROOF
% 5759 [] product(X,Y,multiply(X,Y)).
% 5761 [] -product(U,X,V) | -product(V,Y,W) | -product(X,Y,Z) | product(U,Z,W).
% 5762 [] -product(X,Y,Z) | product(Y,X,Z).
% 5763 [] -product(X,U,Z) | -product(X,Y,Z) | equal(Y,U).
% 5766 [] product(X,second_divided_by_1st(X,Y),Y) | -divides(X,Y).
% 5767 [] -product(X,Y,Z) | divides(X,Z).
% 5768 [] -product(X,X,Y) | -divides(Z,Y) | divides(Z,X) | -prime(Z).
% 5769 [] prime(a).
% 5773 [] -divides(X,c) | -divides(X,b).
% 5857 [hyper:5762,5759] product(X,Y,multiply(Y,X)).
% 5864 [hyper:5767,5759] divides(X,multiply(X,Y)).
% 5875 [hyper:5768,5864,5759,5769] divides(a,a).
% 5876 [hyper:5766,5875] product(a,second_divided_by_1st(a,a),a).
% 5998 [hyper:5767,5857] divides(X,multiply(Y,X)).
% 6264 [hyper:5761,5876,5857,5759] product(a,multiply(X,second_divided_by_1st(a,a)),multiply(a,X)).
% 46133 [hyper:5763,6264,5759] equal(X,multiply(X,second_divided_by_1st(a,a))).
% 46436 [para:46133.1.2,5998.1.2] divides(second_divided_by_1st(a,a),X).
% 47105 [hyper:5773,46436,cut:46436] 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 7
% clause depth limited to 3
% seconds given: 58
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 346
% derived clauses: 565638
% kept clauses: 831
% kept size sum: 8843
% kept mid-nuclei: 46205
% kept new demods: 35
% forw unit-subs: 314109
% forw double-subs: 680
% forw overdouble-subs: 0
% backward subs: 12
% fast unit cutoff: 5
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 5.58
% process. runtime: 5.57
% specific non-discr-tree subsumption statistics:
% tried: 732
% length fails: 0
% strength fails: 88
% predlist fails: 20
% aux str. fails: 204
% by-lit fails: 0
% full subs tried: 420
% full subs fail: 420
%
% ; 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/NUM/NUM017-2+eq_r.in")
%
%------------------------------------------------------------------------------