TSTP Solution File: SWC014-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC014-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 49.5s
% Output : Assurance 49.5s
% 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/SWC014-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,55103,4,2227,56941,5,2803,56942,1,2803,56942,50,2805,56942,40,2805,57146,0,2805,134941,3,4207,168788,4,4915)
%
%
% START OF PROOF
% 56943 [] equal(X,X).
% 56951 [] ss^list(nil).
% 56999 [] segment^p(X,nil) | -ss^list(X).
% 57017 [] equal(app(nil,X),X) | -ss^list(X).
% 57022 [] -equal(nil,X) | segment^p(nil,X) | -ss^list(X).
% 57025 [] -rearseg^p(nil,X) | equal(nil,X) | -ss^list(X).
% 57039 [] equal(tl(cons(X,Y)),Y) | -ss^item(X) | -ss^list(Y).
% 57041 [] -equal(cons(X,Y),nil) | -ss^item(X) | -ss^list(Y).
% 57043 [] neq(X,Y) | equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 57058 [] -neq(X,Y) | -equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 57070 [] -segment^p(X,Y) | -segment^p(Y,X) | equal(Y,X) | -ss^list(Y) | -ss^list(X).
% 57076 [] equal(tl(app(X,Y)),app(tl(X),Y)) | equal(nil,X) | -ss^list(Y) | -ss^list(X).
% 57086 [] -equal(app(X,Y),Z) | rearseg^p(Z,Y) | -ss^list(Z) | -ss^list(Y) | -ss^list(X).
% 57130 [] ss^list(sk2).
% 57131 [] ss^list(sk3).
% 57132 [] ss^list(sk4).
% 57133 [] equal(sk2,sk4).
% 57134 [] equal(sk1,sk3).
% 57135 [] neq(sk2,nil).
% 57142 [] -neq(nil,sk2) | -neq(sk4,nil) | -equal(app(sk1,X),Y) | -equal(tl(sk2),X) | -equal(sk2,Y) | -ss^list(X) | -ss^list(Y).
% 57143 [] -neq(sk4,nil) | ss^item(sk5).
% 57144 [] -neq(sk4,nil) | ss^list(sk6).
% 57145 [] equal(cons(sk5,nil),sk3) | -neq(sk4,nil).
% 57146 [] equal(app(cons(sk5,nil),sk6),sk4) | -neq(sk4,nil).
% 57161 [input:57058,factor:cut:56943] -neq(X,X) | -ss^list(X).
% 57188 [input:57086,factor:factor] -equal(app(X,Y),X) | rearseg^p(X,Y) | -ss^list(X) | -ss^list(Y).
% 57915 [para:57133.1.2,57143.1.1,cut:57135] ss^item(sk5).
% 57920 [binary:57130,57142.7,cut:56943] -neq(sk4,nil) | -neq(nil,sk2) | -equal(app(sk1,X),sk2) | -equal(tl(sk2),X) | -ss^list(X).
% 57949 [para:57133.1.2,57144.1.1,cut:57135] ss^list(sk6).
% 57951 [para:57133.1.2,57145.2.1,cut:57135] equal(cons(sk5,nil),sk3).
% 57953 [para:57133.1.2,57146.2.1,demod:57951,cut:57135] equal(app(sk3,sk6),sk4).
% 57954 [para:57134.1.2,57953.1.1.1] equal(app(sk1,sk6),sk4).
% 57976 [binary:57130,56999.2] segment^p(sk2,nil).
% 57977 [binary:57131,56999.2] segment^p(sk3,nil).
% 58454 [binary:57132,57017.2] equal(app(nil,sk4),sk4).
% 58464 [binary:57949,57017.2] equal(app(nil,sk6),sk6).
% 58489 [binary:57132,57022.3] -equal(nil,sk4) | segment^p(nil,sk4).
% 59495 [binary:57132,57161.2] -neq(sk4,sk4).
% 59557 [para:57951.1.1,57039.1.1.1,cut:57915,cut:56951] equal(tl(sk3),nil).
% 59581 [para:57133.1.2,59495.1.2] -neq(sk4,sk2).
% 59673 [para:57951.1.1,57041.1.1,cut:57915,cut:56951] -equal(sk3,nil).
% 59823 [binary:59581,57043,cut:57130,cut:57132] equal(sk4,sk2).
% 60958 [binary:57135,57058,cut:56951,cut:57130] -equal(sk2,nil).
% 62401 [binary:57976,57070.2,cut:60958,cut:57130,cut:56951] -segment^p(nil,sk2).
% 62402 [binary:57977,57070.2,cut:59673,cut:57131,cut:56951] -segment^p(nil,sk3).
% 62461 [binary:57022.2,62401,cut:57130] -equal(nil,sk2).
% 62470 [binary:57022.2,62402,cut:57131] -equal(nil,sk3).
% 62499 [binary:57043.2,62461,cut:57130,cut:56951] neq(nil,sk2).
% 63354 [para:57953.1.1,57076.1.1.1,demod:58464,59557,cut:62470,cut:57949,cut:57131] equal(tl(sk4),sk6).
% 63548 [para:57133.1.2,63354.1.1.1] equal(tl(sk2),sk6).
% 70088 [para:57133.1.2,58489.2.2,cut:62401] -equal(nil,sk4).
% 70403 [binary:57025.2,70088,cut:57132] -rearseg^p(nil,sk4).
% 80077 [para:58454.1.1,57188.1.1,cut:70403,cut:56951,cut:57132] -equal(sk4,nil).
% 80150 [binary:57043.2,80077,cut:56951,cut:57132] neq(sk4,nil).
% 175779 [binary:63548,57920.4,demod:57954,cut:59823,cut:62499,cut:80150,cut:57949] 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 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
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 1615
% derived clauses: 239686
% kept clauses: 118866
% kept size sum: 0
% kept mid-nuclei: 21817
% kept new demods: 33106
% forw unit-subs: 11762
% forw double-subs: 2949
% forw overdouble-subs: 3766
% backward subs: 30
% fast unit cutoff: 15519
% full unit cutoff: 0
% dbl unit cutoff: 309
% real runtime : 50.70
% process. runtime: 50.13
% specific non-discr-tree subsumption statistics:
% tried: 1235339
% length fails: 15528
% strength fails: 119421
% predlist fails: 864063
% aux str. fails: 39661
% by-lit fails: 37309
% full subs tried: 137392
% full subs fail: 133399
%
% ; 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/SWC014-1+eq_r.in")
%
%------------------------------------------------------------------------------