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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SWC189-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 : 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 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/SWC189-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,398,0,2,52066,4,2179,53988,63,2803,53988,1,2803,53988,50,2805,53988,40,2805,54187,0,2806)
% 
% 
% START OF PROOF
% 54180 [] equal(sk1,sk3).
% 54181 [] -equal(app(app(app(X,cons(Y,nil)),cons(Z,nil)),U),sk3) | equal(Y,Z) | -ss^item(Z) | -ss^item(Y) | -ss^list(U) | -ss^list(X).
% 54182 [] ss^item(sk5).
% 54183 [] ss^item(sk6).
% 54184 [] ss^list(sk7).
% 54185 [] ss^list(sk8).
% 54186 [] equal(app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8),sk1).
% 54187 [] -equal(sk5,sk6).
% 54973 [para:54186.1.1,54181.1.1,cut:54180,cut:54187,cut:54183,cut:54182,cut:54185,cut:54184] 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:    84
%  derived clauses:   85546
%  kept clauses:      39649
%  kept size sum:     559018
%  kept mid-nuclei:   14147
%  kept new demods:   31537
%  forw unit-subs:    3814
%  forw double-subs: 1898
%  forw overdouble-subs: 445
%  backward subs:     0
%  fast unit cutoff:  1011
%  full unit cutoff:  0
%  dbl  unit cutoff:  136
%  real runtime  :  28.22
%  process. runtime:  28.22
% specific non-discr-tree subsumption statistics: 
%  tried:           43003
%  length fails:    221
%  strength fails:  16360
%  predlist fails:  3455
%  aux str. fails:  1751
%  by-lit fails:    828
%  full subs tried: 19538
%  full subs fail:  18782
% 
% ; 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/SWC189-1+eq_r.in")
% 
%------------------------------------------------------------------------------