TSTP Solution File: SWC211-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC211-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 : art08.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 378.3s
% Output : Assurance 378.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/SWC211-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(196,40,2,392,0,2,53377,4,2192,55357,63,2803,55357,1,2803,55357,50,2805,55357,40,2805,55553,0,2806,128097,3,4207,156641,4,4907,182739,62,5607,182739,5,5609,182739,1,5609,182739,50,5613,182739,40,5613,182935,0,5613,217323,3,6164,234677,4,6439,252005,62,6714,252005,5,6715,252005,1,6715,252005,50,6717,252005,40,6717,252201,0,6717,305397,3,7570,323572,4,7993,341050,5,8418,341051,5,8419,341051,1,8419,341051,50,8421,341051,40,8421,341247,0,8422,402654,3,9282,414962,4,9699,432666,5,10123,432667,5,10125,432667,1,10125,432667,50,10128,432667,40,10128,432863,0,10128,626941,3,14483,673660,4,16654,744804,5,18852,744804,5,18853,744804,1,18853,744804,50,18856,744804,40,18856,745000,0,18856,786495,3,20257,789540,4,20957,797126,5,21657,797127,1,21657,797127,50,21659,797127,40,21659,797323,0,21659,1042150,3,24585,1053783,4,26010,1102605,5,27460,1102605,1,27460,1102605,50,27465,1102605,40,27465,1102801,0,27493,1263012,3,28894,1293135,4,29594,1338009,5,30294,1338010,5,30296,1338011,1,30296,1338011,50,30302,1338011,40,30302,1338207,0,30341,1388521,3,30909,1403943,4,31167,1449656,1,31442,1449656,50,31447,1449656,40,31447,1449852,0,31447,1496255,3,32848,1497580,4,33548,1506886,1,34248,1506886,50,34249,1506886,40,34249,1507082,0,34249,1570741,3,35650,1587323,4,36351,1607999,62,37050,1607999,5,37051,1607999,1,37051,1607999,50,37053,1607999,40,37053,1608195,0,37053)
%
%
% START OF PROOF
% 1608000 [] equal(X,X).
% 1608008 [] ss^list(nil).
% 1608012 [] ss^item(skaf83(X)).
% 1608013 [] ss^list(skaf82(X)).
% 1608050 [] ss^list(skaf46(X,Y)).
% 1608051 [] ss^list(skaf45(X,Y)).
% 1608058 [] rearseg^p(X,nil) | -ss^list(X).
% 1608059 [] rearseg^p(X,X) | -ss^list(X).
% 1608060 [] frontseg^p(X,nil) | -ss^list(X).
% 1608071 [] -member^p(nil,X) | -ss^item(X).
% 1608073 [] equal(app(X,nil),X) | -ss^list(X).
% 1608074 [] equal(app(nil,X),X) | -ss^list(X).
% 1608081 [] -equal(nil,X) | rearseg^p(nil,X) | -ss^list(X).
% 1608098 [] -equal(cons(X,Y),nil) | -ss^item(X) | -ss^list(Y).
% 1608100 [] neq(X,Y) | equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 1608109 [] equal(cons(skaf83(X),skaf82(X)),X) | equal(nil,X) | -ss^list(X).
% 1608115 [] -neq(X,Y) | -equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 1608118 [] -equal(app(X,Y),nil) | equal(nil,X) | -ss^list(X) | -ss^list(Y).
% 1608120 [] equal(app(cons(X,nil),Y),cons(X,Y)) | -ss^item(X) | -ss^list(Y).
% 1608128 [] -rearseg^p(X,Y) | -rearseg^p(Y,X) | equal(Y,X) | -ss^list(Y) | -ss^list(X).
% 1608131 [] equal(app(skaf46(X,Y),Y),X) | -rearseg^p(X,Y) | -ss^list(X) | -ss^list(Y).
% 1608132 [] equal(app(X,skaf45(Y,X)),Y) | -frontseg^p(Y,X) | -ss^list(Y) | -ss^list(X).
% 1608140 [] member^p(app(X,Y),Z) | -member^p(X,Z) | -ss^item(Z) | -ss^list(X) | -ss^list(Y).
% 1608143 [] -equal(app(X,Y),Z) | rearseg^p(Z,Y) | -ss^list(Z) | -ss^list(Y) | -ss^list(X).
% 1608145 [] equal(app(X,Y),nil) | -equal(nil,X) | -equal(nil,Y) | -ss^list(X) | -ss^list(Y).
% 1608150 [] -equal(app(X,Y),app(X,Z)) | equal(Y,Z) | -ss^list(Z) | -ss^list(X) | -ss^list(Y).
% 1608153 [] -rearseg^p(Y,Z) | -rearseg^p(X,Y) | rearseg^p(X,Z) | -ss^list(X) | -ss^list(Y) | -ss^list(Z).
% 1608175 [] -equal(app(X,cons(Y,Z)),U) | member^p(U,Y) | -ss^item(Y) | -ss^list(U) | -ss^list(Z) | -ss^list(X).
% 1608186 [] ss^list(sk1).
% 1608187 [] ss^list(sk2).
% 1608188 [] ss^list(sk3).
% 1608189 [] ss^list(sk4).
% 1608190 [] equal(sk2,sk4).
% 1608191 [] equal(sk1,sk3).
% 1608192 [] neq(sk2,nil).
% 1608193 [] -equal(app(cons(X,nil),Y),sk4) | equal(app(Y,cons(X,nil)),sk3) | -ss^item(X) | -ss^list(Y).
% 1608194 [] -neq(sk1,nil).
% 1608215 [input:1608131,factor:binarycut:1608059] equal(app(skaf46(X,X),X),X) | -ss^list(X).
% 1608243 [input:1608145,factor] equal(app(X,X),nil) | -equal(nil,X) | -ss^list(X).
% 1609091 [para:1608215.1.1,1608073.1.1,cut:1608008,cut:1608050] equal(nil,skaf46(nil,nil)).
% 1609092 [para:1609091.1.2,1608215.1.1.1,cut:1608008] equal(app(nil,nil),nil).
% 1609111 [binary:1608194,1608100,cut:1608008,cut:1608186] equal(sk1,nil).
% 1609204 [para:1608109.1.1,1608098.1.1,cut:1608012,cut:1608013] -equal(X,nil) | equal(nil,X) | -ss^list(X).
% 1609211 [binary:1609111,1609204,cut:1608186] equal(nil,sk1).
% 1609214 [binary:1608081,1609211,cut:1608186] rearseg^p(nil,sk1).
% 1609260 [binary:1608192,1608115,cut:1608008,cut:1608187] -equal(sk2,nil).
% 1609314 [para:1608120.1.1,1608193.1.1] equal(app(X,cons(Y,nil)),sk3) | -equal(cons(Y,X),sk4) | -ss^item(Y) | -ss^list(X).
% 1609521 [para:1608131.1.1,1608073.1.1,cut:1608008,cut:1608050,binarycut:1608058] equal(X,skaf46(X,nil)) | -ss^list(X).
% 1609523 [para:1608073.1.1,1608131.1.1,cut:1608008,cut:1608050,binarycut:1608058] equal(skaf46(X,nil),X) | -ss^list(X).
% 1609532 [binary:1608118,1608131,cut:1608008,cut:1608050] equal(nil,skaf46(nil,X)) | -rearseg^p(nil,X) | -ss^list(X).
% 1609556 [para:1608132.1.1,1608074.1.1,cut:1608008,cut:1608051,binarycut:1608060] equal(X,skaf45(X,nil)) | -ss^list(X).
% 1609558 [para:1608074.1.1,1608132.1.1,cut:1608008,cut:1608051,binarycut:1608060] equal(skaf45(X,nil),X) | -ss^list(X).
% 1609745 [para:1608243.1.1,1608140.1.1,binarycut:1608071] -equal(nil,X) | -member^p(X,Y) | -ss^item(Y) | -ss^list(X).
% 1609831 [para:1608074.1.1,1608143.1.1,cut:1608008] -equal(X,Y) | rearseg^p(Y,X) | -ss^list(Y) | -ss^list(X).
% 1609854 [binary:1608190,1609831,cut:1608189,cut:1608187] rearseg^p(sk4,sk2).
% 1609855 [binary:1608191,1609831,cut:1608188,cut:1608186] rearseg^p(sk3,sk1).
% 1609878 [binary:1609521,1609831,cut:1608050] rearseg^p(skaf46(X,nil),X) | -ss^list(X).
% 1609879 [binary:1609523,1609831,cut:1608050] rearseg^p(X,skaf46(X,nil)) | -ss^list(X).
% 1609880 [binary:1609556,1609831,cut:1608051] rearseg^p(skaf45(X,nil),X) | -ss^list(X).
% 1609881 [binary:1609558,1609831,cut:1608051] rearseg^p(X,skaf45(X,nil)) | -ss^list(X).
% 1609904 [para:1609111.1.1,1609855.1.2] rearseg^p(sk3,nil).
% 1609905 [binary:1608128,1609904,cut:1608008,cut:1608188] -rearseg^p(nil,sk3) | equal(nil,sk3).
% 1609907 [para:1608191.1.2,1609905.1.2,cut:1609214] equal(nil,sk3).
% 1610188 [para:1609092.1.1,1608150.1.1,cut:1608008] -equal(nil,app(nil,X)) | equal(nil,X) | -ss^list(X).
% 1610429 [binary:1609854,1608153,cut:1608189,cut:1608187] -rearseg^p(X,sk4) | rearseg^p(X,sk2) | -ss^list(X).
% 1610634 [binary:1609878,1610429,cut:1608050,cut:1608189] rearseg^p(skaf46(sk4,nil),sk2).
% 1610635 [binary:1609880,1610429,cut:1608051,cut:1608189] rearseg^p(skaf45(sk4,nil),sk2).
% 1610651 [para:1608190.1.2,1610634.1.1.1] rearseg^p(skaf46(sk2,nil),sk2).
% 1610654 [para:1608190.1.2,1610635.1.1.1] rearseg^p(skaf45(sk2,nil),sk2).
% 1610663 [binary:1608128,1610651,cut:1608187,cut:1608050,binarydemod:1609879,cut:1608187] equal(sk2,skaf46(sk2,nil)).
% 1610671 [binary:1608128,1610654,cut:1608187,cut:1608051,binarydemod:1609881,cut:1608187] equal(sk2,skaf45(sk2,nil)).
% 1610678 [para:1610663.1.2,1608131.1.1.1,cut:1608187,cut:1608008] equal(app(sk2,nil),sk2) | -rearseg^p(sk2,nil).
% 1610685 [para:1610671.1.2,1608132.1.1.2,cut:1608187,cut:1608008] equal(app(nil,sk2),sk2) | -frontseg^p(sk2,nil).
% 1610738 [para:1610678.1.1,1608145.1.1,cut:1609260,cut:1608000,cut:1608187,cut:1608008] -rearseg^p(sk2,nil) | -equal(nil,sk2).
% 1610787 [binary:1608058,1610738,cut:1608187] -equal(nil,sk2).
% 1614205 [binary:1609907,1609745,cut:1608188] -member^p(sk3,X) | -ss^item(X).
% 1622307 [para:1609532.1.2,1608131.1.1.1,cut:1608008] equal(app(nil,X),nil) | -rearseg^p(nil,X) | -ss^list(X).
% 1622636 [para:1608132.1.1,1610188.1.2,cut:1608051,cut:1608008,binarycut:1608060] equal(nil,skaf45(X,nil)) | -equal(nil,X) | -ss^list(X).
% 1631271 [para:1622307.1.1,1610685.1.1,cut:1610787,cut:1608187] -frontseg^p(sk2,nil) | -rearseg^p(nil,sk2).
% 1631329 [binary:1608060,1631271,cut:1608187] -rearseg^p(nil,sk2).
% 1635831 [para:1622636.1.2,1610635.1.1,cut:1631329,cut:1608189] -equal(nil,sk4).
% 1638556 [binary:1608175,1609314,cut:1608188,cut:1608008,binarycut:1614205] -equal(cons(X,Y),sk4) | -ss^item(X) | -ss^list(Y).
% 1641489 [binary:1608109,1638556,cut:1608012,cut:1608013,cut:1635831,cut:1608189] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using weight-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
% seconds given: 28
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 28666
% derived clauses: 2449997
% kept clauses: 767217
% kept size sum: 695269
% kept mid-nuclei: 325612
% kept new demods: 75580
% forw unit-subs: 298996
% forw double-subs: 112361
% forw overdouble-subs: 80498
% backward subs: 1195
% fast unit cutoff: 340186
% full unit cutoff: 123
% dbl unit cutoff: 11813
% real runtime : 382.10
% process. runtime: 380.3
% specific non-discr-tree subsumption statistics:
% tried: 22098771
% length fails: 542790
% strength fails: 5034705
% predlist fails: 4525549
% aux str. fails: 1091870
% by-lit fails: 504632
% full subs tried: 10198399
% full subs fail: 10083969
%
% ; 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/SWC211-1+eq_r.in")
%
%------------------------------------------------------------------------------