%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : FLD067-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 : art05.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/FLD/FLD067-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(31,40,0,62,0,0,632556,4,2028,632805,50,2057,632805,40,2057,632836,0,2057,680541,3,2558,686354,4,2827)
%
%
% START OF PROOF
% 632808 [] equalish(add(X,additive_inverse(X)),additive_identity) | -defined(X).
% 632817 [] defined(additive_inverse(X)) | -defined(X).
% 632824 [] less_or_equal(add(X,Y),add(Z,Y)) | -less_or_equal(X,Z) | -defined(Y).
% 632831 [] -less_or_equal(X,Y) | -equalish(X,Z) | less_or_equal(Z,Y).
% 632833 [] defined(a).
% 632835 [] less_or_equal(a,b).
% 632836 [] -less_or_equal(additive_identity,add(b,additive_inverse(a))).
% 632866 [binary:632833,632817.2] defined(additive_inverse(a)).
% 632910 [binary:632833,632808.2] equalish(add(a,additive_inverse(a)),additive_identity).
% 633263 [binary:632835,632824.2] less_or_equal(add(a,X),add(b,X)) | -defined(X).
% 633640 [binary:632836,632831.3] -less_or_equal(X,add(b,additive_inverse(a))) | -equalish(X,additive_identity).
% 677512 [binary:632866,633263.2] less_or_equal(add(a,additive_inverse(a)),add(b,additive_inverse(a))).
% 696097 [binary:677512,633640,cut:632910] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using unit paramodulation 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 7
% clause depth limited to 3
% seconds given: 10
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 2856
% derived clauses: 1488240
% kept clauses: 130233
% kept size sum: 902844
% kept mid-nuclei: 15703
% kept new demods: 0
% forw unit-subs: 27561
% forw double-subs: 174346
% forw overdouble-subs: 14656
% backward subs: 5
% fast unit cutoff: 448
% full unit cutoff: 0
% dbl unit cutoff: 192
% real runtime : 28.89
% process. runtime: 28.58
% specific non-discr-tree subsumption statistics:
% tried: 83298
% length fails: 0
% strength fails: 192
% predlist fails: 53861
% aux str. fails: 0
% by-lit fails: 954
% full subs tried: 6692
% full subs fail: 5316
%
% ; 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/FLD067-1+noeq.in")
%
%------------------------------------------------------------------------------