%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC122-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 : art07.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 60.0s
% Output : Assurance 60.0s
% 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/SWC122-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(197,40,0,394,0,1,53320,4,2199,55237,5,2802,55238,1,2804,55238,50,2806,55238,40,2806,55435,0,2806,135762,3,4208,174677,4,4909,200189,5,5607,200190,5,5609,200190,1,5609,200190,50,5613,200190,40,5613,200387,0,5613,242534,3,6167,259204,4,6442)
%
%
% START OF PROOF
% 200199 [] ss^list(nil).
% 200241 [] ss^list(skaf46(X,Y)).
% 200264 [] equal(app(X,nil),X) | -ss^list(X).
% 200322 [] equal(app(skaf46(X,Y),Y),X) | -rearseg^p(X,Y) | -ss^list(X) | -ss^list(Y).
% 200364 [] -equal(app(app(X,Y),Z),U) | segment^p(U,Y) | -ss^list(U) | -ss^list(Y) | -ss^list(Z) | -ss^list(X).
% 200377 [] ss^list(sk1).
% 200378 [] ss^list(sk2).
% 200381 [] equal(sk2,sk4).
% 200382 [] equal(sk1,sk3).
% 200383 [] neq(sk2,nil).
% 200385 [] -neq(sk1,nil) | -segment^p(sk2,sk1).
% 200386 [] -neq(sk4,nil) | neq(sk3,nil).
% 200387 [] -neq(sk4,nil) | rearseg^p(sk4,sk3).
% 201160 [para:200381.1.2,200386.1.1,cut:200383] neq(sk3,nil).
% 201164 [para:200381.1.2,200387.1.1,cut:200383] rearseg^p(sk4,sk3).
% 201168 [para:200382.1.2,201160.1.1] neq(sk1,nil).
% 201170 [para:200381.1.2,201164.1.1] rearseg^p(sk2,sk3).
% 201173 [binary:200385,201168] -segment^p(sk2,sk1).
% 201174 [para:200382.1.2,201170.1.2] rearseg^p(sk2,sk1).
% 206478 [binary:201174,200322.2,cut:200378,cut:200377] equal(app(skaf46(sk2,sk1),sk1),sk2).
% 213597 [para:200264.1.1,200364.1.1,cut:200199] -equal(app(X,Y),Z) | -ss^list(app(X,Y)) | segment^p(Z,Y) | -ss^list(X) | -ss^list(Y) | -ss^list(Z).
% 271834 [binary:206478,213597,demod:206478,cut:201173,cut:200241,cut:200377,cut:200378] 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: 2775
% derived clauses: 405569
% kept clauses: 173035
% kept size sum: 938851
% kept mid-nuclei: 52589
% kept new demods: 33898
% forw unit-subs: 44778
% forw double-subs: 10403
% forw overdouble-subs: 8426
% backward subs: 63
% fast unit cutoff: 42850
% full unit cutoff: 0
% dbl unit cutoff: 785
% real runtime : 66.43
% process. runtime: 66.43
% specific non-discr-tree subsumption statistics:
% tried: 2257006
% length fails: 27165
% strength fails: 224634
% predlist fails: 1586689
% aux str. fails: 59236
% by-lit fails: 57363
% full subs tried: 257652
% full subs fail: 248511
%
% ; 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/SWC122-1+eq_r.in")
%
%------------------------------------------------------------------------------