%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SET838-1 : 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 : art10.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 54.8s
% Output   : Assurance 54.8s
% 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/SystemOnTPTP5302/SET/SET838-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: neq
% detected subclass: big
% 
% strategies selected: 
% (hyper 28 #f 4 7)
% (binary-unit 28 #f 4 7)
% (binary-double 11 #f 4 7)
% (binary-double 17 #f)
% (binary-double 17 #t)
% (binary 87 #t 4 7)
% (binary-order 28 #f 4 7)
% (binary-posweight-order 58 #f)
% (binary-posweight-lex-big-order 28 #f)
% (binary-posweight-lex-small-order 11 #f)
% (binary-order-sos 28 #t)
% (binary-unit-uniteq 28 #f)
% (binary-weightorder 28 #f)
% (binary-weightorder-sos 17 #f)
% (binary-order 28 #f)
% (hyper-order 17 #f)
% (binary 141 #t)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(1362,40,6,2724,0,12,378997,4,2114,428349,5,2813,428350,1,2813,428350,50,2820,428350,40,2820,429712,0,2821,465519,3,4222,468383,4,4922,491272,5,5622,491273,5,5623,491274,1,5623,491274,50,5627,491274,40,5627,492636,0,5628)
% 
% 
% START OF PROOF
% 491275 [] equal(X,X).
% 492633 [] equal(v_f(v_g(v_x)),v_x).
% 492634 [] -equal(v_f(v_g(X)),X) | equal(X,v_x).
% 492635 [] equal(v_g(v_f(v_xa(X))),v_xa(X)) | -equal(v_g(v_f(X)),X).
% 492636 [] -equal(v_g(v_f(X)),X) | -equal(v_xa(X),X).
% 492655 [para:492635.1.1,492634.1.1.1,cut:491275] equal(v_f(v_xa(X)),v_x) | -equal(v_g(v_f(X)),X).
% 492684 [para:492633.1.1,492655.2.1.1,cut:491275] equal(v_f(v_xa(v_g(v_x))),v_x).
% 492699 [para:492684.1.1,492635.1.1.1,demod:492633,cut:491275] equal(v_g(v_x),v_xa(v_g(v_x))).
% 492700 [para:492684.1.1,492636.1.1.1,demod:492699,cut:491275] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% not using sos strategy
% using double 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 7
% clause depth limited to 4
% seconds given: 11
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    6685
%  derived clauses:   1129084
%  kept clauses:      114281
%  kept size sum:     530828
%  kept mid-nuclei:   36768
%  kept new demods:   78
%  forw unit-subs:    97153
%  forw double-subs: 7762
%  forw overdouble-subs: 2162
%  backward subs:     40
%  fast unit cutoff:  16266
%  full unit cutoff:  2103
%  dbl  unit cutoff:  7
%  real runtime  :  56.46
%  process. runtime:  56.25
% specific non-discr-tree subsumption statistics: 
%  tried:           97907
%  length fails:    7837
%  strength fails:  9659
%  predlist fails:  1333
%  aux str. fails:  4063
%  by-lit fails:    939
%  full subs tried: 73821
%  full subs fail:  71663
% 
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP5302/SET/SET838-1+eq_r.in")
% WARNING: TreeLimitedRun lost 54.82s, total lost is 54.82s
% 
%------------------------------------------------------------------------------