%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : LCL436-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 : art09.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory   : 1003MB
% OS       : Linux 2.6.11-1.1369_FC4
% CPULimit : 600s

% Result   : Unsatisfiable 24.8s
% Output   : Assurance 24.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/SystemOnTPTP6305/LCL/LCL436-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 5 7)
% (binary-unit 28 #f 5 7)
% (binary-double 11 #f 5 7)
% (binary-double 17 #f)
% (binary-double 17 #t)
% (binary 87 #t 5 7)
% (binary-order 28 #f 5 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(1375,40,6,2750,0,12,21539,4,2282)
% 
% 
% START OF PROOF
% 2747 [] c_in(c_^prop^log_^opl_^oop_^a_^n_62(c_^prop^log_^opl_^oop_^a_^n_62(X,c_^prop^log_^opl_^oop_^a_^n_62(Y,Z,U),U),c_^prop^log_^opl_^oop_^a_^n_62(c_^prop^log_^opl_^oop_^a_^n_62(X,Y,U),c_^prop^log_^opl_^oop_^a_^n_62(X,Z,U),U),U),c_^prop^log_^othms(V,U),tc_^prop^log_^opl(U)).
% 2749 [] c_in(c_^prop^log_^opl_^oop_^a_^n_62(X,Y,Z),c_^prop^log_^othms(U,Z),tc_^prop^log_^opl(Z)) | -c_in(Y,c_^prop^log_^othms(U,Z),tc_^prop^log_^opl(Z)).
% 2750 [] -c_in(c_^prop^log_^opl_^oop_^a_^n_62(v_p,c_^prop^log_^opl_^oop_^a_^n_62(c_^prop^log_^opl_^oop_^a_^n_62(v_pa,c_^prop^log_^opl_^oop_^a_^n_62(v_q,v_r,t_a),t_a),c_^prop^log_^opl_^oop_^a_^n_62(c_^prop^log_^opl_^oop_^a_^n_62(v_pa,v_q,t_a),c_^prop^log_^opl_^oop_^a_^n_62(v_pa,v_r,t_a),t_a),t_a),t_a),c_^prop^log_^othms(v_^h,t_a),tc_^prop^log_^opl(t_a)).
% 29515 [binary:2749,2750,cut:2747] 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 5
% seconds given: 28
% 
% 
% old unit clauses discarded
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    1403
%  derived clauses:   87181
%  kept clauses:      16599
%  kept size sum:     0
%  kept mid-nuclei:   3651
%  kept new demods:   22
%  forw unit-subs:    13883
%  forw double-subs: 2091
%  forw overdouble-subs: 7213
%  backward subs:     19
%  fast unit cutoff:  308
%  full unit cutoff:  30
%  dbl  unit cutoff:  37
%  real runtime  :  26.24
%  process. runtime:  26.5
% specific non-discr-tree subsumption statistics: 
%  tried:           4159293
%  length fails:    13
%  strength fails:  14
%  predlist fails:  233567
%  aux str. fails:  2
%  by-lit fails:    181215
%  full subs tried: 3725814
%  full subs fail:  3717803
% 
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP6305/LCL/LCL436-1+eq_r.in")
% WARNING: TreeLimitedRun lost 24.82s, total lost is 24.82s
% 
%------------------------------------------------------------------------------