TSTP Solution File: SWC316-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC316-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 : art10.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 317.7s
% Output : Assurance 317.7s
% 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/SWC316-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 23)
% (binary-unit 28 #f 5 23)
% (binary-double 11 #f 5 23)
% (binary-double 17 #f)
% (binary-double 17 #t)
% (binary 87 #t 5 23)
% (binary-order 28 #f 5 23)
% (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,3,412,0,3,55158,4,2227,57085,5,2804,57086,1,2806,57086,50,2808,57086,40,2808,57294,0,2808,141756,3,4232,175410,4,4913,198015,5,5609,198015,5,5611,198016,1,5611,198016,50,5615,198016,40,5615,198224,0,5615,240679,3,6166,255533,4,6441,270363,5,6716,270363,5,6717,270363,1,6717,270363,50,6719,270363,40,6719,270571,0,6719,303613,3,7596,308366,4,8007,329810,5,8420,329811,1,8420,329811,50,8423,329811,40,8423,330019,0,8423,395683,3,9275,406364,4,9700,425869,5,10124,425869,5,10126,425869,1,10126,425869,50,10128,425869,40,10128,426077,0,10129,477521,3,14489,560197,4,16656,614424,62,18830,614424,5,18831,614425,1,18831,614425,50,18835,614425,40,18835,614633,0,18835,659252,3,20236,661935,4,20936,667698,5,21636,667699,1,21636,667699,50,21638,667699,40,21638,667907,0,21638,927126,3,24539,969566,4,25990,1066522,5,27439,1066523,1,27439,1066523,50,27445,1066523,40,27445,1066731,0,27474,1223304,3,28892,1273880,4,29575,1326701,5,30275,1326701,1,30275,1326701,50,30281,1326701,40,30281,1326909,0,30316,1379753,3,30867,1394192,4,31142,1441379,5,31419,1441379,5,31420,1441379,1,31420,1441379,50,31425,1441379,40,31425,1441587,0,31425)
%
%
% START OF PROOF
% 1441380 [] equal(X,X).
% 1441388 [] ss^list(nil).
% 1441451 [] -member^p(nil,X) | -ss^item(X).
% 1441459 [] -equal(nil,X) | segment^p(nil,X) | -ss^list(X).
% 1441460 [] -segment^p(nil,X) | equal(nil,X) | -ss^list(X).
% 1441466 [] ss^list(cons(X,Y)) | -ss^item(X) | -ss^list(Y).
% 1441476 [] equal(tl(cons(X,Y)),Y) | -ss^item(X) | -ss^list(Y).
% 1441477 [] equal(hd(cons(X,Y)),X) | -ss^item(X) | -ss^list(Y).
% 1441478 [] -equal(cons(X,Y),nil) | -ss^item(X) | -ss^list(Y).
% 1441480 [] neq(X,Y) | equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 1441500 [] equal(app(cons(X,nil),Y),cons(X,Y)) | -ss^item(X) | -ss^list(Y).
% 1441555 [] -equal(app(X,cons(Y,Z)),U) | member^p(U,Y) | -ss^item(Y) | -ss^list(U) | -ss^list(Z) | -ss^list(X).
% 1441566 [] -neq(sk1,nil) | -neq(sk4,nil) | -neq(nil,sk1) | -equal(cons(X,nil),Y) | -equal(app(Z,Y),U) | -equal(hd(sk1),X) | -equal(tl(sk1),Z) | -equal(sk2,U) | -ss^item(X) | -ss^list(Y) | -ss^list(Z) | -ss^list(U).
% 1441567 [] equal(app(sk6,cons(sk5,nil)),sk4) | -neq(sk4,nil).
% 1441568 [] equal(app(cons(sk5,nil),sk6),sk3) | -neq(sk4,nil).
% 1441569 [] -neq(sk4,nil) | ss^list(sk6).
% 1441570 [] -neq(sk4,nil) | ss^item(sk5).
% 1441577 [] neq(sk2,nil).
% 1441578 [] equal(sk1,sk3).
% 1441579 [] equal(sk2,sk4).
% 1441580 [] ss^list(sk4).
% 1441581 [] ss^list(sk3).
% 1441583 [] ss^list(sk1).
% 1441705 [input:1441555,factor] -equal(app(X,cons(Y,Z)),Z) | member^p(Z,Y) | -ss^item(Y) | -ss^list(Z) | -ss^list(X).
% 1442418 [para:1441567.1.2,1441579.2.1,cut:1441577] equal(app(sk6,cons(sk5,nil)),sk4).
% 1442419 [para:1441568.1.2,1441579.2.1,cut:1441577] equal(app(cons(sk5,nil),sk6),sk3).
% 1442420 [para:1441579.1.2,1441569.1.1,cut:1441577] ss^list(sk6).
% 1442421 [para:1441579.1.2,1441570.1.1,cut:1441577] ss^item(sk5).
% 1442848 [binary:1442421,1441451.2] -member^p(nil,sk5).
% 1442928 [binary:1441583,1441459.3] -equal(nil,sk1) | segment^p(nil,sk1).
% 1442964 [binary:1441581,1441460.3] -segment^p(nil,sk3) | equal(nil,sk3).
% 1451295 [binary:1441480.2,1442928,cut:1441583,cut:1441388] neq(nil,sk1) | segment^p(nil,sk1).
% 1454197 [para:1441578.1.2,1442964.1.2] -segment^p(nil,sk1) | equal(nil,sk3).
% 1462103 [binary:1451295.2,1454197] neq(nil,sk1) | equal(nil,sk3).
% 1466887 [para:1442418.1.1,1441705.1.1,cut:1442848,cut:1442421,cut:1441388,cut:1442420] -equal(sk4,nil).
% 1466922 [binary:1441480.2,1466887,cut:1441388,cut:1441580] neq(sk4,nil).
% 1468623 [para:1442419.1.1,1441500.1.1,cut:1442421,cut:1442420] equal(sk3,cons(sk5,sk6)).
% 1468674 [para:1468623.1.2,1441476.1.1.1,cut:1442421,cut:1442420] equal(tl(sk3),sk6).
% 1468675 [para:1468623.1.2,1441477.1.1.1,cut:1442421,cut:1442420] equal(hd(sk3),sk5).
% 1468676 [para:1468623.1.2,1441478.1.1,cut:1442421,cut:1442420] -equal(sk3,nil).
% 1468843 [para:1441578.1.2,1468676.1.1] -equal(sk1,nil).
% 1468859 [para:1462103.2.2,1468676.1.1,cut:1441380] neq(nil,sk1).
% 1468938 [binary:1441480.2,1468843,cut:1441388,cut:1441583] neq(sk1,nil).
% 1469257 [para:1441578.1.2,1468674.1.1.1] equal(tl(sk1),sk6).
% 1469260 [para:1441578.1.2,1468675.1.1.1] equal(hd(sk1),sk5).
% 1483054 [binary:1441566.5,1441567,cut:1441579,cut:1441580,cut:1469257,cut:1466922,cut:1468938,cut:1468859,cut:1442420] -ss^list(cons(sk5,nil)) | -equal(cons(X,nil),cons(sk5,nil)) | -equal(hd(sk1),X) | -ss^item(X).
% 1483055 [binary:1441380,1483054.2,demod:1469260,cut:1441380,cut:1442421] -ss^list(cons(sk5,nil)).
% 1483063 [binary:1441466,1483055,cut:1442421,cut:1441388] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using term-depth-order strategy
% using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 28
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 20594
% derived clauses: 2189731
% kept clauses: 652279
% kept size sum: 778860
% kept mid-nuclei: 297159
% kept new demods: 63107
% forw unit-subs: 178889
% forw double-subs: 71775
% forw overdouble-subs: 50652
% backward subs: 350
% fast unit cutoff: 206263
% full unit cutoff: 8
% dbl unit cutoff: 6752
% real runtime : 328.34
% process. runtime: 325.69
% specific non-discr-tree subsumption statistics:
% tried: 58911099
% length fails: 6736459
% strength fails: 15046765
% predlist fails: 15933603
% aux str. fails: 2270656
% by-lit fails: 2872251
% full subs tried: 14829545
% full subs fail: 14759137
%
% ; 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/SWC316-1+eq_r.in")
%
%------------------------------------------------------------------------------