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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SWC012-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 : art06.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 179.3s
% Output   : Assurance 179.3s
% 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/SWC012-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(200,40,0,400,0,1,55060,4,2221,56996,5,2803,56997,1,2803,56997,50,2806,56997,40,2806,57197,0,2806,143913,3,4208,185815,4,4910,209931,5,5607,209932,5,5609,209933,1,5609,209933,50,5613,209933,40,5613,210133,0,5613,254912,3,6167,271573,4,6442,286186,5,6714,286186,5,6715,286186,1,6715,286186,50,6718,286186,40,6718,286386,0,6718,349566,3,7569,359055,4,7995,374626,5,8419,374628,5,8420,374629,1,8420,374629,50,8423,374629,40,8423,374829,0,8423,453100,3,9274,478791,4,9701,496436,5,10124,496437,5,10126,496438,1,10126,496438,50,10129,496438,40,10129,496638,0,10129,803985,3,14483,907553,4,16661,1003018,5,18831,1003019,1,18831,1003019,50,18834,1003019,40,18834,1003219,0,18834)
% 
% 
% START OF PROOF
% 1003020 [] equal(X,X).
% 1003028 [] ss^list(nil).
% 1003093 [] equal(app(X,nil),X) | -ss^list(X).
% 1003207 [] ss^list(sk2).
% 1003208 [] ss^list(sk3).
% 1003210 [] equal(sk2,sk4).
% 1003211 [] equal(sk1,sk3).
% 1003212 [] neq(sk2,nil).
% 1003217 [] -neq(sk4,nil) | -equal(app(app(X,cons(Y,nil)),Z),sk2) | -equal(app(X,Z),sk1) | -ss^item(Y) | -ss^list(X) | -ss^list(Z).
% 1003218 [] -neq(sk4,nil) | ss^item(sk5).
% 1003219 [] equal(app(sk3,cons(sk5,nil)),sk4) | -neq(sk4,nil).
% 1003988 [para:1003210.1.2,1003218.1.1,cut:1003212] ss^item(sk5).
% 1003990 [para:1003210.1.2,1003217.1.1,cut:1003212] -equal(app(app(X,cons(Y,nil)),Z),sk2) | -equal(app(X,Z),sk1) | -ss^item(Y) | -ss^list(X) | -ss^list(Z).
% 1003995 [para:1003219.1.1,1003990.1.1.1,cut:1003988,cut:1003208] -neq(sk4,nil) | -equal(app(sk4,X),sk2) | -equal(app(sk3,X),sk1) | -ss^list(X).
% 1003998 [para:1003210.1.2,1003995.1.1,cut:1003212] -equal(app(sk3,X),sk1) | -equal(app(sk4,X),sk2) | -ss^list(X).
% 1004270 [para:1003210.1.2,1003998.2.1.1] -equal(app(sk3,X),sk1) | -equal(app(sk2,X),sk2) | -ss^list(X).
% 1004338 [para:1003093.1.1,1004270.1.1,cut:1003208,cut:1003028,binarydemod:1003093,cut:1003207] -equal(sk3,sk1).
% 1004340 [para:1003211.1.2,1004338.1.1,cut:1003020] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% using term-depth-order strategy
% not using sos 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:    7341
%  derived clauses:   1702985
%  kept clauses:      393942
%  kept size sum:     5649
%  kept mid-nuclei:   160472
%  kept new demods:   36201
%  forw unit-subs:    120095
%  forw double-subs: 31177
%  forw overdouble-subs: 29447
%  backward subs:     179
%  fast unit cutoff:  141077
%  full unit cutoff:  86
%  dbl  unit cutoff:  6600
%  real runtime  :  189.29
%  process. runtime:  188.39
% specific non-discr-tree subsumption statistics: 
%  tried:           7236127
%  length fails:    59279
%  strength fails:  726670
%  predlist fails:  4832800
%  aux str. fails:  252582
%  by-lit fails:    155774
%  full subs tried: 1098232
%  full subs fail:  1065069
% 
% ; 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/SWC012-1+eq_r.in")
% 
%------------------------------------------------------------------------------