TSTP Solution File: SWC323-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC323-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 : art06.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 69.5s
% Output : Assurance 69.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/SWC323-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,1,396,0,1,53422,4,2194,55352,5,2802,55352,1,2802,55352,50,2805,55352,40,2805,55550,0,2805,138562,3,4243,180177,4,4909,204908,5,5606,204908,5,5608,204908,1,5608,204908,50,5612,204908,40,5612,205106,0,5612,248122,3,6176,264703,4,6439,277999,5,6715,278000,5,6716,278000,1,6716,278000,50,6719,278000,40,6719,278198,0,6719)
%
%
% START OF PROOF
% 212289 [?] ?
% 278009 [] ss^list(nil).
% 278058 [] segment^p(X,X) | -ss^list(X).
% 278087 [] ss^list(cons(X,Y)) | -ss^item(X) | -ss^list(Y).
% 278128 [] -segment^p(X,Y) | -segment^p(Y,X) | equal(Y,X) | -ss^list(Y) | -ss^list(X).
% 278187 [] ss^list(sk1).
% 278188 [] ss^list(sk2).
% 278189 [] ss^list(sk3).
% 278190 [] ss^list(sk4).
% 278191 [] equal(sk2,sk4).
% 278192 [] equal(sk1,sk3).
% 278193 [] -equal(app(X,Y),sk2) | -equal(app(Y,X),sk1) | -ss^list(X) | -ss^list(Y).
% 278195 [] -neq(sk4,nil) | ss^item(sk5).
% 278196 [] -neq(sk4,nil) | ss^list(sk6).
% 278197 [] equal(app(cons(sk5,nil),sk6),sk4) | -neq(sk4,nil).
% 278198 [] equal(app(sk6,cons(sk5,nil)),sk3) | -neq(sk4,nil).
% 278543 [para:278191.1.2,278195.1.1,cut:212289] ss^item(sk5).
% 278545 [para:278191.1.2,278196.1.1,cut:212289] ss^list(sk6).
% 278557 [para:278191.1.2,278197.2.1,cut:212289] equal(app(cons(sk5,nil),sk6),sk4).
% 278570 [para:278191.1.2,278198.2.1,cut:212289] equal(app(sk6,cons(sk5,nil)),sk3).
% 278676 [binary:278189,278058.2] segment^p(sk3,sk3).
% 278677 [binary:278190,278058.2] segment^p(sk4,sk4).
% 278742 [para:278192.1.2,278676.1.1] segment^p(sk1,sk3).
% 278743 [para:278192.1.2,278676.1.2] segment^p(sk3,sk1).
% 278779 [para:278191.1.2,278677.1.1] segment^p(sk2,sk4).
% 278780 [para:278191.1.2,278677.1.2] segment^p(sk4,sk2).
% 279878 [binary:278543,278087.2] ss^list(cons(sk5,X)) | -ss^list(X).
% 283196 [binary:278742,278128,cut:278743,cut:278189,cut:278187] equal(sk3,sk1).
% 283197 [binary:278779,278128,cut:278780,cut:278190,cut:278188] equal(sk4,sk2).
% 304960 [para:278557.1.1,278193.1.1,demod:278570,cut:283197,cut:283196,cut:278545,binarydemod:279878,cut:278009] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using double strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 17
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 3617
% derived clauses: 438568
% kept clauses: 198502
% kept size sum: 0
% kept mid-nuclei: 52584
% kept new demods: 34173
% forw unit-subs: 45196
% forw double-subs: 11512
% forw overdouble-subs: 9138
% backward subs: 101
% fast unit cutoff: 42745
% full unit cutoff: 0
% dbl unit cutoff: 888
% real runtime : 70.31
% process. runtime: 69.81
% specific non-discr-tree subsumption statistics:
% tried: 2593971
% length fails: 34471
% strength fails: 241586
% predlist fails: 1812590
% aux str. fails: 82541
% by-lit fails: 61548
% full subs tried: 298594
% full subs fail: 288468
%
% ; 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/SWC323-1+eq_r.in")
%
%------------------------------------------------------------------------------