%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC256-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 20.0s
% Output : Assurance 20.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/SWC256-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,400,0,2,58621,4,2237,62564,5,2804,62565,1,2806,62565,50,2808,62565,40,2808,62765,0,2808)
%
%
% START OF PROOF
% 62566 [] equal(X,X).
% 62681 [] -neq(X,Y) | -equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 62682 [] -equal(cons(X,nil),Y) | -ss^item(X) | -ss^list(Y) | singleton^p(Y).
% 62753 [] ss^list(sk2).
% 62754 [] ss^list(sk3).
% 62755 [] ss^list(sk4).
% 62756 [] equal(sk2,sk4).
% 62757 [] equal(sk1,sk3).
% 62758 [] neq(sk2,nil).
% 62759 [] -singleton^p(sk1).
% 62760 [] equal(nil,sk4) | ss^item(sk5).
% 62762 [] equal(cons(sk5,nil),sk3) | equal(nil,sk4).
% 62779 [input:62681,factor:cut:62566] -neq(X,X) | -ss^list(X).
% 63335 [para:62760.1.2,62756.1.2] equal(sk2,nil) | ss^item(sk5).
% 64716 [binary:62753,62779.2] -neq(sk2,sk2).
% 64718 [binary:62755,62779.2] -neq(sk4,sk4).
% 64750 [para:63335.1.1,64716.1.2,cut:62758] ss^item(sk5).
% 64802 [para:62756.1.2,64718.1.1] -neq(sk2,sk4).
% 64917 [para:62762.2.2,64802.1.2,cut:62758] equal(cons(sk5,nil),sk3).
% 67533 [binary:62682,64917,cut:64750,cut:62754] singleton^p(sk3).
% 67665 [para:62757.1.2,67533.1.1,cut:62759] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using unit 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: 28
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 560
% derived clauses: 107059
% kept clauses: 50135
% kept size sum: 707415
% kept mid-nuclei: 16231
% kept new demods: 32447
% forw unit-subs: 7213
% forw double-subs: 3255
% forw overdouble-subs: 562
% backward subs: 51
% fast unit cutoff: 1797
% full unit cutoff: 0
% dbl unit cutoff: 117
% real runtime : 28.51
% process. runtime: 28.51
% specific non-discr-tree subsumption statistics:
% tried: 54573
% length fails: 223
% strength fails: 13033
% predlist fails: 14143
% aux str. fails: 2125
% by-lit fails: 934
% full subs tried: 22318
% full subs fail: 21473
%
% ; 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/SWC256-1+eq_r.in")
%
%------------------------------------------------------------------------------