%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL383-1 : TPTP v3.4.2. Released v2.3.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art08.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/LCL/LCL383-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 5 5)
% (binary-unit 11 #f 5 5)
% (binary-double 17 #f 5 5)
% (hyper 29 #f)
% (binary-unit 34 #f)
% (binary-weightorder 40 #f)
% (binary 17 #t)
% (binary-order 29 #f)
% (binary-posweight-order 111 #f 5 5)
% (binary-posweight-order 283 #f)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(5,40,0,10,0,0,15792,4,2177,15792,50,2180,15792,40,2180,15797,0,2180)
%
%
% START OF PROOF
% 7187 [?] ?
% 15793 [] -is_a_theorem(implies(X,Y)) | -is_a_theorem(X) | is_a_theorem(Y).
% 15794 [] is_a_theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z)))).
% 15797 [] -is_a_theorem(implies(implies(x,implies(y,not(z))),implies(implies(z,y),implies(x,not(z))))).
% 15807 [binary:15793,15794] is_a_theorem(implies(implies(X,Y),implies(Z,Y))) | -is_a_theorem(implies(Z,X)).
% 15816 [binary:15794,15807.2] is_a_theorem(implies(implies(implies(implies(X,Y),implies(Z,Y)),U),implies(implies(Z,X),U))).
% 15856 [binary:15793,15816] -is_a_theorem(implies(implies(implies(X,Y),implies(Z,Y)),U)) | is_a_theorem(implies(implies(Z,X),U)).
% 15868 [binary:15816,15856] is_a_theorem(implies(implies(X,implies(Y,Z)),implies(implies(U,Y),implies(X,implies(U,Z))))).
% 15899 [binary:15793,15868] is_a_theorem(implies(implies(X,Y),implies(Z,implies(X,U)))) | -is_a_theorem(implies(Z,implies(Y,U))).
% 15978 [binary:15797,15899,cut:7187] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos 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 5
% clause depth limited to 5
% seconds given: 11
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 2606
% derived clauses: 1551716
% kept clauses: 10834
% kept size sum: 181223
% kept mid-nuclei: 5070
% kept new demods: 0
% forw unit-subs: 359155
% forw double-subs: 7
% forw overdouble-subs: 0
% backward subs: 106
% fast unit cutoff: 1
% full unit cutoff: 20
% dbl unit cutoff: 0
% real runtime : 21.82
% process. runtime: 21.81
% specific non-discr-tree subsumption statistics:
% tried: 0
% length fails: 0
% strength fails: 0
% predlist fails: 0
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 0
% full subs fail: 0
%
% ; 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/LCL383-1+noeq.in")
%
%------------------------------------------------------------------------------