TSTP Solution File: COL109-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : COL109-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 : 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 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/SystemOnTPTP4371/COL/COL109-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 5 5)
% (binary-unit 11 #f 5 5)
% (binary-double 17 #f 5 5)
% (hyper 29 #f)
% (binary-unit 34 #f)
% (binary-weightorder 40 #f)
% (binary 17 #t)
% (binary-order 29 #f)
% (binary-posweight-order 111 #f 5 5)
% (binary-posweight-order 283 #f)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(6,40,0,12,0,0)
%
%
% START OF PROOF
% 7 [] c_in(c_^pair(c_^comb_^ocomb_^oop_^a_^d_^d(c_^comb_^ocomb_^oop_^a_^d_^d(c_^comb_^ocomb_^oop_^a_^d_^d(c_^comb_^ocomb_^o^s,X),Y),Z),c_^comb_^ocomb_^oop_^a_^d_^d(c_^comb_^ocomb_^oop_^a_^d_^d(X,Z),c_^comb_^ocomb_^oop_^a_^d_^d(Y,Z)),tc_^comb_^ocomb,tc_^comb_^ocomb),c_^comb_^oparcontract,tc_prod(tc_^comb_^ocomb,tc_^comb_^ocomb)).
% 8 [] 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)).
% 9 [] c_in(c_^pair(v_z,v_w,tc_^comb_^ocomb,tc_^comb_^ocomb),c_^comb_^oparcontract,tc_prod(tc_^comb_^ocomb,tc_^comb_^ocomb)).
% 10 [] c_in(c_^pair(v_xb,v_x_^h,tc_^comb_^ocomb,tc_^comb_^ocomb),c_^comb_^oparcontract,tc_prod(tc_^comb_^ocomb,tc_^comb_^ocomb)).
% 11 [] c_in(c_^pair(v_yb,v_y_^ha,tc_^comb_^ocomb,tc_^comb_^ocomb),c_^comb_^oparcontract,tc_prod(tc_^comb_^ocomb,tc_^comb_^ocomb)).
% 12 [] -c_in(c_^pair(c_^comb_^ocomb_^oop_^a_^d_^d(c_^comb_^ocomb_^oop_^a_^d_^d(c_^comb_^ocomb_^oop_^a_^d_^d(c_^comb_^ocomb_^o^s,v_x_^h),v_y_^ha),v_w),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(c_^comb_^ocomb_^oop_^a_^d_^d(v_xb,v_z),c_^comb_^ocomb_^oop_^a_^d_^d(v_yb,v_z)),X,tc_^comb_^ocomb,tc_^comb_^ocomb),c_^comb_^oparcontract,tc_prod(tc_^comb_^ocomb,tc_^comb_^ocomb)).
% 17 [hyper:8,10,9] c_in(c_^pair(c_^comb_^ocomb_^oop_^a_^d_^d(v_xb,v_z),c_^comb_^ocomb_^oop_^a_^d_^d(v_x_^h,v_w),tc_^comb_^ocomb,tc_^comb_^ocomb),c_^comb_^oparcontract,tc_prod(tc_^comb_^ocomb,tc_^comb_^ocomb)).
% 22 [hyper:8,11,9] c_in(c_^pair(c_^comb_^ocomb_^oop_^a_^d_^d(v_yb,v_z),c_^comb_^ocomb_^oop_^a_^d_^d(v_y_^ha,v_w),tc_^comb_^ocomb,tc_^comb_^ocomb),c_^comb_^oparcontract,tc_prod(tc_^comb_^ocomb,tc_^comb_^ocomb)).
% 91 [hyper:8,22,17] c_in(c_^pair(c_^comb_^ocomb_^oop_^a_^d_^d(c_^comb_^ocomb_^oop_^a_^d_^d(v_xb,v_z),c_^comb_^ocomb_^oop_^a_^d_^d(v_yb,v_z)),c_^comb_^ocomb_^oop_^a_^d_^d(c_^comb_^ocomb_^oop_^a_^d_^d(v_x_^h,v_w),c_^comb_^ocomb_^oop_^a_^d_^d(v_y_^ha,v_w)),tc_^comb_^ocomb,tc_^comb_^ocomb),c_^comb_^oparcontract,tc_prod(tc_^comb_^ocomb,tc_^comb_^ocomb)).
% 134 [hyper:12,7,cut:91] 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 5
% seconds given: 29
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 12
% derived clauses: 132
% kept clauses: 100
% kept size sum: 1960
% kept mid-nuclei: 20
% kept new demods: 0
% forw unit-subs: 10
% 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.0
% 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/SystemOnTPTP4371/COL/COL109-2+noeq.in")
%
%------------------------------------------------------------------------------