%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC006-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 19.5s
% Output : Assurance 19.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/SWC006-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,1,396,0,1,53972,4,2293,55982,5,2807,55982,1,2807,55982,50,2810,55982,40,2810,56180,0,2810)
%
%
% START OF PROOF
% 55983 [] equal(X,X).
% 56173 [] equal(sk2,sk4).
% 56174 [] equal(sk1,sk3).
% 56175 [] -equal(app(app(X,Y),Z),sk2) | -equal(app(X,Z),sk1) | -ss^list(Z) | -ss^list(X) | -ss^list(Y).
% 56176 [] ss^list(sk5).
% 56177 [] ss^list(sk6).
% 56178 [] ss^list(sk7).
% 56179 [] equal(app(app(sk5,sk6),sk7),sk4).
% 56180 [] equal(app(sk5,sk7),sk3).
% 56976 [para:56179.1.1,56175.1.1,demod:56180,cut:56178,cut:56176,cut:56177] -equal(sk4,sk2) | -equal(sk3,sk1).
% 57000 [para:56173.1.2,56976.1.1,cut:55983] -equal(sk3,sk1).
% 57023 [para:56174.1.2,57000.1.1,cut:55983] 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: 110
% derived clauses: 83415
% kept clauses: 41613
% kept size sum: 584929
% kept mid-nuclei: 14231
% kept new demods: 32988
% forw unit-subs: 3907
% forw double-subs: 2065
% forw overdouble-subs: 434
% backward subs: 1
% fast unit cutoff: 960
% full unit cutoff: 0
% dbl unit cutoff: 136
% real runtime : 28.64
% process. runtime: 28.14
% specific non-discr-tree subsumption statistics:
% tried: 43476
% length fails: 221
% strength fails: 16274
% predlist fails: 3483
% aux str. fails: 1976
% by-lit fails: 826
% full subs tried: 19850
% full subs fail: 19099
%
% ; 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/SWC006-1+eq_r.in")
%
%------------------------------------------------------------------------------