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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SWC032-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 : art08.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 20.0s
% Output   : Assurance 20.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: /home/graph/tptp/TSTP/PreparedTPTP/otter:hypothesis:set(auto),clear(print_given)---add_equality:r/SWC/SWC032-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(201,40,1,411,0,1,49930,4,2136,51884,5,2808,51884,1,2808,51884,50,2810,51884,40,2810,52094,0,2811)
% 
% 
% START OF PROOF
% 51958 [] equal(app(X,nil),X) | -ss^list(X).
% 51967 [] -rearseg^p(nil,X) | equal(nil,X) | -ss^list(X).
% 52028 [] -equal(app(X,Y),Z) | rearseg^p(Z,Y) | -ss^list(Z) | -ss^list(Y) | -ss^list(X).
% 52078 [] equal(app(sk3,sk5),sk4).
% 52079 [] ss^list(sk5).
% 52080 [] equal(sk1,sk3).
% 52081 [] equal(sk2,sk4).
% 52082 [] ss^list(sk4).
% 52083 [] ss^list(sk3).
% 52085 [] ss^list(sk1).
% 52090 [] -equal(nil,sk3) | equal(nil,sk4).
% 52091 [] equal(nil,sk2) | equal(nil,sk1).
% 52094 [] -equal(nil,sk1) | -equal(nil,sk2).
% 52908 [para:52080.1.2,52078.1.1.1] equal(app(sk1,sk5),sk4).
% 53012 [para:52080.1.2,52090.1.2] -equal(nil,sk1) | equal(nil,sk4).
% 53579 [binary:52085,51958.2] equal(app(sk1,nil),sk1).
% 60293 [binary:52078,52028,cut:52082,cut:52079,cut:52083] rearseg^p(sk4,sk5).
% 60419 [para:52081.1.2,60293.1.1] rearseg^p(sk2,sk5).
% 60421 [para:53012.2.2,60293.1.1] -equal(nil,sk1) | rearseg^p(nil,sk5).
% 60427 [para:52091.1.2,60419.1.1,binarycut:60421] rearseg^p(nil,sk5).
% 60433 [binary:51967,60427,cut:52079] equal(nil,sk5).
% 60452 [para:60433.1.2,52908.1.1.2,demod:53579] equal(sk1,sk4).
% 60678 [para:60452.1.2,52081.1.2] equal(sk2,sk1).
% 61230 [para:60678.1.1,52091.1.2] equal(nil,sk1).
% 61232 [para:60678.1.1,52094.2.2,cut:61230] 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 19
% clause depth limited to 5
% seconds given: 28
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    662
%  derived clauses:   99689
%  kept clauses:      45909
%  kept size sum:     642621
%  kept mid-nuclei:   13973
%  kept new demods:   30218
%  forw unit-subs:    4876
%  forw double-subs: 2139
%  forw overdouble-subs: 789
%  backward subs:     23
%  fast unit cutoff:  1563
%  full unit cutoff:  0
%  dbl  unit cutoff:  148
%  real runtime  :  28.90
%  process. runtime:  28.88
% specific non-discr-tree subsumption statistics: 
%  tried:           82346
%  length fails:    1149
%  strength fails:  16743
%  predlist fails:  35479
%  aux str. fails:  2718
%  by-lit fails:    892
%  full subs tried: 23278
%  full subs fail:  22174
% 
% ; 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/SWC032-1+eq_r.in")
% 
%------------------------------------------------------------------------------