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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SWC370-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 50.0s
% Output   : Assurance 50.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/SWC370-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,402,0,1,49934,4,2137,52135,5,2802,52136,1,2802,52136,50,2804,52136,40,2804,52340,0,2804,139288,3,4210,174776,4,4907)
% 
% 
% START OF PROOF
% 52145 [] ss^list(nil).
% 52188 [] ss^list(skaf45(X,Y)).
% 52211 [] equal(app(nil,X),X) | -ss^list(X).
% 52269 [] equal(app(X,skaf45(Y,X)),Y) | -frontseg^p(Y,X) | -ss^list(Y) | -ss^list(X).
% 52281 [] -equal(app(X,Y),Z) | frontseg^p(Z,X) | -ss^list(Z) | -ss^list(X) | -ss^list(Y).
% 52310 [] -equal(app(app(X,Y),Z),U) | segment^p(U,Y) | -ss^list(U) | -ss^list(Y) | -ss^list(Z) | -ss^list(X).
% 52324 [] -segment^p(sk2,sk1).
% 52327 [] equal(app(sk3,sk5),sk4).
% 52328 [] ss^list(sk5).
% 52329 [] equal(sk1,sk3).
% 52330 [] equal(sk2,sk4).
% 52331 [] ss^list(sk4).
% 52333 [] ss^list(sk2).
% 52334 [] ss^list(sk1).
% 53125 [para:52329.1.2,52327.1.1.1] equal(app(sk1,sk5),sk4).
% 53795 [binary:52334,52211.2] equal(app(nil,sk1),sk1).
% 60533 [binary:53125,52281,cut:52331,cut:52334,cut:52328] frontseg^p(sk4,sk1).
% 60602 [para:52330.1.2,60533.1.1] frontseg^p(sk2,sk1).
% 60614 [binary:52269.2,60602,cut:52333,cut:52334] equal(app(sk1,skaf45(sk2,sk1)),sk2).
% 66262 [para:53795.1.1,52310.1.1.1,cut:52334,cut:52145] -equal(app(sk1,X),Y) | segment^p(Y,sk1) | -ss^list(Y) | -ss^list(X).
% 185884 [binary:60614,66262,cut:52324,cut:52333,cut:52188] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% not using sos strategy
% using unit paramodulation 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:    1517
%  derived clauses:   232071
%  kept clauses:      115186
%  kept size sum:     0
%  kept mid-nuclei:   25029
%  kept new demods:   30818
%  forw unit-subs:    18199
%  forw double-subs: 5714
%  forw overdouble-subs: 3069
%  backward subs:     17
%  fast unit cutoff:  17385
%  full unit cutoff:  0
%  dbl  unit cutoff:  242
%  real runtime  :  51.37
%  process. runtime:  51.37
% specific non-discr-tree subsumption statistics: 
%  tried:           992965
%  length fails:    9385
%  strength fails:  88920
%  predlist fails:  683590
%  aux str. fails:  30941
%  by-lit fails:    32142
%  full subs tried: 127992
%  full subs fail:  124636
% 
% ; 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/SWC370-1+eq_r.in")
% 
%------------------------------------------------------------------------------