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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SWC101-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 : art01.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/SWC101-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(199,40,1,405,0,1,49916,4,2156,51862,5,2803,51863,1,2803,51863,50,2805,51863,40,2805,52069,0,2805)
% 
% 
% START OF PROOF
% 51872 [] ss^list(nil).
% 51937 [] equal(app(X,nil),X) | -ss^list(X).
% 51964 [] neq(X,Y) | equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 51982 [] -equal(app(X,Y),nil) | equal(nil,X) | -ss^list(X) | -ss^list(Y).
% 52008 [] -equal(app(X,Y),Z) | frontseg^p(Z,X) | -ss^list(Z) | -ss^list(X) | -ss^list(Y).
% 52055 [] equal(app(sk3,sk5),sk4).
% 52056 [] ss^list(sk5).
% 52057 [] equal(sk1,sk3).
% 52058 [] equal(sk2,sk4).
% 52059 [] ss^list(sk4).
% 52062 [] ss^list(sk1).
% 52067 [] -equal(nil,sk3) | equal(nil,sk4).
% 52068 [] -equal(nil,sk2) | -equal(nil,sk1).
% 52069 [] -neq(sk1,nil) | -frontseg^p(sk2,sk1).
% 52862 [para:52057.1.2,52055.1.1.1] equal(app(sk1,sk5),sk4).
% 52948 [para:52057.1.2,52067.1.2] -equal(nil,sk1) | equal(nil,sk4).
% 53492 [binary:52062,51937.2] equal(app(sk1,nil),sk1).
% 53859 [para:52058.1.2,52948.2.2,binarycut:52068] -equal(nil,sk1).
% 56500 [para:53492.1.1,51982.1.1,cut:53859,cut:52062,cut:51872] -equal(sk1,nil).
% 56541 [binary:51964.2,56500,cut:51872,cut:52062] neq(sk1,nil).
% 56857 [binary:52069,56541] -frontseg^p(sk2,sk1).
% 60506 [binary:52862,52008,cut:52059,cut:52062,cut:52056] frontseg^p(sk4,sk1).
% 60572 [para:52058.1.2,60506.1.1,cut:56857] 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:    634
%  derived clauses:   97938
%  kept clauses:      45281
%  kept size sum:     631805
%  kept mid-nuclei:   13960
%  kept new demods:   30204
%  forw unit-subs:    4549
%  forw double-subs: 2081
%  forw overdouble-subs: 820
%  backward subs:     20
%  fast unit cutoff:  1524
%  full unit cutoff:  0
%  dbl  unit cutoff:  145
%  real runtime  :  28.72
%  process. runtime:  28.72
% specific non-discr-tree subsumption statistics: 
%  tried:           89080
%  length fails:    4009
%  strength fails:  17090
%  predlist fails:  39379
%  aux str. fails:  2718
%  by-lit fails:    892
%  full subs tried: 22897
%  full subs fail:  21770
% 
% ; 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/SWC101-1+eq_r.in")
% 
%------------------------------------------------------------------------------