%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL017-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 : art05.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 138.4s
% Output : Assurance 138.4s
% 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/LCL017-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(3,40,0,6,0,0,9,50,0,12,0,0,20,50,0,23,0,0,33,50,0,36,0,0,73,50,0,76,0,0,51754,4,2189,51882,5,2903,51883,1,2909,51883,50,2914,51883,40,2914,51886,0,2914,51889,50,2914,51892,0,2918,51904,50,2918,51907,0,2918,51930,50,2918,51933,0,2918,52287,50,2923,52290,0,2927,56927,3,3428,57929,4,3685,58875,5,3928,58876,5,3928,58876,1,3928,58876,50,3929,58876,40,3929,58879,0,3929,66571,3,4780,67531,4,5205,68264,5,5630,68264,1,5630,68264,50,5630,68264,40,5630,68267,0,5630,144235,4,7809,144392,5,8531,144393,1,8534,144393,50,8539,144393,40,8539,144396,0,8539,152014,3,10270,153697,4,11105,155552,5,11940,155553,5,11941,155553,1,11941,155553,50,11942,155553,40,11942,155556,0,11942,189504,3,14061)
%
%
% START OF PROOF
% 155554 [] -is_a_theorem(equivalent(X,Y)) | -is_a_theorem(X) | is_a_theorem(Y).
% 155555 [] is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(Y,Z)),Z),equivalent(Y,X))).
% 155556 [] -is_a_theorem(equivalent(equivalent(a,b),equivalent(c,equivalent(equivalent(c,b),a)))).
% 155558 [binary:155554,155555] -is_a_theorem(equivalent(equivalent(X,equivalent(Y,Z)),Z)) | is_a_theorem(equivalent(Y,X)).
% 155560 [binary:155555,155558] is_a_theorem(equivalent(X,equivalent(Y,equivalent(Z,equivalent(X,equivalent(Z,Y)))))).
% 155561 [binary:155554,155560] is_a_theorem(equivalent(X,equivalent(Y,equivalent(Z,equivalent(Y,X))))) | -is_a_theorem(Z).
% 155563 [binary:155554,155561] is_a_theorem(equivalent(X,equivalent(Y,equivalent(X,Z)))) | -is_a_theorem(Z) | -is_a_theorem(Y).
% 155564 [binary:155554,155561,factor] is_a_theorem(equivalent(X,equivalent(Y,equivalent(X,Y)))) | -is_a_theorem(Y).
% 155566 [binary:155554,155564] is_a_theorem(equivalent(X,equivalent(Y,X))) | -is_a_theorem(Y) | -is_a_theorem(X).
% 155569 [binary:155554,155563] is_a_theorem(equivalent(X,equivalent(Y,Z))) | -is_a_theorem(Y) | -is_a_theorem(Z) | -is_a_theorem(X).
% 155576 [binary:155554,155566] is_a_theorem(equivalent(X,Y)) | -is_a_theorem(Y) | -is_a_theorem(X).
% 155581 [binary:155558,155569] -is_a_theorem(equivalent(X,equivalent(Y,equivalent(Z,U)))) | is_a_theorem(equivalent(Y,X)) | -is_a_theorem(Z) | -is_a_theorem(U).
% 155585 [binary:155558,155576] -is_a_theorem(equivalent(X,equivalent(Y,Z))) | is_a_theorem(equivalent(Y,X)) | -is_a_theorem(Z).
% 155590 [binary:155560,155585] -is_a_theorem(equivalent(X,equivalent(Y,equivalent(X,Z)))) | is_a_theorem(equivalent(Z,Y)).
% 155592 [binary:155563,155585] -is_a_theorem(equivalent(X,Y)) | is_a_theorem(equivalent(Z,X)) | -is_a_theorem(Y) | -is_a_theorem(Z).
% 155600 [binary:155560,155581] -is_a_theorem(equivalent(X,equivalent(Y,Z))) | is_a_theorem(equivalent(Z,X)) | -is_a_theorem(Y).
% 155649 [binary:155560,155590] is_a_theorem(equivalent(equivalent(X,equivalent(X,Y)),Y)).
% 155650 [binary:155560,155590,binarydemod:155558] is_a_theorem(equivalent(X,X)).
% 155651 [binary:155561,155590] is_a_theorem(equivalent(equivalent(X,Y),X)) | -is_a_theorem(Y).
% 155657 [binary:155585,155650] is_a_theorem(equivalent(X,equivalent(X,Y))) | -is_a_theorem(Y).
% 155661 [binary:155555,155592] is_a_theorem(equivalent(X,equivalent(equivalent(Y,equivalent(Z,U)),U))) | -is_a_theorem(equivalent(Z,Y)) | -is_a_theorem(X).
% 155672 [binary:155554,155649] -is_a_theorem(equivalent(X,equivalent(X,Y))) | is_a_theorem(Y).
% 155737 [binary:155554,155651] -is_a_theorem(equivalent(X,Y)) | -is_a_theorem(Y) | is_a_theorem(X).
% 155751 [binary:155590,155657] -is_a_theorem(equivalent(X,Y)) | is_a_theorem(equivalent(Y,X)).
% 155788 [binary:155560,155672] is_a_theorem(equivalent(X,equivalent(Y,equivalent(X,Y)))).
% 155840 [binary:155555,155751] is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(Y,equivalent(X,Z)),Z))).
% 155849 [binary:155737,155788] -is_a_theorem(equivalent(X,equivalent(Y,X))) | is_a_theorem(Y).
% 156653 [binary:155849,155661] is_a_theorem(equivalent(X,equivalent(Y,Z))) | -is_a_theorem(equivalent(Y,X)) | -is_a_theorem(Z).
% 161366 [binary:155590,155840] is_a_theorem(equivalent(X,equivalent(Y,equivalent(Z,equivalent(equivalent(Z,Y),X))))).
% 161367 [binary:155600,155840] -is_a_theorem(equivalent(X,equivalent(Y,Z))) | is_a_theorem(equivalent(Z,equivalent(Y,X))).
% 165339 [binary:155590,156653] -is_a_theorem(equivalent(Y,Z)) | -is_a_theorem(equivalent(X,Y)) | is_a_theorem(equivalent(Z,X)).
% 172495 [binary:155788,161367] is_a_theorem(equivalent(equivalent(X,Y),equivalent(Y,X))).
% 172567 [binary:161366,161367] is_a_theorem(equivalent(equivalent(X,equivalent(equivalent(X,Y),Z)),equivalent(Y,Z))).
% 189645 [binary:172495,165339] -is_a_theorem(equivalent(X,equivalent(Y,Z))) | is_a_theorem(equivalent(equivalent(Z,Y),X)).
% 192252 [binary:172567,189645,slowcut:155556] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using weight-order strategy
% not 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
% seconds given: 40
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 5814
% derived clauses: 1519613
% kept clauses: 134847
% kept size sum: 809243
% kept mid-nuclei: 5475
% kept new demods: 0
% forw unit-subs: 178739
% forw double-subs: 15208
% forw overdouble-subs: 39110
% backward subs: 594
% fast unit cutoff: 4985
% full unit cutoff: 257
% dbl unit cutoff: 3
% real runtime : 147.47
% process. runtime: 145.28
% specific non-discr-tree subsumption statistics:
% tried: 38526654
% length fails: 2492650
% strength fails: 6664125
% predlist fails: 138
% aux str. fails: 73766
% by-lit fails: 57856
% full subs tried: 29237063
% full subs fail: 29182451
%
% ; 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/LCL017-1+noeq.in")
%
%------------------------------------------------------------------------------