TSTP Solution File: SWC415-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC415-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 209.1s
% Output : Assurance 209.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/SWC415-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,3,396,0,3,53405,4,2222,55305,5,2806,55306,1,2806,55306,50,2808,55306,40,2808,55504,0,2808,138733,3,4218,170239,4,4912,192372,5,5609,192373,5,5610,192374,1,5610,192374,50,5614,192374,40,5614,192572,0,5614,234067,3,6165,251152,4,6440,265137,5,6715,265138,5,6716,265138,1,6716,265138,50,6719,265138,40,6719,265336,0,6719,325015,3,7571,336440,4,7995,350555,5,8420,350557,5,8421,350558,1,8421,350558,50,8424,350558,40,8424,350756,0,8424,428865,3,9278,452340,4,9700,471173,5,10125,471173,5,10126,471174,1,10126,471174,50,10129,471174,40,10129,471372,0,10129,763253,3,14481,866358,4,16658,944459,5,18830,944460,1,18830,944460,50,18833,944460,40,18833,944658,0,18833,987166,3,20234,989906,4,20934)
%
%
% START OF PROOF
% 944469 [] ss^list(nil).
% 944473 [] ss^item(skaf83(X)).
% 944474 [] ss^list(skaf82(X)).
% 944517 [] segment^p(X,nil) | -ss^list(X).
% 944540 [] -equal(nil,X) | segment^p(nil,X) | -ss^list(X).
% 944557 [] equal(tl(cons(X,Y)),Y) | -ss^item(X) | -ss^list(Y).
% 944561 [] neq(X,Y) | equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 944570 [] equal(cons(skaf83(X),skaf82(X)),X) | equal(nil,X) | -ss^list(X).
% 944576 [] -neq(X,Y) | -equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 944588 [] -segment^p(X,Y) | -segment^p(Y,X) | equal(Y,X) | -ss^list(Y) | -ss^list(X).
% 944648 [] ss^list(sk2).
% 944649 [] ss^list(sk3).
% 944650 [] ss^list(sk4).
% 944651 [] equal(sk2,sk4).
% 944652 [] equal(sk1,sk3).
% 944653 [] neq(sk2,nil).
% 944657 [] -neq(nil,sk4) | -neq(sk4,nil) | -equal(tl(sk4),X) | equal(sk3,X) | -ss^list(X).
% 944658 [] -neq(nil,sk2) | -neq(sk4,nil) | -equal(tl(sk2),X) | -equal(sk1,X) | -ss^list(X).
% 945430 [para:944651.1.2,944657.2.1,cut:944653] -neq(nil,sk4) | -equal(tl(sk4),X) | equal(sk3,X) | -ss^list(X).
% 945549 [binary:944648,944517.2] segment^p(sk2,nil).
% 945863 [binary:944650,944540.3] -equal(nil,sk4) | segment^p(nil,sk4).
% 947059 [para:944570.1.1,944557.1.1.1,cut:944473,cut:944474] equal(tl(X),skaf82(X)) | equal(nil,X) | -ss^list(X).
% 947194 [binary:944653,944576,cut:944469,cut:944648] -equal(sk2,nil).
% 948148 [binary:945549,944588.2,cut:947194,cut:944648,cut:944469] -segment^p(nil,sk2).
% 948201 [binary:944540.2,948148,cut:944648] -equal(nil,sk2).
% 948210 [binary:944561.2,948201,cut:944648,cut:944469] neq(nil,sk2).
% 948861 [para:944651.1.2,945863.2.2,cut:948148] -equal(nil,sk4).
% 948876 [binary:944561.2,948861,cut:944650,cut:944469] neq(nil,sk4).
% 982280 [para:944651.1.2,945430.2.1.1,cut:948876] -equal(tl(sk2),X) | equal(sk3,X) | -ss^list(X).
% 984345 [para:944651.1.2,944658.2.1,cut:944653,cut:948210] -equal(tl(sk2),X) | -equal(sk1,X) | -ss^list(X).
% 984348 [binary:944649,984345.3,cut:944652] -equal(tl(sk2),sk3).
% 984436 [para:982280.2.1,984348.1.2] -equal(tl(sk2),X) | -ss^list(X).
% 984441 [binary:944474,984436.2] -equal(tl(sk2),skaf82(X)).
% 989923 [binary:984441,947059,cut:948201,cut:944648] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using term-depth-order strategy
% not using sos strategy
% using unit paramodulation strategy
% using unit 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: 28
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 9798
% derived clauses: 1736500
% kept clauses: 427004
% kept size sum: 741144
% kept mid-nuclei: 160165
% kept new demods: 36357
% forw unit-subs: 132690
% forw double-subs: 52558
% forw overdouble-subs: 37282
% backward subs: 257
% fast unit cutoff: 162615
% full unit cutoff: 96
% dbl unit cutoff: 8156
% real runtime : 210.61
% process. runtime: 209.51
% specific non-discr-tree subsumption statistics:
% tried: 8077374
% length fails: 155585
% strength fails: 1188696
% predlist fails: 4684260
% aux str. fails: 219184
% by-lit fails: 210397
% full subs tried: 1497095
% full subs fail: 1450575
%
% ; 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/SWC415-1+eq_r.in")
%
%------------------------------------------------------------------------------