%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : FLD032-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 : art01.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 60.0s
% Output : Assurance 60.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/FLD032-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,1,597078,4,2028,597245,50,2070,597245,40,2070,597276,0,2070,631822,3,2571,640820,4,2821,658149,5,3071,658149,1,3071,658149,50,3074,658149,40,3074,658180,0,3074,711209,3,3876,719025,4,4275,737394,5,4675,737394,1,4675,737394,50,4678,737394,40,4678,737425,0,4678)
%
%
% START OF PROOF
% 737400 [] equalish(multiply(multiplicative_identity,X),X) | -defined(X).
% 737401 [] equalish(multiply(X,multiplicative_inverse(X)),multiplicative_identity) | equalish(X,additive_identity) | -defined(X).
% 737402 [] equalish(multiply(X,Y),multiply(Y,X)) | -defined(X) | -defined(Y).
% 737409 [] defined(multiplicative_inverse(X)) | equalish(X,additive_identity) | -defined(X).
% 737416 [] -equalish(X,Y) | equalish(Y,X).
% 737417 [] -equalish(X,Y) | -equalish(Y,Z) | equalish(X,Z).
% 737419 [] equalish(multiply(X,Y),multiply(Z,Y)) | -equalish(X,Z) | -defined(Y).
% 737422 [] defined(a).
% 737423 [] -equalish(a,additive_identity).
% 737424 [] equalish(multiplicative_inverse(a),multiplicative_identity).
% 737425 [] -equalish(a,multiplicative_identity).
% 737436 [binary:737400.2,737422] equalish(multiply(multiplicative_identity,a),a).
% 737437 [binary:737401.3,737422,cut:737423] equalish(multiply(a,multiplicative_inverse(a)),multiplicative_identity).
% 737448 [binary:737409.3,737422,cut:737423] defined(multiplicative_inverse(a)).
% 737493 [binary:737417.3,737425] -equalish(X,multiplicative_identity) | -equalish(a,X).
% 737498 [binary:737419.2,737424] equalish(multiply(multiplicative_inverse(a),X),multiply(multiplicative_identity,X)) | -defined(X).
% 737536 [binary:737417.2,737436] -equalish(X,multiply(multiplicative_identity,a)) | equalish(X,a).
% 738067 [binary:737417.2,737437] -equalish(X,multiply(a,multiplicative_inverse(a))) | equalish(X,multiplicative_identity).
% 738172 [binary:737416.2,737493.2] -equalish(X,multiplicative_identity) | -equalish(X,a).
% 741674 [binary:737498,737536,cut:737422] equalish(multiply(multiplicative_inverse(a),a),a).
% 741792 [binary:738172.2,741674] -equalish(multiply(multiplicative_inverse(a),a),multiplicative_identity).
% 805097 [binary:737402,738067,cut:741792,cut:737448,cut:737422] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using sos 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: 54
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 7431
% derived clauses: 2792710
% kept clauses: 252510
% kept size sum: 0
% kept mid-nuclei: 34893
% kept new demods: 0
% forw unit-subs: 94813
% forw double-subs: 230826
% forw overdouble-subs: 12542
% backward subs: 33
% fast unit cutoff: 8651
% full unit cutoff: 0
% dbl unit cutoff: 169
% real runtime : 64.82
% process. runtime: 64.80
% specific non-discr-tree subsumption statistics:
% tried: 418556
% length fails: 269
% strength fails: 40636
% predlist fails: 100391
% aux str. fails: 2150
% by-lit fails: 96
% full subs tried: 270034
% full subs fail: 260785
%
% ; 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/FLD032-1+noeq.in")
%
%------------------------------------------------------------------------------