%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : LCL031-1 : TPTP v3.4.2. Released v1.0.0.
% Transfm  : add_equality:r
% Format   : otter:hypothesis:set(auto),clear(print_given)
% Command  : gandalf-wrapper -time %d %s

% Computer : art03.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 30.0s
% Output   : Assurance 30.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/LCL/LCL031-1+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: hne
% detected subclass: small
% detected subclass: short
% 
% strategies selected: 
% (hyper 29 #f 6 5)
% (binary-unit 11 #f 6 5)
% (binary-double 17 #f 6 5)
% (hyper 29 #f)
% (binary-unit 34 #f)
% (binary-weightorder 40 #f)
% (binary 17 #t)
% (binary-order 29 #f)
% (binary-posweight-order 111 #f 6 5)
% (binary-posweight-order 283 #f)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(6,40,1,12,0,1,23426,4,2191,23426,50,2197,23426,40,2197,23432,0,2197,34969,3,2749,39347,4,3023,39646,5,3298,39647,5,3298,39647,1,3298,39647,50,3300,39647,40,3300,39653,0,3300)
% 
% 
% START OF PROOF
% 4150 [?] ?
% 39648 [] -is_a_theorem(implies(X,Y)) | -is_a_theorem(X) | is_a_theorem(Y).
% 39649 [] is_a_theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z)))).
% 39650 [] is_a_theorem(implies(X,implies(Y,X))).
% 39653 [] -is_a_theorem(implies(implies(implies(implies(implies(a,b),implies(c,falsehood)),e),falsehood),implies(implies(falsehood,a),implies(c,a)))).
% 39659 [binary:39650,39648.2] -is_a_theorem(implies(implies(X,implies(Y,X)),Z)) | is_a_theorem(Z).
% 39692 [binary:39648,39649] is_a_theorem(implies(implies(X,Y),implies(Z,Y))) | -is_a_theorem(implies(Z,X)).
% 40831 [binary:39659,39692] is_a_theorem(implies(X,implies(Y,Z))) | -is_a_theorem(implies(X,Z)).
% 42851 [binary:39653,40831,cut:4150] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% not using sos strategy
% using double 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 5
% clause depth limited to 6
% seconds given: 17
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    1902
%  derived clauses:   930063
%  kept clauses:      39604
%  kept size sum:     750416
%  kept mid-nuclei:   2897
%  kept new demods:   0
%  forw unit-subs:    471499
%  forw double-subs: 954
%  forw overdouble-subs: 89
%  backward subs:     35
%  fast unit cutoff:  1
%  full unit cutoff:  72
%  dbl  unit cutoff:  0
%  real runtime  :  33.38
%  process. runtime:  33.37
% specific non-discr-tree subsumption statistics: 
%  tried:           1637
%  length fails:    58
%  strength fails:  209
%  predlist fails:  569
%  aux str. fails:  45
%  by-lit fails:    7
%  full subs tried: 714
%  full subs fail:  625
% 
% ; 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/LCL/LCL031-1+noeq.in")
% 
%------------------------------------------------------------------------------