TSTP Solution File: SWC166-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC166-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 567.3s
% Output : Assurance 567.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/SWC166-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,1,52032,4,2155,54120,5,2802,54121,1,2804,54121,50,2806,54121,40,2806,54320,0,2806,136494,3,4208,171038,4,4911,194693,5,5607,194693,5,5609,194694,1,5609,194694,50,5613,194694,40,5613,194893,0,5613,242530,3,6165,259401,4,6443,269238,5,6717,269238,5,6719,269238,1,6719,269238,50,6721,269238,40,6721,269437,0,6721,334114,3,7572,356126,4,8002,369351,5,8422,369352,5,8424,369352,1,8424,369352,50,8427,369352,40,8427,369551,0,8427,441771,3,9279,462912,4,9721,481183,5,10128,481184,5,10130,481185,1,10130,481185,50,10133,481185,40,10133,481384,0,10133,826138,3,14520,892898,4,16664,1001720,5,18834,1001721,5,18836,1001722,1,18836,1001722,50,18839,1001722,40,18839,1001921,0,18839,1044484,3,20240,1045687,4,20940,1051679,1,21640,1051679,50,21641,1051679,40,21641,1051878,0,21641,1329292,3,24543,1360448,4,25992,1522043,5,27443,1522043,1,27443,1522043,50,27449,1522043,40,27449,1522242,0,27478,1665990,3,28879,1718765,4,29580,1786898,5,30279,1786899,1,30279,1786899,50,30286,1786899,40,30286,1787098,0,30320,1843365,3,30872,1857759,4,31147,1907444,5,31421,1907445,1,31421,1907445,50,31426,1907445,40,31426,1907644,0,31426,1950702,3,32828,1951865,4,33527,1958722,5,34227,1958723,5,34227,1958723,1,34227,1958723,50,34228,1958723,40,34228,1958922,0,34228,2036728,3,35629,2052925,4,36329,2069555,5,37029,2069557,1,37030,2069557,50,37033,2069557,40,37033,2069756,0,37033,2109578,3,38434,2110262,4,39134,2119480,1,39834,2119480,50,39835,2119480,40,39835,2119679,0,39835,2175187,3,40687,2183537,4,41111,2201896,5,41536,2201897,5,41537,2201897,1,41537,2201897,50,41540,2201897,40,41540,2202096,0,41540,2229053,5,44341,2229053,1,44341,2229053,50,44342,2229053,40,44342,2229252,0,44342,3056852,5,46043,3056853,1,46043,3056853,50,46049,3056853,40,46049,3057052,0,46051,3254426,3,53115,3301468,4,56641)
%
%
% START OF PROOF
% 269427 [?] ?
% 269431 [?] ?
% 272410 [?] ?
% 300486 [binary:269427,272410.2,cut:269431] strictordered^p(sk3).
% 369416 [?] ?
% 369541 [?] ?
% 369547 [?] ?
% 369913 [?] ?
% 370345 [binary:369416.2,369547] -lt(sk6,sk6).
% 445503 [binary:369541,369913.2] ss^list(app(sk3,sk3)).
% 2069558 [?] ?
% 2093947 [?] ?
% 2094509 [?] ?
% 2095412 [binary:2069558,2094509,cut:2093947] -duplicatefree^p(app(sk1,sk1)).
% 3056862 [] ss^list(nil).
% 3056926 [] -ss^list(X) | ss^item(Y) | duplicatefree^p(X).
% 3056939 [] ss^list(app(X,Y)) | -ss^list(X) | -ss^list(Y).
% 3056940 [?] ?
% 3056956 [?] ?
% 3056974 [?] ?
% 3057003 [] equal(app(app(X,Y),Z),app(X,app(Y,Z))) | -ss^list(X) | -ss^list(Z) | -ss^list(Y).
% 3057035 [?] ?
% 3057040 [] ss^list(sk1).
% 3057045 [] equal(sk1,sk3).
% 3057049 [] ss^list(sk7).
% 3057050 [] ss^list(sk8).
% 3057051 [] equal(app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8),sk1).
% 3057052 [] -neq(sk5,sk6).
% 3057822 [para:3057045.1.2,300486.1.1] strictordered^p(sk1).
% 3057874 [para:3057045.1.2,445503.1.1.1] ss^list(app(sk1,sk3)).
% 3057904 [para:3057045.1.2,3057874.1.1.2] ss^list(app(sk1,sk1)).
% 3059730 [binary:2095412,3056926.3,cut:3057904] ss^item(X).
% 3065085 [binary:3057049,3056939.2] ss^list(app(sk7,X)) | -ss^list(X).
% 3066042 [input:3056940,cut:3059730] ss^list(cons(X,Y)) | -ss^list(Y).
% 3066050 [binary:3056862,3066042.2] ss^list(cons(X,nil)).
% 3073114 [input:3056956,cut:3059730,cut:3059730] neq(X,Y) | equal(X,Y).
% 3073115 [binary:3057052,3073114] equal(sk5,sk6).
% 3073123 [para:3073115.1.2,370345.1.1] -lt(sk5,sk6).
% 3080161 [input:3056974,cut:3059730] equal(app(cons(X,nil),Y),cons(X,Y)) | -ss^list(Y).
% 3080167 [binary:3057050,3080161.2] equal(app(cons(X,nil),sk8),cons(X,sk8)).
% 3080465 [para:3080161.1.1,3056939.1.1,cut:3066050] ss^list(cons(X,Y)) | -ss^list(Y).
% 3100642 [para:3057003.1.1,3057051.1.1,demod:3080167,cut:3057050,cut:3066050,binarydemod:3080465,3065085,cut:3056862] equal(app(app(sk7,cons(sk5,nil)),cons(sk6,sk8)),sk1).
% 3138361 [input:3057035,cut:3059730,cut:3059730] -equal(app(app(X,cons(Y,Z)),cons(U,V)),W) | lt(Y,U) | -ss^list(V) | -ss^list(Z) | -ss^list(X) | -ss^list(W) | -strictordered^p(W).
% 3305455 [binary:3100642,3138361,cut:3073123,cut:3057050,cut:3056862,cut:3057049,cut:3057040,cut:3057822] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% 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
% seconds given: 141
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 34708
% derived clauses: 4525032
% kept clauses: 1045387
% kept size sum: 0
% kept mid-nuclei: 420452
% kept new demods: 62879
% forw unit-subs: 308071
% forw double-subs: 388987
% forw overdouble-subs: 115331
% backward subs: 1392
% fast unit cutoff: 370398
% full unit cutoff: 275
% dbl unit cutoff: 15939
% real runtime : 570.74
% process. runtime: 567.51
% specific non-discr-tree subsumption statistics:
% tried: 52280986
% length fails: 660198
% strength fails: 9471605
% predlist fails: 8161442
% aux str. fails: 436886
% by-lit fails: 556797
% full subs tried: 32757160
% full subs fail: 32592451
%
% ; 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/SWC166-1+eq_r.in")
%
%------------------------------------------------------------------------------