TSTP Solution File: SWC389-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC389-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 : art04.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.6s
% Output : Assurance 69.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/SWC389-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(208,40,3,416,0,3,81849,4,2304,105803,5,2804,105804,1,2805,105804,50,2810,105804,40,2810,106012,0,2810,196349,3,4213,221874,4,4911,238662,5,5611,238664,1,5612,238664,50,5615,238664,40,5615,238872,0,5615,275194,3,6166,286710,4,6441,304637,5,6716,304637,5,6717,304637,1,6717,304637,50,6718,304637,40,6718,304845,0,6718)
%
%
% START OF PROOF
% 274223 [?] ?
% 274234 [?] ?
% 304717 [] -equal(nil,X) | segment^p(nil,X) | -ss^list(X).
% 304754 [] -equal(cons(X,nil),Y) | -ss^item(X) | -ss^list(Y) | singleton^p(Y).
% 304811 [] -equal(app(app(X,Y),Z),U) | segment^p(U,Y) | -ss^list(U) | -ss^list(Y) | -ss^list(Z) | -ss^list(X).
% 304824 [] ss^list(sk1).
% 304826 [] ss^list(sk3).
% 304827 [] ss^list(sk4).
% 304828 [] equal(sk2,sk4).
% 304829 [] equal(sk1,sk3).
% 304831 [] equal(nil,sk3) | ss^item(sk5).
% 304838 [] equal(nil,sk3) | ss^list(sk6).
% 304839 [] equal(nil,sk3) | ss^list(sk7).
% 304840 [] equal(cons(sk5,nil),sk3) | equal(nil,sk3).
% 304841 [] equal(app(app(sk6,sk3),sk7),sk4) | equal(nil,sk3).
% 304845 [] -segment^p(sk2,sk1) | -singleton^p(sk1).
% 305177 [para:304831.1.2,304829.1.2,cut:274223] ss^item(sk5).
% 305188 [para:304838.1.2,304829.1.2,cut:274223] ss^list(sk6).
% 305216 [para:304839.1.2,304829.1.2,cut:274223] ss^list(sk7).
% 305220 [para:304840.2.2,304829.1.2,cut:274223] equal(cons(sk5,nil),sk3).
% 305853 [binary:304826,304717.3,cut:274234] -equal(nil,sk3).
% 310288 [binary:304754,305220,cut:305177,cut:304826] singleton^p(sk3).
% 310424 [para:304829.1.2,310288.1.1] singleton^p(sk1).
% 310425 [binary:304845.2,310424] -segment^p(sk2,sk1).
% 332196 [para:304829.1.2,304841.1.1.1.2,cut:305853] equal(app(app(sk6,sk1),sk7),sk4).
% 332225 [binary:304811,332196,cut:304827,cut:304824,cut:305216,cut:305188] segment^p(sk4,sk1).
% 332254 [para:304828.1.2,332225.1.1,cut:310425] 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: 3636
% derived clauses: 526090
% kept clauses: 221750
% kept size sum: 0
% kept mid-nuclei: 53363
% kept new demods: 26677
% forw unit-subs: 43272
% forw double-subs: 37270
% forw overdouble-subs: 11029
% backward subs: 438
% fast unit cutoff: 39108
% full unit cutoff: 0
% dbl unit cutoff: 858
% real runtime : 70.67
% process. runtime: 70.18
% specific non-discr-tree subsumption statistics:
% tried: 2168662
% length fails: 32198
% strength fails: 253230
% predlist fails: 1396375
% aux str. fails: 83402
% by-lit fails: 50652
% full subs tried: 292334
% full subs fail: 280559
%
% ; 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/SWC389-1+eq_r.in")
%
%------------------------------------------------------------------------------