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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : FLD013-2 : TPTP v3.4.2. Bugfixed v2.1.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 unknown
% CPU      : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory   : 1000MB
% OS       : Linux 2.4.22-21mdk-i686-up-4GB
% CPULimit : 600s

% Result   : Unsatisfiable 89.6s
% Output   : Assurance 89.6s
% 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: /home/graph/tptp/TSTP/PreparedTPTP/otter:hypothesis:set(auto),clear(print_given)---add_equality:r/FLD/FLD013-2+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: nne
% detected subclass: medium
% 
% strategies selected: 
% (hyper 27 #f 3 7)
% (binary-unit 10 #f 3 7)
% (binary-double 16 #f 3 7)
% (binary 54 #t 3 7)
% (binary-order 27 #f 3 7)
% (binary-posweight-order 125 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 27 #f)
% (binary-weightorder 54 #f)
% (binary-order 54 #f)
% (hyper-order 43 #f)
% (binary 109 #t)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(36,40,1,72,0,1,595572,4,2036,595602,50,2068,595602,40,2068,595638,0,2068,638154,3,2569,644830,4,2819,665454,5,3069,665455,1,3069,665455,50,3073,665455,40,3073,665491,0,3073,719443,3,3874,729043,4,4275,801120,5,4674,801120,5,4675,801120,1,4675,801120,50,4681,801120,40,4681,801156,0,4681,902715,3,7383,926260,4,8732)
% 
% 
% START OF PROOF
% 801124 [] equalish(add(X,Y),add(Y,X)) | -defined(X) | -defined(Y).
% 801142 [] -equalish(X,Y) | equalish(Y,X).
% 801143 [] -equalish(X,Y) | -equalish(Y,Z) | equalish(X,Z).
% 801144 [] equalish(add(X,Y),add(Z,Y)) | -equalish(X,Z) | -defined(Y).
% 801149 [] defined(b).
% 801150 [] defined(c).
% 801153 [] equalish(a,b).
% 801154 [] equalish(c,d).
% 801155 [] equalish(add(a,c),u).
% 801156 [] -equalish(add(d,b),u).
% 801190 [binary:801124.2,801149] equalish(add(b,X),add(X,b)) | -defined(X).
% 801211 [binary:801144.3,801149] equalish(add(X,b),add(Y,b)) | -equalish(X,Y).
% 801297 [binary:801142,801153] equalish(b,a).
% 801406 [binary:801143.2,801155] -equalish(X,add(a,c)) | equalish(X,u).
% 801412 [binary:801144.2,801297] equalish(add(b,X),add(a,X)) | -defined(X).
% 801427 [binary:801142.2,801156] -equalish(u,add(d,b)).
% 801566 [binary:801143.3,801427] -equalish(X,add(d,b)) | -equalish(u,X).
% 803252 [binary:801143,801190] -equalish(add(X,b),Y) | equalish(add(b,X),Y) | -defined(X).
% 804993 [binary:801154,801211.2] equalish(add(c,b),add(d,b)).
% 831080 [binary:801406,801412,cut:801150] equalish(add(b,c),u).
% 831081 [binary:801142,831080] equalish(u,add(b,c)).
% 852579 [binary:831081,801566.2] -equalish(add(b,c),add(d,b)).
% 957199 [binary:804993,803252,cut:852579,cut:801150] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% using sos strategy
% using unit paramodulation 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 3
% seconds given: 54
% 
% 
% old unit clauses discarded
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    8243
%  derived clauses:   3755370
%  kept clauses:      268675
%  kept size sum:     0
%  kept mid-nuclei:   127843
%  kept new demods:   0
%  forw unit-subs:    126065
%  forw double-subs: 67217
%  forw overdouble-subs: 7096
%  backward subs:     5
%  fast unit cutoff:  16905
%  full unit cutoff:  0
%  dbl  unit cutoff:  263
%  real runtime  :  90.6
%  process. runtime:  89.53
% specific non-discr-tree subsumption statistics: 
%  tried:           133075
%  length fails:    38
%  strength fails:  13300
%  predlist fails:  44508
%  aux str. fails:  285
%  by-lit fails:    26
%  full subs tried: 73230
%  full subs fail:  66559
% 
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/home/graph/tptp/TSTP/PreparedTPTP/otter:hypothesis:set(auto),clear(print_given)---add_equality:r/FLD/FLD013-2+noeq.in")
% 
%------------------------------------------------------------------------------