%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL439-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 : 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 114.7s
% Output : Assurance 114.7s
% 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/SystemOnTPTP16662/LCL/LCL439-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(1373,40,6,2746,0,12,349716,4,2122,363117,5,2813,363118,1,2813,363118,50,2819,363118,40,2819,364491,0,2820,399974,3,4221,400891,4,4921,414502,5,5621,414504,5,5623,414504,1,5623,414504,50,5627,414504,40,5627,415877,0,5628,438790,3,6179,443072,4,6454,453927,5,6729,453928,5,6729,453929,1,6729,453929,50,6732,453929,40,6732,455302,0,6733,494442,3,7584,514503,4,8010,527039,5,8434,527040,5,8435,527041,1,8435,527041,50,8441,527041,40,8441,528414,0,8442,554889,3,9293,565143,4,9718,570718,5,10143,570719,5,10144,570720,1,10144,570720,50,10147,570720,40,10147,572093,0,10148)
%
%
% START OF PROOF
% 570731 [] c_in(X,c_^prop^log_^othms(Y,Z),tc_^prop^log_^opl(Z)) | -c_in(X,Y,tc_^prop^log_^opl(Z)).
% 570907 [] c_in(X,c_insert(X,Y,Z),Z).
% 572089 [] -c_in(X,c_^prop^log_^othms(c_insert(Y,Z,tc_^prop^log_^opl(U)),U),tc_^prop^log_^opl(U)) | c_in(c_^prop^log_^opl_^oop_^a_^n_62(Y,X,U),c_^prop^log_^othms(Z,U),tc_^prop^log_^opl(U)).
% 572090 [] -c_in(c_^prop^log_^opl_^oop_^a_^n_62(X,c_^prop^log_^opl_^ofalse,Y),c_^prop^log_^othms(Z,Y),tc_^prop^log_^opl(Y)) | -c_in(X,c_^prop^log_^othms(Z,Y),tc_^prop^log_^opl(Y)) | c_in(U,c_^prop^log_^othms(Z,Y),tc_^prop^log_^opl(Y)).
% 572091 [] c_in(X,c_^prop^log_^othms(c_insert(Y,Z,tc_^prop^log_^opl(U)),U),tc_^prop^log_^opl(U)) | -c_in(X,c_^prop^log_^othms(Z,U),tc_^prop^log_^opl(U)).
% 572092 [] c_in(c_^prop^log_^opl_^oop_^a_^n_62(v_p,c_^prop^log_^opl_^ofalse,t_a),c_^prop^log_^othms(v_^h,t_a),tc_^prop^log_^opl(t_a)).
% 572093 [] -c_in(c_^prop^log_^opl_^oop_^a_^n_62(v_p,v_q,t_a),c_^prop^log_^othms(v_^h,t_a),tc_^prop^log_^opl(t_a)).
% 572116 [binary:572091.2,572092] c_in(c_^prop^log_^opl_^oop_^a_^n_62(v_p,c_^prop^log_^opl_^ofalse,t_a),c_^prop^log_^othms(c_insert(X,v_^h,tc_^prop^log_^opl(t_a)),t_a),tc_^prop^log_^opl(t_a)).
% 572172 [binary:572089.2,572093] -c_in(v_q,c_^prop^log_^othms(c_insert(v_p,v_^h,tc_^prop^log_^opl(t_a)),t_a),tc_^prop^log_^opl(t_a)).
% 572453 [binary:572090.3,572172] -c_in(c_^prop^log_^opl_^oop_^a_^n_62(X,c_^prop^log_^opl_^ofalse,t_a),c_^prop^log_^othms(c_insert(v_p,v_^h,tc_^prop^log_^opl(t_a)),t_a),tc_^prop^log_^opl(t_a)) | -c_in(X,c_^prop^log_^othms(c_insert(v_p,v_^h,tc_^prop^log_^opl(t_a)),t_a),tc_^prop^log_^opl(t_a)).
% 622030 [binary:572116,572453] -c_in(v_p,c_^prop^log_^othms(c_insert(v_p,v_^h,tc_^prop^log_^opl(t_a)),t_a),tc_^prop^log_^opl(t_a)).
% 622046 [binary:570731,622030,cut:570907] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using sos 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: 87
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 13730
% derived clauses: 1394809
% kept clauses: 269885
% kept size sum: 0
% kept mid-nuclei: 56305
% kept new demods: 143
% forw unit-subs: 161224
% forw double-subs: 30756
% forw overdouble-subs: 5216
% backward subs: 189
% fast unit cutoff: 14004
% full unit cutoff: 6848
% dbl unit cutoff: 125
% real runtime : 118.33
% process. runtime: 117.80
% specific non-discr-tree subsumption statistics:
% tried: 423698
% length fails: 50332
% strength fails: 44030
% predlist fails: 75442
% aux str. fails: 31624
% by-lit fails: 37382
% full subs tried: 144444
% full subs fail: 139219
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP16662/LCL/LCL439-1+eq_r.in")
% WARNING: TreeLimitedRun lost 114.69s, total lost is 114.69s
%
%------------------------------------------------------------------------------