TSTP Solution File: SWC167-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC167-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 : art08.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 89.6s
% Output : Assurance 89.6s
% 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/SWC167-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(203,40,1,417,0,2,52214,4,2182,54158,5,2805,54158,1,2805,54158,50,2808,54158,40,2808,54372,0,2808,141402,3,4224,182223,4,4909,200763,5,5609,200765,1,5611,200765,50,5615,200765,40,5615,200979,0,5615,247039,3,6166,260698,4,6443,271348,5,6716,271349,5,6717,271350,1,6717,271350,50,6719,271350,40,6719,271564,0,6720,330325,3,7572,345561,4,7996,363140,62,8421,363141,5,8422,363142,1,8422,363142,50,8424,363142,40,8424,363356,0,8424,437431,3,9276,462903,4,9717)
%
%
% START OF PROOF
% 363151 [] ss^list(nil).
% 363228 [] ss^list(app(X,Y)) | -ss^list(X) | -ss^list(Y).
% 363229 [] ss^list(cons(X,Y)) | -ss^item(X) | -ss^list(Y).
% 363245 [] neq(X,Y) | equal(X,Y) | -ss^item(Y) | -ss^item(X).
% 363254 [] -lt(X,Y) | -equal(X,Y) | -ss^item(Y) | -ss^item(X).
% 363263 [] equal(app(cons(X,nil),Y),cons(X,Y)) | -ss^item(X) | -ss^list(Y).
% 363292 [] equal(app(app(X,Y),Z),app(X,app(Y,Z))) | -ss^list(X) | -ss^list(Z) | -ss^list(Y).
% 363324 [] -equal(app(app(X,cons(Y,Z)),cons(U,V)),W) | lt(Y,U) | -ss^item(U) | -ss^item(Y) | -ss^list(W) | -ss^list(Z) | -ss^list(X) | -ss^list(V) | -strictordered^p(W).
% 363330 [] -neq(sk6,sk7).
% 363331 [] equal(app(app(app(sk8,cons(sk6,nil)),cons(sk7,nil)),sk9),sk1).
% 363332 [] ss^list(sk9).
% 363333 [] ss^list(sk8).
% 363334 [] ss^item(sk7).
% 363335 [] ss^item(sk6).
% 363337 [] strictordered^p(sk3).
% 363340 [] equal(sk1,sk3).
% 363345 [] ss^list(sk1).
% 363408 [binary:363263.3,363332] equal(app(cons(X,nil),sk9),cons(X,sk9)) | -ss^item(X).
% 363449 [binary:363292.3,363332] equal(app(app(X,Y),sk9),app(X,app(Y,sk9))) | -ss^list(Y) | -ss^list(X).
% 363550 [binary:363228.2,363333] ss^list(app(sk8,X)) | -ss^list(X).
% 363716 [binary:363229.2,363334] ss^list(cons(sk7,X)) | -ss^list(X).
% 363816 [binary:363229.2,363335] ss^list(cons(sk6,X)) | -ss^list(X).
% 364762 [binary:363245,363330,cut:363334,cut:363335] equal(sk6,sk7).
% 364767 [para:363340.1.2,363337.1.1] strictordered^p(sk1).
% 366361 [binary:363254.2,364762,cut:363334,cut:363335] -lt(sk6,sk7).
% 385044 [binary:363334,363408.2] equal(app(cons(sk7,nil),sk9),cons(sk7,sk9)).
% 400060 [para:363449.1.1,363331.1.1,demod:385044,binarydemod:363716,363816,363550,cut:363151] equal(app(app(sk8,cons(sk6,nil)),cons(sk7,sk9)),sk1).
% 465876 [binary:400060,363324,cut:366361,cut:363334,cut:363335,cut:363345,cut:363151,cut:363333,cut:363332,cut:364767] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% 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
% seconds given: 17
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 5030
% derived clauses: 665048
% kept clauses: 308911
% kept size sum: 0
% kept mid-nuclei: 63520
% kept new demods: 34658
% forw unit-subs: 64161
% forw double-subs: 18745
% forw overdouble-subs: 13139
% backward subs: 74
% fast unit cutoff: 53471
% full unit cutoff: 0
% dbl unit cutoff: 1476
% real runtime : 98.5
% process. runtime: 97.54
% specific non-discr-tree subsumption statistics:
% tried: 4340208
% length fails: 12740
% strength fails: 564938
% predlist fails: 2979094
% aux str. fails: 119742
% by-lit fails: 80494
% full subs tried: 507674
% full subs fail: 493445
%
% ; 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/SWC167-1+eq_r.in")
%
%------------------------------------------------------------------------------