TSTP Solution File: SWC098-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC098-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 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/SWC098-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(205,40,0,410,0,1,58545,4,2295,62382,5,2804,62383,1,2804,62383,50,2806,62383,40,2806,62588,0,2806,160189,3,4208,188248,4,4909,207593,5,5607,207593,5,5609,207593,1,5609,207593,50,5613,207593,40,5613,207798,0,5613,243341,3,6164,255436,4,6440)
%
%
% START OF PROOF
% 207594 [] equal(X,X).
% 207605 [] -singleton^p(nil).
% 207665 [] -member^p(nil,X) | -ss^item(X).
% 207694 [] neq(X,Y) | equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 207709 [] -neq(X,Y) | -equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 207710 [] -equal(cons(X,nil),Y) | -ss^item(X) | -ss^list(Y) | singleton^p(Y).
% 207734 [] member^p(app(X,Y),Z) | -member^p(X,Z) | -ss^item(Z) | -ss^list(X) | -ss^list(Y).
% 207739 [] equal(app(X,Y),nil) | -equal(nil,X) | -equal(nil,Y) | -ss^list(X) | -ss^list(Y).
% 207780 [] ss^list(sk1).
% 207782 [] ss^list(sk3).
% 207783 [] ss^list(sk4).
% 207784 [] equal(sk2,sk4).
% 207785 [] equal(sk1,sk3).
% 207786 [] -equal(cons(X,nil),sk1) | ss^item(sk5(X)) | -member^p(sk2,X) | -ss^item(X).
% 207787 [] -equal(cons(X,nil),sk1) | member^p(sk2,sk5(X)) | -member^p(sk2,X) | -ss^item(X).
% 207788 [] -equal(cons(X,nil),sk1) | leq(X,sk5(X)) | -member^p(sk2,X) | -ss^item(X).
% 207789 [] -equal(cons(X,nil),sk1) | -equal(X,sk5(X)) | -member^p(sk2,X) | -ss^item(X).
% 207790 [] -equal(nil,sk2) | -equal(nil,sk1).
% 207791 [] equal(nil,sk4) | ss^item(sk6).
% 207793 [] equal(cons(sk6,nil),sk3) | equal(nil,sk4).
% 207795 [] equal(nil,sk4) | -member^p(sk4,X) | -leq(sk6,X) | equal(sk6,X) | -ss^item(X).
% 207796 [] equal(cons(sk6,nil),sk3) | equal(nil,sk3).
% 207797 [] member^p(sk4,sk6) | equal(nil,sk3).
% 207812 [input:207709,factor:cut:207594] -neq(X,X) | -ss^list(X).
% 207836 [input:207734,factor] member^p(app(X,X),Y) | -member^p(X,Y) | -ss^item(Y) | -ss^list(X).
% 208574 [para:207791.1.2,207784.1.2] equal(sk2,nil) | ss^item(sk6).
% 208598 [?] ?
% 208634 [para:208574.1.1,207790.1.2,cut:207594,binarycut:208598] ss^item(sk6).
% 208642 [para:207784.1.2,207795.2.1] equal(nil,sk4) | -member^p(sk2,X) | -leq(sk6,X) | equal(sk6,X) | -ss^item(X).
% 209207 [binary:208634,207665.2] -member^p(nil,sk6).
% 210292 [binary:207782,207812.2] -neq(sk3,sk3).
% 210389 [para:207785.1.2,210292.1.2] -neq(sk3,sk1).
% 210875 [binary:210389,207694,cut:207780,cut:207782] equal(sk3,sk1).
% 211877 [binary:207793,207710,cut:208634,cut:207782] equal(nil,sk4) | singleton^p(sk3).
% 220393 [para:211877.1.2,207784.1.2] equal(sk2,nil) | singleton^p(sk3).
% 220940 [?] ?
% 229961 [para:220393.1.1,207790.1.2,cut:207594,binarycut:220940] singleton^p(sk3).
% 229964 [para:207796.2.2,229961.1.1,cut:207605] equal(cons(sk6,nil),sk3).
% 229965 [para:207797.2.2,229961.1.1,cut:207605] member^p(sk4,sk6).
% 230383 [para:207784.1.2,229965.1.1] member^p(sk2,sk6).
% 230388 [binary:207836.2,229965,cut:208634,cut:207783] member^p(app(sk4,sk4),sk6).
% 230389 [binary:207786.3,230383,demod:229964,cut:210875,cut:208634] ss^item(sk5(sk6)).
% 230390 [binary:207787.3,230383,demod:229964,cut:210875,cut:208634] member^p(sk2,sk5(sk6)).
% 230391 [binary:207788.3,230383,demod:229964,cut:210875,cut:208634] leq(sk6,sk5(sk6)).
% 230392 [binary:207789.3,230383,demod:229964,cut:210875,cut:208634] -equal(sk6,sk5(sk6)).
% 235520 [para:207739.1.1,230388.1.1,cut:209207,cut:207783] -equal(nil,sk4).
% 259551 [binary:230390,208642.2,cut:235520,cut:230391,cut:230392,cut:230389] 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
% clause length limited to 19
% clause depth limited to 5
% seconds given: 11
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 2786
% derived clauses: 357662
% kept clauses: 168541
% kept size sum: 771848
% kept mid-nuclei: 39333
% kept new demods: 33682
% forw unit-subs: 29157
% forw double-subs: 11337
% forw overdouble-subs: 6653
% backward subs: 290
% fast unit cutoff: 28899
% full unit cutoff: 0
% dbl unit cutoff: 649
% real runtime : 65.77
% process. runtime: 64.90
% specific non-discr-tree subsumption statistics:
% tried: 1590623
% length fails: 25005
% strength fails: 185979
% predlist fails: 1051928
% aux str. fails: 47421
% by-lit fails: 26319
% full subs tried: 210588
% full subs fail: 203303
%
% ; 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/SWC098-1+eq_r.in")
%
%------------------------------------------------------------------------------