TSTP Solution File: SWC416-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC416-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 79.5s
% Output : Assurance 79.5s
% 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/SWC416-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(200,40,1,406,0,1,53441,4,2198,55304,5,2803,55305,1,2805,55305,50,2808,55305,40,2808,55511,0,2808,142950,3,4209,177951,4,4909,201158,5,5609,201159,5,5610,201159,1,5610,201159,50,5614,201159,40,5614,201365,0,5614,245100,3,6174,261547,4,6443,275973,5,6718,275973,5,6720,275974,1,6720,275974,50,6722,275974,40,6722,276180,0,6722,331030,3,7573,346095,4,7998)
%
%
% START OF PROOF
% 206502 [?] ?
% 221709 [?] ?
% 275975 [] equal(X,X).
% 275983 [] ss^list(nil).
% 276048 [] equal(app(X,nil),X) | -ss^list(X).
% 276054 [] -equal(nil,X) | segment^p(nil,X) | -ss^list(X).
% 276061 [] ss^list(cons(X,Y)) | -ss^item(X) | -ss^list(Y).
% 276072 [] equal(hd(cons(X,Y)),X) | -ss^item(X) | -ss^list(Y).
% 276075 [] neq(X,Y) | equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 276093 [] -equal(app(X,Y),nil) | equal(nil,X) | -ss^list(X) | -ss^list(Y).
% 276095 [] equal(app(cons(X,nil),Y),cons(X,Y)) | -ss^item(X) | -ss^list(Y).
% 276163 [] -neq(nil,sk2) | -neq(sk4,nil) | -equal(cons(X,nil),Y) | -equal(app(Y,sk1),Z) | -equal(hd(sk2),X) | -equal(sk2,Z) | -ss^item(X) | -ss^list(Y) | -ss^list(Z).
% 276168 [] neq(sk2,nil).
% 276169 [] equal(sk1,sk3).
% 276170 [] equal(sk2,sk4).
% 276171 [] ss^list(sk4).
% 276173 [] ss^list(sk2).
% 276174 [] ss^list(sk1).
% 276179 [] -neq(sk4,nil) | ss^item(sk5).
% 276180 [] equal(app(cons(sk5,nil),sk3),sk4) | -neq(sk4,nil).
% 276597 [para:276170.1.2,276179.1.1,cut:276168] ss^item(sk5).
% 276605 [para:276170.1.2,276180.2.1,cut:276168] equal(app(cons(sk5,nil),sk3),sk4).
% 277136 [binary:276171,276048.2] equal(app(sk4,nil),sk4).
% 277227 [binary:276171,276054.3,cut:221709] -equal(nil,sk4).
% 277229 [binary:276173,276054.3,cut:206502] -equal(nil,sk2).
% 277842 [binary:275983,276061.3] ss^list(cons(X,nil)) | -ss^item(X).
% 278599 [binary:277229,276075.2,cut:276173,cut:275983] neq(nil,sk2).
% 285818 [para:277136.1.1,276093.1.1,cut:277227,cut:276171,cut:275983] -equal(sk4,nil).
% 285835 [binary:276075.2,285818,cut:275983,cut:276171] neq(sk4,nil).
% 303082 [binary:276163.3,275975,cut:285835,cut:278599,binarycut:277842] -equal(app(cons(X,nil),sk1),Y) | -equal(hd(sk2),X) | -equal(sk2,Y) | -ss^item(X) | -ss^list(Y).
% 321113 [para:276169.1.2,276180.1.1.2,cut:285835] equal(app(cons(sk5,nil),sk1),sk4).
% 321133 [para:321113.1.1,276095.1.1,cut:276597,cut:276174] equal(sk4,cons(sk5,sk1)).
% 322115 [para:276169.1.2,276605.1.1.2] equal(app(cons(sk5,nil),sk1),sk4).
% 326277 [para:321133.1.2,276072.1.1.1,cut:276597,cut:276174] equal(hd(sk4),sk5).
% 326353 [para:276170.1.2,326277.1.1.1] equal(hd(sk2),sk5).
% 348059 [binary:322115,303082,demod:326353,cut:275975,cut:276170,cut:276597,cut:276171] 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: 4253
% derived clauses: 500286
% kept clauses: 233634
% kept size sum: 0
% kept mid-nuclei: 54176
% kept new demods: 34632
% forw unit-subs: 47756
% forw double-subs: 11515
% forw overdouble-subs: 9696
% backward subs: 128
% fast unit cutoff: 46577
% full unit cutoff: 0
% dbl unit cutoff: 846
% real runtime : 80.88
% process. runtime: 80.32
% specific non-discr-tree subsumption statistics:
% tried: 2947035
% length fails: 33766
% strength fails: 236518
% predlist fails: 2112538
% aux str. fails: 80703
% by-lit fails: 71664
% full subs tried: 347603
% full subs fail: 336775
%
% ; 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/SWC416-1+eq_r.in")
%
%------------------------------------------------------------------------------