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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SWC371-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 : art03.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 49.7s
% Output   : Assurance 49.7s
% 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/SWC371-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(198,40,3,402,0,4,49988,4,2144,52188,63,2805,52188,1,2805,52188,50,2807,52188,40,2807,52392,0,2807,139750,3,4209,173843,4,4908)
% 
% 
% START OF PROOF
% 52197 [] ss^list(nil).
% 52240 [] ss^list(skaf45(X,Y)).
% 52263 [] equal(app(nil,X),X) | -ss^list(X).
% 52321 [] equal(app(X,skaf45(Y,X)),Y) | -frontseg^p(Y,X) | -ss^list(Y) | -ss^list(X).
% 52333 [] -equal(app(X,Y),Z) | frontseg^p(Z,X) | -ss^list(Z) | -ss^list(X) | -ss^list(Y).
% 52362 [] -equal(app(app(X,Y),Z),U) | segment^p(U,Y) | -ss^list(U) | -ss^list(Y) | -ss^list(Z) | -ss^list(X).
% 52376 [] -segment^p(sk2,sk1).
% 52379 [] equal(app(sk3,sk5),sk4).
% 52380 [] ss^list(sk5).
% 52381 [] equal(sk1,sk3).
% 52382 [] equal(sk2,sk4).
% 52383 [] ss^list(sk4).
% 52385 [] ss^list(sk2).
% 52386 [] ss^list(sk1).
% 53186 [para:52381.1.2,52379.1.1.1] equal(app(sk1,sk5),sk4).
% 53892 [binary:52386,52263.2] equal(app(nil,sk1),sk1).
% 60660 [binary:53186,52333,cut:52383,cut:52386,cut:52380] frontseg^p(sk4,sk1).
% 60729 [para:52382.1.2,60660.1.1] frontseg^p(sk2,sk1).
% 60741 [binary:52321.2,60729,cut:52385,cut:52386] equal(app(sk1,skaf45(sk2,sk1)),sk2).
% 66387 [para:53892.1.1,52362.1.1.1,cut:52386,cut:52197] -equal(app(sk1,X),Y) | segment^p(Y,sk1) | -ss^list(Y) | -ss^list(X).
% 184951 [binary:60741,66387,cut:52376,cut:52385,cut:52240] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% not 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 19
% clause depth limited to 5
% seconds given: 28
% 
% 
% old unit clauses discarded
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    1514
%  derived clauses:   230650
%  kept clauses:      115183
%  kept size sum:     0
%  kept mid-nuclei:   25082
%  kept new demods:   30820
%  forw unit-subs:    18194
%  forw double-subs: 5713
%  forw overdouble-subs: 3131
%  backward subs:     17
%  fast unit cutoff:  17387
%  full unit cutoff:  0
%  dbl  unit cutoff:  245
%  real runtime  :  51.91
%  process. runtime:  51.45
% specific non-discr-tree subsumption statistics: 
%  tried:           982136
%  length fails:    9385
%  strength fails:  87389
%  predlist fails:  680111
%  aux str. fails:  28640
%  by-lit fails:    31228
%  full subs tried: 125476
%  full subs fail:  122057
% 
% ; 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/SWC371-1+eq_r.in")
% 
%------------------------------------------------------------------------------