TSTP Solution File: SWC380-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC380-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 : art01.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 79.1s
% Output : Assurance 79.1s
% 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/SWC380-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(204,40,1,408,0,1,55050,4,2266,56874,5,2803,56874,1,2803,56874,50,2806,56874,40,2806,57078,0,2806,136714,3,4211,174319,4,4908,197841,5,5608,197841,5,5610,197841,1,5610,197841,50,5613,197841,40,5613,198045,0,5614,237466,3,6167,251102,4,6443,266685,5,6740,266685,5,6742,266686,1,6742,266686,50,6744,266686,40,6744,266890,0,6744,323817,3,7595,342418,4,8021)
%
%
% START OF PROOF
% 202998 [?] ?
% 202999 [?] ?
% 203000 [?] ?
% 266695 [] ss^list(nil).
% 266761 [] equal(app(nil,X),X) | -ss^list(X).
% 266766 [] -equal(nil,X) | segment^p(nil,X) | -ss^list(X).
% 266783 [] equal(tl(cons(X,Y)),Y) | -ss^item(X) | -ss^list(Y).
% 266784 [] equal(hd(cons(X,Y)),X) | -ss^item(X) | -ss^list(Y).
% 266787 [] neq(X,Y) | equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 266791 [] equal(cons(hd(X),tl(X)),X) | equal(nil,X) | -ss^list(X).
% 266805 [] -equal(app(X,Y),nil) | equal(nil,X) | -ss^list(X) | -ss^list(Y).
% 266807 [] equal(app(cons(X,nil),Y),cons(X,Y)) | -ss^item(X) | -ss^list(Y).
% 266810 [] equal(hd(app(X,Y)),hd(X)) | equal(nil,X) | -ss^list(Y) | -ss^list(X).
% 266820 [] equal(tl(app(X,Y)),app(tl(X),Y)) | equal(nil,X) | -ss^list(Y) | -ss^list(X).
% 266862 [] -equal(app(X,cons(Y,Z)),U) | member^p(U,Y) | -ss^item(Y) | -ss^list(U) | -ss^list(Z) | -ss^list(X).
% 266873 [] ss^list(sk1).
% 266874 [] ss^list(sk2).
% 266875 [] ss^list(sk3).
% 266876 [] ss^list(sk4).
% 266877 [] equal(sk2,sk4).
% 266878 [] equal(sk1,sk3).
% 266879 [] neq(sk2,nil).
% 266886 [] -neq(sk4,nil) | -equal(cons(X,nil),sk1) | -member^p(sk2,X) | -ss^item(X).
% 266887 [] -neq(sk4,nil) | ss^item(sk5).
% 266888 [] -neq(sk4,nil) | ss^list(sk6).
% 266889 [] equal(cons(sk5,nil),sk3) | -neq(sk4,nil).
% 266890 [] equal(app(cons(sk5,nil),sk6),sk4) | -neq(sk4,nil).
% 267219 [para:266877.1.2,266887.1.1,cut:266879] ss^item(sk5).
% 267221 [para:266877.1.2,266886.1.1,cut:266879] -equal(cons(X,nil),sk1) | -member^p(sk2,X) | -ss^item(X).
% 267231 [para:266877.1.2,266888.1.1,cut:266879] ss^list(sk6).
% 267233 [para:266877.1.2,266889.2.1,cut:266879] equal(cons(sk5,nil),sk3).
% 267235 [para:266877.1.2,266890.2.1,demod:267233,cut:266879] equal(app(sk3,sk6),sk4).
% 267789 [binary:267231,266761.2] equal(app(nil,sk6),sk6).
% 267833 [binary:266873,266766.3,cut:202998] -equal(nil,sk1).
% 267834 [binary:266874,266766.3,cut:202999] -equal(nil,sk2).
% 267835 [binary:266875,266766.3,cut:203000] -equal(nil,sk3).
% 268947 [para:267233.1.1,266783.1.1.1,cut:267219,cut:266695] equal(tl(sk3),nil).
% 268977 [para:266878.1.2,268947.1.1.1] equal(tl(sk1),nil).
% 269019 [para:267233.1.1,266784.1.1.1,cut:267219,cut:266695] equal(hd(sk3),sk5).
% 269124 [para:266878.1.2,269019.1.1.1] equal(hd(sk1),sk5).
% 269409 [binary:266873,266791.3,demod:267233,268977,269124,cut:267833] equal(sk3,sk1).
% 270488 [para:267235.1.1,266805.1.1,cut:267835,cut:266875,cut:267231] -equal(sk4,nil).
% 270676 [binary:266787.2,270488,cut:266695,cut:266876] neq(sk4,nil).
% 270964 [para:266807.1.1,266890.1.1,cut:267219,cut:267231,cut:270676] equal(cons(sk5,sk6),sk4).
% 271038 [para:266890.1.1,266810.1.1.1,demod:269019,267233,cut:267835,cut:267231,cut:266875,cut:270676] equal(hd(sk4),sk5).
% 271240 [para:266877.1.2,271038.1.1.1] equal(hd(sk2),sk5).
% 271242 [para:271240.1.1,266791.1.1.1,cut:267834,cut:266874] equal(cons(sk5,tl(sk2)),sk2).
% 272100 [para:266890.1.1,266820.1.1.1,demod:267789,268947,267233,cut:267835,cut:267231,cut:266875,cut:270676] equal(tl(sk4),sk6).
% 272306 [para:266877.1.2,272100.1.1.1] equal(tl(sk2),sk6).
% 279376 [para:266761.1.1,266862.1.1,cut:266695] -equal(cons(X,Y),Z) | -ss^list(cons(X,Y)) | member^p(Z,X) | -ss^item(X) | -ss^list(Y) | -ss^list(Z).
% 282890 [binary:266887.2,267221.3,demod:267233,cut:269409,cut:270676] -member^p(sk2,sk5).
% 350271 [binary:271242,279376,demod:270964,272306,cut:266876,cut:282890,cut:267219,cut:267231,cut:266874] 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 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: 4307
% derived clauses: 553005
% kept clauses: 238427
% kept size sum: 0
% kept mid-nuclei: 61521
% kept new demods: 34755
% forw unit-subs: 65705
% forw double-subs: 14531
% forw overdouble-subs: 13248
% backward subs: 117
% fast unit cutoff: 59067
% full unit cutoff: 0
% dbl unit cutoff: 1009
% real runtime : 83.40
% process. runtime: 82.46
% specific non-discr-tree subsumption statistics:
% tried: 3519766
% length fails: 46371
% strength fails: 283940
% predlist fails: 2577150
% aux str. fails: 89410
% by-lit fails: 72739
% full subs tried: 385399
% full subs fail: 371055
%
% ; 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/SWC380-1+eq_r.in")
%
%------------------------------------------------------------------------------