TSTP Solution File: FLD010-1 by Gandalf---c-2.6

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : FLD010-1 : TPTP v3.4.2. Bugfixed v2.7.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 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/FLD010-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,0,56,0,0)
% 
% 
% START OF PROOF
% 34 [] equalish(multiply(multiplicative_identity,X),X) | -defined(X).
% 35 [] equalish(multiply(X,multiplicative_inverse(X)),multiplicative_identity) | equalish(X,additive_identity) | -defined(X).
% 42 [] defined(multiplicative_identity).
% 43 [] defined(multiplicative_inverse(X)) | equalish(X,additive_identity) | -defined(X).
% 50 [] -equalish(X,Y) | equalish(Y,X).
% 51 [] -equalish(Z,X) | -equalish(X,Y) | equalish(Z,Y).
% 55 [] -equalish(additive_identity,multiplicative_identity).
% 56 [] -equalish(multiplicative_inverse(multiplicative_identity),multiplicative_identity).
% 164 [hyper:35,42] equalish(multiply(multiplicative_identity,multiplicative_inverse(multiplicative_identity)),multiplicative_identity) | equalish(multiplicative_identity,additive_identity).
% 203 [hyper:43,42] defined(multiplicative_inverse(multiplicative_identity)) | equalish(multiplicative_identity,additive_identity).
% 3029 [hyper:50,203,cut:55] defined(multiplicative_inverse(multiplicative_identity)).
% 3095 [hyper:34,3029] equalish(multiply(multiplicative_identity,multiplicative_inverse(multiplicative_identity)),multiplicative_inverse(multiplicative_identity)).
% 12033 [hyper:50,164,cut:55] equalish(multiply(multiplicative_identity,multiplicative_inverse(multiplicative_identity)),multiplicative_identity).
% 12043 [hyper:50,12033] equalish(multiplicative_identity,multiply(multiplicative_identity,multiplicative_inverse(multiplicative_identity))).
% 23170 [hyper:51,3095,12043] equalish(multiplicative_identity,multiplicative_inverse(multiplicative_identity)).
% 23182 [hyper:50,23170,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:    340
%  derived clauses:   109317
%  kept clauses:      21099
%  kept size sum:     435127
%  kept mid-nuclei:   1999
%  kept new demods:   0
%  forw unit-subs:    3982
%  forw double-subs: 56235
%  forw overdouble-subs: 139
%  backward subs:     5
%  fast unit cutoff:  3
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  1.93
%  process. runtime:  1.92
% specific non-discr-tree subsumption statistics: 
%  tried:           1144
%  length fails:    0
%  strength fails:  32
%  predlist fails:  199
%  aux str. fails:  0
%  by-lit fails:    0
%  full subs tried: 774
%  full subs fail:  774
% 
% ; 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/FLD010-1+noeq.in")
% 
%------------------------------------------------------------------------------