%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : FLD006-1 : 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 : art02.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/FLD006-1+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 3 7)
% (binary-unit 10 #f 3 7)
% (binary-double 16 #f 3 7)
% (binary 54 #t 3 7)
% (binary-order 27 #f 3 7)
% (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(28,40,1,56,0,1)
%
%
% START OF PROOF
% 30 [] equalish(add(additive_identity,X),X) | -defined(X).
% 31 [] equalish(add(X,additive_inverse(X)),additive_identity) | -defined(X).
% 39 [] defined(additive_identity).
% 40 [] defined(additive_inverse(X)) | -defined(X).
% 50 [] -equalish(X,Y) | equalish(Y,X).
% 51 [] -equalish(Z,X) | -equalish(X,Y) | equalish(Z,Y).
% 56 [] -equalish(additive_inverse(additive_identity),additive_identity).
% 68 [hyper:31,39] equalish(add(additive_identity,additive_inverse(additive_identity)),additive_identity).
% 100 [hyper:40,39] defined(additive_inverse(additive_identity)).
% 212 [hyper:30,100] equalish(add(additive_identity,additive_inverse(additive_identity)),additive_inverse(additive_identity)).
% 2877 [hyper:50,68] equalish(additive_identity,add(additive_identity,additive_inverse(additive_identity))).
% 11705 [hyper:51,212,2877] equalish(additive_identity,additive_inverse(additive_identity)).
% 11711 [hyper:50,11705,cut:56] 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 3
% seconds given: 27
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 219
% derived clauses: 54755
% kept clauses: 10303
% kept size sum: 187811
% kept mid-nuclei: 1325
% kept new demods: 0
% forw unit-subs: 2481
% forw double-subs: 25685
% forw overdouble-subs: 142
% backward subs: 3
% fast unit cutoff: 3
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.75
% process. runtime: 0.74
% specific non-discr-tree subsumption statistics:
% tried: 899
% length fails: 0
% strength fails: 32
% predlist fails: 203
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 522
% full subs fail: 522
%
% ; 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/FLD006-1+noeq.in")
%
%------------------------------------------------------------------------------