%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC387-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 49.5s
% Output : Assurance 49.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/SWC387-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(198,40,0,396,0,1,53356,4,2193,55240,5,2802,55241,1,2804,55241,50,2807,55241,40,2807,55439,0,2808,148798,3,4211,174115,4,4914,192540,5,5609,192541,5,5611,192542,1,5611,192542,50,5615,192542,40,5615,192740,0,5615)
%
%
% START OF PROOF
% 192543 [] equal(X,X).
% 192551 [] ss^list(nil).
% 192616 [] equal(app(X,nil),X) | -ss^list(X).
% 192643 [] neq(X,Y) | equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 192658 [] -neq(X,Y) | -equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 192661 [] -equal(app(X,Y),nil) | equal(nil,X) | -ss^list(X) | -ss^list(Y).
% 192729 [] ss^list(sk1).
% 192730 [] ss^list(sk2).
% 192731 [] ss^list(sk3).
% 192733 [] equal(sk2,sk4).
% 192734 [] equal(sk1,sk3).
% 192735 [] -equal(cons(X,nil),sk1) | -member^p(sk2,X) | -ss^item(X).
% 192736 [] -equal(nil,sk4) | equal(nil,sk3).
% 192737 [] -equal(nil,sk2) | -equal(nil,sk1).
% 192738 [] -neq(sk4,nil) | ss^item(sk5).
% 192739 [] equal(cons(sk5,nil),sk3) | -neq(sk4,nil).
% 192740 [] -neq(sk4,nil) | member^p(sk4,sk5).
% 192754 [input:192658,factor:cut:192543] -neq(X,X) | -ss^list(X).
% 193511 [para:192733.1.2,192736.1.2] -equal(nil,sk2) | equal(nil,sk3).
% 193516 [para:192733.1.2,192738.1.1] -neq(sk2,nil) | ss^item(sk5).
% 193528 [para:192733.1.2,192740.1.1] -neq(sk2,nil) | member^p(sk4,sk5).
% 193533 [para:193511.2.2,192734.1.2] -equal(nil,sk2) | equal(sk1,nil).
% 193981 [para:193533.2.1,192737.2.2,cut:192543] -equal(nil,sk2).
% 194048 [binary:192730,192616.2] equal(app(sk2,nil),sk2).
% 195135 [binary:192731,192754.2] -neq(sk3,sk3).
% 195202 [para:192734.1.2,195135.1.2] -neq(sk3,sk1).
% 195639 [binary:195202,192643,cut:192729,cut:192731] equal(sk3,sk1).
% 199485 [para:194048.1.1,192661.1.1,cut:193981,cut:192730,cut:192551] -equal(sk2,nil).
% 199738 [binary:192643.2,199485,cut:192551,cut:192730] neq(sk2,nil).
% 199746 [binary:193516,199738] ss^item(sk5).
% 199747 [binary:193528,199738] member^p(sk4,sk5).
% 199804 [para:192733.1.2,199747.1.1] member^p(sk2,sk5).
% 200206 [binary:192735.2,199804,cut:199746] -equal(cons(sk5,nil),sk1).
% 205300 [para:192739.1.1,200206.1.1,cut:195639] -neq(sk4,nil).
% 205331 [para:192733.1.2,205300.1.1,cut:199738] 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
% clause length limited to 19
% clause depth limited to 5
% seconds given: 11
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 2188
% derived clauses: 304907
% kept clauses: 129320
% kept size sum: 150272
% kept mid-nuclei: 33050
% kept new demods: 33466
% forw unit-subs: 20666
% forw double-subs: 6544
% forw overdouble-subs: 4394
% backward subs: 40
% fast unit cutoff: 19216
% full unit cutoff: 0
% dbl unit cutoff: 382
% real runtime : 57.63
% process. runtime: 57.11
% specific non-discr-tree subsumption statistics:
% tried: 1050567
% length fails: 3817
% strength fails: 88993
% predlist fails: 725959
% aux str. fails: 27077
% by-lit fails: 30885
% full subs tried: 142625
% full subs fail: 137599
%
% ; 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/SWC387-1+eq_r.in")
%
%------------------------------------------------------------------------------