TSTP Solution File: SWC096-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC096-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 : art03.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 59.4s
% Output : Assurance 59.4s
% 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/SWC096-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,55087,4,2255,56918,5,2802,56919,1,2804,56919,50,2806,56919,40,2806,57123,0,2806,138561,3,4212,178997,4,4907,202737,5,5607,202738,5,5608,202738,1,5608,202738,50,5612,202738,40,5612,202942,0,5612,240760,3,6163,252581,4,6441,268276,62,6713,268276,5,6714,268277,1,6714,268277,50,6716,268277,40,6716,268481,0,6716)
%
%
% START OF PROOF
% 207906 [?] ?
% 207908 [?] ?
% 268286 [] ss^list(nil).
% 268357 [] -equal(nil,X) | segment^p(nil,X) | -ss^list(X).
% 268374 [] equal(tl(cons(X,Y)),Y) | -ss^item(X) | -ss^list(Y).
% 268375 [] equal(hd(cons(X,Y)),X) | -ss^item(X) | -ss^list(Y).
% 268378 [] neq(X,Y) | equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 268382 [] equal(cons(hd(X),tl(X)),X) | equal(nil,X) | -ss^list(X).
% 268393 [] -neq(X,Y) | -equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 268397 [] -equal(app(X,Y),nil) | equal(nil,Y) | -ss^list(X) | -ss^list(Y).
% 268464 [] ss^list(sk1).
% 268465 [] ss^list(sk2).
% 268466 [] ss^list(sk3).
% 268467 [] ss^list(sk4).
% 268468 [] equal(sk2,sk4).
% 268469 [] equal(sk1,sk3).
% 268470 [] neq(sk2,nil).
% 268477 [] -neq(sk4,nil) | -equal(app(X,cons(Y,nil)),sk2) | -equal(cons(Y,nil),sk1) | -ss^item(Y) | -ss^list(X).
% 268478 [] -neq(sk4,nil) | ss^item(sk5).
% 268479 [] -neq(sk4,nil) | ss^list(sk6).
% 268480 [] equal(cons(sk5,nil),sk3) | -neq(sk4,nil).
% 268481 [] equal(app(sk6,cons(sk5,nil)),sk4) | -neq(sk4,nil).
% 268810 [para:268468.1.2,268478.1.1,cut:268470] ss^item(sk5).
% 268816 [para:268468.1.2,268477.1.1,cut:268470] -equal(app(X,cons(Y,nil)),sk2) | -equal(cons(Y,nil),sk1) | -ss^item(Y) | -ss^list(X).
% 268836 [para:268468.1.2,268479.1.1,cut:268470] ss^list(sk6).
% 268838 [para:268468.1.2,268480.2.1,cut:268470] equal(cons(sk5,nil),sk3).
% 268840 [para:268468.1.2,268481.2.1,demod:268838,cut:268470] equal(app(sk6,sk3),sk4).
% 269438 [binary:268464,268357.3,cut:207906] -equal(nil,sk1).
% 269440 [binary:268466,268357.3,cut:207908] -equal(nil,sk3).
% 270552 [para:268838.1.1,268374.1.1.1,cut:268810,cut:268286] equal(tl(sk3),nil).
% 270582 [para:268469.1.2,270552.1.1.1] equal(tl(sk1),nil).
% 270624 [para:268838.1.1,268375.1.1.1,cut:268810,cut:268286] equal(hd(sk3),sk5).
% 270729 [para:268469.1.2,270624.1.1.1] equal(hd(sk1),sk5).
% 271014 [binary:268464,268382.3,demod:268838,270582,270729,cut:269438] equal(sk3,sk1).
% 271877 [binary:268840,268393.2,demod:268840,cut:268467] -neq(sk4,sk4).
% 271907 [para:268468.1.2,271877.1.2] -neq(sk4,sk2).
% 272026 [binary:268378,271907,cut:268465,cut:268467] equal(sk4,sk2).
% 272339 [para:268840.1.1,268397.1.1,cut:269440,cut:268836,cut:268466] -equal(sk4,nil).
% 272530 [binary:268378.2,272339,cut:268286,cut:268467] neq(sk4,nil).
% 287814 [para:268481.1.1,268816.1.1,demod:268838,cut:272026,cut:271014,cut:268810,cut:268836,cut:272530] 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: 3704
% derived clauses: 450753
% kept clauses: 184665
% kept size sum: 0
% kept mid-nuclei: 54107
% kept new demods: 34178
% forw unit-subs: 47748
% forw double-subs: 10010
% forw overdouble-subs: 12285
% backward subs: 95
% fast unit cutoff: 51116
% full unit cutoff: 0
% dbl unit cutoff: 916
% real runtime : 69.86
% process. runtime: 68.83
% specific non-discr-tree subsumption statistics:
% tried: 2817377
% length fails: 45208
% strength fails: 259376
% predlist fails: 2022039
% aux str. fails: 75298
% by-lit fails: 57622
% full subs tried: 298825
% full subs fail: 285609
%
% ; 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/SWC096-1+eq_r.in")
%
%------------------------------------------------------------------------------