TSTP Solution File: SWC046-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC046-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 60.0s
% Output : Assurance 60.0s
% 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/SWC046-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,51026,4,2193,54579,63,2803,54579,1,2803,54579,50,2806,54579,40,2806,54777,0,2806,119192,3,4207,151488,4,4909,179291,5,5607,179291,5,5609,179291,1,5609,179291,50,5613,179291,40,5613,179489,0,5613,214885,3,6165,229218,4,6443)
%
%
% START OF PROOF
% 179300 [] ss^list(nil).
% 179304 [] ss^item(skaf83(X)).
% 179305 [] ss^list(skaf82(X)).
% 179348 [] segment^p(X,nil) | -ss^list(X).
% 179349 [] segment^p(X,X) | -ss^list(X).
% 179351 [] rearseg^p(X,X) | -ss^list(X).
% 179363 [] -member^p(nil,X) | -ss^item(X).
% 179366 [] equal(app(nil,X),X) | -ss^list(X).
% 179371 [] -equal(nil,X) | segment^p(nil,X) | -ss^list(X).
% 179372 [] -segment^p(nil,X) | equal(nil,X) | -ss^list(X).
% 179374 [] -rearseg^p(nil,X) | equal(nil,X) | -ss^list(X).
% 179377 [] ss^list(app(X,Y)) | -ss^list(X) | -ss^list(Y).
% 179401 [] equal(cons(skaf83(X),skaf82(X)),X) | equal(nil,X) | -ss^list(X).
% 179410 [] -equal(app(X,Y),nil) | equal(nil,X) | -ss^list(X) | -ss^list(Y).
% 179419 [] -segment^p(X,Y) | -segment^p(Y,X) | equal(Y,X) | -ss^list(Y) | -ss^list(X).
% 179428 [] rearseg^p(app(X,Y),Z) | -rearseg^p(Y,Z) | -ss^list(Y) | -ss^list(Z) | -ss^list(X).
% 179437 [] equal(app(X,Y),nil) | -equal(nil,X) | -equal(nil,Y) | -ss^list(X) | -ss^list(Y).
% 179450 [] -member^p(app(X,Y),Z) | member^p(Y,Z) | member^p(X,Z) | -ss^item(Z) | -ss^list(Y) | -ss^list(X).
% 179467 [] -equal(app(X,cons(Y,Z)),U) | member^p(U,Y) | -ss^item(Y) | -ss^list(U) | -ss^list(Z) | -ss^list(X).
% 179478 [] ss^list(sk1).
% 179480 [] ss^list(sk3).
% 179481 [] ss^list(sk4).
% 179482 [] equal(nil,sk2).
% 179483 [] equal(sk2,sk4).
% 179484 [] equal(sk1,sk3).
% 179485 [] -equal(nil,sk1).
% 179488 [] -member^p(sk3,X) | member^p(sk4,X) | -ss^item(X).
% 179490 [input:179377,factor] ss^list(app(X,X)) | -ss^list(X).
% 179505 [input:179410,factor] -equal(app(X,X),nil) | equal(nil,X) | -ss^list(X).
% 179515 [input:179428,factor:factor] rearseg^p(app(X,X),Y) | -rearseg^p(X,Y) | -ss^list(X) | -ss^list(Y).
% 179561 [input:179450,factor] -member^p(app(X,X),Y) | member^p(X,Y) | -ss^item(Y) | -ss^list(X).
% 180405 [binary:179481,179349.2] segment^p(sk4,sk4).
% 180505 [para:179483.1.2,180405.1.1] segment^p(sk2,sk4).
% 180510 [binary:179480,179351.2] rearseg^p(sk3,sk3).
% 180607 [para:179482.1.2,180505.1.1] segment^p(nil,sk4).
% 180628 [para:179484.1.2,180510.1.2] rearseg^p(sk3,sk1).
% 181016 [binary:179481,179372.3,cut:180607] equal(nil,sk4).
% 181139 [para:181016.1.2,179488.2.1,binarycut:179363] -member^p(sk3,X) | -ss^item(X).
% 181182 [binary:179478,179374.3,cut:179485] -rearseg^p(nil,sk1).
% 183124 [binary:179304,181139.2] -member^p(sk3,skaf83(X)).
% 191788 [para:179366.1.1,179467.1.1,cut:179300] -equal(cons(X,Y),Z) | -ss^list(cons(X,Y)) | member^p(Z,X) | -ss^item(X) | -ss^list(Y) | -ss^list(Z).
% 194738 [binary:179480,179490.2] ss^list(app(sk3,sk3)).
% 195821 [binary:179348.2,194738] segment^p(app(sk3,sk3),nil).
% 197787 [binary:180628,179515.2,cut:179480,cut:179478] rearseg^p(app(sk3,sk3),sk1).
% 201264 [binary:183124,179561.2,cut:179304,cut:179480] -member^p(app(sk3,sk3),skaf83(X)).
% 206347 [para:179437.1.1,197787.1.1,cut:181182,cut:179480] -equal(nil,sk3).
% 206510 [binary:179505.2,206347,cut:179480] -equal(app(sk3,sk3),nil).
% 212148 [binary:179419.3,206510,cut:195821,cut:194738,cut:179300] -segment^p(nil,app(sk3,sk3)).
% 214367 [binary:179371.2,212148,cut:194738] -equal(nil,app(sk3,sk3)).
% 215275 [binary:179401.2,214367,cut:194738] equal(cons(skaf83(app(sk3,sk3)),skaf82(app(sk3,sk3))),app(sk3,sk3)).
% 242658 [binary:215275,191788,demod:215275,cut:201264,cut:179304,cut:179305,cut:194738] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using unit paramodulation strategy
% using unit strategy
% using double strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% clause length limited to 19
% clause depth limited to 5
% seconds given: 11
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 3072
% derived clauses: 370740
% kept clauses: 164010
% kept size sum: 789677
% kept mid-nuclei: 55209
% kept new demods: 32485
% forw unit-subs: 47855
% forw double-subs: 17520
% forw overdouble-subs: 10663
% backward subs: 59
% fast unit cutoff: 60093
% full unit cutoff: 0
% dbl unit cutoff: 1138
% real runtime : 66.40
% process. runtime: 66.34
% specific non-discr-tree subsumption statistics:
% tried: 1864884
% length fails: 29607
% strength fails: 273674
% predlist fails: 1168686
% aux str. fails: 61829
% by-lit fails: 58883
% full subs tried: 221516
% full subs fail: 210163
%
% ; 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/SWC046-1+eq_r.in")
%
%------------------------------------------------------------------------------