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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SWC047-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 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/SWC047-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(197,40,1,394,0,1,53602,4,2202,55501,5,2802,55502,1,2804,55502,50,2807,55502,40,2807,55699,0,2807)
% 
% 
% START OF PROOF
% 584 [?] ?
% 55503 [] equal(X,X).
% 55511 [] ss^list(nil).
% 55562 [] rearseg^p(X,X) | -ss^list(X).
% 55618 [] -neq(X,Y) | -equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 55690 [] ss^list(sk2).
% 55693 [] equal(sk2,sk4).
% 55694 [] equal(sk1,sk3).
% 55695 [] equal(sk4,sk3).
% 55696 [] neq(sk2,nil) | equal(nil,sk2).
% 55697 [] equal(nil,sk2) | -neq(X,nil) | -rearseg^p(sk2,X) | -rearseg^p(sk1,X) | -ss^list(X).
% 55698 [] -equal(nil,sk1) | neq(sk2,nil).
% 55713 [input:55618,factor:cut:55503] -neq(X,X) | -ss^list(X).
% 56466 [para:55695.1.1,55693.1.2] equal(sk2,sk3).
% 56468 [para:56466.1.2,55694.1.2] equal(sk1,sk2).
% 56486 [para:56468.1.2,55696.2.2,binarycut:55698] neq(sk2,nil).
% 56633 [binary:55690,55562.2] rearseg^p(sk2,sk2).
% 56748 [para:56468.1.2,56633.1.1] rearseg^p(sk1,sk2).
% 57597 [binary:55690,55697.5,cut:584,binarycut:55696,cut:56748] equal(nil,sk2).
% 57600 [para:57597.1.2,56486.1.1] neq(nil,nil).
% 58429 [binary:55511,55713.2,cut:57600] 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:    390
%  derived clauses:   90180
%  kept clauses:      42300
%  kept size sum:     609659
%  kept mid-nuclei:   14898
%  kept new demods:   32391
%  forw unit-subs:    4518
%  forw double-subs: 1923
%  forw overdouble-subs: 437
%  backward subs:     12
%  fast unit cutoff:  1166
%  full unit cutoff:  0
%  dbl  unit cutoff:  139
%  real runtime  :  28.20
%  process. runtime:  28.18
% specific non-discr-tree subsumption statistics: 
%  tried:           46987
%  length fails:    221
%  strength fails:  16162
%  predlist fails:  6688
%  aux str. fails:  1995
%  by-lit fails:    934
%  full subs tried: 19822
%  full subs fail:  19070
% 
% ; 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/SWC047-1+eq_r.in")
% 
%------------------------------------------------------------------------------