%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC347-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 : art04.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 169.0s
% Output : Assurance 169.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/SWC347-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,2,402,0,3,50065,4,2158,52249,5,2804,52250,1,2804,52250,50,2806,52250,40,2806,52454,0,2806,139128,3,4209,173403,4,4907,195022,5,5607,195023,5,5608,195024,1,5608,195024,50,5611,195024,40,5611,195228,0,5612,244445,3,6171,257878,4,6439,267498,62,6713,267499,5,6714,267500,1,6714,267500,50,6717,267500,40,6717,267704,0,6717,330025,3,7581,345497,4,7993,362441,62,8418,362441,5,8420,362442,1,8420,362442,50,8423,362442,40,8423,362646,0,8423,442264,3,9275,464778,4,9702,477829,5,10124,477829,5,10126,477830,1,10126,477830,50,10129,477830,40,10129,478034,0,10129,784761,3,14481,868571,4,16655)
%
%
% START OF PROOF
% 477839 [] ss^list(nil).
% 477882 [] ss^list(skaf45(X,Y)).
% 477888 [] segment^p(X,X) | -ss^list(X).
% 477905 [] equal(app(nil,X),X) | -ss^list(X).
% 477963 [] equal(app(X,skaf45(Y,X)),Y) | -frontseg^p(Y,X) | -ss^list(Y) | -ss^list(X).
% 477975 [] -equal(app(X,Y),Z) | frontseg^p(Z,X) | -ss^list(Z) | -ss^list(X) | -ss^list(Y).
% 477983 [] -segment^p(X,Y) | -segment^p(Z,X) | segment^p(Z,Y) | -ss^list(Z) | -ss^list(X) | -ss^list(Y).
% 478004 [] -equal(app(app(X,Y),Z),U) | segment^p(U,Y) | -ss^list(U) | -ss^list(Y) | -ss^list(Z) | -ss^list(X).
% 478020 [] strictordered^p(sk3).
% 478021 [] equal(app(sk3,sk5),sk4).
% 478022 [] ss^list(sk5).
% 478023 [] equal(sk1,sk3).
% 478024 [] equal(sk2,sk4).
% 478025 [] ss^list(sk4).
% 478026 [] ss^list(sk3).
% 478027 [] ss^list(sk2).
% 478028 [] ss^list(sk1).
% 478034 [?] ?
% 478214 [binary:477888.2,478025] segment^p(sk4,sk4).
% 478310 [binary:477983.5,478025] -segment^p(sk4,X) | -segment^p(Y,sk4) | segment^p(Y,X) | -ss^list(X) | -ss^list(Y).
% 478731 [binary:477905.2,478028] equal(app(nil,sk1),sk1).
% 478899 [para:478023.1.2,478020.1.1] strictordered^p(sk1).
% 480491 [para:478024.1.2,478214.1.1] segment^p(sk2,sk4).
% 480555 [binary:477975,478021,cut:478025,cut:478026,cut:478022] frontseg^p(sk4,sk3).
% 481231 [input:478034,cut:478899] -segment^p(sk2,sk1).
% 481254 [para:478023.1.2,480555.1.2] frontseg^p(sk4,sk1).
% 482882 [binary:477963.2,481254,cut:478025,cut:478028] equal(app(sk1,skaf45(sk4,sk1)),sk4).
% 497873 [para:478731.1.1,478004.1.1.1,cut:478028,cut:477839] -equal(app(sk1,X),Y) | segment^p(Y,sk1) | -ss^list(Y) | -ss^list(X).
% 762661 [binary:481231,478310.3,cut:480491,cut:478028,cut:478027] -segment^p(sk4,sk1).
% 882967 [binary:482882,497873,cut:762661,cut:478025,cut:477882] 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
% clause length limited to 19
% clause depth limited to 5
% seconds given: 87
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 6957
% derived clauses: 1180995
% kept clauses: 403084
% kept size sum: 0
% kept mid-nuclei: 88924
% kept new demods: 34358
% forw unit-subs: 89877
% forw double-subs: 30699
% forw overdouble-subs: 21619
% backward subs: 62
% fast unit cutoff: 99716
% full unit cutoff: 42
% dbl unit cutoff: 6228
% real runtime : 172.96
% process. runtime: 171.74
% specific non-discr-tree subsumption statistics:
% tried: 6706553
% length fails: 229478
% strength fails: 891730
% predlist fails: 3760713
% aux str. fails: 306015
% by-lit fails: 131502
% full subs tried: 1276196
% full subs fail: 1249532
%
% ; 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/SWC347-1+eq_r.in")
%
%------------------------------------------------------------------------------