TSTP Solution File: COL123-2 by Gandalf---c-2.6

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : COL123-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/SystemOnTPTP3321/COL/COL123-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(9,40,0,18,0,0,140,50,0,149,0,0)
% 
% 
% START OF PROOF
% 141 [] c_in(X,c_^transitive__^closure_^ortrancl(Y,Z),tc_prod(Z,Z)) | -c_in(X,Y,tc_prod(Z,Z)).
% 142 [] -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)).
% 143 [] c_in(c_^pair(v_y,v_z,t_a,t_a),v_r,tc_prod(t_a,t_a)).
% 144 [] c_in(c_^pair(v_x,v_xb,t_a,t_a),v_r,tc_prod(t_a,t_a)).
% 145 [] c_in(c_^pair(X,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_x,X,t_a,t_a),v_r,tc_prod(t_a,t_a)).
% 146 [] c_in(c_^pair(v_y,v_xaa(X),t_a,t_a),v_r,tc_prod(t_a,t_a)) | -c_in(c_^pair(v_x,X,t_a,t_a),v_r,tc_prod(t_a,t_a)).
% 147 [] -c_in(c_^pair(v_xb,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),v_r,tc_prod(t_a,t_a)).
% 148 [] c_in(c_^pair(X,v_xa(Y,X,Z),t_a,t_a),v_r,tc_prod(t_a,t_a)) | -c_in(c_^pair(Y,Z,t_a,t_a),v_r,tc_prod(t_a,t_a)) | -c_in(c_^pair(Y,X,t_a,t_a),v_r,tc_prod(t_a,t_a)).
% 149 [] c_in(c_^pair(X,v_xa(Y,Z,X),t_a,t_a),v_r,tc_prod(t_a,t_a)) | -c_in(c_^pair(Y,X,t_a,t_a),v_r,tc_prod(t_a,t_a)) | -c_in(c_^pair(Y,Z,t_a,t_a),v_r,tc_prod(t_a,t_a)).
% 156 [hyper:145,144] c_in(c_^pair(v_xb,v_xaa(v_xb),t_a,t_a),c_^transitive__^closure_^ortrancl(v_r,t_a),tc_prod(t_a,t_a)).
% 157 [hyper:146,144] c_in(c_^pair(v_y,v_xaa(v_xb),t_a,t_a),v_r,tc_prod(t_a,t_a)).
% 168 [hyper:148,157,143] c_in(c_^pair(v_xaa(v_xb),v_xa(v_y,v_xaa(v_xb),v_z),t_a,t_a),v_r,tc_prod(t_a,t_a)).
% 172 [hyper:149,157,143] c_in(c_^pair(v_z,v_xa(v_y,v_xaa(v_xb),v_z),t_a,t_a),v_r,tc_prod(t_a,t_a)).
% 220 [hyper:141,168] c_in(c_^pair(v_xaa(v_xb),v_xa(v_y,v_xaa(v_xb),v_z),t_a,t_a),c_^transitive__^closure_^ortrancl(v_r,t_a),tc_prod(t_a,t_a)).
% 332 [hyper:142,220,156] c_in(c_^pair(v_xb,v_xa(v_y,v_xaa(v_xb),v_z),t_a,t_a),c_^transitive__^closure_^ortrancl(v_r,t_a),tc_prod(t_a,t_a)).
% 336 [hyper:147,332,cut:172] 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:    69
%  derived clauses:   492
%  kept clauses:      68
%  kept size sum:     1042
%  kept mid-nuclei:   226
%  kept new demods:   0
%  forw unit-subs:    106
%  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.12
%  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/SystemOnTPTP3321/COL/COL123-2+noeq.in")
% Killed 1 orphans
% 
%------------------------------------------------------------------------------