%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC174-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 566.5s
% Output : Assurance 566.5s
% 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/SWC174-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,2151,54122,5,2802,54123,1,2804,54123,50,2806,54123,40,2806,54322,0,2806,137097,3,4209,173187,4,4911,197202,5,5607,197204,1,5608,197204,50,5612,197204,40,5612,197403,0,5612,245040,3,6163,261911,4,6440,271587,5,6713,271587,5,6715,271587,1,6715,271587,50,6717,271587,40,6717,271786,0,6717,337085,3,7571,359119,4,7996,372743,5,8418,372744,5,8420,372744,1,8420,372744,50,8423,372744,40,8423,372943,0,8423,445757,3,9275,467520,4,9701,486206,5,10124,486207,5,10125,486208,1,10125,486208,50,10128,486208,40,10128,486407,0,10128,817942,3,14482,885000,4,16655,993085,62,18829,993085,5,18831,993086,1,18831,993086,50,18834,993086,40,18834,993285,0,18834,1036190,3,20235,1037369,4,20935,1043041,5,21635,1043042,1,21635,1043042,50,21637,1043042,40,21637,1043241,0,21637,1323534,3,24538,1354124,4,25988,1513415,5,27439,1513415,1,27439,1513415,50,27445,1513415,40,27445,1513614,0,27474,1665595,3,28875,1720828,4,29576,1786887,5,30275,1786888,1,30275,1786888,50,30281,1786888,40,30281,1787087,0,30316,1843797,3,30868,1858290,4,31142,1908308,5,31418,1908308,1,31418,1908308,50,31423,1908308,40,31423,1908507,0,31423,1951822,3,32825,1953002,4,33524,1959544,5,34224,1959545,5,34224,1959545,1,34224,1959545,50,34225,1959545,40,34225,1959744,0,34225,2037568,3,35627,2053767,4,36326,2070365,5,37026,2070366,5,37027,2070366,1,37027,2070366,50,37030,2070366,40,37030,2070565,0,37030,2110954,3,38431,2111671,4,39131,2121243,1,39831,2121243,50,39832,2121243,40,39832,2121442,0,39832,2177196,3,40684,2185347,4,41108,2203609,5,41533,2203609,5,41534,2203609,1,41534,2203609,50,41536,2203609,40,41536,2203808,0,41536,2230763,5,44337,2230765,1,44337,2230765,50,44338,2230765,40,44338,2230964,0,44338,3056063,5,46039,3056064,1,46039,3056064,50,46045,3056064,40,46045,3056263,0,46048,3275575,3,53158,3318604,4,56625)
%
%
% START OF PROOF
% 271776 [?] ?
% 271780 [?] ?
% 274759 [?] ?
% 302835 [binary:271776,274759.2,cut:271780] strictordered^p(sk3).
% 372808 [?] ?
% 372933 [?] ?
% 372939 [?] ?
% 373305 [?] ?
% 373737 [binary:372808.2,372939] -lt(sk6,sk6).
% 448899 [binary:372933,373305.2] ss^list(app(sk3,sk3)).
% 2070367 [?] ?
% 2094756 [?] ?
% 2095318 [?] ?
% 2096221 [binary:2070367,2095318,cut:2094756] -duplicatefree^p(app(sk1,sk1)).
% 3056073 [] ss^list(nil).
% 3056137 [] -ss^list(X) | ss^item(Y) | duplicatefree^p(X).
% 3056150 [] ss^list(app(X,Y)) | -ss^list(X) | -ss^list(Y).
% 3056151 [?] ?
% 3056167 [?] ?
% 3056185 [?] ?
% 3056214 [] equal(app(app(X,Y),Z),app(X,app(Y,Z))) | -ss^list(X) | -ss^list(Z) | -ss^list(Y).
% 3056246 [?] ?
% 3056251 [] ss^list(sk1).
% 3056256 [] equal(sk1,sk3).
% 3056260 [] ss^list(sk7).
% 3056261 [] ss^list(sk8).
% 3056262 [] equal(app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8),sk1).
% 3056263 [] -neq(sk5,sk6).
% 3057033 [para:3056256.1.2,302835.1.1] strictordered^p(sk1).
% 3057093 [para:3056256.1.2,448899.1.1.1] ss^list(app(sk1,sk3)).
% 3057123 [para:3056256.1.2,3057093.1.1.2] ss^list(app(sk1,sk1)).
% 3059082 [binary:2096221,3056137.3,cut:3057123] ss^item(X).
% 3065554 [binary:3056260,3056150.2] ss^list(app(sk7,X)) | -ss^list(X).
% 3066260 [input:3056151,cut:3059082] ss^list(cons(X,Y)) | -ss^list(Y).
% 3066268 [binary:3056073,3066260.2] ss^list(cons(X,nil)).
% 3073297 [input:3056167,cut:3059082,cut:3059082] neq(X,Y) | equal(X,Y).
% 3073298 [binary:3056263,3073297] equal(sk5,sk6).
% 3073305 [para:3073298.1.2,373737.1.1] -lt(sk5,sk6).
% 3081025 [input:3056185,cut:3059082] equal(app(cons(X,nil),Y),cons(X,Y)) | -ss^list(Y).
% 3081031 [binary:3056261,3081025.2] equal(app(cons(X,nil),sk8),cons(X,sk8)).
% 3081363 [para:3081025.1.1,3056150.1.1,cut:3066268] ss^list(cons(X,Y)) | -ss^list(Y).
% 3104816 [para:3056214.1.1,3056262.1.1,demod:3081031,cut:3056261,cut:3066268,binarydemod:3081363,3065554,cut:3056073] equal(app(app(sk7,cons(sk5,nil)),cons(sk6,sk8)),sk1).
% 3144781 [input:3056246,cut:3059082,cut:3059082] -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).
% 3324955 [binary:3104816,3144781,cut:3073305,cut:3056261,cut:3056073,cut:3056260,cut:3056251,cut:3057033] 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: 34856
% derived clauses: 4537920
% kept clauses: 1046219
% kept size sum: 0
% kept mid-nuclei: 423313
% kept new demods: 63164
% forw unit-subs: 309295
% forw double-subs: 390104
% forw overdouble-subs: 115314
% backward subs: 1462
% fast unit cutoff: 374484
% full unit cutoff: 279
% dbl unit cutoff: 15902
% real runtime : 572.0
% process. runtime: 567.95
% specific non-discr-tree subsumption statistics:
% tried: 48698583
% length fails: 660183
% strength fails: 8768177
% predlist fails: 8293716
% aux str. fails: 438438
% by-lit fails: 554791
% full subs tried: 29749710
% full subs fail: 29587786
%
% ; 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/SWC174-1+eq_r.in")
%
%------------------------------------------------------------------------------