%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : NUM001-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 : art10.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/NUM001-1+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: hne
% detected subclass: medium
% detected subclass: short
% 
% strategies selected: 
% (hyper 12 #t 3 5)
% (binary-unit 30 #f 3 5)
% (binary-posweight-order 90 #f 3 5)
% (binary-double 30 #f)
% (binary 48 #t 3 5)
% (hyper 30 #f)
% (binary-posweight-order 180 #f)
% (binary-weightorder 42 #f)
% (binary-order 30 #f)
% (binary-unit 48 #f)
% (binary 60 #t)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(13,40,0,26,0,0,26,50,0,39,0,0,39,50,0,52,0,0,52,50,0,65,0,0,65,50,0,78,0,0,78,50,0,91,0,0,91,50,0,104,0,0,104,50,0,117,0,0,117,50,0,130,0,0,130,50,0,143,0,0,143,50,0,156,0,0,156,50,0,169,0,0,169,50,0,182,0,0,182,50,0,195,0,0,195,50,0,208,0,0,208,50,0,221,0,0,221,50,0,234,0,1,234,50,1,247,0,1,247,50,1,260,0,1,260,50,1,260,40,1,273,0,1)
% 
% 
% START OF PROOF
% 262 [] -equalish(Y,Z) | -equalish(X,Y) | equalish(X,Z).
% 263 [] equalish(add(X,Y),add(Y,X)).
% 264 [] equalish(add(X,add(Y,Z)),add(add(X,Y),Z)).
% 273 [] -equalish(add(add(a,b),c),add(a,add(b,c))).
% 279 [binary:263,262] -equalish(X,add(Y,Z)) | equalish(X,add(Z,Y)).
% 280 [binary:263,262.2] -equalish(add(X,Y),Z) | equalish(add(Y,X),Z).
% 287 [binary:273,279.2] -equalish(add(add(a,b),c),add(add(b,c),a)).
% 293 [binary:262.3,287] -equalish(add(add(a,b),c),X) | -equalish(X,add(add(b,c),a)).
% 298 [binary:280,264] equalish(add(add(X,Y),Z),add(add(Z,X),Y)).
% 413 [binary:264,293.2] -equalish(add(add(a,b),c),add(b,add(c,a))).
% 448 [binary:279.2,413,cut:298] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% not using sos strategy
% using unit strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% clause length limited to 5
% clause depth limited to 3
% seconds given: 30
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    83
%  derived clauses:   747
%  kept clauses:      131
%  kept size sum:     1466
%  kept mid-nuclei:   0
%  kept new demods:   0
%  forw unit-subs:    94
%  forw double-subs: 2
%  forw overdouble-subs: 0
%  backward subs:     1
%  fast unit cutoff:  1
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.2
%  process. runtime:  0.1
% specific non-discr-tree subsumption statistics: 
%  tried:           4
%  length fails:    0
%  strength fails:  4
%  predlist fails:  0
%  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/NUM001-1+noeq.in")
% 
%------------------------------------------------------------------------------