TSTP Solution File: SWC229-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC229-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 368.4s
% Output : Assurance 368.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/SWC229-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(200,40,1,400,0,2,52309,4,2176,55898,5,2806,55899,1,2806,55899,50,2809,55899,40,2809,56099,0,2809,141130,3,4210,178833,4,4913,203990,5,5610,203991,5,5612,203991,1,5612,203991,50,5615,203991,40,5615,204191,0,5616,249243,3,6167,263888,4,6442,276654,5,6717,276654,5,6718,276654,1,6718,276654,50,6720,276654,40,6720,276854,0,6721,345530,3,7572,357098,4,7997,377847,5,8422,377848,5,8423,377849,1,8423,377849,50,8425,377849,40,8425,378049,0,8425,442389,3,9281,462907,4,9701,473688,5,10126,473689,5,10128,473690,1,10128,473690,50,10131,473690,40,10131,473890,0,10131,718658,3,14483,780994,4,16665,836283,5,18832,836283,5,18834,836284,1,18834,836284,50,18837,836284,40,18837,836484,0,18837,880253,3,20238,881542,4,20938,889424,5,21638,889425,5,21638,889425,1,21638,889425,50,21639,889425,40,21639,889625,0,21640,1129090,3,24541,1214885,4,25992,1271746,1,27441,1271746,50,27447,1271746,40,27447,1271946,0,27478,1430787,3,28880,1461930,4,29579,1506773,5,30279,1506773,5,30281,1506774,1,30281,1506774,50,30287,1506774,40,30287,1506974,0,30324,1556929,3,30880,1572855,4,31151,1618444,5,31425,1618444,1,31425,1618444,50,31430,1618444,40,31430,1618644,0,31430,1664078,3,32832,1665316,4,33531,1672423,5,34231,1672424,1,34231,1672424,50,34232,1672424,40,34232,1672624,0,34232,1773289,3,35634,1823324,4,36334,1847504,5,37036,1847504,5,37037,1847505,1,37037,1847505,50,37039,1847505,40,37039,1847705,0,37040)
%
%
% START OF PROOF
% 1847506 [] equal(X,X).
% 1847514 [] ss^list(nil).
% 1847553 [] ss^item(skaf44(X)).
% 1847577 [] -member^p(nil,X) | -ss^item(X).
% 1847579 [] equal(app(X,nil),X) | -ss^list(X).
% 1847580 [] equal(app(nil,X),X) | -ss^list(X).
% 1847586 [] -segment^p(nil,X) | equal(nil,X) | -ss^list(X).
% 1847592 [] ss^list(cons(X,Y)) | -ss^item(X) | -ss^list(Y).
% 1847606 [] neq(X,Y) | equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 1847607 [] equal(cons(skaf44(X),nil),X) | -singleton^p(X) | -ss^list(X).
% 1847692 [] ss^list(sk1).
% 1847695 [] ss^list(sk4).
% 1847697 [] equal(sk1,sk3).
% 1847698 [] segment^p(sk4,sk3).
% 1847699 [] -equal(nil,sk1).
% 1847700 [] -equal(app(app(X,cons(Y,nil)),Z),sk1) | ss^item(sk5(Z,X,Y)) | -ss^item(Y) | -ss^list(Z) | -ss^list(X).
% 1847702 [] -equal(app(app(X,cons(Y,nil)),Z),sk1) | member^p(Z,sk5(Z,X,Y)) | -ss^item(Y) | -ss^list(Z) | -ss^list(X).
% 1847705 [] -neq(sk4,nil) | singleton^p(sk3).
% 1848478 [para:1847697.1.2,1847698.1.2] segment^p(sk4,sk1).
% 1848585 [para:1847580.1.1,1847700.1.1.1,cut:1847514] -equal(app(cons(X,nil),Y),sk1) | ss^item(sk5(Y,nil,X)) | -ss^list(cons(X,nil)) | -ss^item(X) | -ss^list(Y).
% 1848589 [para:1847580.1.1,1847702.1.1.1,cut:1847514] -equal(app(cons(X,nil),Y),sk1) | member^p(Y,sk5(Y,nil,X)) | -ss^list(cons(X,nil)) | -ss^item(X) | -ss^list(Y).
% 1848602 [para:1847579.1.1,1848585.1.1,cut:1847514] -equal(cons(X,nil),sk1) | ss^item(sk5(nil,nil,X)) | -ss^list(cons(X,nil)) | -ss^item(X).
% 1848637 [para:1847579.1.1,1848589.1.1,cut:1847514] member^p(nil,sk5(nil,nil,X)) | -equal(cons(X,nil),sk1) | -ss^list(cons(X,nil)) | -ss^item(X).
% 1848656 [binary:1847577,1848637] -ss^item(sk5(nil,nil,X)) | -equal(cons(X,nil),sk1) | -ss^list(cons(X,nil)) | -ss^item(X).
% 1848658 [binary:1847705,1847606,cut:1847514,cut:1847695] equal(sk4,nil) | singleton^p(sk3).
% 1848662 [para:1848658.1.1,1848478.1.1] segment^p(nil,sk1) | singleton^p(sk3).
% 1848668 [binary:1847586,1848662,cut:1847699,cut:1847692] singleton^p(sk3).
% 1848669 [para:1847697.1.2,1848668.1.1] singleton^p(sk1).
% 1848698 [binary:1848602,1847607,cut:1848669,cut:1847692,cut:1847553] ss^item(sk5(nil,nil,skaf44(sk1))) | -ss^list(cons(skaf44(sk1),nil)).
% 1848752 [binary:1848698,1848656,cut:1847553] -equal(cons(skaf44(sk1),nil),sk1) | -ss^list(cons(skaf44(sk1),nil)).
% 1848774 [para:1847607.1.1,1848752.1.1,cut:1847506,cut:1848669,cut:1847692] -ss^list(cons(skaf44(sk1),nil)).
% 1848776 [binary:1847592,1848774,cut:1847553,cut:1847514] 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: 25328
% derived clauses: 2457115
% kept clauses: 741179
% kept size sum: 6225
% kept mid-nuclei: 300291
% kept new demods: 73021
% forw unit-subs: 223615
% forw double-subs: 91083
% forw overdouble-subs: 66634
% backward subs: 631
% fast unit cutoff: 243808
% full unit cutoff: 80
% dbl unit cutoff: 9773
% real runtime : 372.58
% process. runtime: 370.44
% specific non-discr-tree subsumption statistics:
% tried: 12984154
% length fails: 296805
% strength fails: 2457421
% predlist fails: 6134226
% aux str. fails: 208087
% by-lit fails: 314673
% full subs tried: 3424727
% full subs fail: 3335482
%
% ; 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/SWC229-1+eq_r.in")
%
%------------------------------------------------------------------------------