TSTP Solution File: SWC090-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC090-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 : art05.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.1s
% Output : Assurance 367.1s
% 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/SWC090-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,53839,4,2343,55840,5,2803,55841,1,2803,55841,50,2806,55841,40,2806,56039,0,2806,136837,3,4208,167835,4,4916,190724,5,5607,190724,5,5609,190725,1,5609,190725,50,5613,190725,40,5613,190923,0,5613,231524,3,6164,248667,4,6439,262987,5,6718,262987,5,6720,262988,1,6720,262988,50,6722,262988,40,6722,263186,0,6722,321681,3,7573,338479,4,7998,351284,5,8423,351286,5,8424,351286,1,8424,351286,50,8427,351286,40,8427,351484,0,8427,423616,3,9281,446443,4,9705,463828,5,10128,463829,5,10130,463830,1,10130,463830,50,10133,463830,40,10133,464028,0,10133,784651,3,14486,843930,4,16661,938520,5,18834,938520,1,18834,938520,50,18837,938520,40,18837,938718,0,18837,982912,3,20238,983551,4,20938,988171,5,21638,988172,1,21638,988172,50,21640,988172,40,21640,988370,0,21640,1244521,3,24543,1302755,4,26009,1423298,5,27441,1423299,1,27441,1423299,50,27446,1423299,40,27446,1423497,0,27476,1580631,3,28911,1633819,4,29578,1689664,5,30277,1689664,1,30277,1689664,50,30283,1689664,40,30283,1689862,0,30318,1745227,3,30869,1759753,4,31145,1808621,5,31419,1808621,1,31419,1808621,50,31425,1808621,40,31425,1808819,0,31425,1854095,3,32827,1854724,4,33526,1859521,5,34227,1859522,1,34227,1859522,50,34228,1859522,40,34228,1859720,0,34228,1937339,3,35632,1954056,4,36330,1970297,5,37029,1970298,5,37030,1970298,1,37030,1970298,50,37033,1970298,40,37033,1970496,0,37033)
%
%
% START OF PROOF
% 1970299 [] equal(X,X).
% 1970307 [] ss^list(nil).
% 1970311 [] ss^item(skaf83(X)).
% 1970312 [] ss^list(skaf82(X)).
% 1970349 [] ss^list(skaf46(X,Y)).
% 1970356 [] segment^p(X,X) | -ss^list(X).
% 1970357 [] rearseg^p(X,nil) | -ss^list(X).
% 1970372 [] equal(app(X,nil),X) | -ss^list(X).
% 1970373 [] equal(app(nil,X),X) | -ss^list(X).
% 1970397 [] -equal(cons(X,Y),nil) | -ss^item(X) | -ss^list(Y).
% 1970399 [] neq(X,Y) | equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 1970408 [] equal(cons(skaf83(X),skaf82(X)),X) | equal(nil,X) | -ss^list(X).
% 1970414 [] -neq(X,Y) | -equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 1970427 [] -rearseg^p(X,Y) | -rearseg^p(Y,X) | equal(Y,X) | -ss^list(Y) | -ss^list(X).
% 1970430 [] equal(app(skaf46(X,Y),Y),X) | -rearseg^p(X,Y) | -ss^list(X) | -ss^list(Y).
% 1970435 [] rearseg^p(app(X,Y),Z) | -rearseg^p(Y,Z) | -ss^list(Y) | -ss^list(Z) | -ss^list(X).
% 1970442 [] -equal(app(X,Y),Z) | rearseg^p(Z,Y) | -ss^list(Z) | -ss^list(Y) | -ss^list(X).
% 1970444 [] equal(app(X,Y),nil) | -equal(nil,X) | -equal(nil,Y) | -ss^list(X) | -ss^list(Y).
% 1970452 [] -rearseg^p(Y,Z) | -rearseg^p(X,Y) | rearseg^p(X,Z) | -ss^list(X) | -ss^list(Y) | -ss^list(Z).
% 1970471 [] segment^p(app(app(X,Y),Z),U) | -segment^p(Y,U) | -ss^list(Y) | -ss^list(U) | -ss^list(Z) | -ss^list(X).
% 1970485 [] ss^list(sk1).
% 1970486 [] ss^list(sk2).
% 1970487 [] ss^list(sk3).
% 1970488 [] ss^list(sk4).
% 1970489 [] equal(sk2,sk4).
% 1970490 [] equal(sk1,sk3).
% 1970491 [] neq(sk2,nil).
% 1970492 [] -neq(X,nil) | -segment^p(sk2,X) | -segment^p(sk1,X) | -ss^list(X).
% 1970493 [] ss^list(sk5).
% 1970494 [] ss^list(sk6).
% 1970495 [] equal(app(sk5,sk6),sk4).
% 1970496 [] equal(app(sk6,sk5),sk3).
% 1970574 [input:1970471,factor:binarycut:1970356] segment^p(app(app(X,Y),Z),Y) | -ss^list(Z) | -ss^list(X) | -ss^list(Y).
% 1970582 [input:1970471,factor:factor:factor:factor:factor:factor:factor:factor:binarycut:1970356] segment^p(app(app(X,Y),X),Y) | -ss^list(Y) | -ss^list(X).
% 1971399 [binary:1970492,1970399,cut:1970307] -segment^p(sk1,X) | -segment^p(sk2,X) | equal(X,nil) | -ss^list(X).
% 1971463 [para:1970408.1.1,1970397.1.1,cut:1970311,cut:1970312] -equal(X,nil) | equal(nil,X) | -ss^list(X).
% 1971477 [binary:1970491,1970414,cut:1970307,cut:1970486] -equal(sk2,nil).
% 1971585 [para:1970496.1.1,1970582.1.1.1,cut:1970493,cut:1970494] segment^p(app(sk3,sk6),sk5).
% 1971605 [para:1970490.1.2,1971585.1.1.1] segment^p(app(sk1,sk6),sk5).
% 1971779 [para:1970430.1.1,1970372.1.1,cut:1970307,cut:1970349,binarycut:1970357] equal(X,skaf46(X,nil)) | -ss^list(X).
% 1971781 [para:1970372.1.1,1970430.1.1,cut:1970307,cut:1970349,binarycut:1970357] equal(skaf46(X,nil),X) | -ss^list(X).
% 1971907 [para:1970496.1.1,1970435.1.1,cut:1970493,cut:1970494] -rearseg^p(sk5,X) | rearseg^p(sk3,X) | -ss^list(X).
% 1971967 [binary:1970357,1971907,cut:1970307,cut:1970493] rearseg^p(sk3,nil).
% 1971969 [para:1970490.1.2,1971967.1.1] rearseg^p(sk1,nil).
% 1972058 [para:1970373.1.1,1970442.1.1,cut:1970307] -equal(X,Y) | rearseg^p(Y,X) | -ss^list(Y) | -ss^list(X).
% 1972116 [para:1970444.1.1,1970495.1.1,cut:1970493,cut:1970494] -equal(nil,sk5) | -equal(nil,sk6) | equal(nil,sk4).
% 1973495 [para:1970373.1.1,1970471.1.1.1,cut:1970307,factor:factor:binarycut:1970356] segment^p(app(X,Y),X) | -ss^list(Y) | -ss^list(X).
% 1973920 [para:1970495.1.1,1973495.1.1,cut:1970494,cut:1970493] segment^p(sk4,sk5).
% 1973921 [para:1970496.1.1,1973495.1.1,cut:1970493,cut:1970494] segment^p(sk3,sk6).
% 1973947 [para:1970489.1.2,1973920.1.1] segment^p(sk2,sk5).
% 1973950 [para:1970490.1.2,1973921.1.1] segment^p(sk1,sk6).
% 1973955 [binary:1971399,1973950,cut:1970494] -segment^p(sk2,sk6) | equal(sk6,nil).
% 1976471 [binary:1970490,1972058,cut:1970487,cut:1970485] rearseg^p(sk3,sk1).
% 1976506 [binary:1971779,1972058,cut:1970349] rearseg^p(skaf46(X,nil),X) | -ss^list(X).
% 1976507 [binary:1971781,1972058,cut:1970349] rearseg^p(X,skaf46(X,nil)) | -ss^list(X).
% 1976562 [binary:1970452,1976471,cut:1970487,cut:1970485] -rearseg^p(X,sk3) | rearseg^p(X,sk1) | -ss^list(X).
% 1978093 [binary:1976506,1976562,cut:1970349,cut:1970487] rearseg^p(skaf46(sk3,nil),sk1).
% 1978152 [para:1970490.1.2,1978093.1.1.1] rearseg^p(skaf46(sk1,nil),sk1).
% 1978354 [binary:1970427,1978152,cut:1970485,cut:1970349,binarydemod:1976507,cut:1970485] equal(sk1,skaf46(sk1,nil)).
% 1978364 [para:1978354.1.2,1970430.1.1.1,cut:1971969,cut:1970485,cut:1970307] equal(app(sk1,nil),sk1).
% 1978615 [para:1970495.1.1,1970574.1.1.1,cut:1970493,cut:1970494] segment^p(app(sk4,X),sk6) | -ss^list(X).
% 1978681 [para:1970372.1.1,1978615.1.1,cut:1970307,cut:1970488] segment^p(sk4,sk6).
% 1978687 [para:1970489.1.2,1978681.1.1] segment^p(sk2,sk6).
% 1978692 [binary:1973955,1978687] equal(sk6,nil).
% 1978696 [binary:1971463,1978692,cut:1970494] equal(nil,sk6).
% 1978700 [para:1978692.1.1,1971605.1.1.2,demod:1978364] segment^p(sk1,sk5).
% 1978832 [binary:1971399,1978700,cut:1973947,cut:1970493] equal(sk5,nil).
% 1978915 [para:1978832.1.1,1972116.1.2,cut:1970299,cut:1978696] equal(nil,sk4).
% 1978978 [para:1978915.1.2,1970489.1.2,cut:1971477] 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: 25915
% derived clauses: 2918995
% kept clauses: 767589
% kept size sum: 146292
% kept mid-nuclei: 325121
% kept new demods: 62419
% forw unit-subs: 271652
% forw double-subs: 194960
% forw overdouble-subs: 67881
% backward subs: 309
% fast unit cutoff: 280733
% full unit cutoff: 104
% dbl unit cutoff: 10617
% real runtime : 374.82
% process. runtime: 371.60
% specific non-discr-tree subsumption statistics:
% tried: 11114937
% length fails: 355176
% strength fails: 2075785
% predlist fails: 5598326
% aux str. fails: 222281
% by-lit fails: 334493
% full subs tried: 2344274
% full subs fail: 2265985
%
% ; 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/SWC090-1+eq_r.in")
%
%------------------------------------------------------------------------------