%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL010-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/LCL010-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 4 5)
% (binary-unit 11 #f 4 5)
% (binary-double 17 #f 4 5)
% (hyper 29 #f)
% (binary-unit 34 #f)
% (binary-weightorder 40 #f)
% (binary 17 #t)
% (binary-order 29 #f)
% (binary-posweight-order 111 #f 4 5)
% (binary-posweight-order 283 #f)
%
%
% **** EMPTY CLAUSE DERIVED ****
%
%
% timer checkpoints: c(3,40,1,6,0,2,9,50,2,12,0,2)
%
%
% START OF PROOF
% 10 [] -is_a_theorem(equivalent(X,Y)) | -is_a_theorem(X) | is_a_theorem(Y).
% 11 [] is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(X,Z),equivalent(Z,Y)))).
% 12 [] -is_a_theorem(equivalent(equivalent(a,b),equivalent(equivalent(c,b),equivalent(a,c)))).
% 15 [hyper:10,11,11] is_a_theorem(equivalent(equivalent(equivalent(X,Y),Z),equivalent(Z,equivalent(equivalent(X,U),equivalent(U,Y))))).
% 20 [hyper:10,15,11] is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(Y,Z)),equivalent(equivalent(X,U),equivalent(U,Z)))).
% 21 [hyper:10,15,15] is_a_theorem(equivalent(equivalent(X,equivalent(equivalent(Y,Z),equivalent(Z,U))),equivalent(equivalent(equivalent(Y,U),V),equivalent(V,X)))).
% 25 [hyper:10,20,20] is_a_theorem(equivalent(equivalent(equivalent(X,X),Y),equivalent(Y,equivalent(Z,Z)))).
% 32 [hyper:10,21,11] is_a_theorem(equivalent(equivalent(equivalent(X,Y),Z),equivalent(Z,equivalent(X,Y)))).
% 39 [hyper:10,25,11] is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(Y,X)),equivalent(Z,Z))).
% 50 [hyper:10,32,11] is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(Y,Z)),equivalent(X,Z))).
% 68 [hyper:10,39,20] is_a_theorem(equivalent(equivalent(equivalent(X,Y),Z),equivalent(Z,equivalent(Y,X)))).
% 271 [hyper:10,68,50,slowcut:12] 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 5
% seconds given: 29
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 39
% derived clauses: 1448
% kept clauses: 154
% kept size sum: 2084
% kept mid-nuclei: 103
% kept new demods: 0
% forw unit-subs: 764
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 3
% fast unit cutoff: 0
% full unit cutoff: 1
% dbl unit cutoff: 0
% real runtime : 0.1
% process. runtime: 0.2
% 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/LCL010-1+noeq.in")
%
%------------------------------------------------------------------------------