%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : COL110-2 : 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 : art01.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 0.0s
% Output : Assurance 0.0s
% 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/SystemOnTPTP23106/COL/COL110-2+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: hne
% detected subclass: small
% detected subclass: short
%
% strategies selected:
% (hyper 29 #f 3 5)
% (binary-unit 11 #f 3 5)
% (binary-double 17 #f 3 5)
% (hyper 29 #f)
% (binary-unit 34 #f)
% (binary-weightorder 40 #f)
% (binary 17 #t)
% (binary-order 29 #f)
% (binary-posweight-order 111 #f 3 5)
% (binary-posweight-order 283 #f)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(8,40,0,16,0,0,38,50,0,46,0,0)
%
%
% START OF PROOF
% 39 [] c_in(c_^pair(c_^comb_^ocomb_^oop_^a_^d_^d(X,Y),c_^comb_^ocomb_^oop_^a_^d_^d(Z,U),tc_^comb_^ocomb,tc_^comb_^ocomb),c_^comb_^oparcontract,tc_prod(tc_^comb_^ocomb,tc_^comb_^ocomb)) | -c_in(c_^pair(X,Z,tc_^comb_^ocomb,tc_^comb_^ocomb),c_^comb_^oparcontract,tc_prod(tc_^comb_^ocomb,tc_^comb_^ocomb)) | -c_in(c_^pair(Y,U,tc_^comb_^ocomb,tc_^comb_^ocomb),c_^comb_^oparcontract,tc_prod(tc_^comb_^ocomb,tc_^comb_^ocomb)).
% 40 [] c_in(c_^pair(v_x,v_yb,tc_^comb_^ocomb,tc_^comb_^ocomb),c_^comb_^oparcontract,tc_prod(tc_^comb_^ocomb,tc_^comb_^ocomb)).
% 41 [] c_in(c_^pair(v_z,v_wa,tc_^comb_^ocomb,tc_^comb_^ocomb),c_^comb_^oparcontract,tc_prod(tc_^comb_^ocomb,tc_^comb_^ocomb)).
% 42 [] -c_in(c_^pair(c_^comb_^ocomb_^oop_^a_^d_^d(v_yb,v_wa),X,tc_^comb_^ocomb,tc_^comb_^ocomb),c_^comb_^oparcontract,tc_prod(tc_^comb_^ocomb,tc_^comb_^ocomb)) | -c_in(c_^pair(c_^comb_^ocomb_^oop_^a_^d_^d(v_ya,v_w),X,tc_^comb_^ocomb,tc_^comb_^ocomb),c_^comb_^oparcontract,tc_prod(tc_^comb_^ocomb,tc_^comb_^ocomb)).
% 43 [] c_in(c_^pair(v_ya,v_xb(X),tc_^comb_^ocomb,tc_^comb_^ocomb),c_^comb_^oparcontract,tc_prod(tc_^comb_^ocomb,tc_^comb_^ocomb)) | -c_in(c_^pair(v_x,X,tc_^comb_^ocomb,tc_^comb_^ocomb),c_^comb_^oparcontract,tc_prod(tc_^comb_^ocomb,tc_^comb_^ocomb)).
% 44 [] c_in(c_^pair(X,v_xb(X),tc_^comb_^ocomb,tc_^comb_^ocomb),c_^comb_^oparcontract,tc_prod(tc_^comb_^ocomb,tc_^comb_^ocomb)) | -c_in(c_^pair(v_x,X,tc_^comb_^ocomb,tc_^comb_^ocomb),c_^comb_^oparcontract,tc_prod(tc_^comb_^ocomb,tc_^comb_^ocomb)).
% 45 [] c_in(c_^pair(v_w,v_xaa(X),tc_^comb_^ocomb,tc_^comb_^ocomb),c_^comb_^oparcontract,tc_prod(tc_^comb_^ocomb,tc_^comb_^ocomb)) | -c_in(c_^pair(v_z,X,tc_^comb_^ocomb,tc_^comb_^ocomb),c_^comb_^oparcontract,tc_prod(tc_^comb_^ocomb,tc_^comb_^ocomb)).
% 46 [] c_in(c_^pair(X,v_xaa(X),tc_^comb_^ocomb,tc_^comb_^ocomb),c_^comb_^oparcontract,tc_prod(tc_^comb_^ocomb,tc_^comb_^ocomb)) | -c_in(c_^pair(v_z,X,tc_^comb_^ocomb,tc_^comb_^ocomb),c_^comb_^oparcontract,tc_prod(tc_^comb_^ocomb,tc_^comb_^ocomb)).
% 47 [hyper:43,40] c_in(c_^pair(v_ya,v_xb(v_yb),tc_^comb_^ocomb,tc_^comb_^ocomb),c_^comb_^oparcontract,tc_prod(tc_^comb_^ocomb,tc_^comb_^ocomb)).
% 48 [hyper:44,40] c_in(c_^pair(v_yb,v_xb(v_yb),tc_^comb_^ocomb,tc_^comb_^ocomb),c_^comb_^oparcontract,tc_prod(tc_^comb_^ocomb,tc_^comb_^ocomb)).
% 52 [hyper:45,41] c_in(c_^pair(v_w,v_xaa(v_wa),tc_^comb_^ocomb,tc_^comb_^ocomb),c_^comb_^oparcontract,tc_prod(tc_^comb_^ocomb,tc_^comb_^ocomb)).
% 53 [hyper:46,41] c_in(c_^pair(v_wa,v_xaa(v_wa),tc_^comb_^ocomb,tc_^comb_^ocomb),c_^comb_^oparcontract,tc_prod(tc_^comb_^ocomb,tc_^comb_^ocomb)).
% 84 [hyper:39,52,47] c_in(c_^pair(c_^comb_^ocomb_^oop_^a_^d_^d(v_ya,v_w),c_^comb_^ocomb_^oop_^a_^d_^d(v_xb(v_yb),v_xaa(v_wa)),tc_^comb_^ocomb,tc_^comb_^ocomb),c_^comb_^oparcontract,tc_prod(tc_^comb_^ocomb,tc_^comb_^ocomb)).
% 98 [hyper:39,53,48] c_in(c_^pair(c_^comb_^ocomb_^oop_^a_^d_^d(v_yb,v_wa),c_^comb_^ocomb_^oop_^a_^d_^d(v_xb(v_yb),v_xaa(v_wa)),tc_^comb_^ocomb,tc_^comb_^ocomb),c_^comb_^oparcontract,tc_prod(tc_^comb_^ocomb,tc_^comb_^ocomb)).
% 197 [hyper:42,84,cut:98] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 5
% clause depth limited to 4
% seconds given: 29
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 56
% derived clauses: 501
% kept clauses: 112
% kept size sum: 1944
% kept mid-nuclei: 48
% kept new demods: 0
% forw unit-subs: 124
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.2
% process. runtime: 0.1
% specific non-discr-tree subsumption statistics:
% tried: 0
% length fails: 0
% strength fails: 0
% predlist fails: 0
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 0
% full subs fail: 0
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP23106/COL/COL110-2+noeq.in")
%
%------------------------------------------------------------------------------