%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL445-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 : art04.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 99.8s
% Output : Assurance 99.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/SystemOnTPTP7611/LCL/LCL445-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,680650,4,2117,688744,5,2813,688744,1,2813,688744,50,2821,688744,40,2821,690119,0,2822,737899,3,4224,752313,4,4923,758118,5,5628,758119,5,5629,758120,1,5629,758120,50,5637,758120,40,5637,759495,0,5638,783466,3,6189,791310,4,6464,798109,5,6739,798109,5,6739,798110,1,6739,798110,50,6742,798110,40,6742,799485,0,6743,833173,3,7623,855981,4,8019,864588,5,8444,864588,5,8444,864589,1,8445,864589,50,8452,864589,40,8452,865964,0,8453,891903,3,9305,900359,4,9730)
%
%
% START OF PROOF
% 865958 [] -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)).
% 865959 [] -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(X,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)).
% 865961 [] c_in(c_^prop^log_^opl_^oop_^a_^n_62(c_^prop^log_^opl_^oop_^a_^n_62(X,Y,Z),c_^prop^log_^opl_^oop_^a_^n_62(c_^prop^log_^opl_^oop_^a_^n_62(c_^prop^log_^opl_^oop_^a_^n_62(X,c_^prop^log_^opl_^ofalse,Z),Y,Z),Y,Z),Z),c_^prop^log_^othms(U,Z),tc_^prop^log_^opl(Z)).
% 865962 [] 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)).
% 865963 [] c_in(v_q,c_^prop^log_^othms(c_insert(c_^prop^log_^opl_^oop_^a_^n_62(v_p,c_^prop^log_^opl_^ofalse,t_a),v_^h,tc_^prop^log_^opl(t_a)),t_a),tc_^prop^log_^opl(t_a)).
% 865964 [] -c_in(v_q,c_^prop^log_^othms(v_^h,t_a),tc_^prop^log_^opl(t_a)).
% 866053 [binary:865958,865962] 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)).
% 866087 [binary:865959.2,866053] -c_in(c_^prop^log_^opl_^oop_^a_^n_62(c_^prop^log_^opl_^oop_^a_^n_62(v_p,v_q,t_a),X,t_a),c_^prop^log_^othms(v_^h,t_a),tc_^prop^log_^opl(t_a)) | c_in(X,c_^prop^log_^othms(v_^h,t_a),tc_^prop^log_^opl(t_a)).
% 866154 [binary:865958,865963] c_in(c_^prop^log_^opl_^oop_^a_^n_62(c_^prop^log_^opl_^oop_^a_^n_62(v_p,c_^prop^log_^opl_^ofalse,t_a),v_q,t_a),c_^prop^log_^othms(v_^h,t_a),tc_^prop^log_^opl(t_a)).
% 883896 [binary:865961,866087] c_in(c_^prop^log_^opl_^oop_^a_^n_62(c_^prop^log_^opl_^oop_^a_^n_62(c_^prop^log_^opl_^oop_^a_^n_62(v_p,c_^prop^log_^opl_^ofalse,t_a),v_q,t_a),v_q,t_a),c_^prop^log_^othms(v_^h,t_a),tc_^prop^log_^opl(t_a)).
% 907455 [binary:883896,865959,cut:866154,cut:865964] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using sos strategy
% using unit paramodulation strategy
% using unit strategy
% using double strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 17
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 11249
% derived clauses: 1253844
% kept clauses: 252384
% kept size sum: 727522
% kept mid-nuclei: 43443
% kept new demods: 152
% forw unit-subs: 162042
% forw double-subs: 24021
% forw overdouble-subs: 2957
% backward subs: 111
% fast unit cutoff: 4603
% full unit cutoff: 2540
% dbl unit cutoff: 1
% real runtime : 101.87
% process. runtime: 101.62
% specific non-discr-tree subsumption statistics:
% tried: 174699
% length fails: 13533
% strength fails: 24721
% predlist fails: 24896
% aux str. fails: 8923
% by-lit fails: 17835
% full subs tried: 57619
% full subs fail: 54649
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP7611/LCL/LCL445-1+eq_r.in")
% WARNING: TreeLimitedRun lost 99.83s, total lost is 99.83s
%
%------------------------------------------------------------------------------