%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : COL091-2 : TPTP v3.4.2. Released v2.7.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art04.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/COL/COL091-2+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 9)
% (binary-unit 28 #f 5 9)
% (binary-double 11 #f 5 9)
% (binary-double 17 #f)
% (binary-double 17 #t)
% (binary 87 #t 5 9)
% (binary-order 28 #f 5 9)
% (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(176,40,1,352,0,1,103480,4,2104)
%
%
% START OF PROOF
% 177 [?] ?
% 352 [?] ?
% 43856 [?] ?
% 43857 [?] ?
% 103481 [binary:43856,352,demod:43857,cut:177] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 9
% clause depth limited to 5
% seconds given: 28
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 567
% derived clauses: 245357
% kept clauses: 77003
% kept size sum: 0
% kept mid-nuclei: 9822
% kept new demods: 32
% forw unit-subs: 72722
% forw double-subs: 15605
% forw overdouble-subs: 3596
% backward subs: 11
% fast unit cutoff: 58
% full unit cutoff: 0
% dbl unit cutoff: 1
% real runtime : 21.7
% process. runtime: 21.6
% specific non-discr-tree subsumption statistics:
% tried: 11902
% length fails: 449
% strength fails: 800
% predlist fails: 424
% aux str. fails: 271
% by-lit fails: 5
% full subs tried: 9927
% full subs fail: 6354
%
% ; 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/COL/COL091-2+eq_r.in")
%
%------------------------------------------------------------------------------