TSTP Solution File: SWC417-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC417-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 : art07.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.2s
% Output : Assurance 378.2s
% 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/SWC417-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(204,40,1,408,0,1,55124,4,2201,56982,5,2802,56983,1,2804,56983,50,2807,56983,40,2807,57187,0,2807,136446,3,4243,173485,4,4908,196682,5,5608,196683,5,5610,196683,1,5610,196683,50,5613,196683,40,5613,196887,0,5614,233365,3,6165,250980,4,6442,266275,5,6715,266276,5,6716,266277,1,6716,266277,50,6718,266277,40,6718,266481,0,6718,327162,3,7573,344748,4,7994,361181,5,8421,361182,5,8423,361183,1,8423,361183,50,8425,361183,40,8425,361387,0,8425,437132,3,9276,461343,4,9702,479672,5,10126,479672,5,10128,479673,1,10128,479673,50,10131,479673,40,10131,479877,0,10131,798692,3,14484,885111,4,16660,971941,5,18832,971942,1,18832,971942,50,18835,971942,40,18835,972146,0,18835,1017032,3,20236,1018205,4,20936,1024940,5,21636,1024941,1,21637,1024941,50,21638,1024941,40,21638,1025145,0,21638,1279039,3,24540,1371979,4,25990,1474601,5,27439,1474602,1,27439,1474602,50,27444,1474602,40,27444,1474806,0,27475,1632160,3,28877,1683439,4,29576,1735353,5,30276,1735354,1,30276,1735354,50,30283,1735354,40,30283,1735558,0,30318,1789489,3,30882,1805243,4,31145,1851954,5,31419,1851955,5,31420,1851955,1,31420,1851955,50,31425,1851955,40,31425,1852159,0,31426,1896438,3,32827,1897330,4,33527,1907288,5,34227,1907289,5,34227,1907289,1,34227,1907289,50,34229,1907289,40,34229,1907493,0,34229,1993142,3,35630,2056858,4,36330,2085893,5,37030,2085894,5,37030,2085894,1,37030,2085894,50,37032,2085894,40,37032,2086098,0,37032)
%
%
% START OF PROOF
% 2085895 [] equal(X,X).
% 2085903 [] ss^list(nil).
% 2085956 [] frontseg^p(X,X) | -ss^list(X).
% 2085968 [] equal(app(X,nil),X) | -ss^list(X).
% 2085969 [] equal(app(nil,X),X) | -ss^list(X).
% 2085981 [] ss^list(cons(X,Y)) | -ss^item(X) | -ss^list(Y).
% 2086015 [] equal(app(cons(X,nil),Y),cons(X,Y)) | -ss^item(X) | -ss^list(Y).
% 2086024 [] -frontseg^p(X,Y) | -frontseg^p(Y,X) | equal(Y,X) | -ss^list(Y) | -ss^list(X).
% 2086039 [] -equal(app(X,Y),Z) | frontseg^p(Z,X) | -ss^list(Z) | -ss^list(X) | -ss^list(Y).
% 2086073 [] frontseg^p(cons(X,Y),cons(Z,U)) | -frontseg^p(Y,U) | -equal(X,Z) | -ss^item(X) | -ss^item(Z) | -ss^list(Y) | -ss^list(U).
% 2086081 [] ss^list(sk1).
% 2086082 [] ss^list(sk2).
% 2086084 [] ss^list(sk4).
% 2086085 [] equal(sk2,sk4).
% 2086086 [] equal(sk1,sk3).
% 2086087 [] neq(sk2,nil).
% 2086094 [] -neq(sk4,nil) | -equal(app(app(X,cons(Y,nil)),Z),sk1) | -equal(app(app(Z,cons(Y,nil)),X),sk2) | -ss^item(Y) | -ss^list(Z) | -ss^list(X).
% 2086095 [] -neq(sk4,nil) | ss^item(sk5).
% 2086096 [] -neq(sk4,nil) | ss^list(sk6).
% 2086097 [] equal(app(cons(sk5,nil),sk6),sk4) | -neq(sk4,nil).
% 2086098 [] equal(app(sk6,cons(sk5,nil)),sk3) | -neq(sk4,nil).
% 2086220 [input:2086073,factor:factor:binarycut:2085956,factor:cut:2085895] frontseg^p(cons(X,Y),cons(X,Y)) | -ss^item(X) | -ss^list(Y).
% 2086867 [para:2086085.1.2,2086095.1.1,cut:2086087] ss^item(sk5).
% 2086869 [para:2086085.1.2,2086094.1.1,cut:2086087] -equal(app(app(X,cons(Y,nil)),Z),sk1) | -equal(app(app(Z,cons(Y,nil)),X),sk2) | -ss^item(Y) | -ss^list(Z) | -ss^list(X).
% 2086871 [para:2086085.1.2,2086096.1.1,cut:2086087] ss^list(sk6).
% 2086875 [para:2086098.1.1,2086869.1.1.1,cut:2086867,cut:2086871] -neq(sk4,nil) | -equal(app(app(X,cons(sk5,nil)),sk6),sk2) | -equal(app(sk3,X),sk1) | -ss^list(X).
% 2086877 [para:2086085.1.2,2086875.1.1,cut:2086087] -equal(app(app(X,cons(sk5,nil)),sk6),sk2) | -equal(app(sk3,X),sk1) | -ss^list(X).
% 2086983 [para:2085969.1.1,2086877.1.1.1,cut:2085903] -equal(app(cons(sk5,nil),sk6),sk2) | -equal(app(sk3,nil),sk1) | -ss^list(cons(sk5,nil)).
% 2086995 [para:2086097.1.1,2086983.1.1] -equal(app(sk3,nil),sk1) | -ss^list(cons(sk5,nil)) | -neq(sk4,nil) | -equal(sk4,sk2).
% 2087203 [para:2086015.1.1,2086097.1.1,cut:2086867,cut:2086871] equal(cons(sk5,sk6),sk4) | -neq(sk4,nil).
% 2087774 [para:2085968.1.1,2086039.1.1,cut:2085903] -equal(X,Y) | frontseg^p(Y,X) | -ss^list(Y) | -ss^list(X).
% 2087846 [binary:2086085,2087774,cut:2086084,cut:2086082] frontseg^p(sk4,sk2).
% 2095313 [para:2087203.1.1,2086220.1.1,cut:2086867,cut:2086871] frontseg^p(sk4,cons(sk5,sk6)) | -neq(sk4,nil).
% 2095430 [para:2087203.1.1,2095313.1.2] -neq(sk4,nil) | frontseg^p(sk4,sk4).
% 2095437 [para:2086085.1.2,2095430.1.1,cut:2086087] frontseg^p(sk4,sk4).
% 2095438 [para:2086085.1.2,2095437.1.1] frontseg^p(sk2,sk4).
% 2095439 [binary:2086024,2095438,cut:2087846,cut:2086084,cut:2086082] equal(sk4,sk2).
% 2119464 [para:2086086.1.2,2086995.1.1.1,binarydemod:2085968,cut:2086081,cut:2095439] -ss^list(cons(sk5,nil)) | -neq(sk4,nil).
% 2119465 [binary:2085981,2119464,cut:2086867,cut:2085903] -neq(sk4,nil).
% 2119466 [para:2086085.1.2,2119465.1.1,cut:2086087] 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: 27428
% derived clauses: 2959146
% kept clauses: 767247
% kept size sum: 660916
% kept mid-nuclei: 341566
% kept new demods: 64396
% forw unit-subs: 226478
% forw double-subs: 79182
% forw overdouble-subs: 83627
% backward subs: 633
% fast unit cutoff: 282479
% full unit cutoff: 108
% dbl unit cutoff: 12783
% real runtime : 380.57
% process. runtime: 378.38
% specific non-discr-tree subsumption statistics:
% tried: 15599619
% length fails: 511346
% strength fails: 3226576
% predlist fails: 7959179
% aux str. fails: 317544
% by-lit fails: 544371
% full subs tried: 2798164
% full subs fail: 2695040
%
% ; 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/SWC417-1+eq_r.in")
%
%------------------------------------------------------------------------------