%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : COM009-1 : TPTP v3.4.2. Released v3.2.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art01.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2794MHz
% Memory : 1003MB
% OS : Linux 2.6.11-1.1369_FC4
% CPULimit : 600s
% Result : Unsatisfiable 0.0s
% Output : Assurance 0.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: /tmp/SystemOnTPTP24350/COM/COM009-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 4 7)
% (binary-unit 28 #f 4 7)
% (binary-double 11 #f 4 7)
% (binary-double 17 #f)
% (binary-double 17 #t)
% (binary 87 #t 4 7)
% (binary-order 28 #f 4 7)
% (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)
%
%
% SOS clause
% -equal(c_^u^n^i^t^y_^ototalize(v_^f,t_a),v_^f) | -c_^u^n^i^t^y_^oall__total(v_^f,t_a).
% was split for some strategies as:
% -equal(c_^u^n^i^t^y_^ototalize(v_^f,t_a),v_^f).
% -c_^u^n^i^t^y_^oall__total(v_^f,t_a).
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(1372,40,6,2744,0,12)
%
%
% START OF PROOF
% 1373 [] equal(X,X).
% 2733 [] equal(c_^u^n^i^t^y_^ototalize(X,Y),X) | -c_^u^n^i^t^y_^oall__total(X,Y).
% 2734 [] c_^u^n^i^t^y_^oall__total(c_^u^n^i^t^y_^ototalize(X,Y),Y).
% 2743 [] -equal(c_^u^n^i^t^y_^ototalize(v_^f,t_a),v_^f) | -c_^u^n^i^t^y_^oall__total(v_^f,t_a).
% 2744 [] equal(c_^u^n^i^t^y_^ototalize(v_^f,t_a),v_^f) | c_^u^n^i^t^y_^oall__total(v_^f,t_a).
% 2748 [hyper:2733,2744] equal(c_^u^n^i^t^y_^ototalize(v_^f,t_a),v_^f).
% 7072 [para:2748.1.1,2734.1.1] c_^u^n^i^t^y_^oall__total(v_^f,t_a).
% 7073 [hyper:2743,7072,demod:2748,cut:1373] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 7
% clause depth limited to 4
% seconds given: 13
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 1319
% derived clauses: 8062
% kept clauses: 2614
% kept size sum: 24283
% kept mid-nuclei: 606
% kept new demods: 26
% forw unit-subs: 3025
% forw double-subs: 172
% forw overdouble-subs: 68
% backward subs: 14
% fast unit cutoff: 49
% full unit cutoff: 7
% dbl unit cutoff: 2
% real runtime : 0.61
% process. runtime: 0.58
% specific non-discr-tree subsumption statistics:
% tried: 131
% length fails: 6
% strength fails: 4
% predlist fails: 4
% aux str. fails: 2
% by-lit fails: 1
% full subs tried: 113
% full subs fail: 45
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP24350/COM/COM009-1+eq_r.in")
%
%------------------------------------------------------------------------------