%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LAT244-1 : TPTP v3.4.2. Released v3.1.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 39.5s
% Output : Assurance 39.5s
% 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/LAT244-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: peq
%
% strategies selected:
% (hyper 30 #f 6 5)
% (binary-unit 12 #f)
% (binary-unit-uniteq 12 #f)
% (binary-posweight-kb-big-order 60 #f 6 5)
% (binary-posweight-lex-big-order 30 #f 6 5)
% (binary 30 #t)
% (binary-posweight-kb-big-order 156 #f)
% (binary-posweight-lex-big-order 102 #f)
% (binary-posweight-firstpref-order 60 #f)
% (binary-order 30 #f)
% (binary-posweight-kb-small-order 48 #f)
% (binary-posweight-lex-small-order 30 #f)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(15,40,0,30,0,0,25532,4,2255,26633,63,3003,26633,1,3003,26633,50,3004,26633,40,3004,26648,0,3004,37999,3,3608,40091,4,3916,41658,5,4205,41659,5,4205,41659,1,4205,41659,50,4206,41659,40,4206,41674,0,4206)
%
%
% START OF PROOF
% 41663 [] equal(meet(X,join(X,Y)),X).
% 41664 [] equal(join(X,meet(X,Y)),X).
% 41665 [] equal(meet(X,Y),meet(Y,X)).
% 41666 [] equal(join(X,Y),join(Y,X)).
% 41667 [] equal(meet(meet(X,Y),Z),meet(X,meet(Y,Z))).
% 41668 [] equal(join(join(X,Y),Z),join(X,join(Y,Z))).
% 41669 [] equal(join(X,complement(X)),one).
% 41670 [] equal(meet(X,complement(X)),zero).
% 41671 [] -equal(join(X,Y),one) | -equal(meet(X,Y),zero) | equal(complement(X),Y).
% 41672 [] equal(meet(X,join(Y,Z)),meet(X,join(Y,meet(join(X,Y),join(Z,meet(X,Y)))))).
% 41673 [] equal(meet(b,a),a).
% 41674 [] -equal(join(complement(b),complement(a)),complement(a)).
% 41677 [para:41670.1.1,41664.1.1.2] equal(join(X,zero),X).
% 41679 [para:41665.1.1,41670.1.1] equal(meet(complement(X),X),zero).
% 41682 [para:41665.1.1,41664.1.1.2] equal(join(X,meet(Y,X)),X).
% 41686 [para:41666.1.1,41674.1.1] -equal(join(complement(a),complement(b)),complement(a)).
% 41690 [para:41666.1.1,41677.1.1] equal(join(zero,X),X).
% 41693 [para:41690.1.1,41663.1.1.2] equal(meet(zero,X),zero).
% 41707 [para:41679.1.1,41667.1.1.1,demod:41693] equal(zero,meet(complement(X),meet(X,Y))).
% 41714 [para:41668.1.1,41669.1.1] equal(join(X,join(Y,complement(join(X,Y)))),one).
% 41795 [para:41673.1.1,41707.1.2.2] equal(zero,meet(complement(b),a)).
% 41802 [para:41795.1.2,41665.1.1] equal(zero,meet(a,complement(b))).
% 41811 [para:41802.1.2,41672.1.2.2.2.2.2,demod:41677] equal(meet(a,join(complement(b),X)),meet(a,join(complement(b),meet(join(a,complement(b)),X)))).
% 42141 [binary:41671,41714] -equal(meet(X,join(Y,complement(join(X,Y)))),zero) | equal(complement(X),join(Y,complement(join(X,Y)))).
% 50338 [para:41670.1.1,41811.1.2.2.2,demod:41802,41677,binarydemod:42141] equal(complement(a),join(complement(b),complement(join(a,complement(b))))).
% 51865 [para:50338.1.2,41663.1.1.2] equal(meet(complement(b),complement(a)),complement(b)).
% 51925 [para:51865.1.1,41682.1.1.2,cut:41686] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% 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: 12
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 2424
% derived clauses: 1238630
% kept clauses: 44494
% kept size sum: 864335
% kept mid-nuclei: 2548
% kept new demods: 33969
% forw unit-subs: 1068537
% forw double-subs: 19765
% forw overdouble-subs: 6163
% backward subs: 41
% fast unit cutoff: 1255
% full unit cutoff: 12
% dbl unit cutoff: 208
% real runtime : 45.62
% process. runtime: 44.77
% specific non-discr-tree subsumption statistics:
% tried: 16705
% length fails: 759
% strength fails: 0
% predlist fails: 4483
% aux str. fails: 909
% by-lit fails: 0
% full subs tried: 10356
% full subs fail: 4212
%
% ; 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/LAT244-1+eq_r.in")
%
%------------------------------------------------------------------------------