%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SET838-2 : TPTP v3.4.2. Released v3.2.0.
% Transfm  : add_equality:r
% Format   : otter:hypothesis:set(auto),clear(print_given)
% Command  : gandalf-wrapper -time %d %s

% Computer : art08.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2794MHz
% Memory   : 1003MB
% OS       : Linux 2.6.11-1.1369_FC4
% 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: /tmp/SystemOnTPTP17705/SET/SET838-2+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: peq
% 
% strategies selected: 
% (hyper 30 #f 4 3)
% (binary-unit 12 #f)
% (binary-unit-uniteq 12 #f)
% (binary-posweight-kb-big-order 60 #f 4 3)
% (binary-posweight-lex-big-order 30 #f 4 3)
% (binary 30 #t)
% (binary-posweight-kb-big-order 156 #f)
% (binary-posweight-lex-big-order 102 #f)
% (binary-posweight-firstpref-order 60 #f)
% (binary-order 30 #f)
% (binary-posweight-kb-small-order 48 #f)
% (binary-posweight-lex-small-order 30 #f)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(5,40,0,10,0,0,13,50,0,18,0,0,21,50,0,26,0,0,29,50,0,34,0,0,37,50,0,42,0,0,45,50,0,50,0,0,53,50,0,58,0,0,61,50,0,66,0,0,69,50,0,74,0,0,77,50,0,82,0,0,85,50,0,90,0,0,93,50,0,98,0,0,101,50,0,106,0,0,109,50,0,114,0,0,117,50,0,122,0,0,125,50,0,130,0,0,133,50,0,138,0,0,141,50,0,146,0,1,149,50,1,149,40,1,154,0,1)
% 
% 
% START OF PROOF
% 150 [] equal(X,X).
% 151 [] equal(v_f(v_g(v_x)),v_x).
% 152 [] -equal(v_f(v_g(X)),X) | equal(X,v_x).
% 153 [] equal(v_g(v_f(v_xa(X))),v_xa(X)) | -equal(v_g(v_f(X)),X).
% 154 [] -equal(v_g(v_f(X)),X) | -equal(v_xa(X),X).
% 162 [para:151.1.1,153.2.1.1,cut:150] equal(v_g(v_f(v_xa(v_g(v_x)))),v_xa(v_g(v_x))).
% 166 [para:162.1.1,152.1.1.1,cut:150] equal(v_f(v_xa(v_g(v_x))),v_x).
% 171 [para:166.1.1,153.1.1.1,demod:151,cut:150] equal(v_g(v_x),v_xa(v_g(v_x))).
% 173 [para:171.1.2,154.2.1,demod:151,cut:150] 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
% seconds given: 12
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    100
%  derived clauses:   161
%  kept clauses:      15
%  kept size sum:     150
%  kept mid-nuclei:   0
%  kept new demods:   23
%  forw unit-subs:    86
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     0
%  fast unit cutoff:  6
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.2
%  process. runtime:  0.1
% specific non-discr-tree subsumption statistics: 
%  tried:           0
%  length fails:    0
%  strength fails:  0
%  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" "/tmp/SystemOnTPTP17705/SET/SET838-2+eq_r.in")
% 
%------------------------------------------------------------------------------