%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LAT027-1 : TPTP v3.4.2. Released v2.2.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 90.1s
% Output : Assurance 90.1s
% 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/LAT/LAT027-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: ueq
%
% strategies selected:
% (binary-posweight-kb-big-order 60 #f 4 1)
% (binary-posweight-lex-big-order 30 #f 4 1)
% (binary 30 #t)
% (binary-posweight-kb-big-order 180 #f)
% (binary-posweight-lex-big-order 120 #f)
% (binary-posweight-firstpref-order 60 #f)
% (binary-posweight-kb-small-order 60 #f)
% (binary-posweight-lex-small-order 60 #f)
%
%
% **** EMPTY CLAUSE DERIVED ****
%
%
% timer checkpoints: c(9,40,0,18,0,0,3878,3,3004,5193,4,4518,5558,5,6001,5558,1,6001,5558,50,6001,5558,40,6001,5567,0,6001,8227,3,7508,9060,4,8254,9636,5,9002,9636,1,9002,9636,50,9002,9636,40,9002,9645,0,9002)
%
%
% START OF PROOF
% 9639 [] equal(join(X,X),X).
% 9640 [] equal(meet(X,Y),meet(Y,X)).
% 9641 [] equal(join(X,Y),join(Y,X)).
% 9643 [] equal(join(join(meet(X,Y),meet(Z,Y)),Y),Y).
% 9644 [] equal(meet(X,join(Y,join(X,Z))),X).
% 9645 [] -equal(join(join(a,b),c),join(a,join(b,c))).
% 9646 [para:9639.1.1,9644.1.1.2] equal(meet(X,join(X,Y)),X).
% 9647 [para:9639.1.1,9644.1.1.2.2] equal(meet(X,join(Y,X)),X).
% 9649 [para:9641.1.1,9644.1.1.2] equal(meet(X,join(join(X,Y),Z)),X).
% 9650 [para:9641.1.1,9644.1.1.2.2] equal(meet(X,join(Y,join(Z,X))),X).
% 9651 [para:9644.1.1,9643.1.1.1.1] equal(join(join(X,meet(Y,join(Z,join(X,U)))),join(Z,join(X,U))),join(Z,join(X,U))).
% 9654 [para:9646.1.1,9640.1.1] equal(X,meet(join(X,Y),X)).
% 9659 [para:9647.1.1,9643.1.1.1.1] equal(join(join(X,meet(Y,join(Z,X))),join(Z,X)),join(Z,X)).
% 9661 [para:9654.1.2,9643.1.1.1.1] equal(join(join(X,meet(Y,X)),X),X).
% 9666 [para:9641.1.1,9645.1.2] -equal(join(join(a,b),c),join(join(b,c),a)).
% 9676 [para:9650.1.1,9643.1.1.1.1] equal(join(join(X,meet(Y,join(Z,join(U,X)))),join(Z,join(U,X))),join(Z,join(U,X))).
% 9682 [para:9661.1.1,9646.1.1.2,demod:9654] equal(X,join(X,meet(Y,X))).
% 9688 [para:9682.1.2,9641.1.1] equal(X,join(meet(Y,X),X)).
% 9704 [para:9641.1.1,9651.1.1.2.2] equal(join(join(X,meet(Y,join(Z,join(X,U)))),join(Z,join(U,X))),join(Z,join(X,U))).
% 9708 [para:9646.1.1,9651.1.1.1.2] equal(join(join(X,Y),join(Y,join(X,Z))),join(Y,join(X,Z))).
% 9726 [para:9688.1.2,9649.1.1.2.1] equal(meet(meet(X,Y),join(Y,Z)),meet(X,Y)).
% 9952 [para:9726.1.1,9659.1.1.1.2] equal(join(join(X,meet(Y,Z)),join(Z,X)),join(Z,X)).
% 10479 [para:9641.1.1,9666.1.2.1] -equal(join(join(a,b),c),join(join(c,b),a)).
% 11315 [para:9641.1.1,9676.1.1.1.2.2.2,demod:9704] equal(join(X,join(Y,Z)),join(X,join(Z,Y))).
% 11863 [para:11315.1.1,9641.1.1] equal(join(X,join(Y,Z)),join(join(Z,Y),X)).
% 15339 [para:9708.1.1,11863.1.2] equal(join(join(X,join(Y,Z)),join(X,Y)),join(X,join(Y,Z))).
% 15378 [para:9952.1.1,9708.1.1.2,demod:9952,15339] equal(join(X,join(Y,meet(Z,X))),join(X,Y)).
% 15383 [para:15378.1.1,9641.1.1] equal(join(X,Y),join(join(Y,meet(Z,X)),X)).
% 15387 [para:9647.1.1,15378.1.1.2.2] equal(join(join(X,Y),join(Z,Y)),join(join(X,Y),Z)).
% 15471 [para:9647.1.1,15383.1.2.1.2,demod:15387,slowcut:10479] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 30
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 2135
% derived clauses: 5624340
% kept clauses: 15433
% kept size sum: 362752
% kept mid-nuclei: 0
% kept new demods: 6873
% forw unit-subs: 2086131
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 36
% fast unit cutoff: 0
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 91.53
% process. runtime: 91.51
% 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/LAT/LAT027-1+eq_r.in")
%
%------------------------------------------------------------------------------