TSTP Solution File: COL121-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : COL121-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 : art10.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/SystemOnTPTP3073/COL/COL121-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: long
%
% strategies selected:
% (hyper 57 #f 3 7)
% (binary-unit 28 #f 3 7)
% (binary-double 28 #f 3 7)
% (binary-posweight-order 28 #f 3 7)
% (binary-unit 62 #f)
% (hyper 159 #f)
% (binary-posweight-order 154 #f)
% (binary-weightorder 28 #f)
% (binary-order 28 #f)
% (binary 28 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(10,40,0,20,0,0,117,50,0,127,0,0)
%
%
% START OF PROOF
% 118 [] c_in(c_^pair(X,c_^comb_^odiamond__strip__lemma^e__1(Y,Z,X,U),U,U),c_^transitive__^closure_^ortrancl(Y,U),tc_prod(U,U)) | -c_in(c_^pair(V,Z,U,U),c_^transitive__^closure_^ortrancl(Y,U),tc_prod(U,U)) | -c_in(c_^pair(V,X,U,U),Y,tc_prod(U,U)) | -c_^comb_^odiamond(Y,U).
% 119 [] c_in(c_^pair(X,c_^comb_^odiamond__strip__lemma^e__1(Y,X,Z,U),U,U),Y,tc_prod(U,U)) | -c_in(c_^pair(V,X,U,U),c_^transitive__^closure_^ortrancl(Y,U),tc_prod(U,U)) | -c_in(c_^pair(V,Z,U,U),Y,tc_prod(U,U)) | -c_^comb_^odiamond(Y,U).
% 120 [] c_in(X,c_^transitive__^closure_^ortrancl(Y,Z),tc_prod(Z,Z)) | -c_in(X,Y,tc_prod(Z,Z)).
% 121 [] -c_in(c_^pair(V,X,Z,Z),c_^transitive__^closure_^ortrancl(U,Z),tc_prod(Z,Z)) | -c_in(c_^pair(X,Y,Z,Z),c_^transitive__^closure_^ortrancl(U,Z),tc_prod(Z,Z)) | c_in(c_^pair(V,Y,Z,Z),c_^transitive__^closure_^ortrancl(U,Z),tc_prod(Z,Z)).
% 122 [] c_^comb_^odiamond(v_r,t_a).
% 123 [] c_in(c_^pair(v_ya,v_z,t_a,t_a),v_r,tc_prod(t_a,t_a)).
% 124 [] c_in(c_^pair(v_y,v_xaa,t_a,t_a),c_^transitive__^closure_^ortrancl(v_r,t_a),tc_prod(t_a,t_a)).
% 125 [] c_in(c_^pair(v_ya,v_x(X),t_a,t_a),c_^transitive__^closure_^ortrancl(v_r,t_a),tc_prod(t_a,t_a)) | -c_in(c_^pair(v_y,X,t_a,t_a),c_^transitive__^closure_^ortrancl(v_r,t_a),tc_prod(t_a,t_a)).
% 126 [] c_in(c_^pair(X,v_x(X),t_a,t_a),c_^transitive__^closure_^ortrancl(v_r,t_a),tc_prod(t_a,t_a)) | -c_in(c_^pair(v_y,X,t_a,t_a),c_^transitive__^closure_^ortrancl(v_r,t_a),tc_prod(t_a,t_a)).
% 127 [] -c_in(c_^pair(v_xaa,X,t_a,t_a),c_^transitive__^closure_^ortrancl(v_r,t_a),tc_prod(t_a,t_a)) | -c_in(c_^pair(v_z,X,t_a,t_a),c_^transitive__^closure_^ortrancl(v_r,t_a),tc_prod(t_a,t_a)).
% 133 [hyper:125,124] c_in(c_^pair(v_ya,v_x(v_xaa),t_a,t_a),c_^transitive__^closure_^ortrancl(v_r,t_a),tc_prod(t_a,t_a)).
% 134 [hyper:126,124] c_in(c_^pair(v_xaa,v_x(v_xaa),t_a,t_a),c_^transitive__^closure_^ortrancl(v_r,t_a),tc_prod(t_a,t_a)).
% 152 [hyper:118,133,123,cut:122] c_in(c_^pair(v_z,c_^comb_^odiamond__strip__lemma^e__1(v_r,v_x(v_xaa),v_z,t_a),t_a,t_a),c_^transitive__^closure_^ortrancl(v_r,t_a),tc_prod(t_a,t_a)).
% 155 [hyper:119,133,123,cut:122] c_in(c_^pair(v_x(v_xaa),c_^comb_^odiamond__strip__lemma^e__1(v_r,v_x(v_xaa),v_z,t_a),t_a,t_a),v_r,tc_prod(t_a,t_a)).
% 261 [hyper:120,155] c_in(c_^pair(v_x(v_xaa),c_^comb_^odiamond__strip__lemma^e__1(v_r,v_x(v_xaa),v_z,t_a),t_a,t_a),c_^transitive__^closure_^ortrancl(v_r,t_a),tc_prod(t_a,t_a)).
% 410 [hyper:121,261,134] c_in(c_^pair(v_xaa,c_^comb_^odiamond__strip__lemma^e__1(v_r,v_x(v_xaa),v_z,t_a),t_a,t_a),c_^transitive__^closure_^ortrancl(v_r,t_a),tc_prod(t_a,t_a)).
% 414 [hyper:127,410,cut:152] 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 7
% clause depth limited to 4
% seconds given: 57
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 67
% derived clauses: 826
% kept clauses: 58
% kept size sum: 946
% kept mid-nuclei: 311
% kept new demods: 0
% forw unit-subs: 103
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 49
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.3
% process. runtime: 0.2
% specific non-discr-tree subsumption statistics:
% tried: 36
% length fails: 0
% strength fails: 8
% predlist fails: 28
% 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/SystemOnTPTP3073/COL/COL121-2+noeq.in")
%
%------------------------------------------------------------------------------