%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : FLD012-4 : TPTP v3.4.2. Bugfixed v2.1.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art10.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 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: /home/graph/tptp/TSTP/PreparedTPTP/otter:hypothesis:set(auto),clear(print_given)---add_equality:r/FLD/FLD012-4+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: nne
% detected subclass: medium
%
% strategies selected:
% (hyper 27 #f 2 9)
% (binary-unit 10 #f 2 9)
% (binary-double 16 #f 2 9)
% (binary 54 #t 2 9)
% (binary-order 27 #f 2 9)
% (binary-posweight-order 125 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 27 #f)
% (binary-weightorder 54 #f)
% (binary-order 54 #f)
% (hyper-order 43 #f)
% (binary 109 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(35,40,0,70,0,0)
%
%
% START OF PROOF
% 37 [] -sum(Y,U,V) | -sum(X,V,W) | -sum(X,Y,Z) | sum(Z,U,W).
% 38 [] sum(additive_identity,X,X) | -defined(X).
% 39 [] sum(additive_inverse(X),X,additive_identity) | -defined(X).
% 40 [] -sum(X,Y,Z) | sum(Y,X,Z).
% 41 [] -product(Y,U,V) | -product(Z,U,W) | -product(X,Y,Z) | product(X,V,W).
% 42 [] -product(Y,U,V) | -product(X,V,W) | -product(X,Y,Z) | product(Z,U,W).
% 43 [] product(multiplicative_identity,X,X) | -defined(X).
% 44 [] product(multiplicative_inverse(X),X,multiplicative_identity) | sum(additive_identity,X,additive_identity) | -defined(X).
% 45 [] -product(X,Y,Z) | product(Y,X,Z).
% 46 [] -product(U,Y,V) | -product(W,Y,X1) | -product(X,Y,Z) | -sum(U,W,X) | sum(V,X1,Z).
% 62 [] defined(a).
% 63 [] defined(b).
% 64 [] defined(u).
% 65 [] defined(v).
% 66 [] -sum(additive_identity,a,additive_identity).
% 67 [] -sum(additive_identity,b,additive_identity).
% 68 [] product(a,b,u).
% 69 [] product(multiplicative_inverse(a),multiplicative_inverse(b),v).
% 70 [] -product(multiplicative_identity,multiplicative_inverse(u),v).
% 72 [hyper:39,62] sum(additive_inverse(a),a,additive_identity).
% 73 [hyper:43,62] product(multiplicative_identity,a,a).
% 74 [hyper:44,62,cut:66] product(multiplicative_inverse(a),a,multiplicative_identity).
% 95 [hyper:44,63,cut:67] product(multiplicative_inverse(b),b,multiplicative_identity).
% 122 [hyper:38,64] sum(additive_identity,u,u).
% 125 [hyper:44,64] product(multiplicative_inverse(u),u,multiplicative_identity) | sum(additive_identity,u,additive_identity).
% 163 [hyper:43,65] product(multiplicative_identity,v,v).
% 454 [hyper:45,68] product(b,a,u).
% 1571 [hyper:40,122] sum(u,additive_identity,u).
% 3124 [hyper:45,163] product(v,multiplicative_identity,v).
% 6407 [hyper:41,95,454,73] product(multiplicative_inverse(b),u,a).
% 7140 [hyper:42,6407,69,74] product(v,u,multiplicative_identity).
% 7150 [hyper:45,6407] product(u,multiplicative_inverse(b),a).
% 11107 [hyper:45,125] product(u,multiplicative_inverse(u),multiplicative_identity) | sum(additive_identity,u,additive_identity).
% 23367 [hyper:42,11107,7140,3124,cut:70] sum(additive_identity,u,additive_identity).
% 23767 [hyper:37,23367,1571,1571] sum(u,u,u).
% 28006 [hyper:46,23767,7150,7150,7150] sum(a,a,a).
% 35753 [hyper:37,28006,72,72,cut:66] 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 9
% clause depth limited to 2
% seconds given: 27
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 303
% derived clauses: 70010
% kept clauses: 5771
% kept size sum: 67216
% kept mid-nuclei: 29874
% kept new demods: 0
% forw unit-subs: 11004
% forw double-subs: 13189
% forw overdouble-subs: 1594
% backward subs: 7
% fast unit cutoff: 156
% full unit cutoff: 0
% dbl unit cutoff: 1
% real runtime : 1.62
% process. runtime: 1.61
% specific non-discr-tree subsumption statistics:
% tried: 16958
% length fails: 379
% strength fails: 3109
% predlist fails: 9764
% aux str. fails: 1454
% by-lit fails: 10
% full subs tried: 445
% full subs fail: 445
%
% ; 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/FLD/FLD012-4+noeq.in")
%
%------------------------------------------------------------------------------