TSTP Solution File: SWC182-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC182-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 20.0s
% Output : Assurance 20.0s
% 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/SWC182-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)
%
%
% SOS clause
% member^p(sk6,sk5) | member^p(sk7,sk5).
% was split for some strategies as:
% member^p(sk6,sk5).
% member^p(sk7,sk5).
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(198,40,0,396,0,1,35282,4,1112,36603,5,1303,36604,1,1304,36604,50,1305,36604,40,1305,36802,0,1316,71863,3,1967)
%
%
% START OF PROOF
% 1736 [?] ?
% 2101 [?] ?
% 36613 [] ss^list(nil).
% 36665 [] frontseg^p(X,nil) | -ss^list(X).
% 36666 [] frontseg^p(X,X) | -ss^list(X).
% 36676 [] -member^p(nil,X) | -ss^item(X).
% 36678 [] equal(app(X,nil),X) | -ss^list(X).
% 36685 [] -segment^p(nil,X) | equal(nil,X) | -ss^list(X).
% 36688 [] -equal(nil,X) | frontseg^p(nil,X) | -ss^list(X).
% 36690 [] ss^list(app(X,Y)) | -ss^list(X) | -ss^list(Y).
% 36691 [] ss^list(cons(X,Y)) | -ss^item(X) | -ss^list(Y).
% 36723 [] -equal(app(X,Y),nil) | equal(nil,X) | -ss^list(X) | -ss^list(Y).
% 36724 [] -equal(app(X,Y),nil) | equal(nil,Y) | -ss^list(X) | -ss^list(Y).
% 36734 [] -frontseg^p(X,Y) | -frontseg^p(Y,X) | equal(Y,X) | -ss^list(Y) | -ss^list(X).
% 36742 [] frontseg^p(app(X,Y),Z) | -frontseg^p(X,Z) | -ss^list(X) | -ss^list(Z) | -ss^list(Y).
% 36745 [] member^p(app(X,Y),Z) | -member^p(X,Z) | -ss^item(Z) | -ss^list(X) | -ss^list(Y).
% 36750 [] equal(app(X,Y),nil) | -equal(nil,X) | -equal(nil,Y) | -ss^list(X) | -ss^list(Y).
% 36759 [] -frontseg^p(Y,Z) | -frontseg^p(X,Y) | frontseg^p(X,Z) | -ss^list(X) | -ss^list(Y) | -ss^list(Z).
% 36778 [] -equal(app(app(X,Y),Z),U) | segment^p(U,Y) | -ss^list(U) | -ss^list(Y) | -ss^list(Z) | -ss^list(X).
% 36791 [] ss^list(sk1).
% 36795 [] equal(nil,sk3).
% 36797 [] equal(sk1,sk3).
% 36798 [] ss^item(sk5).
% 36799 [] ss^list(sk6).
% 36800 [] ss^list(sk7).
% 36801 [] equal(app(app(sk6,cons(sk5,nil)),sk7),sk1).
% 36802 [] member^p(sk6,sk5) | member^p(sk7,sk5).
% 36835 [input:36742,factor:factor:factor] frontseg^p(app(X,Y),Y) | -frontseg^p(X,Y) | -ss^list(X) | -ss^list(Y).
% 36840 [input:36745,factor] member^p(app(X,X),Y) | -member^p(X,Y) | -ss^item(Y) | -ss^list(X).
% 37569 [para:36797.1.2,36795.1.2] equal(nil,sk1).
% 37570 [para:36795.1.2,36797.1.2] equal(sk1,nil).
% 37776 [binary:36800,36666.2] frontseg^p(sk7,sk7).
% 37988 [binary:36798,36676.2] -member^p(nil,sk5).
% 38045 [binary:36799,36678.2] equal(app(sk6,nil),sk6).
% 38589 [binary:36799,36690.2] ss^list(app(sk6,X)) | -ss^list(X).
% 38669 [binary:36798,36691.2] ss^list(cons(sk5,X)) | -ss^list(X).
% 40543 [para:36801.1.1,36723.1.1,cut:37570,cut:36800,binarydemod:38669,38589,cut:36613] equal(nil,app(sk6,cons(sk5,nil))).
% 40771 [para:36801.1.1,36724.1.1,demod:40543,cut:37570,cut:36613,cut:36800] equal(nil,sk7).
% 40972 [para:40771.1.2,36802.2.1,cut:37988] member^p(sk6,sk5).
% 40975 [para:40771.1.2,37776.1.1] frontseg^p(nil,sk7).
% 44905 [binary:40975,36759,cut:36613,cut:36800,binarycut:36665] frontseg^p(X,sk7) | -ss^list(X).
% 46933 [binary:36801,36778,cut:36791,cut:2101,cut:36800,cut:36799] segment^p(sk1,cons(sk5,nil)).
% 54625 [binary:40972,36840.2,cut:36798,cut:36799] member^p(app(sk6,sk6),sk5).
% 56572 [binary:36799,44905.2] frontseg^p(sk6,sk7).
% 56646 [binary:36835.2,56572,cut:36799,cut:36800] frontseg^p(app(sk6,sk7),sk7).
% 62827 [para:37569.1.2,46933.1.1] segment^p(nil,cons(sk5,nil)).
% 70184 [para:36750.1.1,54625.1.1,cut:37988,cut:36799] -equal(nil,sk6).
% 70355 [binary:36723.2,70184,cut:36799] -equal(app(sk6,X),nil) | -ss^list(X).
% 72326 [para:40771.1.2,56646.1.2] frontseg^p(app(sk6,sk7),nil).
% 72396 [binary:36685,62827,cut:2101] equal(nil,cons(sk5,nil)).
% 73017 [binary:36734.2,72326,cut:1736,cut:36613,binarydemod:70355,cut:36800] -frontseg^p(nil,app(sk6,sk7)).
% 73120 [para:72396.1.2,36801.1.1.1.2,demod:38045] equal(app(sk6,sk7),sk1).
% 73173 [binary:36688.2,73017,demod:73120,cut:37569,cut:36791] 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: 13
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 1566
% derived clauses: 98102
% kept clauses: 59721
% kept size sum: 877144
% kept mid-nuclei: 11220
% kept new demods: 20041
% forw unit-subs: 10131
% forw double-subs: 3036
% forw overdouble-subs: 2795
% backward subs: 15
% fast unit cutoff: 10385
% full unit cutoff: 0
% dbl unit cutoff: 236
% real runtime : 21.58
% process. runtime: 21.57
% specific non-discr-tree subsumption statistics:
% tried: 515281
% length fails: 16669
% strength fails: 87849
% predlist fails: 310726
% aux str. fails: 22173
% by-lit fails: 5895
% full subs tried: 51911
% full subs fail: 48803
%
% ; 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/SWC182-1+eq_r.in")
%
%------------------------------------------------------------------------------