%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : FLD004-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 : 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 89.1s
% Output : Assurance 89.1s
% 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/FLD004-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 4 7)
% (binary-unit 10 #f 4 7)
% (binary-double 16 #f 4 7)
% (binary 54 #t 4 7)
% (binary-order 27 #f 4 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,1267202,4,2035,1267244,50,2072,1267244,40,2072,1267275,0,2072,1332693,3,2574,1349778,4,2824,1418246,5,3073,1418247,5,3075,1418248,1,3075,1418248,50,3084,1418248,40,3084,1418279,0,3084,1502004,3,3886,1540684,4,4285,1709307,5,4685,1709308,5,4686,1709308,1,4686,1709308,50,4695,1709308,40,4695,1709339,0,4695,1844651,3,7396,1954873,4,8746)
%
%
% START OF PROOF
% 1709314 [] equalish(multiply(multiplicative_identity,X),X) | -defined(X).
% 1709315 [] equalish(multiply(X,multiplicative_inverse(X)),multiplicative_identity) | equalish(X,additive_identity) | -defined(X).
% 1709316 [] equalish(multiply(X,Y),multiply(Y,X)) | -defined(X) | -defined(Y).
% 1709321 [] defined(multiply(X,Y)) | -defined(X) | -defined(Y).
% 1709323 [] defined(multiplicative_inverse(X)) | equalish(X,additive_identity) | -defined(X).
% 1709331 [] -equalish(X,Y) | -equalish(Y,Z) | equalish(X,Z).
% 1709333 [] equalish(multiply(X,Y),multiply(Z,Y)) | -equalish(X,Z) | -defined(Y).
% 1709336 [] defined(a).
% 1709337 [] defined(b).
% 1709338 [] -equalish(b,additive_identity).
% 1709339 [] -equalish(multiply(a,multiply(b,multiplicative_inverse(b))),a).
% 1709350 [binary:1709314.2,1709336] equalish(multiply(multiplicative_identity,a),a).
% 1709367 [binary:1709333.3,1709336] equalish(multiply(X,a),multiply(Y,a)) | -equalish(X,Y).
% 1709379 [binary:1709315.3,1709337,cut:1709338] equalish(multiply(b,multiplicative_inverse(b)),multiplicative_identity).
% 1709388 [binary:1709321.2,1709337] defined(multiply(b,X)) | -defined(X).
% 1709390 [binary:1709323.3,1709337,cut:1709338] defined(multiplicative_inverse(b)).
% 1709524 [binary:1709331.3,1709339] -equalish(multiply(a,multiply(b,multiplicative_inverse(b))),X) | -equalish(X,a).
% 1709609 [binary:1709331.2,1709350] -equalish(X,multiply(multiplicative_identity,a)) | equalish(X,a).
% 1713147 [binary:1709390,1709388.2] defined(multiply(b,multiplicative_inverse(b))).
% 1715341 [binary:1709367.2,1709379] equalish(multiply(multiply(b,multiplicative_inverse(b)),a),multiply(multiplicative_identity,a)).
% 1753237 [binary:1709316,1709524,cut:1709336,cut:1713147] -equalish(multiply(multiply(b,multiplicative_inverse(b)),a),a).
% 1994867 [binary:1715341,1709609,cut:1753237] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% 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 4
% seconds given: 54
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 6217
% derived clauses: 4810071
% kept clauses: 308054
% kept size sum: 0
% kept mid-nuclei: 319428
% kept new demods: 0
% forw unit-subs: 180467
% forw double-subs: 30369
% forw overdouble-subs: 5155
% backward subs: 4
% fast unit cutoff: 3054
% full unit cutoff: 6
% dbl unit cutoff: 1701
% real runtime : 90.5
% process. runtime: 89.8
% specific non-discr-tree subsumption statistics:
% tried: 133631
% length fails: 17
% strength fails: 16128
% predlist fails: 32184
% aux str. fails: 1267
% by-lit fails: 2
% full subs tried: 83064
% full subs fail: 77878
%
% ; 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/FLD004-1+noeq.in")
%
%------------------------------------------------------------------------------