%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SET822-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 : art02.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 19.8s
% Output   : Assurance 19.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/SystemOnTPTP22176/SET/SET822-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(1361,40,6,2722,0,12,283587,4,2117)
% 
% 
% START OF PROOF
% 1525 [] -c_in(X,c_^inter(Y,Z),Z) | -c_in(U,Y,tc_set(Z)) | c_in(X,U,Z).
% 1536 [] -c_in(X,c_emptyset,Y).
% 1538 [] c_in(X,c_insert(X,Y,Z),Z).
% 1539 [] -c_in(X,c_insert(Y,Z,U),U) | c_in(X,Z,U) | equal(X,Y).
% 1658 [] c_in(X,c_^u^n^i^v,Y).
% 2720 [] v_^p(v_f(v_b)).
% 2721 [] c_in(v_x(X,Y),Y,tc_^int^def_^oint) | -c_in(v_f(X),Y,tc_^int^def_^oint).
% 2722 [] -c_in(v_f(X),Y,tc_^int^def_^oint) | -v_^p(v_x(X,Y)).
% 4839 [hyper:2721,1538] c_in(v_x(X,c_insert(v_f(X),Y,tc_^int^def_^oint)),c_insert(v_f(X),Y,tc_^int^def_^oint),tc_^int^def_^oint).
% 4982 [hyper:1539,4839] c_in(v_x(X,c_insert(v_f(X),Y,tc_^int^def_^oint)),Y,tc_^int^def_^oint) | equal(v_x(X,c_insert(v_f(X),Y,tc_^int^def_^oint)),v_f(X)).
% 12884 [hyper:1525,1658,4982,slowcut:1536] equal(v_x(X,c_insert(v_f(X),c_^inter(c_^u^n^i^v,tc_^int^def_^oint),tc_^int^def_^oint)),v_f(X)).
% 286795 [para:12884.1.1,2722.2.1,cut:1538,slowcut:2720] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% not using sos 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 4
% seconds given: 28
% 
% 
% old unit clauses discarded
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    2048
%  derived clauses:   711204
%  kept clauses:      77038
%  kept size sum:     0
%  kept mid-nuclei:   23691
%  kept new demods:   27
%  forw unit-subs:    75079
%  forw double-subs: 8904
%  forw overdouble-subs: 3570
%  backward subs:     16
%  fast unit cutoff:  600
%  full unit cutoff:  148
%  dbl  unit cutoff:  1
%  real runtime  :  22.7
%  process. runtime:  21.88
% specific non-discr-tree subsumption statistics: 
%  tried:           57129
%  length fails:    4411
%  strength fails:  12
%  predlist fails:  2018
%  aux str. fails:  2
%  by-lit fails:    44
%  full subs tried: 50126
%  full subs fail:  46500
% 
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP22176/SET/SET822-1+eq_r.in")
% WARNING: TreeLimitedRun lost 19.81s, total lost is 19.81s
% 
%------------------------------------------------------------------------------