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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SWC008-1 : TPTP v3.4.2. Released v2.4.0.
% Transfm  : add_equality:r
% Format   : otter:hypothesis:set(auto),clear(print_given)
% Command  : gandalf-wrapper -time %d %s

% Computer : art07.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 90.1s
% Output   : Assurance 90.1s
% 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/SWC/SWC008-1+eq_r.in
% 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 5 19)
% (binary-unit 28 #f 5 19)
% (binary-double 11 #f 5 19)
% (binary-double 17 #f)
% (binary-double 17 #t)
% (binary 87 #t 5 19)
% (binary-order 28 #f 5 19)
% (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(196,40,3,392,0,3,53700,4,2227,55592,5,2804,55593,1,2806,55593,50,2808,55593,40,2808,55789,0,2809,138728,3,4255,177438,4,4915,202711,5,5642,202711,5,5645,202712,1,5645,202712,50,5648,202712,40,5648,202908,0,5649,244543,3,6201,255813,4,6475,269895,5,6750,269895,5,6751,269896,1,6751,269896,50,6753,269896,40,6753,270092,0,6753,333815,3,7605,349941,4,8029,370467,5,8454,370469,5,8455,370470,1,8455,370470,50,8458,370470,40,8458,370666,0,8458,443406,3,9312,469445,4,9735)
% 
% 
% START OF PROOF
% 370471 [] equal(X,X).
% 370479 [] ss^list(nil).
% 370522 [] ss^list(skaf45(X,Y)).
% 370544 [] equal(app(X,nil),X) | -ss^list(X).
% 370603 [] equal(app(X,skaf45(Y,X)),Y) | -frontseg^p(Y,X) | -ss^list(Y) | -ss^list(X).
% 370657 [] ss^list(sk1).
% 370658 [] ss^list(sk2).
% 370661 [] equal(sk2,sk4).
% 370662 [] equal(sk1,sk3).
% 370663 [] frontseg^p(sk4,sk3).
% 370665 [] -equal(app(app(X,Y),Z),sk2) | -equal(app(X,Z),sk1) | -ss^list(Z) | -ss^list(X) | -ss^list(Y).
% 370681 [binary:370544.2,370657] equal(app(sk1,nil),sk1).
% 371377 [para:370661.1.2,370663.1.1] frontseg^p(sk2,sk3).
% 371488 [para:370544.1.1,370665.1.1,cut:370479] -equal(app(X,nil),sk1) | -equal(app(X,Y),sk2) | -ss^list(app(X,Y)) | -ss^list(Y) | -ss^list(X).
% 372186 [para:370662.1.2,371377.1.2] frontseg^p(sk2,sk1).
% 372553 [binary:370603.2,372186,cut:370658,cut:370657] equal(app(sk1,skaf45(sk2,sk1)),sk2).
% 474339 [binary:372553,371488.2,demod:372553,370681,cut:370471,cut:370658,cut:370522,cut:370657] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% using sos strategy
% using unit paramodulation strategy
% using unit strategy
% using double strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 17
% 
% 
% old unit clauses discarded
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    4984
%  derived clauses:   645656
%  kept clauses:      309595
%  kept size sum:     0
%  kept mid-nuclei:   79267
%  kept new demods:   35201
%  forw unit-subs:    69795
%  forw double-subs: 17981
%  forw overdouble-subs: 15259
%  backward subs:     99
%  fast unit cutoff:  65133
%  full unit cutoff:  0
%  dbl  unit cutoff:  1384
%  real runtime  :  97.84
%  process. runtime:  97.82
% specific non-discr-tree subsumption statistics: 
%  tried:           3560268
%  length fails:    53744
%  strength fails:  336921
%  predlist fails:  2351159
%  aux str. fails:  121869
%  by-lit fails:    74442
%  full subs tried: 553963
%  full subs fail:  537484
% 
% ; 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/SWC/SWC008-1+eq_r.in")
% 
%------------------------------------------------------------------------------