%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : NUM016-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/NUM/NUM016-2+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: nne
% detected subclass: small
% 
% strategies selected: 
% (hyper 27 #f 2 5)
% (binary-unit 10 #f 2 5)
% (binary-double 16 #f)
% (binary 16 #t 2 5)
% (binary-posweight-order 181 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 54 #f)
% (binary-order 27 #f 2 5)
% (binary-weightorder 71 #f)
% (binary-order 27 #f)
% (hyper-order 54 #f)
% (binary 63 #t)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(8,40,0,16,0,0,39,50,0,47,0,0)
% 
% 
% START OF PROOF
% 40 [] -less(X,X).
% 41 [] -less(X,Y) | -less(Y,X).
% 42 [] less(X,factorial_plus_one(X)).
% 43 [] -divides(X,factorial_plus_one(Y)) | less(Y,X).
% 44 [] divides(prime_divisor(X),X) | prime(X).
% 45 [] prime(prime_divisor(X)) | prime(X).
% 46 [] less(prime_divisor(X),X) | prime(X).
% 47 [] less(factorial_plus_one(a),X) | -less(a,X) | -prime(X).
% 54 [hyper:47,45,42,cut:40] prime(prime_divisor(factorial_plus_one(a))).
% 65 [hyper:47,44,42,cut:40] divides(prime_divisor(factorial_plus_one(a)),factorial_plus_one(a)).
% 70 [hyper:47,46,42,cut:40] less(prime_divisor(factorial_plus_one(a)),factorial_plus_one(a)).
% 76 [hyper:43,65] less(a,prime_divisor(factorial_plus_one(a))).
% 77 [hyper:47,76,cut:54] less(factorial_plus_one(a),prime_divisor(factorial_plus_one(a))).
% 82 [hyper:41,77,cut:70] 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 5
% clause depth limited to 3
% seconds given: 27
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    19
%  derived clauses:   70
%  kept clauses:      6
%  kept size sum:     35
%  kept mid-nuclei:   40
%  kept new demods:   0
%  forw unit-subs:    4
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     0
%  fast unit cutoff:  5
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.0
%  process. runtime:  0.0
% specific non-discr-tree subsumption statistics: 
%  tried:           15
%  length fails:    0
%  strength fails:  0
%  predlist fails:  15
%  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/NUM/NUM016-2+noeq.in")
% 
%------------------------------------------------------------------------------