%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL120-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 : art04.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/LCL/LCL120-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,58,50,0,61,0,0)
%
%
% START OF PROOF
% 59 [] -is_a_theorem(equivalent(X,Y)) | -is_a_theorem(X) | is_a_theorem(Y).
% 60 [] is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(X,Z)),equivalent(Z,Y))).
% 61 [] -is_a_theorem(equivalent(a,equivalent(equivalent(b,equivalent(c,a)),equivalent(b,c)))).
% 64 [hyper:59,60,60] is_a_theorem(equivalent(X,equivalent(Y,equivalent(Y,X)))).
% 69 [hyper:59,64,60] is_a_theorem(equivalent(X,equivalent(X,equivalent(equivalent(equivalent(Y,Z),equivalent(Y,U)),equivalent(U,Z))))).
% 72 [hyper:59,64,60] is_a_theorem(equivalent(equivalent(X,equivalent(X,Y)),Y)).
% 76 [hyper:59,72,64] is_a_theorem(equivalent(X,X)).
% 123 [hyper:59,69,76] is_a_theorem(equivalent(equivalent(X,X),equivalent(equivalent(equivalent(Y,Z),equivalent(Y,U)),equivalent(U,Z)))).
% 405 [hyper:59,123,60] is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(Z,Y),equivalent(Z,X)))).
% 415 [hyper:59,405,60] is_a_theorem(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(X,equivalent(equivalent(U,Z),equivalent(U,Y))))).
% 1303 [hyper:59,415,64,slowcut:61] 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 5
% clause depth limited to 6
% seconds given: 29
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 136
% derived clauses: 6953
% kept clauses: 1035
% kept size sum: 22872
% kept mid-nuclei: 255
% kept new demods: 0
% forw unit-subs: 4198
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 0
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.10
% process. runtime: 0.11
% 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/LCL120-1+noeq.in")
%
%------------------------------------------------------------------------------