TSTP Solution File: SWV239-1 by Gandalf---c-2.6

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SWV239-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 : art05.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2795MHz
% Memory   : 1003MB
% OS       : Linux 2.6.11-1.1369_FC4
% CPULimit : 600s

% Result   : Unsatisfiable 29.8s
% Output   : Assurance 29.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/SystemOnTPTP18918/SWV/SWV239-1+eq_r.in
% 
% Some predicates or functions were curried and renamed.
% 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 4 7)
% (binary-unit 28 #f 4 7)
% (binary-double 11 #f 4 7)
% (binary-double 17 #f)
% (binary-double 17 #t)
% (binary 87 #t 4 7)
% (binary-order 28 #f 4 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(1401,40,6,2802,0,12,271504,4,2115,279429,5,2813,279430,1,2813,279430,50,2819,279430,40,2819,280831,0,2820)
% 
% 
% START OF PROOF
% 279452 [] -c_in(X,c_^message_^oanalz(c_^message_^oanalz(Y)),tc_^message_^omsg) | c_in(X,c_^message_^oanalz(Y),tc_^message_^omsg).
% 279778 [] c_in($ganapfun3($ganc57,X,Y,Z),X,Z) | c_lessequals(X,Y,tc_set(Z)).
% 279779 [] -c_in($ganapfun3($ganc57,X,Y,Z),Y,Z) | c_lessequals(X,Y,tc_set(Z)).
% 279781 [] c_lessequals(X,X,tc_set(Y)).
% 280829 [] c_lessequals(c_^message_^oanalz(c_union(X,Y,tc_^message_^omsg)),c_^message_^oanalz(c_union(Z,U,tc_^message_^omsg)),tc_set(tc_^message_^omsg)) | -c_lessequals(c_^message_^oanalz(X),c_^message_^oanalz(Z),tc_set(tc_^message_^omsg)) | -c_lessequals(c_^message_^oanalz(Y),c_^message_^oanalz(U),tc_set(tc_^message_^omsg)).
% 280831 [] -c_lessequals(c_^message_^oanalz(c_union(c_^message_^oanalz(v_^g),v_^h,tc_^message_^omsg)),c_^message_^oanalz(c_union(v_^g,v_^h,tc_^message_^omsg)),tc_set(tc_^message_^omsg)).
% 294620 [binary:280831,280829,cut:279781] -c_lessequals(c_^message_^oanalz(c_^message_^oanalz(v_^g)),c_^message_^oanalz(v_^g),tc_set(tc_^message_^omsg)).
% 294784 [binary:279778.2,294620] c_in($ganapfun3($ganc57,c_^message_^oanalz(c_^message_^oanalz(v_^g)),c_^message_^oanalz(v_^g),tc_^message_^omsg),c_^message_^oanalz(c_^message_^oanalz(v_^g)),tc_^message_^omsg).
% 294785 [binary:279779.2,294620] -c_in($ganapfun3($ganc57,c_^message_^oanalz(c_^message_^oanalz(v_^g)),c_^message_^oanalz(v_^g),tc_^message_^omsg),c_^message_^oanalz(v_^g),tc_^message_^omsg).
% 295894 [binary:279452.2,294785,cut:294784] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% not using sos strategy
% using unit strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% clause length limited to 7
% clause depth limited to 4
% seconds given: 28
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    4062
%  derived clauses:   727110
%  kept clauses:      90855
%  kept size sum:     165853
%  kept mid-nuclei:   12262
%  kept new demods:   64
%  forw unit-subs:    112727
%  forw double-subs: 4999
%  forw overdouble-subs: 498
%  backward subs:     34
%  fast unit cutoff:  909
%  full unit cutoff:  628
%  dbl  unit cutoff:  1
%  real runtime  :  31.29
%  process. runtime:  31.10
% specific non-discr-tree subsumption statistics: 
%  tried:           1359
%  length fails:    36
%  strength fails:  36
%  predlist fails:  236
%  aux str. fails:  15
%  by-lit fails:    0
%  full subs tried: 1024
%  full subs fail:  526
% 
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP18918/SWV/SWV239-1+eq_r.in")
% WARNING: TreeLimitedRun lost 29.83s, total lost is 29.83s
% 
%------------------------------------------------------------------------------