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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SWC218-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 : art10.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 29.4s
% Output   : Assurance 29.4s
% 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/SWC218-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,1,396,0,1,50873,4,2120,54509,5,2802,54509,1,2802,54509,50,2804,54509,40,2804,54707,0,2804)
% 
% 
% START OF PROOF
% 2114 [?] ?
% 54510 [] equal(X,X).
% 54518 [] ss^list(nil).
% 54567 [] segment^p(X,X) | -ss^list(X).
% 54590 [] -segment^p(nil,X) | equal(nil,X) | -ss^list(X).
% 54608 [] -equal(cons(X,Y),nil) | -ss^item(X) | -ss^list(Y).
% 54610 [] neq(X,Y) | equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 54683 [] -equal(app(app(X,Y),Z),U) | segment^p(U,Y) | -ss^list(U) | -ss^list(Y) | -ss^list(Z) | -ss^list(X).
% 54696 [] ss^list(sk1).
% 54698 [] ss^list(sk3).
% 54701 [] equal(sk1,sk3).
% 54702 [] ss^list(sk5).
% 54703 [] ss^list(sk6).
% 54705 [] ss^item(sk7).
% 54706 [] equal(app(app(sk5,cons(sk7,nil)),sk6),sk3).
% 54707 [] -neq(sk1,nil).
% 55531 [binary:54698,54567.2] segment^p(sk3,sk3).
% 55631 [para:54701.1.2,55531.1.1] segment^p(sk1,sk3).
% 57355 [binary:54707,54610,cut:54518,cut:54696] equal(sk1,nil).
% 57415 [para:57355.1.1,55631.1.1] segment^p(nil,sk3).
% 57501 [binary:54590,57415,cut:54698] equal(nil,sk3).
% 64761 [binary:54706,54683,cut:54698,cut:2114,cut:54703,cut:54702] segment^p(sk3,cons(sk7,nil)).
% 83511 [para:57501.1.2,64761.1.1] segment^p(nil,cons(sk7,nil)).
% 98041 [binary:54590,83511,cut:2114] equal(nil,cons(sk7,nil)).
% 100646 [para:98041.1.2,54608.1.1,cut:54510,cut:54705,cut:54518] 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
% 
% 
% old unit clauses discarded
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    1695
%  derived clauses:   156719
%  kept clauses:      82100
%  kept size sum:     0
%  kept mid-nuclei:   13951
%  kept new demods:   31522
%  forw unit-subs:    12367
%  forw double-subs: 3771
%  forw overdouble-subs: 4430
%  backward subs:     14
%  fast unit cutoff:  13155
%  full unit cutoff:  0
%  dbl  unit cutoff:  237
%  real runtime  :  39.58
%  process. runtime:  39.1
% specific non-discr-tree subsumption statistics: 
%  tried:           664831
%  length fails:    12767
%  strength fails:  146482
%  predlist fails:  362923
%  aux str. fails:  28443
%  by-lit fails:    15540
%  full subs tried: 69340
%  full subs fail:  64589
% 
% ; 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/SWC218-1+eq_r.in")
% 
%------------------------------------------------------------------------------