TSTP Solution File: SWC075-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC075-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 : art10.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 367.4s
% Output : Assurance 367.4s
% 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/SWC075-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,0,396,0,1,53840,4,2320,55831,5,2814,55831,1,2814,55831,50,2817,55831,40,2817,56029,0,2817,143299,3,4223,181939,4,4921,198981,5,5632,198981,5,5635,198982,1,5635,198982,50,5639,198982,40,5639,199180,0,5639,244434,3,6191,260205,4,6466,271613,5,6740,271615,5,6741,271615,1,6741,271615,50,6743,271615,40,6743,271813,0,6743,334471,3,7594,345501,4,8019,358340,5,8444,358342,5,8445,358343,1,8445,358343,50,8448,358343,40,8448,358541,0,8448,436984,3,9300,458099,4,9724,475007,5,10149,475008,5,10151,475009,1,10151,475009,50,10154,475009,40,10154,475207,0,10154,800082,3,14507,894795,4,16686,973025,5,18855,973026,1,18855,973026,50,18858,973026,40,18858,973224,0,18858,1019098,3,20259,1019685,4,20960,1022947,5,21659,1022948,1,21659,1022948,50,21660,1022948,40,21660,1023146,0,21660,1285268,3,24562,1366380,4,26011,1490936,5,27461,1490937,1,27461,1490937,50,27467,1490937,40,27467,1491135,0,27495,1648013,3,28919,1701862,4,29596,1758803,5,30296,1758804,1,30296,1758804,50,30303,1758804,40,30303,1759002,0,30338,1814514,3,30917,1829568,4,31165,1879767,5,31439,1879768,1,31439,1879768,50,31444,1879768,40,31444,1879966,0,31444,1927134,3,32845,1927757,4,33545,1931185,5,34245,1931186,1,34245,1931186,50,34247,1931186,40,34247,1931384,0,34247,2012959,3,35650,2025503,4,36348,2041714,5,37055,2041715,5,37057,2041715,1,37057,2041715,50,37060,2041715,40,37060,2041913,0,37060)
%
%
% START OF PROOF
% 2041716 [] equal(X,X).
% 2041724 [] ss^list(nil).
% 2041728 [] ss^item(skaf83(X)).
% 2041729 [] ss^list(skaf82(X)).
% 2041766 [] ss^list(skaf46(X,Y)).
% 2041773 [] segment^p(X,X) | -ss^list(X).
% 2041774 [] rearseg^p(X,nil) | -ss^list(X).
% 2041775 [] rearseg^p(X,X) | -ss^list(X).
% 2041789 [] equal(app(X,nil),X) | -ss^list(X).
% 2041790 [] equal(app(nil,X),X) | -ss^list(X).
% 2041814 [] -equal(cons(X,Y),nil) | -ss^item(X) | -ss^list(Y).
% 2041816 [] neq(X,Y) | equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 2041825 [] equal(cons(skaf83(X),skaf82(X)),X) | equal(nil,X) | -ss^list(X).
% 2041844 [] -rearseg^p(X,Y) | -rearseg^p(Y,X) | equal(Y,X) | -ss^list(Y) | -ss^list(X).
% 2041847 [] equal(app(skaf46(X,Y),Y),X) | -rearseg^p(X,Y) | -ss^list(X) | -ss^list(Y).
% 2041852 [] rearseg^p(app(X,Y),Z) | -rearseg^p(Y,Z) | -ss^list(Y) | -ss^list(Z) | -ss^list(X).
% 2041859 [] -equal(app(X,Y),Z) | rearseg^p(Z,Y) | -ss^list(Z) | -ss^list(Y) | -ss^list(X).
% 2041861 [] equal(app(X,Y),nil) | -equal(nil,X) | -equal(nil,Y) | -ss^list(X) | -ss^list(Y).
% 2041865 [] equal(app(app(X,Y),Z),app(X,app(Y,Z))) | -ss^list(X) | -ss^list(Z) | -ss^list(Y).
% 2041869 [] -rearseg^p(Y,Z) | -rearseg^p(X,Y) | rearseg^p(X,Z) | -ss^list(X) | -ss^list(Y) | -ss^list(Z).
% 2041888 [] segment^p(app(app(X,Y),Z),U) | -segment^p(Y,U) | -ss^list(Y) | -ss^list(U) | -ss^list(Z) | -ss^list(X).
% 2041902 [] ss^list(sk1).
% 2041903 [] ss^list(sk2).
% 2041904 [] ss^list(sk3).
% 2041905 [] ss^list(sk4).
% 2041906 [] equal(sk2,sk4).
% 2041907 [] equal(sk1,sk3).
% 2041908 [] -neq(X,nil) | -segment^p(sk2,X) | -segment^p(sk1,X) | -ss^list(X).
% 2041909 [] ss^list(sk5).
% 2041910 [] ss^list(sk6).
% 2041911 [] equal(app(sk5,sk6),sk4).
% 2041912 [] equal(app(sk6,sk5),sk3).
% 2041913 [] -equal(nil,sk2) | -equal(nil,sk1).
% 2041938 [input:2041852,factor:binarycut:2041775] rearseg^p(app(X,Y),Y) | -ss^list(Y) | -ss^list(X).
% 2041970 [input:2041865,factor] equal(app(app(X,Y),X),app(X,app(Y,X))) | -ss^list(X) | -ss^list(Y).
% 2041991 [input:2041888,factor:binarycut:2041773] segment^p(app(app(X,Y),Z),Y) | -ss^list(Z) | -ss^list(X) | -ss^list(Y).
% 2041999 [input:2041888,factor:factor:factor:factor:factor:factor:factor:factor:binarycut:2041773] segment^p(app(app(X,Y),X),Y) | -ss^list(Y) | -ss^list(X).
% 2042819 [binary:2041908,2041816,cut:2041724] -segment^p(sk1,X) | -segment^p(sk2,X) | equal(X,nil) | -ss^list(X).
% 2042879 [para:2041825.1.1,2041814.1.1,cut:2041728,cut:2041729] -equal(X,nil) | equal(nil,X) | -ss^list(X).
% 2043003 [para:2041912.1.1,2041999.1.1.1,cut:2041909,cut:2041910] segment^p(app(sk3,sk6),sk5).
% 2043012 [para:2041907.1.2,2043003.1.1.1] segment^p(app(sk1,sk6),sk5).
% 2043212 [para:2041847.1.1,2041789.1.1,cut:2041724,cut:2041766,binarycut:2041774] equal(X,skaf46(X,nil)) | -ss^list(X).
% 2043214 [para:2041789.1.1,2041847.1.1,cut:2041724,cut:2041766,binarycut:2041774] equal(skaf46(X,nil),X) | -ss^list(X).
% 2043337 [para:2041911.1.1,2041852.1.1,cut:2041910,cut:2041909] -rearseg^p(sk6,X) | rearseg^p(sk4,X) | -ss^list(X).
% 2043338 [para:2041912.1.1,2041852.1.1,cut:2041909,cut:2041910] -rearseg^p(sk5,X) | rearseg^p(sk3,X) | -ss^list(X).
% 2043361 [binary:2041774,2043337,cut:2041724,cut:2041910] rearseg^p(sk4,nil).
% 2043363 [para:2041906.1.2,2043361.1.1] rearseg^p(sk2,nil).
% 2043398 [binary:2041774,2043338,cut:2041724,cut:2041909] rearseg^p(sk3,nil).
% 2043400 [para:2041907.1.2,2043398.1.1] rearseg^p(sk1,nil).
% 2043489 [para:2041790.1.1,2041859.1.1,cut:2041724] -equal(X,Y) | rearseg^p(Y,X) | -ss^list(Y) | -ss^list(X).
% 2043547 [para:2041861.1.1,2041911.1.1,cut:2041909,cut:2041910] -equal(nil,sk5) | -equal(nil,sk6) | equal(nil,sk4).
% 2044933 [para:2041790.1.1,2041888.1.1.1,cut:2041724,factor:factor:binarycut:2041773] segment^p(app(X,Y),X) | -ss^list(Y) | -ss^list(X).
% 2045167 [para:2041911.1.1,2044933.1.1,cut:2041910,cut:2041909] segment^p(sk4,sk5).
% 2045168 [para:2041912.1.1,2044933.1.1,cut:2041909,cut:2041910] segment^p(sk3,sk6).
% 2045194 [para:2041906.1.2,2045167.1.1] segment^p(sk2,sk5).
% 2045197 [para:2041907.1.2,2045168.1.1] segment^p(sk1,sk6).
% 2045385 [binary:2042819,2045197,cut:2041910] -segment^p(sk2,sk6) | equal(sk6,nil).
% 2047928 [binary:2041906,2043489,cut:2041905,cut:2041903] rearseg^p(sk4,sk2).
% 2047929 [binary:2041907,2043489,cut:2041904,cut:2041902] rearseg^p(sk3,sk1).
% 2047967 [binary:2043212,2043489,cut:2041766] rearseg^p(skaf46(X,nil),X) | -ss^list(X).
% 2047968 [binary:2043214,2043489,cut:2041766] rearseg^p(X,skaf46(X,nil)) | -ss^list(X).
% 2047995 [binary:2041869,2047928,cut:2041905,cut:2041903] -rearseg^p(X,sk4) | rearseg^p(X,sk2) | -ss^list(X).
% 2047997 [binary:2041869,2047929,cut:2041904,cut:2041902] -rearseg^p(X,sk3) | rearseg^p(X,sk1) | -ss^list(X).
% 2048141 [binary:2047967,2047995,cut:2041766,cut:2041905] rearseg^p(skaf46(sk4,nil),sk2).
% 2048150 [para:2041906.1.2,2048141.1.1.1] rearseg^p(skaf46(sk2,nil),sk2).
% 2048181 [binary:2041844,2048150,cut:2041903,cut:2041766,binarydemod:2047968,cut:2041903] equal(sk2,skaf46(sk2,nil)).
% 2048405 [para:2048181.1.2,2041847.1.1.1,cut:2043363,cut:2041903,cut:2041724] equal(app(sk2,nil),sk2).
% 2048802 [para:2041911.1.1,2041970.1.1.1,demod:2041912,cut:2041909,cut:2041910] equal(app(sk4,sk5),app(sk5,sk3)).
% 2048803 [para:2041912.1.1,2041970.1.1.1,demod:2041911,cut:2041910,cut:2041909] equal(app(sk3,sk6),app(sk6,sk4)).
% 2049209 [para:2048802.1.2,2041938.1.1,cut:2041904,cut:2041909] rearseg^p(app(sk4,sk5),sk3).
% 2049246 [para:2041906.1.2,2049209.1.1.1] rearseg^p(app(sk2,sk5),sk3).
% 2049288 [para:2041907.1.2,2049246.1.2] rearseg^p(app(sk2,sk5),sk1).
% 2049433 [binary:2047967,2047997,cut:2041766,cut:2041904] rearseg^p(skaf46(sk3,nil),sk1).
% 2049495 [para:2041907.1.2,2049433.1.1.1] rearseg^p(skaf46(sk1,nil),sk1).
% 2049520 [binary:2041844,2049495,cut:2041902,cut:2041766,binarydemod:2047968,cut:2041902] equal(sk1,skaf46(sk1,nil)).
% 2049529 [para:2049520.1.2,2041847.1.1.1,cut:2043400,cut:2041902,cut:2041724] equal(app(sk1,nil),sk1).
% 2049876 [para:2048803.1.2,2041938.1.1,cut:2041905,cut:2041910] rearseg^p(app(sk3,sk6),sk4).
% 2049917 [para:2041906.1.2,2049876.1.2] rearseg^p(app(sk3,sk6),sk2).
% 2050041 [para:2041911.1.1,2041991.1.1.1,cut:2041909,cut:2041910] segment^p(app(sk4,X),sk6) | -ss^list(X).
% 2050092 [para:2041907.1.2,2049917.1.1.1] rearseg^p(app(sk1,sk6),sk2).
% 2050172 [para:2041789.1.1,2050041.1.1,cut:2041724,cut:2041905] segment^p(sk4,sk6).
% 2050178 [para:2041906.1.2,2050172.1.1] segment^p(sk2,sk6).
% 2050202 [binary:2045385,2050178] equal(sk6,nil).
% 2050206 [binary:2042879,2050202,cut:2041910] equal(nil,sk6).
% 2050210 [para:2050202.1.1,2043012.1.1.2,demod:2049529] segment^p(sk1,sk5).
% 2050303 [para:2050202.1.1,2050092.1.1.2,demod:2049529] rearseg^p(sk1,sk2).
% 2050311 [binary:2042819,2050210,cut:2045194,cut:2041909] equal(sk5,nil).
% 2050502 [para:2050311.1.1,2043547.1.2,cut:2041716,cut:2050206] equal(nil,sk4).
% 2050529 [para:2050311.1.1,2049288.1.1.2,demod:2048405] rearseg^p(sk2,sk1).
% 2050536 [para:2050502.1.2,2041906.1.2] equal(sk2,nil).
% 2050537 [para:2041906.1.2,2050502.1.2] equal(nil,sk2).
% 2050746 [binary:2041844,2050529,cut:2050303,cut:2041902,cut:2041903] equal(sk1,sk2).
% 2050837 [para:2050536.1.1,2041913.1.2,cut:2041716] -equal(nil,sk1).
% 2051158 [para:2050746.1.2,2050537.1.2,cut:2050837] 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: 25940
% derived clauses: 2994856
% kept clauses: 771033
% kept size sum: 154593
% kept mid-nuclei: 314572
% kept new demods: 62462
% forw unit-subs: 241835
% forw double-subs: 187673
% forw overdouble-subs: 63232
% backward subs: 257
% fast unit cutoff: 271922
% full unit cutoff: 88
% dbl unit cutoff: 11324
% real runtime : 375.26
% process. runtime: 372.14
% specific non-discr-tree subsumption statistics:
% tried: 10534702
% length fails: 328346
% strength fails: 1950032
% predlist fails: 5186803
% aux str. fails: 226007
% by-lit fails: 313785
% full subs tried: 2343113
% full subs fail: 2272192
%
% ; 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/SWC075-1+eq_r.in")
%
%------------------------------------------------------------------------------